/freebsd-11-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
H A D | d_typefun.c | 8 int sorted; member in struct:stack_st
|
/freebsd-11-stable/bin/sh/ |
H A D | alias.c | 183 struct alias **sorted, *ap; local 186 sorted = ckmalloc(aliases * sizeof(*sorted)); 191 sorted[j++] = ap; 192 qsort(sorted, aliases, sizeof(*sorted), comparealiases); 194 printalias(sorted[i]); 198 ckfree(sorted);
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | CallGraphSort.cpp | 183 std::vector<int> sorted(clusters.size()); 187 std::iota(sorted.begin(), sorted.end(), 0); 188 llvm::stable_sort(sorted, [&](int a, int b) { 192 for (int l : sorted) { 217 sorted.clear(); 220 sorted.push_back(i); 221 llvm::stable_sort(sorted, [&](int a, int b) { 227 for (int leader : sorted) 245 for (int leader : sorted) [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | Timer.cpp | 130 std::vector<Stats> sorted; local 137 sorted.push_back(stats); 140 if (sorted.empty()) 144 llvm::sort(sorted.begin(), sorted.end(), CategoryMapIteratorSortCriterion); 146 for (const auto &stats : sorted)
|
/freebsd-11-stable/crypto/openssl/crypto/stack/ |
H A D | stack.c | 86 sk->sorted = 0; 108 ret->sorted = sk->sorted; 127 ret->sorted = sk->sorted; 171 ret->sorted = 0; 211 st->sorted = 0; 363 if (st && !st->sorted && st->comp != NULL) { 375 st->sorted = 1; 383 return st->sorted; [all...] |
H A D | stack.h | 69 int sorted; member in struct:stack_st
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/ |
H A D | list.c | 187 apr_array_header_t *sorted; 199 sorted = apr_array_make(scratch_pool, apr_hash_count(entries), 218 APR_ARRAY_PUSH(sorted, filtered_dirent_t) = filtered; 221 svn_sort__array(sorted, compare_filtered_dirent); 225 for (i = 0; i < sorted->nelts; ++i) 233 filtered = &APR_ARRAY_IDX(sorted, i, filtered_dirent_t); 186 apr_array_header_t *sorted; local
|
/freebsd-11-stable/usr.bin/sort/ |
H A D | radixsort.c | 66 struct sort_list_item **sorted; member in struct:sort_level 78 /* stack of sort levels ready to be sorted */ 332 sl->sorted[sl->start_position] = sl->tosort[0]; 338 sl->sorted[sl->start_position++] = sl->tosort[1]; 339 sl->sorted[sl->start_position] = sl->tosort[0]; 341 sl->sorted[sl->start_position++] = sl->tosort[0]; 342 sl->sorted[sl->start_position] = sl->tosort[1]; 375 memcpy(sl->sorted + sl->start_position, 427 memcpy(sl->sorted + sl->start_position, sl->leaves, 443 slc->sorted [all...] |
/freebsd-11-stable/contrib/subversion/ |
H A D | 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/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-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pragma/ |
H A D | tst.temporal.ksh | 23 # temporal option causes output to be sorted 82 echo $tst: output is not sorted
|
/freebsd-11-stable/usr.bin/gprof/ |
H A D | printgprof.c | 411 arctype sorted; local 416 * then insertion sort back on to sorted's children. 418 * *detachedp the rest of the arcs to be sorted. 419 * sorted arc list onto which you insertion sort. 422 sorted.arc_childlist = 0; 428 * insert it into sorted 430 for ( prevp = &sorted ; 441 * reattach sorted children to parent 443 parentp -> children = sorted.arc_childlist; 451 arctype sorted; local [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | unwind-dw2-fde.h | 59 unsigned long sorted : 1; member in struct:object::__anon1393::__anon1394
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/ |
H A D | path_driver.c | 170 apr_array_header_t *sorted = apr_array_copy(subpool, relpaths); 171 svn_sort__array(sorted, svn_sort_compare_paths); 172 relpaths = sorted; 168 apr_array_header_t *sorted = apr_array_copy(subpool, relpaths); local
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | 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 1956 * allocate our sorted arra [all...] |
/freebsd-11-stable/usr.bin/col/ |
H A D | col.c | 436 static CHAR *sorted; local 445 if ((sorted = realloc(sorted, 470 sorted[count[c->c_column]++] = *c; 471 c = sorted;
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | sorts.c | 52 an "ordered list" of some kind -- in this case, a nicely sorted 157 svn_boolean_t sorted; 164 sorted = TRUE; 178 if (sorted) 180 sorted = (comparison_func(prev_item, item) < 0); 185 /* quicksort the array if it isn't already sorted. */ 186 if (!sorted) 197 The array must already be sorted in the ordering defined by COMPARE_FUNC. 155 svn_boolean_t sorted; local
|
H A D | mergeinfo.c | 294 svn_boolean_t sorted = FALSE; local 306 sorted = (svn_sort_compare_ranges(&lastrange, 314 sorted = TRUE; 322 sorted = (svn_sort_compare_ranges(&lastrange, 358 sorted = (svn_sort_compare_ranges(&lastrange, 361 if (sorted) 362 sorted = (svn_sort_compare_ranges(&r1, &r2) < 0); 427 sorted = (svn_sort_compare_ranges(&lastrange, &r1) < 0); 431 if (sorted) 432 sorted 1910 apr_array_header_t *sorted = local [all...] |
/freebsd-11-stable/contrib/binutils/ld/ |
H A D | 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 [all...] |
H A D | mri.c | 216 tmp->spec.sorted = none; 227 tmp->spec.sorted = none;
|
H A D | ld.h | 113 sort_type sorted; member in struct:wildcard_spec
|
/freebsd-11-stable/lib/libc/iconv/ |
H A D | bsd_iconv.c | 168 __bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted) argument 172 ret = _citrus_esdb_get_list(rlist, rsz, sorted);
|
H A D | citrus_esdb.c | 257 _citrus_esdb_get_list(char ***rlist, size_t *rnum, bool sorted) argument 292 /* XXX: sorted? */ 310 if (!sorted)
|
/freebsd-11-stable/share/dtrace/ |
H A D | nfsclienttime | 33 * system call, and then generates a histogram of those times sorted by
|
/freebsd-11-stable/contrib/subversion/subversion/svnfsfs/ |
H A D | stats-cmd.c | 188 apr_array_header_t *sorted local 192 int count = MIN(sorted->nelts, 16); 199 = APR_ARRAY_IDX(sorted, i, svn_sort__item_t).value;
|