HomeSort by: relevance | last modified time | path
    Searched refs:qsort (Results 1 - 25 of 858) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/gdb/dist/readline/readline/
ansi_stdlib.h 52 extern void qsort ();
  /src/external/gpl3/gdb.old/dist/readline/readline/
ansi_stdlib.h 52 extern void qsort ();
  /src/external/cddl/osnet/sys/util/
qsort.h 1 /* $NetBSD: qsort.h,v 1.1 2009/08/07 20:57:58 haad Exp $ */
33 qsort(void *base, size_t nmemb, size_t size, function
  /src/external/mit/libcbor/dist/examples/
sort.c 36 qsort(cbor_array_handle(array), cbor_array_size(array), sizeof(cbor_item_t *),
  /src/external/gpl3/gcc/dist/libquadmath/math/
x2y2m1q.c 34 and Q for qsort. */
61 qsort (vals, 5, sizeof (__float128), compare);
68 qsort (vals + i + 1, 4 - i, sizeof (__float128), compare);
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
x2y2m1q.c 34 and Q for qsort. */
61 qsort (vals, 5, sizeof (__float128), compare);
68 qsort (vals + i + 1, 4 - i, sizeof (__float128), compare);
  /src/external/gpl2/gmake/dist/w32/subproc/
misc.c 65 qsort((void *) tmp, (size_t) arrcnt, sizeof (char*), compare);
  /src/usr.bin/sortinfo/
sortinfo.c 157 qsort(slist, nsections, sizeof(*slist), compsection);
160 qsort(s->lines, s->nlines, sizeof(*s->lines), strptrcmp);
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/
qsort.d 2 * This is a public domain version of qsort.d. All it does is call C's
3 * qsort().
9 module core.internal.qsort;
11 //debug=qsort;
128 qsort(a.ptr, a.length, ti.tsize, &cmp);
135 debug(qsort) printf("array.sort.unittest()\n");
162 debug(qsort) printf("struct.sort.unittest()\n");
  /src/lib/libc/stdlib/
Makefile.inc 13 nrand48.c putenv.c qabs.c qdiv.c qsort.c posix_openpt.c pty.c \
58 qabs.3 qdiv.3 quick_exit.3 qsort.3 \
91 MLINKS+=qsort.3 heapsort.3 qsort.3 mergesort.3
92 MLINKS+=qsort.3 heapsort_r.3
93 MLINKS+=qsort.3 mergesort_r.3
94 MLINKS+=qsort.3 qsort_r.3
  /src/crypto/external/apache2/openssl/dist/providers/implementations/encode_decode/
ml_common_codecs.c 25 * as required by qsort(3). When overflow or underflow is possible, the
89 qsort(ret, NUM_PKCS8_FORMATS, sizeof(*ret), pref_cmp);
  /src/external/bsd/ntp/dist/sntp/libpkgver/
colcomp.c 126 qsort((void *)base, nmemb, size, qcmp);
  /src/external/gpl3/gcc/dist/gcc/lto/
lto-dump.cc 168 v.qsort (size_compare);
170 v.qsort (name_compare);
202 v.qsort (size_compare);
204 v.qsort (name_compare);
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/c_compatibility/
stdlib.h 74 using std::qsort;
  /src/external/gpl3/gcc.old/dist/gcc/lto/
lto-dump.cc 168 v.qsort (size_compare);
170 v.qsort (name_compare);
202 v.qsort (size_compare);
204 v.qsort (name_compare);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/c_compatibility/
stdlib.h 71 using std::qsort;
  /src/usr.bin/aiomixer/
parse.c 132 qsort(aio->classes, aio->numclasses,
137 qsort(class->controls, class->numcontrols,
  /src/external/bsd/openldap/dist/libraries/libldap/
sort.c 156 qsort( et, count, sizeof(struct entrything), et_cmp );
185 qsort( vals, nel, sizeof(char *), cmp );
  /src/external/bsd/ntp/dist/util/
hist.c 84 qsort(&ovfl, (size_t)n, sizeof(ovfl[0]), col);
  /src/external/ibm-public/postfix/dist/src/dns/
dns_sa_to_rr.c 124 qsort((void *) resv, len, sizeof(*resv), compare_family);
  /src/sys/lib/libsa/
qsort.c 33 * $FreeBSD: src/sys/libkern/qsort.c,v 1.12 2002/11/09 12:55:06 alfred Exp $
34 * $NetBSD: qsort.c,v 1.5 2019/03/31 20:08:45 christos Exp $
46 void qsort(void *a, size_t n, size_t es, cmp_t *cmp);
49 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
93 qsort(void *a, size_t n, size_t es, cmp_t *cmp) function
162 qsort(a, r / es, es, cmp);
169 /* qsort(pn - r, r / es, es, cmp);*/
  /src/crypto/external/apache2/openssl/dist/test/
priority_queue_test.c 75 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare);
80 qsort(values, count, sizeof(*values), &qsort_size_t_compare_rev);
108 qsort(sorted, count, sizeof(*sorted), &qsort_size_t_compare);
  /src/external/gpl2/gettext/dist/gettext-tools/src/
write-catalog.c 247 qsort (mlp->item, mlp->nitems, sizeof (mlp->item[0]), cmp_by_msgid);
282 qsort (mp->filepos, mp->filepos_count, sizeof (mp->filepos[0]),
339 qsort (mlp->item, mlp->nitems, sizeof (mlp->item[0]), cmp_by_filepos);
  /src/external/gpl3/binutils/dist/gprofng/src/
vec.h 77 qsort (ITEM *, size_t, ExtCompareFunc, void *);
160 qsort (data, count, (ExtCompareFunc) compare, arg);
399 qsort (ITEM *base, size_t nelem, ExtCompareFunc qcmp, void *arg) function
504 qsort (base, nleft, qcmp, arg);
510 qsort (mid + 1, nright, qcmp, arg);
  /src/external/gpl3/binutils.old/dist/gprofng/src/
vec.h 77 qsort (ITEM *, size_t, ExtCompareFunc, void *);
160 qsort (data, count, (ExtCompareFunc) compare, arg);
399 qsort (ITEM *base, size_t nelem, ExtCompareFunc qcmp, void *arg) function
504 qsort (base, nleft, qcmp, arg);
510 qsort (mid + 1, nright, qcmp, arg);

Completed in 27 milliseconds

1 2 3 4 5 6 7 8 91011>>