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

12

/freebsd-9.3-release/bin/sh/
H A Dalias.c225 struct alias **sorted, *ap; local
228 sorted = ckmalloc(aliases * sizeof(*sorted));
233 sorted[j++] = ap;
234 qsort(sorted, aliases, sizeof(*sorted), comparealiases);
236 printalias(sorted[i]);
240 ckfree(sorted);
/freebsd-9.3-release/crypto/openssl/crypto/stack/
H A Dstack.c87 sk->sorted = 0;
109 ret->sorted = sk->sorted;
139 ret->sorted = 0;
180 st->sorted = 0;
342 if (st && !st->sorted) {
354 st->sorted = 1;
362 return st->sorted;
H A Dstack.h69 int sorted; member in struct:stack_st
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Drdataset.c329 struct towire_sort *sorted = NULL, sorted_fixed[MAX_SHUFFLE]; local
376 sorted = isc_mem_get(cctx->mctx, count * sizeof(*sorted));
377 if (shuffled == NULL || sorted == NULL)
381 sorted = sorted_fixed;
409 sorted[i].key = (*order)(&shuffled[i],
411 sorted[i].rdata = &shuffled[i];
427 sorted[i].key = (*order)(&shuffled[i],
430 sorted[i].key = 0; /* Unused */
431 sorted[
[all...]
H A Dgen.c170 unsigned int sorted; member in struct:ttnam
369 ttn->sorted = 0;
740 if (ttn->sorted != 0)
759 ttn2->sorted = 1;
H A Dmasterdump.c876 dns_rdataset_t *sorted[MAXSORT]; local
897 sorted[i] = &rdatasets[i];
902 qsort(sorted, n, sizeof(sorted[0]), dump_order_compare);
905 dns_rdataset_t *rds = sorted[i];
936 * If we got more data than could be sorted at once,
/freebsd-9.3-release/contrib/llvm/tools/clang/utils/TableGen/
H A DClangSACheckersEmitter.cpp268 std::map<int, const Record *> sorted; local
271 sorted[(*I)->getID()] = *I;
274 I = sorted.begin(), E = sorted.end(); I != E; ++I)
283 std::map<int, const Record *> sorted; local
286 sorted[(*I)->getID()] = *I;
289 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
/freebsd-9.3-release/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-9.3-release/usr.bin/col/
H A Dcol.c402 static CHAR *sorted; local
411 if ((sorted = realloc(sorted,
436 sorted[count[c->c_column]++] = *c;
437 c = sorted;
/freebsd-9.3-release/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-9.3-release/usr.bin/gprof/
H A Dprintgprof.c414 arctype sorted; local
419 * then insertion sort back on to sorted's children.
421 * *detachedp the rest of the arcs to be sorted.
422 * sorted arc list onto which you insertion sort.
425 sorted.arc_childlist = 0;
431 * insert it into sorted
433 for ( prevp = &sorted ;
444 * reattach sorted children to parent
446 parentp -> children = sorted.arc_childlist;
455 arctype sorted; local
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dunwind-dw2-fde.h59 unsigned long sorted : 1; member in struct:object::__anon1231::__anon1232
H A Dunwind-dw2-fde.c47 it's pc_begin and count fields initialized at minimum, and is sorted
195 if ((*p)->s.b.sorted)
536 /* Merge V1 and V2, both sorted, and put the result into V1. */
713 /* Set up a sorted array of pointers to FDEs for a loaded object. We
716 allocate a sorted fde array on a previous occasion. */
765 ob->s.b.sorted = 1;
932 /* If the data hasn't been sorted, try to do this now. We may have
934 if (! ob->s.b.sorted)
945 if (ob->s.b.sorted)
983 containing the pc. Note that pc_begin is sorted descendin
[all...]
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c1309 dt_ahashent_t *h, **sorted; local
1316 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1318 if (sorted == NULL)
1322 sorted[i++] = h;
1327 dt_aggregate_qsort(dtp, sorted, nentries,
1335 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1341 h = sorted[i];
1344 dt_free(dtp, sorted);
1349 dt_free(dtp, sorted);
1429 dt_ahashent_t *h, **sorted local
[all...]
/freebsd-9.3-release/contrib/binutils/ld/
H A Dldgram.y429 $$.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 Dmri.c216 tmp->spec.sorted = none;
227 tmp->spec.sorted = none;
H A Dld.h113 sort_type sorted; member in struct:wildcard_spec
H A Dldlang.c373 && (sec == NULL || sec->spec.sorted == none))
384 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
418 /* Convert a sorted sections' BST back to list form. */
2150 && (sec == NULL || sec->spec.sorted == none))
2172 dlltool assumes that files will be sorted by the name of
2220 /* Here either the files are not sorted by name, or we are
2223 if (sec != NULL && sec->spec.sorted != none)
2224 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2554 && s->handler_data[0]->spec.sorted == by_name
3171 switch (sec->spec.sorted)
[all...]
/freebsd-9.3-release/lib/libc/iconv/
H A Dcitrus_esdb.c257 _citrus_esdb_get_list(char ***rlist, size_t *rnum, bool sorted) argument
294 if (sorted)
318 if (!sorted)
H A Diconv.c187 __iconv_get_list(char ***rlist, size_t *rsz, bool sorted) argument
191 ret = _citrus_esdb_get_list(rlist, rsz, sorted);
/freebsd-9.3-release/contrib/ntp/ntpq/
H A Dntpq-subs.c2915 * All IPv4 addresses sort before any IPv6, addresses are sorted by
3095 mru **sorted; local
3173 sorted = eallocarray(mru_count, sizeof(*sorted));
3174 ppentry = sorted;
3177 INSIST(ppentry < sorted + mru_count);
3183 INSIST(ppentry < sorted + mru_count);
3189 if (ppentry - sorted != (int)mru_count) {
3192 mru_count, (long)(ppentry - sorted));
3193 free(sorted);
[all...]
/freebsd-9.3-release/sys/geom/journal/
H A Dg_journal.c793 * It keeps the queue sorted by offset and ensures that there are no doubled
1036 /* Be sure that bios queue is sorted. */
1477 g_journal_read_find(struct bio *head, int sorted, struct bio *pbp, off_t ostart, argument
1491 if (!sorted)
1572 u_int i, sorted = 0; local
1583 sorted = 0;
1587 sorted = 1;
1591 sorted = 0;
1595 sorted = 1;
1602 sorted
[all...]
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libuutil/common/
H A Duu_list.c317 int sorted = lp->ul_sorted; local
336 if (sorted && cmp > 0) {
/freebsd-9.3-release/usr.sbin/freebsd-update/
H A Dfreebsd-update.sh1461 # sorted by device and inode number.
3070 sort -k 1,1 -t '|' $1.noflags > $1.sorted
3075 join -t '|' $1.sorted - > INDEX-NOTMATCHING
3168 rm $1 $1.noflags $1.sorted $2 INDEX-NOTMATCHING
/freebsd-9.3-release/contrib/ipfilter/perl/
H A Dplog132 # they are sorted last.
472 # high ports get sorted behind all others.
793 # port number, so that high ports get sorted last.
1017 sorted by IP address. For each address, all packets originating at the address

Completed in 314 milliseconds

12