| /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.15/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()|.
73 #ifdef qsort
74 #undef qsort macro
76 #define qsort SDL_qsort macro
81 static char _ID[]="<qsort.c gjm 1.12 1998-03-19>";
238 * idea from the GNU implementation of qsort().
431 void qsort(void *base, size_t nmemb, size_t size, function
|
| /external/harfbuzz_ng/src/ |
| hb-private.hh | 278 /* Type of bsearch() / qsort() compare function */
369 inline void qsort (void) function in struct:hb_prealloced_array_t
371 ::qsort (array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
374 inline void qsort (unsigned int start, unsigned int end) function in struct:hb_prealloced_array_t
376 ::qsort (array + start, end - start, sizeof (Type), (hb_compare_func_t) Type::cmp);
|
| /external/valgrind/main/callgrind/ |
| dump.c | 987 * qsort -- qsort interface implemented by faster quicksort.
1020 static void qsort(BBCC **a, int n, int (*cmp)(BBCC**,BBCC**)) function
1026 CLG_DEBUG(8, " qsort(%ld,%ld)\n", a-qsort_start + 0L, n + 0L);
1118 if ((s = pb+1-pa) > 1) qsort(a, s, cmp);
1119 if ((s = pd+1-pc) > 1) qsort(a+n-s, s, cmp);
1244 qsort(array, prepare_count, my_cmp);
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetLibraryInfo.h | 481 /// void qsort(void *base, size_t nel, size_t width,
483 qsort, enumerator in enum:llvm::LibFunc::Func
|
