Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 2835) sorted by relevance

12345678910>>...114

/freebsd/contrib/arm-optimized-routines/string/arm/
H A Dasmdefs.h126 _prologue \first, \first, \push_ip, \push_lr
184 cfisavelist \first, \first, 3
190 cfisavelist \first, \first, 2
198 cfisavelist \first, \first, 2
203 cfisavelist \first, \first, 1
242 _epilogue \first, \first, \push_ip, \push_lr
281 cfirestorelist \first, \first
286 cfirestorelist \first, \first
293 cfirestorelist \first, \first
297 cfirestorelist \first, \first
[all …]
/freebsd/contrib/libdivsufsort/lib/
H A Dtrsort.c171 t = last - first; in tr_pivot()
183 first = tr_median3(ISAd, first, first + t, first + (t << 1)); in tr_pivot()
371 STACK_PUSH5(ISAd, first, a, tr_ilg(a - first), trlink); in tr_introsort()
392 a = first; in tr_introsort()
394 first = a; in tr_introsort()
436 tr_heapsort(ISAd, first, last - first); in tr_introsort()
446 SWAP(*first, *a); in tr_introsort()
447 v = ISAd[*first]; in tr_introsort()
450 tr_partition(ISAd, first, first + 1, last, &a, &b, v); in tr_introsort()
564 first = SA; in trsort()
[all …]
H A Dsssort.c267 t = last - first; in ss_pivot()
279 first = ss_median3(Td, PA, first, first + t, first + (t << 1)); in ss_pivot()
303 if(first < a) { *first = ~*first; } in ss_partition()
333 if(limit-- == 0) { ss_heapsort(Td, PA, first, last - first); } in ss_mintrosort()
335 for(a = first + 1, v = Td[PA[*first]]; a < last; ++a) { in ss_mintrosort()
343 first = ss_partition(PA, first, a, depth); in ss_mintrosort()
354 STACK_PUSH(first, a, depth + 1, ss_ilg(a - first)); in ss_mintrosort()
434 first = ss_partition(PA, first, last, depth); in ss_mintrosort()
514 for(a = first, len = middle - first, half = len >> 1, r = -1; in ss_inplacemerge()
553 ss_blockswap(buf, first, middle - first); in ss_mergeforward()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dllist.h14 struct llist_node *first; member
35 first = head->first; in llist_del_first()
36 if (first == NULL) in llist_del_first()
38 next = first->next; in llist_del_first()
42 return (first); in llist_del_first()
48 struct llist_node *first; in llist_add() local
51 new->next = first = head->first; in llist_add()
55 return (first == NULL); in llist_add()
65 new_last->next = first = head->first; in llist_add_batch()
69 return (first == NULL); in llist_add_batch()
[all …]
/freebsd/contrib/bmake/unit-tests/
H A Ddepsrc-use.mk17 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 Ddivsufsort.c369 first = ss_median3(Td, PA, first, first + t, first + (t << 1)); in ss_pivot()
393 if(first < a) { *first = ~*first; } in ss_partition()
425 for(a = first + 1, v = Td[PA[*first]]; a < last; ++a) { in ss_mintrosort()
433 first = ss_partition(PA, first, a, depth); in ss_mintrosort()
524 first = ss_partition(PA, first, last, depth); in ss_mintrosort()
643 ss_blockswap(buf, first, middle - first); in ss_mergeforward()
897 for(a = first, i = *(first - 1); in sssort()
1031 first = tr_median3(ISAd, first, first + t, first + (t << 1)); in tr_pivot()
1284 tr_heapsort(ISAd, first, last - first); in tr_introsort()
1298 tr_partition(ISAd, first, first + 1, last, &a, &b, v); in tr_introsort()
[all …]
/freebsd/usr.sbin/etcupdate/tests/
H A Dtests_test.sh117 mkfifo $i/equal/first/first/fifo
119 mkdir $i/equal/first/first/dir
162 mkfifo $OLD/first/first/equal/fifo
164 mkdir $OLD/first/first/equal/dir
760 missing /equal/first/first/fifo
761 missing /equal/first/first/file
762 missing /equal/first/first/dir
763 missing /equal/first/first/link
783 missing /first/first/equal/fifo
784 missing /first/first/equal/file
[all …]
H A Dalways_test.sh127 mkfifo $OLD/difftype/first/first/fifo
128 mkdir $NEW/difftype/first/first/fifo
158 ln -s "old" $OLD/difflinks/first/first/link
452 missing /difftype/first/first/fifo
465 missing /difflinks/first/first/link
474 missing /difffiles/first/first/file
520 A /difffiles/first/first/file
523 A /difflinks/first/first/link
573 missing /difftype/first/first/fifo
587 link /difflinks/first/first/link "new"
[all …]
/freebsd/usr.bin/netstat/
H A Dinet6.c354 int first, i; in ip6_stats() local
428 if (!first) in ip6_stats()
450 if (!first) in ip6_stats()
508 if (!first) in ip6_stats()
524 if (!first) in ip6_stats()
539 if (!first) in ip6_stats()
555 if (!first) in ip6_stats()
570 if (!first) in ip6_stats()
589 if (!first) in ip6_stats()
977 if (!first) in icmp6_stats()
[all …]
/freebsd/contrib/bmake/
H A Dlst.c88 if (ln == list->first) in Lst_InsertBefore()
89 list->first = newNode; in Lst_InsertBefore()
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 = ln; in Lst_Append()
144 if (list->first == ln) in Lst_Remove()
145 list->first = ln->next; in Lst_Remove()
197 if (src->first != NULL) { in Lst_MoveAll()
202 dst->first = src->first; in Lst_MoveAll()
[all …]
/freebsd/contrib/flex/src/
H A Dnfa.c312 if (first == NIL) in link_machines()
316 return first; 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()
385 return first; in mkbranch()
464 if (first == NIL) in mkor()
468 return first; in mkor()
476 first = link_machines (eps, first); in mkor()
495 first = link_machines (first, eps); in mkor()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_map.h39 return LHS.first < RHS; in operator()
42 return LHS < RHS.first; in operator()
65 if (empty() || K < begin()->first.first || in find()
72 if (K < I->first.second) in find()
99 if (KS >= I->first.second) in erase()
109 if (KE < Tmp.first.second) { in erase()
116 if (KS > Tmp.first.first) in erase()
118 J, std::make_pair(std::make_pair(Tmp.first.first, KS), Tmp.second)); in erase()
138 if (J != this->end() && KE == J->first.first && J->second == V) { in insert()
139 KE = J->first.second; in insert()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Tooling/
H A DNodeIntrospection.cpp64 if (LHS.first.getBegin() < RHS.first.getBegin()) in operator ()()
66 else if (LHS.first.getBegin() != RHS.first.getBegin()) in operator ()()
69 if (LHS.first.getEnd() < RHS.first.getEnd()) in operator ()()
71 else if (LHS.first.getEnd() != RHS.first.getEnd()) in operator ()()
79 if (LHS.first == RHS.first) in operator ()()
81 return LHS.first < RHS.first; in operator ()()
/freebsd/contrib/llvm-project/llvm/lib/TableGen/
H A DStringMatcher.cpp32 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 Dpair.h103 first = __p.first;
116 first = __p.first;
293 first = __p.first;
312 first = __p.first;
322 first = std::forward<_U1>(__p.first);
332 first = __p.first;
351 first = __p.first;
360 first = std::forward<_U1>(__p.first);
481 swap(first, __p.first);
489 swap(first, __p.first);
[all …]
/freebsd/contrib/libevent/sample/
H A Dhostcheck.c123 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/ntp/sntp/libevent/sample/
H A Dhostcheck.c123 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 Dtest_07.X.out1 …first-name>Jim</first-name><nic-name>"რეგტ"</nic-name><last-name>გთხოვთ ახ</last-name><department>…
H A Dtest_07.XP.out14 <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 Dtest_05.X.out1 …first-name>Jim</first-name><nic-name>"რეგტ"</nic-name><last-name>გთხოვთ ახ</last-name><department>…
H A Dtest_05.XP.out33 <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>
/freebsd/contrib/kyua/integration/
H A Dcmd_config_test.sh70 test_suites.first.one = 1
71 test_suites.first.two = 2
75 test_suites.first.two = 2
88 test_suites.first.one = 1
108 test_suites.first.one = 1
109 test_suites.first.two = 2
114 test_suites.first.two = 2
115 test_suites.first.one = 1
132 test_suites.first.one = 1
147 test_suites.first.one test_suites.first.two \
[all …]
/freebsd/lib/libc/
H A DVersions.def8 # 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/sys/dev/drm2/
H A Ddrm_linux_list.h160 first->prev = prev; in __list_splice()
161 prev->next = first; in __list_splice()
209 return !h->first; in hlist_empty()
235 n->next = h->first; in hlist_add_head()
236 if (h->first) in hlist_add_head()
238 h->first = n; in hlist_add_head()
239 n->pprev = &h->first; in hlist_add_head()
267 new->first = old->first; in hlist_move_list()
268 if (new->first) in hlist_move_list()
269 new->first->pprev = &new->first; in hlist_move_list()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegacyLegalizerInfo.cpp121 const LLT Type = LLT2Action.first; 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 + 1; in increaseToLargerTypesAndDecreaseToLargest()
235 if (v.size() == 0 || v[0].first != 1) in decreaseToSmallerTypesAndIncreaseToSmallest()
239 if (i + 1 == v.size() || v[i + 1].first != v[i].first + 1) { in decreaseToSmallerTypesAndIncreaseToSmallest()
282 return {Vec[i].first, Action}; in findAction()
291 return {Vec[i].first, Action}; in findAction()
376 if (Action.first != Legal) { in getAction()
[all …]

12345678910>>...114