Searched refs:sorted (Results 1 - 25 of 42) sorted by relevance

12

/freebsd-current/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_typefun.c8 int sorted; member in struct:stack_st
/freebsd-current/bin/sh/
H A Dalias.c174 struct alias **sorted, *ap; local
177 sorted = ckmalloc(aliases * sizeof(*sorted));
182 sorted[j++] = ap;
183 qsort(sorted, aliases, sizeof(*sorted), comparealiases);
185 printalias(sorted[i]);
189 ckfree(sorted);
/freebsd-current/contrib/llvm-project/lld/COFF/
H A DCallGraphSort.cpp156 std::vector<int> sorted(clusters.size());
160 std::iota(sorted.begin(), sorted.end(), 0);
161 llvm::stable_sort(sorted, [&](int a, int b) {
165 for (int l : sorted) {
190 sorted.clear();
193 sorted.push_back(i);
194 llvm::stable_sort(sorted, [&](int a, int b) {
199 // Sections will be sorted by increasing order. Absent sections will have
202 for (int leader : sorted) {
[all...]
/freebsd-current/contrib/bmake/unit-tests/
H A Dvarmod-order-string.mk3 # 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 Dvarmod-order-reverse.mk3 # Tests for the :Or variable modifier, which returns the words, sorted in
H A Dvarmod-order-shuffle.mk38 sorted:= ${WORDS:Ox:O} macro
39 .if ${sorted} != ${WORDS:O}
40 . error ${sorted} != ${WORDS:O}
H A Dvarmod-order-numeric.mk3 # Tests for the variable modifiers ':On', which returns the words, sorted in
47 # Hexadecimal and octal numbers can be sorted as well.
/freebsd-current/tests/sys/cddl/zfs/tests/txg_integrity/
H A Dmake_patterns.py18 partitions = sorted(
/freebsd-current/contrib/cortex-strings/scripts/
H A Dbench.py53 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 Dlibplot.py36 return sorted(values, key=lambda x: '%-06d|%s' % (-prefer.find(x), x))
38 return sorted(values)
H A Dplot.py19 return sorted(set(getattr(x, name) for x in rows))
H A Dplot-sizes.py57 X = sorted(list(set([x.bytes for x in matches])))
/freebsd-current/contrib/llvm-project/lldb/source/Utility/
H A DTimer.cpp139 std::vector<Stats> sorted; local
146 sorted.push_back(stats);
149 if (sorted.empty())
153 llvm::sort(sorted, CategoryMapIteratorSortCriterion);
155 for (const auto &stats : sorted)
/freebsd-current/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp194 std::vector<int> sorted(clusters.size());
198 std::iota(sorted.begin(), sorted.end(), 0);
199 llvm::stable_sort(sorted, [&](int a, int b) {
203 for (int l : sorted) {
228 sorted.clear();
231 sorted.push_back(i);
232 llvm::stable_sort(sorted, [&](int a, int b) {
238 for (int leader : sorted) {
256 for (int leader : sorted)
[all...]
/freebsd-current/crypto/openssl/crypto/stack/
H A Dstack.c27 int sorted; member in struct:stack_st
38 sk->sorted = 0;
53 ret->sorted = 0;
92 ret->sorted = 0;
282 st->sorted = 0;
340 if (!st->sorted) {
343 st->sorted = 1; /* empty or single-element stack is considered sorted */
462 st->sorted = 0;
468 if (st != NULL && !st->sorted
[all...]
/freebsd-current/usr.bin/sort/
H A Dradixsort.c64 struct sort_list_item **sorted; member in struct:sort_level
76 /* stack of sort levels ready to be sorted */
344 sl->sorted[sl->start_position] = sl->tosort[0];
358 sl->sorted[sl->start_position++] = sl->tosort[1];
359 sl->sorted[sl->start_position] = sl->tosort[0];
361 sl->sorted[sl->start_position++] = sl->tosort[0];
362 sl->sorted[sl->start_position] = sl->tosort[1];
401 memcpy(sl->sorted + sl->start_position,
452 memcpy(sl->sorted + sl->start_position, sl->leaves,
468 slc->sorted
[all...]
/freebsd-current/contrib/llvm-project/lld/MachO/
H A DSectionPriorities.cpp162 // Cluster indices sorted by density.
163 std::vector<int> sorted(clusters.size());
168 std::iota(sorted.begin(), sorted.end(), 0);
170 llvm::stable_sort(sorted, [&](int a, int b) {
174 for (int l : sorted) {
199 sorted.clear();
202 sorted.push_back(i);
203 llvm::stable_sort(sorted, [&](int a, int b) {
209 // Sections will be sorted b
[all...]
/freebsd-current/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):
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pragma/
H A Dtst.temporal.ksh23 # temporal option causes output to be sorted
82 echo $tst: output is not sorted
/freebsd-current/usr.bin/gprof/
H A Dprintgprof.c405 arctype sorted; local
410 * then insertion sort back on to sorted's children.
412 * *detachedp the rest of the arcs to be sorted.
413 * sorted arc list onto which you insertion sort.
416 sorted.arc_childlist = 0;
422 * insert it into sorted
424 for ( prevp = &sorted ;
435 * reattach sorted children to parent
437 parentp -> children = sorted.arc_childlist;
445 arctype sorted; local
[all...]
/freebsd-current/usr.bin/col/
H A Dcol.c429 static CHAR *sorted; local
438 if ((sorted = realloc(sorted,
463 sorted[count[c->c_column]++] = *c;
464 c = sorted;
/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c1540 dt_ahashent_t *h, **sorted; local
1564 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1566 if (sorted == NULL)
1570 sorted[i++] = h;
1575 dt_aggregate_qsort(dtp, sorted, nentries,
1583 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1589 h = sorted[i];
1603 dt_free(dtp, sorted);
1683 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; local
1962 * allocate our sorted arra
[all...]
/freebsd-current/lib/libc/iconv/
H A Dbsd_iconv.c152 __bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted) argument
156 ret = _citrus_esdb_get_list(rlist, rsz, sorted);
H A Dcitrus_esdb.c257 _citrus_esdb_get_list(char ***rlist, size_t *rnum, bool sorted) argument
292 /* XXX: sorted? */
310 if (!sorted)
/freebsd-current/share/dtrace/
H A Dnfsclienttime31 * system call, and then generates a histogram of those times sorted by

Completed in 512 milliseconds

12