| /freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
| HD | CallGraphSort.cpp | 183 std::vector<int> sorted(clusters.size()); in run() local 187 std::iota(sorted.begin(), sorted.end(), 0); in run() 188 llvm::stable_sort(sorted, [&](int a, int b) { in run() 192 for (int l : sorted) { in run() 217 sorted.clear(); in run() 220 sorted.push_back(i); in run() 221 llvm::stable_sort(sorted, [&](int a, int b) { in run() 227 for (int leader : sorted) in run() 245 for (int leader : sorted) in run()
|
| /freebsd-11-stable/bin/sh/ |
| HD | alias.c | 183 struct alias **sorted, *ap; in printaliases() local 186 sorted = ckmalloc(aliases * sizeof(*sorted)); in printaliases() 191 sorted[j++] = ap; in printaliases() 192 qsort(sorted, aliases, sizeof(*sorted), comparealiases); in printaliases() 194 printalias(sorted[i]); in printaliases() 198 ckfree(sorted); in printaliases()
|
| /freebsd-11-stable/usr.bin/sort/ |
| HD | radixsort.c | 66 struct sort_list_item **sorted; member 332 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next() 338 sl->sorted[sl->start_position++] = sl->tosort[1]; in run_sort_level_next() 339 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next() 341 sl->sorted[sl->start_position++] = sl->tosort[0]; in run_sort_level_next() 342 sl->sorted[sl->start_position] = sl->tosort[1]; in run_sort_level_next() 375 memcpy(sl->sorted + sl->start_position, in run_sort_level_next() 427 memcpy(sl->sorted + sl->start_position, sl->leaves, in run_sort_level_next() 443 slc->sorted = sl->sorted; in run_sort_level_next() 464 slc->sorted = sl->sorted; in run_sort_level_next() [all …]
|
| /freebsd-11-stable/crypto/openssl/crypto/stack/ |
| HD | stack.c | 86 sk->sorted = 0; in sk_set_cmp_func() 108 ret->sorted = sk->sorted; in sk_dup() 127 ret->sorted = sk->sorted; in sk_deep_copy() 171 ret->sorted = 0; in sk_new() 211 st->sorted = 0; in sk_insert() 363 if (st && !st->sorted && st->comp != NULL) { in sk_sort() 375 st->sorted = 1; in sk_sort() 383 return st->sorted; in sk_is_sorted()
|
| HD | stack.h | 69 int sorted; member
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
| HD | Timer.cpp | 130 std::vector<Stats> sorted; in DumpCategoryTimes() local 137 sorted.push_back(stats); in DumpCategoryTimes() 140 if (sorted.empty()) in DumpCategoryTimes() 144 llvm::sort(sorted.begin(), sorted.end(), CategoryMapIteratorSortCriterion); in DumpCategoryTimes() 146 for (const auto &stats : sorted) in DumpCategoryTimes()
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/ |
| HD | list.c | 186 apr_array_header_t *sorted; in do_list() local 198 sorted = apr_array_make(scratch_pool, apr_hash_count(entries), in do_list() 217 APR_ARRAY_PUSH(sorted, filtered_dirent_t) = filtered; in do_list() 220 svn_sort__array(sorted, compare_filtered_dirent); in do_list() 224 for (i = 0; i < sorted->nelts; ++i) in do_list() 232 filtered = &APR_ARRAY_IDX(sorted, i, filtered_dirent_t); in do_list()
|
| /freebsd-11-stable/cddl/contrib/opensolaris/lib/pyzfs/common/ |
| HD | 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-11-stable/contrib/llvm-project/llvm/include/llvm/TextAPI/MachO/ |
| HD | 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.
|
| /freebsd-11-stable/usr.bin/gprof/ |
| HD | printgprof.c | 411 arctype sorted; in sortchildren() local 422 sorted.arc_childlist = 0; in sortchildren() 430 for ( prevp = &sorted ; in sortchildren() 443 parentp -> children = sorted.arc_childlist; in sortchildren() 451 arctype sorted; in sortparents() local 462 sorted.arc_parentlist = 0; in sortparents() 470 for ( prevp = &sorted ; in sortparents() 483 childp -> parents = sorted.arc_parentlist; in sortparents()
|
| /freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
| HD | dt_aggregate.c | 1534 dt_ahashent_t *h, **sorted; local 1558 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *)); 1560 if (sorted == NULL) 1564 sorted[i++] = h; 1569 dt_aggregate_qsort(dtp, sorted, nentries, 1577 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc); 1583 h = sorted[i]; 1597 dt_free(dtp, sorted); 1677 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; local 1959 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *)); [all …]
|
| /freebsd-11-stable/contrib/binutils/ld/ |
| HD | ldgram.y | 429 $$.sorted = none; 435 $$.sorted = none; 441 $$.sorted = by_name; 447 $$.sorted = by_alignment; 453 $$.sorted = by_name_alignment; 459 $$.sorted = by_name; 465 $$.sorted = by_alignment_name; 471 $$.sorted = by_alignment; 477 $$.sorted = by_name; 528 tmp.sorted = none;
|
| HD | mri.c | 216 tmp->spec.sorted = none; in mri_draw_tree() 227 tmp->spec.sorted = none; in mri_draw_tree()
|
| /freebsd-11-stable/contrib/subversion/ |
| HD | gen-make.py | 73 sorted_targets = sorted(target_dict.keys(), key=str) 79 gen_keys = sorted(generator.__dict__.keys()) 110 items = sorted(gen_modules.items())
|
| /freebsd-11-stable/usr.bin/col/ |
| HD | col.c | 436 static CHAR *sorted; in flush_line() local 445 if ((sorted = realloc(sorted, in flush_line() 470 sorted[count[c->c_column]++] = *c; in flush_line() 471 c = sorted; in flush_line()
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
| HD | sorts.c | 155 svn_boolean_t sorted; in svn_sort__hash() local 162 sorted = TRUE; in svn_sort__hash() 176 if (sorted) in svn_sort__hash() 178 sorted = (comparison_func(prev_item, item) < 0); in svn_sort__hash() 184 if (!sorted) in svn_sort__hash()
|
| HD | mergeinfo.c | 294 svn_boolean_t sorted = FALSE; in combine_with_lastrange() local 306 sorted = (svn_sort_compare_ranges(&lastrange, in combine_with_lastrange() 314 sorted = TRUE; in combine_with_lastrange() 322 sorted = (svn_sort_compare_ranges(&lastrange, in combine_with_lastrange() 358 sorted = (svn_sort_compare_ranges(&lastrange, in combine_with_lastrange() 361 if (sorted) in combine_with_lastrange() 362 sorted = (svn_sort_compare_ranges(&r1, &r2) < 0); in combine_with_lastrange() 427 sorted = (svn_sort_compare_ranges(&lastrange, &r1) < 0); in combine_with_lastrange() 431 if (sorted) in combine_with_lastrange() 432 sorted = (svn_sort_compare_ranges(&r1, &r2) < 0); in combine_with_lastrange() [all …]
|
| /freebsd-11-stable/share/misc/ |
| HD | organization.dot | 26 # Development teams go here alphabetically sorted 42 # Admin teams go here alphabetically sorted 55 # Misc hats go here alphabetically sorted 63 # Keep the list sorted by the superior team entry.
|
| HD | committers-doc.dot | 30 # Alumni go here. Try to keep things sorted. 51 # Current doc committers go here. Try to keep things sorted. 98 # Keep the list sorted by mentor login.
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/ |
| HD | path_driver.c | 168 apr_array_header_t *sorted = apr_array_copy(subpool, relpaths); in svn_delta_path_driver3() local 169 svn_sort__array(sorted, svn_sort_compare_paths); in svn_delta_path_driver3() 170 relpaths = sorted; in svn_delta_path_driver3()
|
| /freebsd-11-stable/crypto/openssl/doc/ssl/ |
| HD | SSL_get_ciphers.pod | 21 sorted by preference. If B<ssl> is NULL or no ciphers are available, NULL 48 sorted list of available ciphers, until NULL is returned.
|
| /freebsd-11-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
| HD | d_typefun.c | 8 int sorted; member
|
| /freebsd-11-stable/lib/libc/iconv/ |
| HD | bsd_iconv.c | 168 __bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted) in __bsd___iconv_get_list() argument 172 ret = _citrus_esdb_get_list(rlist, rsz, sorted); in __bsd___iconv_get_list()
|
| /freebsd-11-stable/contrib/ntp/ntpq/ |
| HD | ntpq-subs.c | 3165 mru **sorted; in mrulist() local 3243 sorted = eallocarray(mru_count, sizeof(*sorted)); in mrulist() 3244 ppentry = sorted; in mrulist() 3247 INSIST(ppentry < sorted + mru_count); in mrulist() 3253 INSIST(ppentry < sorted + mru_count); in mrulist() 3259 if (ppentry - sorted != (int)mru_count) { in mrulist() 3262 mru_count, (long)(ppentry - sorted)); in mrulist() 3263 free(sorted); in mrulist() 3269 qsort(sorted, mru_count, sizeof(sorted[0]), in mrulist() 3276 for (ppentry = sorted; ppentry < sorted + mru_count; ppentry++) { in mrulist() [all …]
|
| /freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pragma/ |
| HD | tst.temporal.ksh | 82 echo $tst: output is not sorted
|