| /freebsd/sys/contrib/openzfs/.github/workflows/scripts/ |
| H A D | merge_summary.awk | 96 asort(expected_lines, sorted)
97 for (j in sorted)
98 print sorted[j]
101 asort(unexpected_pass_lines, sorted)
102 for (j in sorted)
103 print sorted[j]
106 asort(unexpected_lines, sorted)
107 for (j in sorted)
108 print sorted[j]
|
| /freebsd/share/man/man9/ |
| H A D | SYSINIT.9 | 92 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/ncurses/man/ |
| H A D | MKterminfo.sh | 73 sorted=sorted$$
75 trap 'code=$?; rm -f $sorted $temp $unsorted; exit $code' EXIT HUP INT QUIT TERM
76 rm -f $sorted $temp $unsorted
94 rm -f $sorted
110 sort $temp >>$sorted
113 echo "$data" >>$sorted
117 test $saved = yes && sort $temp >>$sorted
119 sed -e 's/^\.\.$//' $sorted | tr "\005\006" "\012\134"
|
| /freebsd/contrib/llvm-project/lld/COFF/ |
| H A D | CallGraphSort.cpp | 156 std::vector<int> sorted(clusters.size()); in run() local
160 std::iota(sorted.begin(), sorted.end(), 0); in run()
161 llvm::stable_sort(sorted, [&](int a, int b) { in run()
165 for (int l : sorted) { in run()
190 sorted.clear(); in run()
193 sorted.push_back(i); in run()
194 llvm::stable_sort(sorted, [&](int a, int b) { in run()
199 // Sections will be sorted by increasing order. Absent sections will have in run()
202 for (int leader : sorted) { in run()
219 for (int leader : sorted) in run()
[all …]
|
| /freebsd/crypto/openssl/crypto/stack/ |
| H A D | stack.c | 27 int sorted; member
38 sk->sorted = 0; in OPENSSL_sk_set_cmp_func()
53 ret->sorted = 0; in OPENSSL_sk_dup()
92 ret->sorted = 0; in OPENSSL_sk_deep_copy()
282 st->sorted = 0; in OPENSSL_sk_insert()
340 if (!st->sorted) { in internal_find()
343 st->sorted = 1; /* empty or single-element stack is considered sorted */ in internal_find()
462 st->sorted = 0; in OPENSSL_sk_set()
468 if (st != NULL && !st->sorted && st->comp != NULL) { in OPENSSL_sk_sort()
471 st->sorted = 1; /* empty or single-element stack is considered sorted */ in OPENSSL_sk_sort()
[all …]
|
| /freebsd/contrib/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 194 std::vector<int> sorted(clusters.size()); in run()
198 std::iota(sorted.begin(), sorted.end(), 0); in run()
199 llvm::stable_sort(sorted, [&](int a, int b) { in run()
203 for (int l : sorted) { in run()
228 sorted.clear(); in run()
231 sorted.push_back(i); in run()
232 llvm::stable_sort(sorted, [&](int a, int b) { in run()
238 for (int leader : sorted) { in run()
256 for (int leader : sorted) in run()
183 std::vector<int> sorted(clusters.size()); run() local
[all...] |
| /freebsd/usr.bin/sort/ |
| H A D | radixsort.c | 64 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 D | alias.c | 174 struct alias **sorted, *ap; in printaliases() local
177 sorted = ckmalloc(aliases * sizeof(*sorted)); in printaliases()
182 sorted[j++] = ap; in printaliases()
183 qsort(sorted, aliases, sizeof(*sorted), comparealiases); in printaliases()
185 printalias(sorted[i]); in printaliases()
189 ckfree(sorted); in printaliases()
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | SectionPriorities.cpp | 162 // Cluster indices sorted by density. in run()
163 std::vector<int> sorted(clusters.size()); in run() local
168 std::iota(sorted.begin(), sorted.end(), 0); in run()
170 llvm::stable_sort(sorted, [&](int a, int b) { in run()
174 for (int l : sorted) { in run()
199 sorted.clear(); in run()
202 sorted.push_back(i); in run()
203 llvm::stable_sort(sorted, [&](int a, int b) { in run()
209 // Sections will be sorted by decreasing order. Absent sections will have in run()
214 for (int leader : sorted) { in run()
[all …]
|
| /freebsd/usr.bin/gprof/ |
| H A D | printgprof.c | 405 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/contrib/llvm-project/llvm/include/llvm/TextAPI/ |
| H A D | Architecture.def | 14 /// 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/libcxx/include/__algorithm/ |
| H A D | nth_element.h | 137 // 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 D | varmod-order-string.mk | 3 # 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 D | varmod-order-shuffle.mk | 38 sorted:= ${WORDS:Ox:O}
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
|
| /freebsd/lib/libc/stdlib/ |
| H A D | bsearch.3 | 37 .Nd binary search of a sorted table
57 The contents of the array should be in ascending sorted order according
84 A sample program that searches people by age in a sorted array:
114 /* Sorted array */
|
| /freebsd/contrib/cortex-strings/scripts/ |
| H A D | bench.py | 53 VARIANTS = sorted(HAS.keys())
54 FUNCTIONS = sorted(ALIGNMENTS.keys())
87 bytes = sorted(bytes)
124 for b in sorted(bytes):
171 for line in sorted(cache.values()):
|
| /freebsd/share/misc/ |
| H A D | organization.dot | 25 # 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 D | Timer.cpp | 139 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 D | RISCVISAUtils.cpp | 22 // -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/contrib/libdivsufsort/lib/ |
| H A D | divsufsort.c | 161 /* 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/crypto/openssl/test/ |
| H A D | stack_test.c | 61 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/sys/ |
| H A D | queue_mergesort.h | 93 /* 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. */ \
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | DebugSupport.cpp | 67 std::vector<std::pair<Atom, Solver::Result::Assignment>> Sorted = { in operator <<() local
69 llvm::sort(Sorted); in operator <<()
70 for (const auto &Entry : Sorted) in operator <<()
|
| /freebsd/cddl/contrib/opensolaris/lib/pyzfs/common/ |
| H A D | allow.py | 111 for (nwho, perms) in sorted(d.items()):
117 (nwho[1:], ",".join(sorted(perms)))
127 s += "\t%s\n" % ",".join(sorted(self.create))
261 for (name, note) in sorted(perms_subcmd.iteritems()):
264 for (name, note) in sorted(perms_other.iteritems()):
267 for (name, prop) in sorted(zfs.dataset.proptable.iteritems()):
333 for fs in sorted(p.keys(), reverse=True):
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86InstrFoldTables.cpp | 21 // These tables are sorted by their RegOp value allowing them to be binary
93 assert(llvm::is_sorted(TABLE) && #TABLE " is not sorted"); \ in lookupFoldTableImpl()
98 // Make sure the tables are sorted. in lookupFoldTableImpl()
168 // Stores memory unfolding tables entries sorted by opcode.
216 // Now that it's sorted, ensure its unique. in X86MemUnfoldTable()
244 // Stores memory broadcast folding tables entries sorted by opcode.
|