| /freebsd/contrib/llvm-project/clang/lib/Lex/ |
| H A D | DependencyDirectivesScanner.cpp | 87 /// Lexes next token and advances \p First and the \p Lexer.
89 lexToken(const char *&First, const char *const End);
92 lexIncludeFilename(const char *&First, const char *const End);
94 void skipLine(const char *&First, const char *const End);
95 void skipDirective(StringRef Name, const char *&First, const char *const End);
104 /// In any case (whatever the token kind) \p First and the \p Lexer will
107 tryLexIdentifierOrSkipLine(const char *&First, const char *const End);
110 [[nodiscard]] StringRef lexIdentifier(const char *&First,
116 /// In any case (whatever the token kind) \p First and the \p Lexer will
119 const char *&First,
[all …]
|
| /freebsd/contrib/arm-optimized-routines/string/arm/ |
| H A D | asmdefs.h | 68 * - first - If `last' specified, this serves as start of general-purpose
101 .macro cfirestorelist first, last
103 .if \last-\first
104 cfirestorelist \first, \last-1
109 .macro cfisavelist first, last, index=1
111 .if \last-\first
112 cfisavelist \first, \last-1, \index+1
116 .macro _prologue first=-1, last=-1, push_ip=PAC_LEAF_PUSH_IP, push_lr=0
123 .if \first != -1
126 _prologue \first, \first, \push_ip, \push_lr
[all …]
|
| /freebsd/usr.sbin/etcupdate/tests/ |
| H A D | tests_test.sh | 67 states="equal first second difftype difflinks difffiles"
89 # Note that if the old and new files are identical (so first
114 # /equal/first/first: The file is missing from the test
117 mkfifo $i/equal/first/first/fifo
118 echo "foo" > $i/equal/first/first/file
119 mkdir $i/equal/first/first/dir
120 ln -s "bar" $i/equal/first/first/link
146 # /first/equal/second: Remove unmodified files. The files
149 mkfifo $i/first/equal/second/fifo
150 echo "foo" > $i/first/equal/second/file
[all …]
|
| H A D | always_test.sh | 67 states="equal first second difftype difflinks difffiles"
94 # /first/difftype/second: File with different local type
96 mkfifo $OLD/first/difftype/second/fifo
97 mkdir $TEST/first/difftype/second/fifo
99 # /first/difflinks/second: Modified link removed. Should
101 ln -s "old link" $OLD/first/difflinks/second/link
102 ln -s "test link" $TEST/first/difflinks/second/link
104 # /first/difffiles/second: Modified file removed. Should
106 echo "foo" > $OLD/first/difffiles/second/file
107 echo "bar" > $TEST/first/difffiles/second/file
[all …]
|
| /freebsd/contrib/libdivsufsort/lib/ |
| H A D | trsort.c | 79 tr_insertionsort(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_insertionsort() argument
83 for(a = first + 1; a < last; ++a) { in tr_insertionsort()
85 do { *(b + 1) = *b; } while((first <= --b) && (*b < 0)); in tr_insertionsort()
86 if(b < first) { break; } in tr_insertionsort()
167 tr_pivot(const saidx_t *ISAd, saidx_t *first, saidx_t *last) { in tr_pivot() argument
171 t = last - first; in tr_pivot()
172 middle = first + t / 2; in tr_pivot()
176 return tr_median3(ISAd, first, middle, last - 1); in tr_pivot()
179 return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1); in tr_pivot()
183 first = tr_median3(ISAd, first, first + t, first + (t << 1)); in tr_pivot()
[all …]
|
| H A D | sssort.c | 168 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_insertionsort() argument
173 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) { in ss_pivot() argument
267 t = last - first; in ss_pivot()
268 middle = first + t / 2; in ss_pivot()
272 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
275 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
279 first = ss_median3(Td, PA, first, first + t, first + (t << 1)); in ss_pivot()
282 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
292 saidx_t *first, saidx_t *last, saidx_t depth) { in ss_partition() argument
[all …]
|
| /freebsd/sys/compat/linuxkpi/common/include/linux/ |
| H A D | llist.h | 14 struct llist_node *first; member
26 return ((void *)atomic_readandclear_ptr((uintptr_t *)&head->first)); in llist_del_all()
32 struct llist_node *first, *next; in llist_del_first() local
35 first = head->first; in llist_del_first()
36 if (first == NULL) in llist_del_first()
38 next = first->next; in llist_del_first()
39 } while (atomic_cmpset_ptr((uintptr_t *)&head->first, in llist_del_first()
40 (uintptr_t)first, (uintptr_t)next) == 0); in llist_del_first()
42 return (first); in llist_del_first()
48 struct llist_node *first; in llist_add() local
[all …]
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | escape.exp | 42 VAR1BSNL00=:first line:
43 VAR1BSNL0=:first line no space on second line:
44 VAR1BSNLs=:first line one space on second line:
45 VAR1BSNLss=:first line two spaces on second line:
46 VAR1BSNLt=:first line one tab on second line:
47 VAR1BSNLtt=:first line two tabs on second line:
48 VAR1BSNLxx=:first line many spaces and tabs [ ] on second line:
50 echo :'first line\
53 :first line\
56 echo :'first line\
[all …]
|
| H A D | depsrc-use.mk | 17 first: .USE first-first first-second
18 @echo first 1 # Using ${.TARGET} here would expand to "action"
19 @echo first 2
20 first-first: .USE
21 @echo first-first 1
22 @echo first-first 2
23 first-second: .USE
24 @echo first-second 1
25 @echo first-second 2
39 action: first second empty
|
| H A D | depsrc-use.exp | 1 first 1
2 first 2
5 first-first 1
6 first-first 2
7 first-second 1
8 first-second 2
|
| /freebsd/sys/contrib/zstd/lib/dictBuilder/ |
| H A D | divsufsort.c | 258 int *first, int *last, int depth) { in ss_insertionsort() argument
263 for(i = last - 2; first <= i; --i) { in ss_insertionsort()
353 ss_pivot(const unsigned char *Td, const int *PA, int *first, int *last) { in ss_pivot() argument
357 t = last - first; in ss_pivot()
358 middle = first + t / 2; in ss_pivot()
362 return ss_median3(Td, PA, first, middle, last - 1); in ss_pivot()
365 return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1); in ss_pivot()
369 first = ss_median3(Td, PA, first, first + t, first + (t << 1)); in ss_pivot()
372 return ss_median3(Td, PA, first, middle, last); in ss_pivot()
382 int *first, int *last, int depth) { in ss_partition() argument
[all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | list.h | 38 T *front() { return First; } in front()
39 const T *front() const { return First; } in front()
44 First = Last = nullptr; in clear()
51 Iterator begin() { return Iterator(First); } in begin()
54 ConstIterator begin() const { return ConstIterator(First); } in begin()
61 T *First = nullptr; member
67 CHECK_EQ(First, nullptr); in checkConsistency()
71 for (T *I = First;; I = I->Next) { in checkConsistency()
82 using IntrusiveList<T>::First;
90 First = X; in push_back()
[all …]
|
| /freebsd/contrib/flex/src/ |
| H A D | nfa.c | 298 * new = link_machines( first, last );
300 * new - a machine constructed by connecting first to last
301 * first - the machine whose successor is to be last
302 * last - the machine whose predecessor is to be first
304 * note: this routine concatenates the machine first with the machine
305 * last to produce a machine new which will pattern-match first first
307 * FIRST is set to new by the operation. last is unmolested.
310 int link_machines (int first, int last) in link_machines() argument
312 if (first == NIL) in link_machines()
316 return first; in link_machines()
[all …]
|
| /freebsd/contrib/kyua/integration/ |
| H A D | cmd_list_test.sh | 93 atf_test_program{name="first"}
96 utils_cp_helper simple_all_pass first
100 first:skip
102 atf_check -s exit:0 -o file:expout -e empty kyua list first:skip
111 atf_test_program{name="first"}
114 utils_cp_helper simple_all_pass first
145 atf_test_program{name="first"}
147 utils_cp_helper simple_all_pass first
160 first:pass (top-level)
162 atf_check -s exit:0 -o file:expout -e empty kyua list -v subdir first:pass
[all …]
|
| H A D | cmd_config_test.sh | 72 test_suites.first.one = 1
73 test_suites.first.two = 2
77 test_suites.first.two = 2
81 test_suites.first.two
90 test_suites.first.one = 1
91 test_suites.first.three = 3
95 kyua: W: 'test_suites.first.two' is not defined.
99 test_suites.first.two
110 test_suites.first.one = 1
111 test_suites.first.two = 2
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 24 const FormatToken *Next = Line.First->getNextNonComment(); in startsExternCBlock()
101 if (Line.First->is(tok::comment) && IndentForLevel[Line.Level] != -1) in adjustToUnmodifiedLine()
103 unsigned LevelIndent = Line.First->OriginalColumn; in adjustToUnmodifiedLine()
141 if (IsAccessModifier(*Line.First)) { in getIndentOffset()
195 return AnnotatedLines[StartLineIndex]->First->getNamespaceToken(); in getMatchingNamespaceToken()
199 const FormatToken *NamespaceToken = Line->First->getNamespaceToken(); in getNamespaceTokenText()
230 if (Next[i + 1]->First->NewlinesBefore > 0) in getNextMergedLine()
256 if (NextLine.Type == LT_Invalid || NextLine.First->MustBreakBefore) in tryFitMultipleLinesInOne()
259 (!NextLine.InPPDirective || NextLine.First->HasUnescapedNewline)) { in tryFitMultipleLinesInOne()
275 TheLine->First == TheLine->Last && in tryFitMultipleLinesInOne()
[all …]
|
| /freebsd/share/doc/usd/13.viref/ |
| H A D | vi.cmd.roff | 56 first starts, it is in command mode.
70 text insert mode, the cursor is positioned on the first column of
137 (If the line is empty, the cursor is positioned on the first column
201 starting or stopping cursor position which comes first in the file,
282 First, a sequence of letters, digits and underscores,
326 whose first character is an open brace
336 first nonblank character following the previous sentence, paragraph, or
373 The current word begins at the first non-whitespace character on or
394 Set to the first character of the word.
422 Set to the first nonblank character of the line.
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__utility/ |
| H A D | pair.h | 73 _T1 first; member
117 _LIBCPP_HIDE_FROM_ABI pair() : first(), second() {} in pair()
119 _LIBCPP_HIDE_FROM_ABI pair(_T1 const& __t1, _T2 const& __t2) : first(__t1), second(__t2) {} in pair()
122 _LIBCPP_HIDE_FROM_ABI pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair()
125 first = __p.first;
139 first = __p.first;
173 : first(), second() {} in pair()
181 : first(__t1), second(__t2) {} in pair()
195 : first(std::forward<_U1>(__u1)), second(std::forward<_U2>(__u2)) { in pair()
203 : first(__p.first), second(__p.second) {} in pair()
[all …]
|
| /freebsd/contrib/bmake/ |
| H A D | lst.c | 56 for (ln = list->first; ln != NULL; ln = next) { in Lst_Done()
67 for (ln = list->first; ln != NULL; ln = next) { in Lst_DoneCall()
88 if (ln == list->first) in Lst_InsertBefore()
89 list->first = newNode; in Lst_InsertBefore()
100 ln = LstNodeNew(NULL, list->first, datum); in Lst_Prepend()
102 if (list->first == NULL) { in Lst_Prepend()
103 list->first = ln; in Lst_Prepend()
106 list->first->prev = ln; in Lst_Prepend()
107 list->first = ln; in Lst_Prepend()
122 list->first in Lst_Append()
[all...] |
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_base.h | 41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
48 First.setPrev(nullptr); in removeRangeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
68 // Splice [First, Final] into its new list/position. in transferBeforeImpl()
71 First.setPrev(&Prev); in transferBeforeImpl()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | algorithm | 50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
58 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
80 …constexpr I find(I first, S last, const T& value, Proj proj = {}); …
89 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
98 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
107 …constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); …
116 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
124 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
196 …count(I first, S last, const T& value, Proj proj = {}); …
206 …count_if(I first, S last, Pred pred, Proj proj = {}); …
[all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/orc/ |
| H A D | interval_map.h | 39 return LHS.first < RHS; in operator()
42 return LHS < RHS.first; in operator()
65 if (empty() || K < begin()->first.first || in find()
66 K >= std::prev(end())->first.second) in find()
72 if (K < I->first.second) in find()
99 if (KS >= I->first.second) in erase()
103 assert(KE <= I->first.second); in erase()
109 if (KE < Tmp.first.second) { in erase()
111 J, std::make_pair(std::make_pair(KE, Tmp.first.second), Tmp.second)); in erase()
116 if (KS > Tmp.first.first) in erase()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 24 unsigned First, unsigned Last) { in getJumpTableRange() argument
25 assert(Last >= First); in getJumpTableRange()
26 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
38 unsigned First, unsigned Last) { in getJumpTableNumCases() argument
39 assert(Last >= First); in getJumpTableNumCases()
40 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases()
42 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases()
174 for (unsigned First = 0, Last; First < N; First = Last + 1) { in findJumpTables() local
175 Last = LastElement[First]; in findJumpTables()
176 assert(Last >= First); in findJumpTables()
[all …]
|
| /freebsd/lib/libc/ |
| H A D | Versions.def | 8 # This is our first version; it depends on no other.
9 # This version was first added to 7.0-current.
13 # This version was first added to 8.0-current.
17 # This version was first added to 9.0-current.
21 # This version was first added to 10.0-current.
25 # This version was first added to 11.0-current.
29 # This version was first added to 12.0-current.
33 # This version was first added to 13.0-current.
37 # This version was first added to 14.0-current.
41 # This version was first added to 15.0-current.
|
| /freebsd/contrib/llvm-project/clang/include/clang/Lex/ |
| H A D | PPCallbacks.h | 471 std::unique_ptr<PPCallbacks> First, Second; variable
476 : First(std::move(_First)), Second(std::move(_Second)) {} in PPChainedCallbacks()
483 First->FileChanged(Loc, Reason, FileType, PrevFID); in FileChanged()
490 First->LexedFileChanged(FID, Reason, FileType, PrevFID, Loc); in LexedFileChanged()
496 First->FileSkipped(SkippedFile, FilenameTok, FileType); in FileSkipped()
501 bool Skip = First->FileNotFound(FileName); in EmbedFileNotFound()
502 // Make sure to invoke the second callback, no matter if the first already in EmbedFileNotFound()
511 First->EmbedDirective(HashLoc, FileName, IsAngled, File, Params); in EmbedDirective()
516 bool Skip = First->FileNotFound(FileName); in FileNotFound()
517 // Make sure to invoke the second callback, no matter if the first already in FileNotFound()
[all …]
|