| /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()
202 for (int leader : sorted) { in run()
219 for (int leader : sorted) in run()
|
| /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/usr.bin/sort/ |
| H A D | radixsort.c | 64 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()
468 slc->sorted = sl->sorted; in run_sort_level_next()
489 slc->sorted = sl->sorted; in run_sort_level_next()
601 slc->sorted = sl->tosort; in run_top_sort_level()
[all …]
|
| /freebsd/contrib/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 194 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()
|
| /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/MachO/ |
| H A D | SectionPriorities.cpp | 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()
214 for (int leader : sorted) { in run()
231 for (int leader : sorted) in run()
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | varmod-order-shuffle.mk | 38 sorted:= ${WORDS:Ox:O}
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
|
| /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/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()):
|
| H A D | libplot.py | 36 return sorted(values, key=lambda x: '%-06d|%s' % (-prefer.find(x), x))
38 return sorted(values)
|
| /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/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/usr.bin/gprof/ |
| H A D | printgprof.c | 405 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()
|
| /freebsd/cddl/contrib/opensolaris/lib/libdtrace/common/ |
| H A D | dt_aggregate.c | 1540 dt_ahashent_t *h, **sorted; local
1566 if (sorted == NULL)
1570 sorted[i++] = h;
1589 h = sorted[i];
1603 dt_free(dtp, sorted);
1967 if (sorted == NULL)
1976 sorted[i++] = h;
2001 bundle = (dt_ahashent_t ***)sorted;
2005 dt_aggregate_keycmp(&sorted[i], &sorted[i - 1]) == 0)
2030 nbundle[naggvars] = sorted[j];
[all …]
|
| /freebsd/usr.bin/col/ |
| H A D | col.c | 429 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()
|
| /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/sys/contrib/device-tree/Bindings/spi/ |
| H A D | spi-sprd.txt | 11 - clocks: List of clock input name strings sorted in the same order
20 sorted in the same order as the dma-names property.
|
| /freebsd/sys/contrib/openzfs/tests/test-runner/bin/ |
| H A D | zts-report.py.in | 479 for test in sorted(expected):
507 for test in sorted(known.keys()):
515 for test in sorted(unexpected):
|
| H A D | test-runner.py.in | 378 lines = sorted(self.result.stdout + self.result.stderr,
660 for key in sorted(self.tests.keys()):
663 for key in sorted(self.testgroups.keys()):
697 self.testgroups[dirname].tests = sorted(filenames)
732 files = ' '.join(sorted(failed))
804 for test in sorted(self.tests.keys()):
811 for testgroup in sorted(self.testgroups.keys()):
901 for test in sorted(self.tests.keys()):
903 for testgroup in sorted(self.testgroups.keys()):
1003 for p in sorted(options.pathnames):
[all …]
|
| /freebsd/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
| H A D | d_typefun.c | 8 int sorted; member
|
| /freebsd/contrib/kyua/ |
| H A D | AUTHORS | 6 # Names are sorted alphabetically and should be added to this file as:
|
| H A D | CONTRIBUTORS | 13 # Names are sorted by last name and should be added as:
|
| /freebsd/tests/sys/cddl/zfs/tests/txg_integrity/ |
| H A D | make_patterns.py | 18 partitions = sorted(
|
| /freebsd/lib/libc/iconv/ |
| H A D | bsd_iconv.c | 152 __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()
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | SSL_get_ciphers.pod | 31 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.
|