Home
last modified time | relevance | path

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

12345678910>>...140

/freebsd-12.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-12.1/contrib/gcclibs/libiberty/
H A Dconcat.c105 VA_OPEN (args, first); in concat_length()
120 VA_OPEN (args, first); in concat_copy()
123 vconcat_copy (dst, first, args); in concat_copy()
141 concat_copy2 (const char *first, ...) in concat_copy2() argument
143 VA_OPEN (args, first); in concat_copy2()
152 concat (const char *first, ...) in concat() argument
157 VA_OPEN (args, first); in concat()
163 VA_OPEN (args, first); in concat()
165 vconcat_copy (newstr, first, args); in concat()
194 VA_OPEN (args, first); in reconcat()
[all …]
/freebsd-12.1/contrib/binutils/libiberty/
H A Dconcat.c105 VA_OPEN (args, first); in concat_length()
120 VA_OPEN (args, first); in concat_copy()
123 vconcat_copy (dst, first, args); in concat_copy()
141 concat_copy2 (const char *first, ...) in concat_copy2() argument
143 VA_OPEN (args, first); in concat_copy2()
152 concat (const char *first, ...) in concat() argument
157 VA_OPEN (args, first); in concat()
163 VA_OPEN (args, first); in concat()
165 vconcat_copy (newstr, first, args); in concat()
194 VA_OPEN (args, first); in reconcat()
[all …]
/freebsd-12.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-12.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-12.1/contrib/flex/
H A Dnfa.c307 if (first == NIL)
311 return first;
316 lastst[first] = MAX (lastst[first], lastst[last]);
317 firstst[first] = MIN (firstst[first], firstst[last]);
319 return first;
382 return first;
464 if (first == NIL)
468 return first;
476 first = link_machines (eps, first);
495 first = link_machines (first, eps);
[all …]
/freebsd-12.1/usr.bin/netstat/
H A Dinet6.c362 int first, i; in ip6_stats() local
434 if (!first) in ip6_stats()
456 if (!first) in ip6_stats()
514 if (!first) in ip6_stats()
530 if (!first) in ip6_stats()
545 if (!first) in ip6_stats()
561 if (!first) in ip6_stats()
576 if (!first) in ip6_stats()
595 if (!first) in ip6_stats()
983 if (!first) in icmp6_stats()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFGDiff.h95 Pair.first->printAsOperand(OS, false); in printMap()
169 return !N.first->ignoreChild(BB, N.second, false); in operator()
183 auto InsertVec = N.first->getAddedChildren(N.second, false); in child_begin()
191 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first}); in child_begin()
198 auto InsertVec = N.first->getAddedChildren(N.second, false); in child_end()
206 {InsertVec.end(), N.first}, {InsertVec.end(), N.first}); in child_end()
223 return !N.first->ignoreChild(BB, N.second, true); in operator()
237 auto InsertVec = N.first->getAddedChildren(N.second, true); in child_begin()
245 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first}); in child_begin()
252 auto InsertVec = N.first->getAddedChildren(N.second, true); in child_end()
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/
H A Dassoc_container.hpp218 cc_hash_table(It first, It last) in cc_hash_table() argument
219 { base_type::copy_from_range(first, last); } in cc_hash_table()
227 { copy_from_range(first, last); } in cc_hash_table()
238 { copy_from_range(first, last); } in cc_hash_table()
251 { copy_from_range(first, last); } in cc_hash_table()
265 { copy_from_range(first, last); } in cc_hash_table()
368 gp_hash_table(It first, It last) in gp_hash_table() argument
520 tree(It first, It last) in tree() argument
528 tree(It first, It last, const cmp_fn& c) in tree() argument
597 trie(It first, It last) in trie() argument
[all …]
/freebsd-12.1/contrib/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 (Matches[str]->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[Matches[i]->first[CharNo]].push_back(Matches[i]); in EmitStringMatcherForChar()
94 << Matches[0]->first[CharNo] << "')\n"; in EmitStringMatcherForChar()
117 OS << Indent << "case '" << LI->first << "':\t // " in EmitStringMatcherForChar()
[all …]
/freebsd-12.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-12.1/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-12.1/contrib/libstdc++/include/bits/
H A Dstl_pair.h73 _T1 first; ///< @c first is a copy of the first object member
81 : first(), second() { } in pair()
85 : first(__a), second(__b) { } in pair()
90 : first(__p.first), second(__p.second) { } in pair()
97 { return __x.first == __y.first && __x.second == __y.second; }
103 { return __x.first < __y.first
104 || (!(__y.first < __x.first) && __x.second < __y.second); }
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h51 size_t XSizeA = getBlockSize(X.first.first); in operator()
52 size_t YSizeA = getBlockSize(Y.first.first); in operator()
56 size_t XSizeB = getBlockSize(X.first.second); in operator()
57 size_t YSizeB = getBlockSize(Y.first.second); in operator()
80 Edge e = (*EWi).first; in MaximumSpanningTree()
82 Forest.insert(e.first); in MaximumSpanningTree()
89 Edge e = (*EWi).first; in MaximumSpanningTree()
91 if (Forest.findLeader(e.first) != Forest.findLeader(e.second)) { in MaximumSpanningTree()
92 Forest.unionSets(e.first, e.second); in MaximumSpanningTree()
/freebsd-12.1/contrib/gcc/
H A Dbitmap.c82 if (head->first == elt) in bitmap_element_free()
83 head->first = next; in bitmap_element_free()
169 head->first = NULL; in bitmap_elt_clear_from()
192 if (head->first) in bitmap_clear()
305 if (head->first == 0) in bitmap_element_link()
308 head->first = element; in bitmap_element_link()
323 head->first = element; in bitmap_element_link()
371 head->first = node; in bitmap_elt_insert_after()
1358 for (a_elt = a->first, b_elt = b->first; in bitmap_equal_p()
1380 for (a_elt = a->first, b_elt = b->first; in bitmap_intersect_p()
[all …]
/freebsd-12.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-12.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()
467 if (first > last) in generate_format()
468 last = first - incr * floor((first - last) / incr); in generate_format()
470 last = first + incr * floor((last - first) / incr); in generate_format()
[all …]
/freebsd-12.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-12.1/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h281 struct list_head *first; in linux_list_splice() local
286 first = list->next; in linux_list_splice()
288 first->prev = prev; in linux_list_splice()
289 prev->next = first; in linux_list_splice()
382 n->next = h->first; in hlist_add_head()
383 if (h->first != NULL) in hlist_add_head()
386 n->pprev = &h->first; in hlist_add_head()
415 new->first = old->first; in hlist_move_list()
416 if (new->first) in hlist_move_list()
417 new->first->pprev = &new->first; in hlist_move_list()
[all …]
/freebsd-12.1/contrib/opencsd/decoder/source/
H A Dtrc_component.cpp99 if(m_error_logger.first()) in LogError()
100 m_error_logger.first()->LogError(m_errLogHandle,&Error); in LogError()
110 if (m_error_logger.first()) in LogMessage()
111 m_error_logger.first()->LogMessage(this->m_errLogHandle, filter_level, msg); in LogMessage()
121 if(m_error_logger.first()) in do_attach_notify()
123 m_errLogHandle = m_error_logger.first()->RegisterErrorSource(m_name); in do_attach_notify()
124 m_errVerbosity = m_error_logger.first()->GetErrorLogVerbosity(); in do_attach_notify()
135 if(m_error_logger.first()) in updateErrorLogLevel()
137 m_errVerbosity = m_error_logger.first()->GetErrorLogVerbosity(); in updateErrorLogLevel()

12345678910>>...140