Home
last modified time | relevance | path

Searched full:sorted (Results 1 – 25 of 1292) sorted by relevance

12345678910>>...52

/freebsd/crypto/openssl/test/
H A Dpriority_queue_test.c55 static size_t values[MAX_SAMPLES], sorted[MAX_SAMPLES], ref[MAX_SAMPLES]; in test_size_t_priority_queue_int() local
69 memset(sorted, 0, sizeof(sorted)); in test_size_t_priority_queue_int()
74 memcpy(sorted, values, sizeof(*sorted) * count); in test_size_t_priority_queue_int()
75 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare); in test_size_t_priority_queue_int()
78 memcpy(values, sorted, sizeof(*values) * count); in test_size_t_priority_queue_int()
93 if (!TEST_size_t_eq(*ossl_pqueue_size_t_peek(pq), *sorted) in test_size_t_priority_queue_int()
107 memcpy(sorted, values, sizeof(*sorted) * count); in test_size_t_priority_queue_int()
108 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare); in test_size_t_priority_queue_int()
111 if (!TEST_size_t_eq(*ossl_pqueue_size_t_peek(pq), sorted[i]) in test_size_t_priority_queue_int()
112 || !TEST_size_t_eq(*ossl_pqueue_size_t_pop(pq), sorted[i])) in test_size_t_priority_queue_int()
H A Dstack_test.c61 int sorted; in test_int_stack() member
139 /* find sorted -- the value is matched so we don't need to locate it */ in test_int_stack()
141 if (!TEST_int_eq(sk_sint_find(s, &finds[i].value), finds[i].sorted)) { in test_int_stack()
142 TEST_info("int sorted find %d", i); in test_int_stack()
146 /* find_ex sorted */ in test_int_stack()
149 TEST_info("int sorted find_ex present %d", i); in test_int_stack()
154 TEST_info("int sorted find_ex absent %d", i); in test_int_stack()
/freebsd/sys/contrib/openzfs/.github/workflows/scripts/
H A Dmerge_summary.awk128 asort(expected_lines, sorted)
129 for (j in sorted)
130 print sorted[j]
133 asort(unexpected_pass_lines, sorted)
134 for (j in sorted)
135 print sorted[j]
138 asort(unexpected_lines, sorted)
139 for (j in sorted)
140 print sorted[j]
/freebsd/share/man/man9/
H A DSYSINIT.992 sorted list of initialization routines.
93 The initialization routines are then executed in the sorted order.
96 is used as the primary key and is sorted in ascending order.
99 is used as the secondary key and is sorted in ascending order.
110 These modules' initialization routines are sorted and merged into the kernel's
122 is scanned, sorted, and executed when the module is loaded.
124 The shutdown linker set for a kernel module is scanned, sorted, and executed
126 The teardown routines are sorted in the reverse order of the initialization
/freebsd/contrib/llvm-project/lld/COFF/
H A DCallGraphSort.cpp155 std::vector<int> sorted(clusters.size()); in run() local
159 std::iota(sorted.begin(), sorted.end(), 0); in run()
160 llvm::stable_sort(sorted, [&](int a, int b) { in run()
164 for (int l : sorted) { in run()
189 sorted.clear(); in run()
192 sorted.push_back(i); in run()
193 llvm::stable_sort(sorted, [&](int a, int b) { in run()
198 // Sections will be sorted by increasing order. Absent sections will have in run()
201 for (int leader : sorted) { in run()
219 for (int leader : sorted) in run()
[all …]
/freebsd/usr.bin/sort/
H A Dradixsort.c64 struct sort_list_item **sorted; member
76 /* stack of sort levels ready to be sorted */
344 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next()
358 sl->sorted[sl->start_position++] = sl->tosort[1]; in run_sort_level_next()
359 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next()
361 sl->sorted[sl->start_position++] = sl->tosort[0]; in run_sort_level_next()
362 sl->sorted[sl->start_position] = sl->tosort[1]; in run_sort_level_next()
401 memcpy(sl->sorted + sl->start_position, in run_sort_level_next()
452 memcpy(sl->sorted + sl->start_position, sl->leaves, in run_sort_level_next()
468 slc->sorted = sl->sorted; in run_sort_level_next()
[all …]
/freebsd/bin/sh/
H A Dalias.c176 struct alias **sorted, *ap; in printaliases() local
179 sorted = ckmalloc(aliases * sizeof(*sorted)); in printaliases()
184 sorted[j++] = ap; in printaliases()
185 qsort(sorted, aliases, sizeof(*sorted), comparealiases); in printaliases()
187 printalias(sorted[i]); in printaliases()
191 ckfree(sorted); in printaliases()
/freebsd/contrib/ncurses/man/
H A DMKterminfo.sh78 sorted=$MYTEMP/sorted
115 rm -f $sorted
131 sort $temp >>$sorted
134 echo "$data" >>$sorted
138 test $saved = yes && sort $temp >>$sorted
140 sed -e 's/^\.\.$//' $sorted | tr "\005\006" "\012\134" | sed -e '/^$/d'
/freebsd/usr.bin/gprof/
H A Dprintgprof.c405 arctype sorted; in sortchildren() local
410 * then insertion sort back on to sorted's children. in sortchildren()
412 * *detachedp the rest of the arcs to be sorted. in sortchildren()
413 * sorted arc list onto which you insertion sort. in sortchildren()
416 sorted.arc_childlist = 0; in sortchildren()
422 * insert it into sorted in sortchildren()
424 for ( prevp = &sorted ; in sortchildren()
435 * reattach sorted children to parent in sortchildren()
437 parentp -> children = sorted.arc_childlist; in sortchildren()
445 arctype sorted; in sortparents() local
[all …]
/freebsd/crypto/openssl/crypto/stack/
H A Dstack.c31 int sorted; member
42 sk->sorted = 0; in OPENSSL_sk_set_cmp_func()
57 ret->sorted = 0; in OPENSSL_sk_dup()
95 ret->sorted = 0; in OPENSSL_sk_deep_copy()
281 st->sorted = 0; in OPENSSL_sk_insert()
344 if (!st->sorted) { in internal_find()
476 st->sorted = 0; in OPENSSL_sk_set()
482 if (st != NULL && !st->sorted && st->comp != NULL) { in OPENSSL_sk_sort()
485 st->sorted = 1; /* empty or single-element stack is considered sorted */ in OPENSSL_sk_sort()
491 return st == NULL ? 1 : st->sorted; in OPENSSL_sk_is_sorted()
/freebsd/contrib/llvm-project/lld/MachO/
H A DSectionPriorities.cpp161 // Cluster indices sorted by density. in run()
162 std::vector<int> sorted(clusters.size()); in run() local
167 std::iota(sorted.begin(), sorted.end(), 0); in run()
169 llvm::stable_sort(sorted, [&](int a, int b) { in run()
173 for (int l : sorted) { in run()
198 sorted.clear(); in run()
201 sorted.push_back(i); in run()
202 llvm::stable_sort(sorted, [&](int a, int b) { in run()
208 // Sections will be sorted by decreasing order. Absent sections will have in run()
211 for (int leader : sorted) { in run()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/TextAPI/
H A DArchitecture.def14 /// X86 architectures sorted by cpu type and sub type id.
22 /// ARM architectures sorted by cpu sub type id.
36 /// ARM64 architectures sorted by cpu sub type id.
43 /// ARM64_32 architectures sorted by cpu sub type id
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp396 std::list<MipsRelocationEntry> Sorted; in sortRelocs() local
399 Sorted.push_back(R); in sortRelocs()
401 Hi16.push_back(std::prev(Sorted.end())); in sortRelocs()
408 if (std::next(I) != Sorted.end() && in sortRelocs()
418 auto Best = Sorted.end(); in sortRelocs()
419 for (auto J = Sorted.begin(); J != Sorted.end(); ++J) { in sortRelocs()
423 (Best == Sorted.end() || R1.Addend < Best->R.Addend || in sortRelocs()
427 if (Best != Sorted.end() && R.Addend == Best->R.Addend) in sortRelocs()
432 Sorted.splice(Best, Sorted, I); in sortRelocs()
435 assert(Relocs.size() == Sorted.size() && "Some relocs were not consumed"); in sortRelocs()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dnth_element.h137 // The first part is sorted, in __nth_element()
189 // Check for [__first, __i) already sorted in __nth_element()
193 // [__first, __i) sorted in __nth_element()
197 // not yet sorted, so sort in __nth_element()
203 // Check for [__i, __last) already sorted in __nth_element()
207 // [__i, __last) sorted in __nth_element()
211 // not yet sorted, so sort in __nth_element()
/freebsd/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp195 std::vector<int> sorted(clusters.size()); in run() local
199 std::iota(sorted.begin(), sorted.end(), 0); in run()
200 llvm::stable_sort(sorted, [&](int a, int b) { in run()
204 for (int l : sorted) { in run()
229 sorted.clear(); in run()
232 sorted.push_back(i); in run()
233 llvm::stable_sort(sorted, [&](int a, int b) { in run()
239 for (int leader : sorted) { in run()
258 for (int leader : sorted) in run()
/freebsd/sys/contrib/dev/iwlwifi/mld/
H A Dmld.c159 /* Please keep this array *SORTED* by hex value.
207 /* Please keep this array *SORTED* by hex value.
221 /* Please keep this array *SORTED* by hex value.
232 /* Please keep this array *SORTED* by hex value.
240 /* Please keep this array *SORTED* by hex value.
264 /* Please keep this array *SORTED* by hex value.
284 /* Please keep this array *SORTED* by hex value.
291 /* Please keep this array *SORTED* by hex value.
299 /* Please keep this array *SORTED* by hex value.
311 /* Please keep this array *SORTED* by hex value.
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dnth_element.h137 // The first part is sorted, in __nth_element()
189 // Check for [__first, __i) already sorted in __nth_element()
193 // [__first, __i) sorted in __nth_element()
197 // not yet sorted, so sort in __nth_element()
203 // Check for [__i, __last) already sorted in __nth_element()
207 // [__i, __last) sorted in __nth_element()
211 // not yet sorted, so sort in __nth_element()
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-order-string.mk3 # Tests for the :O variable modifier, which returns the words, sorted in
6 # Simple words are sorted lexicographically.
20 # Numbers are sorted lexicographically as well.
H A Dvarmod-order-shuffle.mk38 sorted:= ${WORDS:Ox:O}
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
/freebsd/share/misc/
H A Dorganization.dot25 # Development teams go here alphabetically sorted by FreeBSD login name
42 # Admin teams go here alphabetically sorted
53 # Misc hats go here alphabetically sorted
61 # Keep the list sorted by the superior team entry.
/freebsd/contrib/llvm-project/lldb/source/Utility/
H A DTimer.cpp139 std::vector<Stats> sorted; in DumpCategoryTimes() local
146 sorted.push_back(stats); in DumpCategoryTimes()
149 if (sorted.empty()) in DumpCategoryTimes()
153 llvm::sort(sorted, CategoryMapIteratorSortCriterion); in DumpCategoryTimes()
155 for (const auto &stats : sorted) in DumpCategoryTimes()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DRISCVISAUtils.cpp22 // -Multi-letter extensions starting with 'z' sorted by canonical order of
23 // the second letter then sorted alphabetically.
67 // `z` extension must be sorted by canonical order of second letter. in getExtensionRank()
90 // If the rank is same, it must be sorted by lexicographic order. in compareExtension()
/freebsd/lib/libc/stdlib/
H A Dbsearch.339 .Nd binary search of a sorted table
64 The contents of the array should be in ascending sorted order according
148 A sample program that searches people by age in a sorted array:
178 /* Sorted array */
/freebsd/contrib/libdivsufsort/lib/
H A Ddivsufsort.c161 /* Set the sorted order of tyoe B* suffixes. */ in sort_typeBstar()
192 /* Constructs the suffix array by using the sorted order of type B* suffixes. */
203 /* Construct the sorted order of type B suffixes by using in construct_SA()
204 the sorted order of type B* suffixes. */ in construct_SA()
233 the sorted order of type B suffixes. */ in construct_SA()
256 by using the sorted order of type B* suffixes. */
267 /* Construct the sorted order of type B suffixes by using in construct_BWT()
268 the sorted order of type B* suffixes. */ in construct_BWT()
300 the sorted order of type B suffixes. */ in construct_BWT()
/freebsd/sys/sys/
H A Dqueue_mergesort.h93 /* Find the element before the start of the second sorted region. */ \
128 * then sqms_sorted is a sequence of 2^a sorted entries followed by a \
129 * list of 2^b sorted entries ... followed by a list of 2^z sorted \
172 /* Move the sorted list back to the input list. */ \

12345678910>>...52