| /external/icu/icu4c/source/test/perf/collperf/ |
| CollPerf.pl | 44 "qsort strcoll null", ["$p,TestIcu_qsort_strcoll_null", "$p,TestPosix_qsort_strcoll_null", "$p,TestWin_qsort_CompareStringW_null"],
45 "qsort use key", ["$p,TestIcu_qsort_usekey", "$p,TestPosix_qsort_usekey", "$p,TestWin_qsort_usekey"],
61 #"qsort icu strcoll null", ["$p,TestIcu_qsort_strcoll_null"],
62 #"qsort icu strcoll len", ["$p,TestIcu_qsort_strcoll_len"],
63 #"qsort icu use key", ["$p,TestIcu_qsort_usekey"],
64 #"qsort posix strcoll null", ["$p,TestPosix_qsort_strcoll_null"],
65 #"qsort posix use key", ["$p,TestPosix_qsort_usekey"],
66 #"qsort win CompareStringW null", ["$p,TestWin_qsort_CompareStringW_null"],
67 #"qsort win CompareStringW len", ["$p,TestWin_qsort_CompareStringW_len"],
68 #"qsort win use key", ["$p,TestWin_qsort_usekey"]
[all...] |
| CollPerf_r.pl | 55 "qsort icu strcoll null", ["$p1,TestIcu_qsort_strcoll_null", "$p2,TestIcu_qsort_strcoll_null"],
56 "qsort icu strcoll len", ["$p1,TestIcu_qsort_strcoll_len", "$p2,TestIcu_qsort_strcoll_len"],
57 "qsort icu use key", ["$p1,TestIcu_qsort_usekey", "$p2,TestIcu_qsort_usekey"],
|
| /external/syslinux/com32/lib/ |
| qsort.c | 2 * qsort.c
23 void qsort(void *base, size_t nmemb, size_t size, function
|
| /external/compiler-rt/test/asan/TestCases/Linux/ |
| malloc-in-qsort.cc | 5 // Test how well we unwind in presence of qsort in the stack
30 printf("Calling qsort\n");
31 qsort(a, size, sizeof(char), QsortCallback);
42 // Fast unwind may not unwind through qsort.
|
| overflow-in-qsort.cc | 5 // Test how well we unwind in presence of qsort in the stack
29 printf("Calling qsort\n");
30 qsort(a, size, sizeof(char), QsortCallback);
40 // Fast unwind may not unwind through qsort.
|
| /external/syslinux/bios/com32/modules/ |
| ls.c32 | |
| /external/syslinux/efi32/com32/modules/ |
| ls.c32 | |
| /external/webrtc/webrtc/system_wrappers/source/ |
| sort.cc | 14 // qsort() will be used.
24 #include <stdlib.h> // qsort
68 qsort((SORT_KEY), (NUM_OF_ELEMENTS), sizeof(SortKey), (COMPARE_FUNC)); \
295 qsort(data, num_of_elements, sizeof(int8_t), CompareWord8);
298 qsort(data, num_of_elements, sizeof(uint8_t), CompareUWord8);
301 qsort(data, num_of_elements, sizeof(int16_t), CompareWord16);
304 qsort(data, num_of_elements, sizeof(uint16_t), CompareUWord16);
307 qsort(data, num_of_elements, sizeof(int32_t), CompareWord32);
310 qsort(data, num_of_elements, sizeof(uint32_t), CompareUWord32);
313 qsort(data, num_of_elements, sizeof(int64_t), CompareWord64)
[all...] |
| /external/icu/icu4c/source/samples/legacy/ |
| newcol.cpp | 44 // This one can be used for passing to qsort function
87 fprintf(stderr, "Done sortkeys, doing qsort test\n");
90 qsort(data, size, maxlen*sizeof(UChar), compare_current);
|
| oldcol.cpp | 45 // This one can be used for passing to qsort function
104 fprintf(stderr, "Done sortkeys, doing qsort test\n");
107 qsort(data, size, maxlen*sizeof(UChar), compare_legacy);
|
| /external/skia/tests/ |
| SortTest.cpp | 50 // Use qsort as the reference sort.
52 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int);
|
| /external/skqp/tests/ |
| SortTest.cpp | 50 // Use qsort as the reference sort.
52 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int);
|
| /system/libufdt/sysdeps/ |
| libufdt_sysdeps_vendor.c | 20 * https://android.googlesource.com/platform/bionic.git/+/eclair-release/libc/stdlib/qsort.c
24 /* $OpenBSD: qsort.c,v 1.10 2005/08/08 08:05:37 espie Exp $ */
60 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
98 void qsort(void *aa, size_t n, size_t es, function
162 if ((r = pb - pa) > (int)es) qsort(a, r / es, es, cmp);
169 /* qsort(pn - r, r / es, es, cmp); */
172 /* End of the copied qsort. */
176 qsort(base, nmemb, size, compar);
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| qsort.c | 31 static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
49 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
116 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
199 qsort(a, d1 / es, es, cmp);
204 /* qsort(pn - d2, d2 / es, es, cmp); */
215 qsort(pn - d2, d2 / es, es, cmp);
220 /* qsort(a, d1 / es, es, cmp); */
|
| /device/linaro/bootloader/edk2/StdLib/LibC/StdLib/ |
| Qsort.c | 56 ("$FreeBSD: src/lib/libc/stdlib/qsort.c,v 1.15.2.1.2.1 2009/10/25 01:10:29 kensmith Exp $");
68 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
111 /* The qsort function sorts an array of nmemb objects, the initial element of
125 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
function
197 qsort(a, r / es, es, cmp);
204 /* qsort(pn - r, r / es, es, cmp);*/
|
| StdLib.inf | 33 Qsort.c
|
| /cts/tests/simplecpu/src/android/simplecpu/cts/ |
| CpuNative.java | 24 * run qsort for given number of repetition
|
| SimpleCpuTest.java | 30 * qsort
92 * qsort test
|
| /external/cmockery/cmockery_0_1_2/src/example/ |
| key_value.c | 52 qsort(key_values, number_of_key_values, sizeof(*key_values),
|
| /external/python/cpython3/Lib/turtledemo/ |
| sorting_animate.py | 114 def qsort(shelf, left, right): function
118 qsort(shelf, left, pivot_new_index - 1)
119 qsort(shelf, pivot_new_index + 1, right)
163 qsort(s, 0, len(s) - 1)
|
| /external/icu/icu4c/source/test/perf/collationperf/ |
| readme.html | 23 <LI>Quick Sort. Report the time required to sort the file in memory, using the C library qsort function. The file
58 -qsort Quicksort timing test</TT></PRE>
|
| /external/skia/bench/ |
| SortBench.cpp | 85 qsort(array, N, sizeof(int), int_compare);
98 { "qsort", qsort_sort },
|
| /external/skqp/bench/ |
| SortBench.cpp | 85 qsort(array, N, sizeof(int), int_compare);
98 { "qsort", qsort_sort },
|
| /external/syslinux/com32/include/ |
| stdlib.h | 58 __extern void qsort(void *, size_t, size_t,
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/lib32/ |
| libacl.so | |
