Home
last modified time | relevance | path

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

1234567

/src/sys/contrib/openzfs/.github/workflows/scripts/
H A Dmerge_summary.awk96 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]
/src/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()
/src/contrib/llvm-project/lld/COFF/
H A DCallGraphSort.cpp156 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()
202 for (int leader : sorted) { in run()
219 for (int leader : sorted) in run()
/src/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()
/src/usr.bin/sort/
H A Dradixsort.c64 struct sort_list_item **sorted; member
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()
489 slc->sorted = sl->sorted; in run_sort_level_next()
[all …]
/src/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp194 std::vector<int> sorted(clusters.size()); in run() local
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()
/src/contrib/llvm-project/lld/MachO/
H A DSectionPriorities.cpp163 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()
214 for (int leader : sorted) { in run()
231 for (int leader : sorted) in run()
/src/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()
/src/contrib/bmake/unit-tests/
H A Dvarmod-order-shuffle.mk38 sorted:= ${WORDS:Ox:O}
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
/src/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
/src/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()
/src/cddl/contrib/opensolaris/lib/pyzfs/common/
H A Dallow.py111 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):
/src/usr.bin/gprof/
H A Dprintgprof.c405 arctype sorted; in sortchildren() local
416 sorted.arc_childlist = 0; in sortchildren()
424 for ( prevp = &sorted ; in sortchildren()
437 parentp -> children = sorted.arc_childlist; in sortchildren()
445 arctype sorted; in sortparents() local
456 sorted.arc_parentlist = 0; in sortparents()
464 for ( prevp = &sorted ; in sortparents()
477 childp -> parents = sorted.arc_parentlist; in sortparents()
/src/contrib/ncurses/man/
H A DMKterminfo.sh78 sorted=$MYTEMP/sorted
/src/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c1546 dt_ahashent_t *h, **sorted; local
1570 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1572 if (sorted == NULL)
1576 sorted[i++] = h;
1581 dt_aggregate_qsort(dtp, sorted, nentries,
1589 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1595 h = sorted[i];
1609 dt_free(dtp, sorted);
1689 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; local
1971 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
[all …]
/src/usr.bin/col/
H A Dcol.c429 static CHAR *sorted; in flush_line() local
438 if ((sorted = realloc(sorted, in flush_line()
463 sorted[count[c->c_column]++] = *c; in flush_line()
464 c = sorted; in flush_line()
/src/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.
/src/sys/contrib/device-tree/Bindings/spi/
H A Dspi-sprd.txt11 - clocks: List of clock input name strings sorted in the same order
20 sorted in the same order as the dma-names property.
/src/sys/contrib/openzfs/tests/test-runner/bin/
H A Dzts-report.py.in462 for test in sorted(expected):
490 for test in sorted(known.keys()):
498 for test in sorted(unexpected):
/src/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_typefun.c8 int sorted; member
/src/crypto/krb5/src/util/
H A Dprincflags.py137 for v, k in sorted(_flagnames.items()):
228 a = sorted(pflags.items(), key=lambda k, v: (v.flag, -v.invert, k))
/src/lib/libc/iconv/
H A Dbsd_iconv.c152 __bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted) in __bsd___iconv_get_list() argument
156 ret = _citrus_esdb_get_list(rlist, rsz, sorted); in __bsd___iconv_get_list()
/src/crypto/openssl/doc/man3/
H A DSSL_get_ciphers.pod31 sorted by preference. If B<ssl> is NULL or no ciphers are available, NULL
37 B<ssl> as would be sent in a ClientHello (that is, sorted by preference).
86 sorted list of available ciphers, until NULL is returned.
/src/tests/sys/cddl/zfs/tests/txg_integrity/
H A Dmake_patterns.py18 partitions = sorted(
/src/contrib/kyua/
H A DAUTHORS6 # Names are sorted alphabetically and should be added to this file as:

1234567