| /freebsd-10.0-release/contrib/libreadline/ |
| H A D | ansi_stdlib.h | 52 extern void qsort ();
|
| /freebsd-10.0-release/tools/regression/lib/libc/stdlib/ |
| H A D | Makefile | 3 TESTS= test-qsort \
|
| H A D | test-qsort.c | 28 * Test for qsort() routine.
53 /* Sort using qsort(3) */
54 qsort(testvector, j, sizeof(testvector[0]), sorthelp);
63 printf("ok 1 - qsort\n");
|
| /freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
| H A D | MachineModuleInfoImpls.cpp | 42 qsort(&List[0], List.size(), sizeof(List[0]), SortSymbolPair);
|
| /freebsd-10.0-release/lib/libc/stdlib/ |
| H A D | Makefile.inc | 11 merge.c ptsname.c qsort.c qsort_r.c quick_exit.c radixsort.c rand.c \
25 lsearch.3 memory.3 ptsname.3 qsort.3 \
40 MLINKS+=qsort.3 heapsort.3 qsort.3 mergesort.3 qsort.3 qsort_r.3
|
| H A D | Symbol.map | 53 qsort;
|
| /freebsd-10.0-release/share/examples/sunrpc/sort/ |
| H A D | sort_proc.c | 21 qsort(ssp->ss.ss_val, ssp->ss.ss_len, sizeof (char *), comparestrings);
|
| /freebsd-10.0-release/contrib/libstdc++/include/c_compatibility/ |
| H A D | stdlib.h | 56 using std::qsort;
|
| /freebsd-10.0-release/lib/libutil/ |
| H A D | kinfo_getallproc.c | 63 qsort(kipp, count, sizeof(*kipp), kinfo_proc_compare);
|
| /freebsd-10.0-release/usr.bin/users/ |
| H A D | users.c | 94 qsort(names, ncnt, sizeof(namebuf), scmp);
|
| /freebsd-10.0-release/contrib/libstdc++/include/c_std/ |
| H A D | std_cstdlib.h | 93 #undef qsort
129 using ::qsort;
|
| /freebsd-10.0-release/contrib/openbsm/bin/auditdistd/ |
| H A D | sandbox.c | 219 qsort(groups, (size_t)ngroups, sizeof(groups[0]), groups_compare);
220 qsort(ggroups, (size_t)ngroups, sizeof(ggroups[0]), groups_compare);
|
| /freebsd-10.0-release/contrib/ntp/util/ |
| H A D | hist.c | 82 qsort(
|
| /freebsd-10.0-release/contrib/tcsh/ |
| H A D | sh.types.h | 120 extern void qsort();
|
| /freebsd-10.0-release/usr.sbin/lastlogin/ |
| H A D | lastlogin.c | 129 qsort(ulist, ulistsize, sizeof(struct utmpx), utcmp);
|
| /freebsd-10.0-release/contrib/binutils/libiberty/ |
| H A D | partition.c | 121 pointer to each. Used to qsort such an array. */
171 qsort ((void *) class_elements, count, sizeof (int), elem_compare);
|
| /freebsd-10.0-release/contrib/gcclibs/libiberty/ |
| H A D | partition.c | 121 pointer to each. Used to qsort such an array. */
171 qsort ((void *) class_elements, count, sizeof (int), elem_compare);
|
| /freebsd-10.0-release/contrib/subversion/subversion/libsvn_client/ |
| H A D | resolved.c | 64 qsort(array->elts, array->nelts, array->elt_size,
|
| /freebsd-10.0-release/kerberos5/lib/libroken/ |
| H A D | Makefile | 56 qsort.c \
|
| /freebsd-10.0-release/usr.bin/procstat/ |
| H A D | procstat_kstack.c | 123 qsort(kkstp, count, sizeof(*kkstp), kinfo_kstack_compare);
|
| /freebsd-10.0-release/usr.sbin/mptutil/ |
| H A D | mpt_evt.c | 144 qsort(entries, num_events, sizeof(MPI_LOG_0_ENTRY *), event_compare);
|
| /freebsd-10.0-release/usr.sbin/nscd/ |
| H A D | agent.c | 86 qsort(new_agents, new_agents_num, sizeof(struct agent *),
|
| /freebsd-10.0-release/cddl/contrib/opensolaris/cmd/lockstat/ |
| H A D | sym.c | 240 qsort(symbol_table, nsyms, sizeof (syment_t), symcmp);
249 qsort(symbol_table, nsyms, sizeof (syment_t), symcmp);
|
| /freebsd-10.0-release/contrib/gdb/gdb/ |
| H A D | bcache.c | 360 qsort (chain_length, c->num_buckets, sizeof (chain_length[0]),
362 qsort (entry_size, c->unique_count, sizeof (entry_size[0]),
|
| /freebsd-10.0-release/contrib/llvm/include/llvm/ADT/ |
| H A D | STLExtras.h | 21 #include <cstdlib> // for qsort
259 /// extent. This is just like std::sort, except that it calls qsort instead of
260 /// using an inlined template. qsort is slightly slower than std::sort, but
276 qsort(&*Start, End-Start, sizeof(*Start),
285 qsort(&*Start, End-Start, sizeof(*Start), Compare);
|