| /freebsd/contrib/arm-optimized-routines/string/arm/ |
| H A D | asmdefs.h | 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
142 .if \first != -1
[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 | 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
|
| /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/usr.sbin/etcupdate/tests/ |
| H A D | tests_test.sh | 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
149 mkfifo $i/first/equal/second/fifo
150 echo "foo" > $i/first/equal/second/file
151 mkdir $i/first/equal/second/emptydir
152 ln -s "bar" $i/first/equal/second/link
153 mkdir $i/first/equal/second/fulldir
154 echo "foo" > $i/first/equal/second/fulldir/file
[all …]
|
| H A D | always_test.sh | 96 mkfifo $OLD/first/difftype/second/fifo
97 mkdir $TEST/first/difftype/second/fifo
101 ln -s "old link" $OLD/first/difflinks/second/link
102 ln -s "test link" $TEST/first/difflinks/second/link
106 echo "foo" > $OLD/first/difffiles/second/file
107 echo "bar" > $TEST/first/difffiles/second/file
127 mkfifo $OLD/difftype/first/first/fifo
128 mkdir $NEW/difftype/first/first/fifo
158 ln -s "old" $OLD/difflinks/first/first/link
159 ln -s "new" $NEW/difflinks/first/first/link
[all …]
|
| /freebsd/usr.bin/netstat/ |
| H A D | inet6.c | 353 int first, i; in ip6_stats() local
415 for (first = 1, i = 0; i < IP6S_HDRCNT; i++) in ip6_stats()
417 if (first) { in ip6_stats()
420 first = 0; in ip6_stats()
427 if (!first) in ip6_stats()
434 for (first = 1, i = 0; i < IP6S_M2MMAX; i++) { in ip6_stats()
437 if (first) { in ip6_stats()
440 first = 0; in ip6_stats()
449 if (!first) in ip6_stats()
494 for (first = 1, i = 0; i < IP6S_SCOPECNT; i++) { in ip6_stats()
[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/flex/src/ |
| H A D | nfa.c | 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()
319 mkxtion (finalst[first], last); in link_machines()
320 finalst[first] = finalst[last]; in link_machines()
321 lastst[first] = MAX (lastst[first], lastst[last]); in link_machines()
322 firstst[first] = MIN (firstst[first], firstst[last]); in link_machines()
324 return first; in link_machines()
377 int mkbranch (int first, int second) in mkbranch() argument
381 if (first == NO_TRANSITION) in mkbranch()
[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/TableGen/ |
| H A D | StringMatcher.cpp | 32 for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) { in FindFirstNonCommonLetter()
34 char Letter = Matches[0]->first[i]; in FindFirstNonCommonLetter()
37 if (Match->first[i] != Letter) in FindFirstNonCommonLetter()
41 return Matches[0]->first.size(); in FindFirstNonCommonLetter()
57 if (CharNo == Matches[0]->first.size()) { in EmitStringMatcherForChar()
65 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n"; in EmitStringMatcherForChar()
70 OS << Indent << Split.first << "\n"; in EmitStringMatcherForChar()
80 MatchesByLetter[Match->first[CharNo]].push_back(Match); in EmitStringMatcherForChar()
93 << Matches[0]->first[CharNo] << "')\n"; in EmitStringMatcherForChar()
99 << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", " in EmitStringMatcherForChar()
[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/kyua/integration/ |
| 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
99 test_suites.first.two
110 test_suites.first.one = 1
111 test_suites.first.two = 2
116 test_suites.first.two = 2
[all …]
|
| /freebsd/contrib/ntp/sntp/libevent/sample/ |
| H A D | hostcheck.c | 123 static int Curl_raw_equal(const char *first, const char *second) in Curl_raw_equal() argument
125 while(*first && *second) { in Curl_raw_equal()
126 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) in Curl_raw_equal()
129 first++; in Curl_raw_equal()
135 return (Curl_raw_toupper(*first) == Curl_raw_toupper(*second)); in Curl_raw_equal()
138 static int Curl_raw_nequal(const char *first, const char *second, size_t max) in Curl_raw_nequal() argument
140 while(*first && *second && max) { in Curl_raw_nequal()
141 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) { in Curl_raw_nequal()
145 first++; in Curl_raw_nequal()
151 return Curl_raw_toupper(*first) == Curl_raw_toupper(*second); in Curl_raw_nequal()
|
| /freebsd/contrib/libevent/sample/ |
| H A D | hostcheck.c | 123 static int Curl_raw_equal(const char *first, const char *second) in Curl_raw_equal() argument
125 while(*first && *second) { in Curl_raw_equal()
126 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) in Curl_raw_equal()
129 first++; in Curl_raw_equal()
135 return (Curl_raw_toupper(*first) == Curl_raw_toupper(*second)); in Curl_raw_equal()
138 static int Curl_raw_nequal(const char *first, const char *second, size_t max) in Curl_raw_nequal() argument
140 while(*first && *second && max) { in Curl_raw_nequal()
141 if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) { in Curl_raw_nequal()
145 first++; in Curl_raw_nequal()
151 return Curl_raw_toupper(*first) == Curl_raw_toupper(*second); in Curl_raw_nequal()
|
| /freebsd/contrib/libxo/tests/core/saved/ |
| H A D | test_07.X.out | 1 …first-name>Jim</first-name><nic-name>"რეგტ"</nic-name><last-name>გთხოვთ ახ</last-name><department>…
|
| H A D | test_07.XP.out | 14 <first-name>Jim</first-name>
23 <first-name>Terry</first-name>
32 <first-name>Leslie</first-name>
41 <first-name>Ashley</first-name>
49 <first-name>0123456789</first-name>
57 <first-name>ახლა</first-name>
|
| H A D | test_05.XP.out | 33 <first-name>Jim</first-name>
41 <first-name>Terry</first-name>
49 <first-name>Leslie</first-name>
57 <first-name>Ashley</first-name>
64 <first-name>0123456789</first-name>
71 <first-name>ახლა</first-name>
79 <first-name>෴ණ්ණ෴෴ණ්ණ෴</first-name>
|
| H A D | test_05.X.out | 1 …first-name>Jim</first-name><nic-name>"რეგტ"</nic-name><last-name>გთხოვთ ახ</last-name><department>…
|
| /freebsd/sys/dev/drm2/ |
| H A D | drm_linux_list.h | 157 struct list_head *first = list->next; in __list_splice() local
160 first->prev = prev; in __list_splice()
161 prev->next = first; in __list_splice()
182 struct hlist_node *first; member
191 #define INIT_HLIST_HEAD(head) (head)->first = NULL
209 return !h->first; in hlist_empty()
235 n->next = h->first; in hlist_add_head()
236 if (h->first) in hlist_add_head()
237 h->first->pprev = &n->next; in hlist_add_head()
238 h->first = n; in hlist_add_head()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
| H A D | ResourceManager.cpp | 196 unsigned RSID = getResourceStateIndex(RR.first); in use()
204 // If there are still available units in RR.first, in use()
209 AvailableProcResUnits ^= RR.first; in use()
211 // Notify groups that RR.first is no longer available. in use()
217 CurrentUser.markSubResourceAsUsed(RR.first); in use()
218 Strategies[GroupIndex]->used(RR.first); in use()
225 unsigned RSID = getResourceStateIndex(RR.first); in release()
232 AvailableProcResUnits ^= RR.first; in release()
234 // Notify groups that RR.first is now available again. in release()
239 CurrentUser.releaseSubResource(RR.first); in release()
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | LegacyLegalizerInfo.cpp | 121 const LLT Type = LLT2Action.first; in computeTables()
155 Opcode, TypeIdx, PointerSpecifiedActions.first, in computeTables()
163 const uint16_t ElementSize = VectorSpecifiedActions.first; in computeTables()
172 assert(BitsizeAndAction.first % ElementSize == 0); in computeTables()
173 const uint16_t NumElements = BitsizeAndAction.first / ElementSize; in computeTables()
216 if (v.size() >= 1 && v[0].first != 1) in increaseToLargerTypesAndDecreaseToLargest()
220 LargestSizeSoFar = v[i].first; in increaseToLargerTypesAndDecreaseToLargest()
221 if (i + 1 < v.size() && v[i + 1].first != v[i].first + 1) { in increaseToLargerTypesAndDecreaseToLargest()
223 LargestSizeSoFar = v[i].first in increaseToLargerTypesAndDecreaseToLargest()
[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.
|