/freebsd-10.1-release/crypto/heimdal/lib/roken/ |
H A D | roken.h.in | 1106 #define qsort rk_qsort
|
/freebsd-10.1-release/sys/sparc64/sparc64/ |
H A D | pmap.c | 349 qsort(mra, sz, sizeof (*mra), mr_cmp); 620 qsort(translations, sz, sizeof (*translations), om_cmp);
|
/freebsd-10.1-release/contrib/tzcode/zic/ |
H A D | zic.c | 734 (void) qsort((void *) rules, (size_t) nrules, 1464 (void) qsort((void *) attypes, (size_t) timecnt,
|
/freebsd-10.1-release/contrib/ntp/ntpq/ |
H A D | ntpq.c | 2267 qsort((void *)list, words, sizeof(list[0]), helpsort); 2304 * helpsort - do hostname qsort comparisons 3489 qsort(assoc_cache, (size_t)numassoc,
|
/freebsd-10.1-release/contrib/binutils/bfd/ |
H A D | bout.c | 450 qsort (outsyms, (size_t) (q - outsyms), sizeof (asymbol*),
|
H A D | elf-eh-frame.c | 1584 qsort (hdr_info->array, hdr_info->fde_count, sizeof (*hdr_info->array),
|
H A D | elf32-spu.c | 579 /* qsort predicate to sort sections by vma. */ 626 qsort (alloc_sec, n, sizeof (*alloc_sec), sort_sections); 817 /* qsort predicate to sort stubs by overlay number. */ 1099 qsort (stubs.sh, stubs.count, sizeof (*stubs.sh), sort_stubs); 1547 /* qsort predicate to sort symbols by section and value. */ 2175 qsort (psyms, symcount, sizeof (*psyms), sort_syms);
|
/freebsd-10.1-release/contrib/dialog/ |
H A D | dialog.c | 1312 qsort(opts, limit, sizeof(Options *), compare_opts);
|
/freebsd-10.1-release/contrib/gcc/ |
H A D | cfgexpand.c | 345 /* A subroutine of partition_stack_vars. A comparison function for qsort, 432 qsort (stack_vars_sorted, n, sizeof (size_t), stack_var_size_cmp); 1047 /* ??? We could probably integrate this into the qsort we did
|
H A D | dbxout.c | 2406 /* This is a qsort callback which sorts types and declarations into a 2449 qsort (VEC_address (tree, types), VEC_length (tree, types),
|
H A D | tree-eh.c | 359 /* Comparison function for qsort/bsearch. We're interested in 1390 qsort (this_tf.goto_queue, this_tf.goto_queue_active,
|
H A D | tree-into-ssa.c | 795 for qsort. */ 895 qsort (defs, adef, sizeof (struct dom_dfsnum), cmp_dfsnum);
|
H A D | tree-ssa-live.c | 1259 /* Comparison function to allow qsort to sort P1 and P2 in descending order. */ 1297 /* Only call qsort if there are more than 2 items. */ 1307 qsort (list, count, sizeof (partition_pair_p), compare_pairs);
|
H A D | tree-ssa-operands.c | 159 /* Comparison function for qsort used in operand_build_sort_virtual. */ 202 /* There are 3 or more elements, call qsort. */ 203 qsort (VEC_address (tree, list),
|
/freebsd-10.1-release/contrib/gcclibs/libcpp/ |
H A D | files.c | 1522 /* A qsort ordering function for pchf_entry structures. */ 1591 qsort (result->entries, result->count, sizeof (struct pchf_entry),
|
/freebsd-10.1-release/contrib/ldns/ |
H A D | dnssec.c | 1667 qsort(unsorted->_rrs,
|
/freebsd-10.1-release/contrib/llvm/lib/Support/ |
H A D | CommandLine.cpp | 1407 qsort(Opts.data(), Opts.size(), sizeof(Opts[0]), OptNameCompare);
|
/freebsd-10.1-release/contrib/subversion/subversion/libsvn_repos/ |
H A D | replay.c | 1572 qsort(paths->elts, paths->nelts, paths->elt_size, svn_sort_compare_paths);
|
/freebsd-10.1-release/lib/libedit/ |
H A D | readline.c | 2130 qsort(&list[1], len - 1, sizeof(*list),
|
/freebsd-10.1-release/usr.bin/sort/ |
H A D | file.c | 1256 * Wrapper for qsort 1262 qsort(list, count, elem_size, cmp_func);
|
/freebsd-10.1-release/usr.sbin/nscd/ |
H A D | cachelib.c | 639 qsort(the_cache->entries, the_cache->entries_size,
|
/freebsd-10.1-release/contrib/ntp/ntpd/ |
H A D | refclock_msfees.c | 1282 qsort(coffs, (size_t)samples, sizeof(coffs[0]), offcompare);
|
/freebsd-10.1-release/contrib/ntp/ntpdc/ |
H A D | ntpdc.c | 1534 qsort((void *)list, words, sizeof(list[0]), helpsort); 1571 * helpsort - do hostname qsort comparisons
|
/freebsd-10.1-release/contrib/gcc/cp/ |
H A D | class.c | 1717 qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree), 1758 qsort (VEC_address (tree, method_vec) + slot, 5134 qsort (field_vec->elts, n_fields, sizeof (tree),
|
/freebsd-10.1-release/contrib/gdb/gdb/ |
H A D | tracepoint.c | 1082 /* compare memranges for qsort */ 1109 /* Sort the memrange list using qsort, and merge adjacent memranges */ 1115 qsort (memranges->list, memranges->next_memrange,
|