Home
last modified time | relevance | path

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

12345678910>>...161

/freebsd-13.1/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-13.1/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-13.1/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-13.1/usr.sbin/etcupdate/tests/
H A Dtests_test.sh118 mkfifo $i/equal/first/first/fifo
120 mkdir $i/equal/first/first/dir
163 mkfifo $OLD/first/first/equal/fifo
165 mkdir $OLD/first/first/equal/dir
761 missing /equal/first/first/fifo
762 missing /equal/first/first/file
763 missing /equal/first/first/dir
764 missing /equal/first/first/link
784 missing /first/first/equal/fifo
785 missing /first/first/equal/file
[all …]
H A Dalways_test.sh128 mkfifo $OLD/difftype/first/first/fifo
129 mkdir $NEW/difftype/first/first/fifo
159 ln -s "old" $OLD/difflinks/first/first/link
453 missing /difftype/first/first/fifo
466 missing /difflinks/first/first/link
475 missing /difffiles/first/first/file
521 A /difffiles/first/first/file
524 A /difflinks/first/first/link
574 missing /difftype/first/first/fifo
588 link /difflinks/first/first/link "new"
[all …]
/freebsd-13.1/usr.bin/netstat/
H A Dinet6.c362 int first, i; in ip6_stats() local
436 if (!first) in ip6_stats()
458 if (!first) in ip6_stats()
516 if (!first) in ip6_stats()
532 if (!first) in ip6_stats()
547 if (!first) in ip6_stats()
563 if (!first) in ip6_stats()
578 if (!first) in ip6_stats()
597 if (!first) in ip6_stats()
985 if (!first) in icmp6_stats()
[all …]
/freebsd-13.1/contrib/bmake/
H A Dlst.c106 if (ln == list->first) in Lst_InsertBefore()
107 list->first = newNode; in Lst_InsertBefore()
121 list->first = ln; in Lst_Prepend()
124 list->first->prev = ln; in Lst_Prepend()
125 list->first = ln; in Lst_Prepend()
140 list->first = ln; in Lst_Append()
162 if (list->first == ln) in Lst_Remove()
163 list->first = ln->next; in Lst_Remove()
213 if (src->first != NULL) { in Lst_MoveAll()
218 dst->first = src->first; in Lst_MoveAll()
[all …]
/freebsd-13.1/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-13.1/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-13.1/contrib/llvm-project/llvm/lib/TableGen/
H A DStringMatcher.cpp31 for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) { in FindFirstNonCommonLetter()
33 char Letter = Matches[0]->first[i]; in FindFirstNonCommonLetter()
36 if (Matches[str]->first[i] != Letter) in FindFirstNonCommonLetter()
40 return Matches[0]->first.size(); in FindFirstNonCommonLetter()
56 if (CharNo == Matches[0]->first.size()) { in EmitStringMatcherForChar()
64 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n"; in EmitStringMatcherForChar()
69 OS << Indent << Split.first << "\n"; in EmitStringMatcherForChar()
79 MatchesByLetter[Matches[i]->first[CharNo]].push_back(Matches[i]); in EmitStringMatcherForChar()
93 << Matches[0]->first[CharNo] << "')\n"; in EmitStringMatcherForChar()
99 << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", " in EmitStringMatcherForChar()
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A Dalgorithm35 for_each(InputIterator first, InputIterator last, Function f);
39 for_each_n(InputIterator first, Size n, Function f); // C++17
75 adjacent_find(ForwardIterator first, ForwardIterator last);
166 search_n(ForwardIterator first, ForwardIterator last,
175 copy_if(InputIterator first, InputIterator last,
227 fill_n(OutputIterator first, Size n, const T& value);
235 generate_n(OutputIterator first, Size n, Generator gen);
255 unique(ForwardIterator first, ForwardIterator last);
306 shift_left(ForwardIterator first, ForwardIterator last,
325 partition_copy(InputIterator first, InputIterator last,
[all …]
/freebsd-13.1/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-13.1/contrib/libxo/tests/core/saved/
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_07.X.out1 …first-name>Jim</first-name><nic-name>"რეგტ"</nic-name><last-name>გთხოვთ ახ</last-name><department>…
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-13.1/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-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h50 size_t XSizeA = getBlockSize(X.first.first); in operator()
51 size_t YSizeA = getBlockSize(Y.first.first); in operator()
55 size_t XSizeB = getBlockSize(X.first.second); in operator()
56 size_t YSizeB = getBlockSize(Y.first.second); in operator()
78 Edge e = (*EWi).first; in MaximumSpanningTree()
80 Forest.insert(e.first); in MaximumSpanningTree()
87 Edge e = (*EWi).first; in MaximumSpanningTree()
89 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { in MaximumSpanningTree()
90 Forest.unionSets(e.first, e.second); in MaximumSpanningTree()
/freebsd-13.1/usr.bin/seq/
H A Dseq.c92 double first, last, incr, last_shown_value, cur, step; in main() local
97 first = 1.0; in main()
153 first = e_atof(argv[0]); in main()
164 incr = (first < last) ? 1.0 : -1.0; in main()
166 if (incr <= 0.0 && first < last) in main()
169 if (incr >= 0.0 && first > last) in main()
186 cur = first + incr * step++) { in main()
468 if (first > last) in generate_format()
469 last = first - incr * floor((first - last) / incr); in generate_format()
471 last = first + incr * floor((last - first) / incr); in generate_format()
[all …]
/freebsd-13.1/sys/dev/drm2/
H A Ddrm_linux_list.h162 first->prev = prev; in __list_splice()
163 prev->next = first; in __list_splice()
211 return !h->first; in hlist_empty()
237 n->next = h->first; in hlist_add_head()
238 if (h->first) in hlist_add_head()
240 h->first = n; in hlist_add_head()
241 n->pprev = &h->first; in hlist_add_head()
269 new->first = old->first; in hlist_move_list()
270 if (new->first) in hlist_move_list()
271 new->first->pprev = &new->first; in hlist_move_list()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegacyLegalizerInfo.cpp118 const LLT Type = LLT2Action.first; in computeTables()
213 if (v.size() >= 1 && v[0].first != 1) in increaseToLargerTypesAndDecreaseToLargest()
217 LargestSizeSoFar = v[i].first; in increaseToLargerTypesAndDecreaseToLargest()
218 if (i + 1 < v.size() && v[i + 1].first != v[i].first + 1) { in increaseToLargerTypesAndDecreaseToLargest()
220 LargestSizeSoFar = v[i].first + 1; in increaseToLargerTypesAndDecreaseToLargest()
232 if (v.size() == 0 || v[0].first != 1) in decreaseToSmallerTypesAndIncreaseToSmallest()
236 if (i + 1 == v.size() || v[i + 1].first != v[i].first + 1) { in decreaseToSmallerTypesAndIncreaseToSmallest()
279 return {Vec[i].first, Action}; in findAction()
288 return {Vec[i].first, Action}; in findAction()
373 if (Action.first != Legal) { in getAction()
[all …]
/freebsd-13.1/contrib/mandoc/
H A Deqn_html.c54 if (NULL == bp->first) in eqn_box()
57 bp->first->expectargs == 1) { in eqn_box()
58 eqn_box(p, bp->first); in eqn_box()
61 if (NULL == (parent = bp->first->first)) in eqn_box()
71 parent = bp->first->first; in eqn_box()
74 child = parent->first; in eqn_box()
87 eqn_box(p, child->first); in eqn_box()
137 if (bp->first != NULL && in eqn_box()
139 bp->first->expectargs > 1) in eqn_box()
211 eqn_box(p, bp->first); in eqn_box()
[all …]
/freebsd-13.1/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/
H A Dtst.relenum.d47 first, enumerator
52 /zero >= one || second <= first || zero == second/
56 printf("null = %d; first = %d; second = %d", null, first, second);
61 /second < one || two > second || null == first/
65 printf("null = %d; first = %d; second = %d", null, first, second);
70 /first < two && second > one && one != two && zero != first/
/freebsd-13.1/contrib/llvm-project/libcxx/include/__utility/
H A Dpair.h50 _T1 first; member
69 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} in pair()
73 first = __p.first;
148 : first(), second() {} in pair()
201 : first(__p.first), second(__p.second) {} in pair()
210 : first(__p.first), second(__p.second) {} in pair()
264 first = __p.first; in _NOEXCEPT_()
277 first = _VSTD::forward<first_type>(__p.first); in _NOEXCEPT_()
299 swap(first, __p.first); in swap()
323 return __x.first == __y.first && __x.second == __y.second;
[all …]

12345678910>>...161