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

12

/freebsd-10.0-release/bin/sh/
H A Dalias.c225 struct alias **sorted, *ap; local
227 sorted = ckmalloc(aliases * sizeof(*sorted));
232 sorted[j++] = ap;
233 qsort(sorted, aliases, sizeof(*sorted), comparealiases);
235 printalias(sorted[i]);
236 ckfree(sorted);
/freebsd-10.0-release/crypto/openssl/crypto/stack/
H A Dstack.c86 sk->sorted=0;
105 ret->sorted=sk->sorted;
134 ret->sorted=0;
176 st->sorted=0;
314 if (st && !st->sorted)
325 st->sorted=1;
333 return st->sorted;
H A Dstack.h70 int sorted; member in struct:stack_st
/freebsd-10.0-release/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 */
315 sl->sorted[sl->start_position] = sl->tosort[0];
321 sl->sorted[sl->start_position++] = sl->tosort[1];
322 sl->sorted[sl->start_position] = sl->tosort[0];
324 sl->sorted[sl->start_position++] = sl->tosort[0];
325 sl->sorted[sl->start_position] = sl->tosort[1];
358 memcpy(sl->sorted + sl->start_position,
410 memcpy(sl->sorted + sl->start_position, sl->leaves,
426 slc->sorted
[all...]
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_delta/
H A Dpath_driver.c161 apr_array_header_t *sorted = apr_array_copy(subpool, paths);
162 qsort(sorted->elts, sorted->nelts, sorted->elt_size,
164 paths = sorted;
159 apr_array_header_t *sorted = apr_array_copy(subpool, paths); local
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_subr/
H A Dsorts.c49 an "ordered list" of some kind -- in this case, a nicely sorted
146 svn_boolean_t sorted;
153 sorted = TRUE;
167 if (sorted)
169 sorted = (comparison_func(prev_item, item) < 0);
174 /* quicksort the array if it isn't already sorted. */
175 if (!sorted)
186 The array must already be sorted in the ordering defined by COMPARE_FUNC.
144 svn_boolean_t sorted; local
H A Dmergeinfo.c297 svn_boolean_t sorted = FALSE; local
309 sorted = (svn_sort_compare_ranges(&lastrange,
317 sorted = TRUE;
325 sorted = (svn_sort_compare_ranges(&lastrange,
361 sorted = (svn_sort_compare_ranges(&lastrange,
364 if (sorted)
365 sorted = (svn_sort_compare_ranges(&r1, &r2) < 0);
430 sorted = (svn_sort_compare_ranges(&lastrange, &r1) < 0);
434 if (sorted)
435 sorted
1926 apr_array_header_t *sorted = local
[all...]
/freebsd-10.0-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-10.0-release/cddl/contrib/opensolaris/lib/pyzfs/common/
H A Dallow.py110 for (nwho, perms) in sorted(d.items()):
116 (nwho[1:], ",".join(sorted(perms)))
126 s += "\t%s\n" % ",".join(sorted(self.create))
259 for (name, note) in sorted(perms_subcmd.iteritems()):
262 for (name, note) in sorted(perms_other.iteritems()):
265 for (name, prop) in sorted(zfs.dataset.proptable.iteritems()):
331 for fs in sorted(p.keys(), reverse=True):
/freebsd-10.0-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-10.0-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-10.0-release/contrib/subversion/
H A Dgen-make.py76 gen_keys = sorted(generator.__dict__.keys())
107 items = sorted(gen_modules.items())
/freebsd-10.0-release/usr.bin/gprof/
H A Dprintgprof.c411 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-10.0-release/contrib/gcc/
H A Dunwind-dw2-fde.h59 unsigned long sorted : 1; member in struct:object::__anon1119::__anon1120
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-10.0-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-10.0-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-10.0-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 Dbsd_iconv.c167 __bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted) argument
171 ret = _citrus_esdb_get_list(rlist, rsz, sorted);
/freebsd-10.0-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-10.0-release/cddl/contrib/opensolaris/lib/libuutil/common/
H A Duu_list.c317 int sorted = lp->ul_sorted; local
336 if (sorted && cmp > 0) {
/freebsd-10.0-release/contrib/llvm/lib/ExecutionEngine/JIT/
H A DJIT.cpp124 unsigned long sorted : 1; member in struct:__anon2259::LibgccObject::__anon2260::__anon2261

Completed in 155 milliseconds

12