| /bionic/libc/stdlib/ |
| qsort.c | 1 /* $OpenBSD: qsort.c,v 1.10 2005/08/08 08:05:37 espie Exp $ */
40 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
84 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *)) function
153 qsort(a, r / es, es, cmp);
160 /* qsort(pn - r, r / es, es, cmp); */
|
| /external/yaffs2/yaffs2/ |
| yaffs_qsort.c | 34 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
79 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *)) function
148 qsort(a, r / es, es, cmp);
155 /* qsort(pn - r, r / es, es, cmp);*/
|
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_qsort.c | 0 /* qsort.c
4 * This is a drop-in replacement for the C library's |qsort()| routine.
11 * - A few little wrinkles stolen from the GNU |qsort()|.
58 #define qsort SDL_qsort macro
63 static char _ID[]="<qsort.c gjm 1.12 1998-03-19>";
220 * idea from the GNU implementation of qsort().
413 void qsort(void *base, size_t nmemb, size_t size, function
|
| /external/valgrind/main/callgrind/ |
| dump.c | 985 * qsort -- qsort interface implemented by faster quicksort.
1018 static void qsort(BBCC **a, int n, int (*cmp)(BBCC**,BBCC**)) function
1024 CLG_DEBUG(8, " qsort(%ld,%ld)\n", a-qsort_start + 0L, n + 0L);
1116 if ((s = pb+1-pa) > 1) qsort(a, s, cmp);
1117 if ((s = pd+1-pc) > 1) qsort(a+n-s, s, cmp);
1242 qsort(array, prepare_count, my_cmp);
[all...] |
