| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| TSearch.h | 30 void QSort(T* left, T* right)
37 QSort(left, pivot - 1);
38 QSort(pivot + 1, right);
59 void QSort(T** left, T** right)
66 QSort(left, pivot - 1);
67 QSort(pivot + 1, right);
89 void QSort(S& context, T* left, T* right,
97 QSort(context, left, pivot - 1, lessThan);
98 QSort(context, pivot + 1, right, lessThan);
|
| /external/skia/experimental/Intersection/ |
| TSearch.h | 30 void QSort(T* left, T* right)
37 QSort(left, pivot - 1);
38 QSort(pivot + 1, right);
59 void QSort(T** left, T** right)
66 QSort(left, pivot - 1);
67 QSort(pivot + 1, right);
89 void QSort(S& context, T* left, T* right,
97 QSort(context, left, pivot - 1, lessThan);
98 QSort(context, pivot + 1, right, lessThan);
|
| /external/chromium_org/third_party/icu/source/test/perf/collperf/ |
| CollPerf.pl | 40 "qsort strcoll null", ["$p,TestIcu_qsort_strcoll_null", "$p,TestPosix_qsort_strcoll_null", "$p,TestWin_qsort_CompareStringW_null"],
41 "qsort use key", ["$p,TestIcu_qsort_usekey", "$p,TestPosix_qsort_usekey", "$p,TestWin_qsort_usekey"],
57 #"qsort icu strcoll null", ["$p,TestIcu_qsort_strcoll_null"],
58 #"qsort icu strcoll len", ["$p,TestIcu_qsort_strcoll_len"],
59 #"qsort icu use key", ["$p,TestIcu_qsort_usekey"],
60 #"qsort posix strcoll null", ["$p,TestPosix_qsort_strcoll_null"],
61 #"qsort posix use key", ["$p,TestPosix_qsort_usekey"],
62 #"qsort win CompareStringW null", ["$p,TestWin_qsort_CompareStringW_null"],
63 #"qsort win CompareStringW len", ["$p,TestWin_qsort_CompareStringW_len"],
64 #"qsort win use key", ["$p,TestWin_qsort_usekey"]
[all...] |
| CollPerf_r.pl | 51 "qsort icu strcoll null", ["$p1,TestIcu_qsort_strcoll_null", "$p2,TestIcu_qsort_strcoll_null"],
52 "qsort icu strcoll len", ["$p1,TestIcu_qsort_strcoll_len", "$p2,TestIcu_qsort_strcoll_len"],
53 "qsort icu use key", ["$p1,TestIcu_qsort_usekey", "$p2,TestIcu_qsort_usekey"],
|
| /external/icu/icu4c/source/test/perf/collperf/ |
| CollPerf.pl | 40 "qsort strcoll null", ["$p,TestIcu_qsort_strcoll_null", "$p,TestPosix_qsort_strcoll_null", "$p,TestWin_qsort_CompareStringW_null"],
41 "qsort use key", ["$p,TestIcu_qsort_usekey", "$p,TestPosix_qsort_usekey", "$p,TestWin_qsort_usekey"],
57 #"qsort icu strcoll null", ["$p,TestIcu_qsort_strcoll_null"],
58 #"qsort icu strcoll len", ["$p,TestIcu_qsort_strcoll_len"],
59 #"qsort icu use key", ["$p,TestIcu_qsort_usekey"],
60 #"qsort posix strcoll null", ["$p,TestPosix_qsort_strcoll_null"],
61 #"qsort posix use key", ["$p,TestPosix_qsort_usekey"],
62 #"qsort win CompareStringW null", ["$p,TestWin_qsort_CompareStringW_null"],
63 #"qsort win CompareStringW len", ["$p,TestWin_qsort_CompareStringW_len"],
64 #"qsort win use key", ["$p,TestWin_qsort_usekey"]
[all...] |
| CollPerf_r.pl | 51 "qsort icu strcoll null", ["$p1,TestIcu_qsort_strcoll_null", "$p2,TestIcu_qsort_strcoll_null"],
52 "qsort icu strcoll len", ["$p1,TestIcu_qsort_strcoll_len", "$p2,TestIcu_qsort_strcoll_len"],
53 "qsort icu use key", ["$p1,TestIcu_qsort_usekey", "$p2,TestIcu_qsort_usekey"],
|
| /external/compiler-rt/test/asan/TestCases/Linux/ |
| 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: can not unwind through qsort.
|
| 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: can not unwind through qsort.
|
| /external/chromium_org/third_party/icu/source/samples/legacy/ |
| newcol.cpp | 38 // This one can be used for passing to qsort function
81 fprintf(stderr, "Done sortkeys, doing qsort test\n");
84 qsort(data, size, maxlen*sizeof(UChar), compare_current);
|
| oldcol.cpp | 39 // This one can be used for passing to qsort function
98 fprintf(stderr, "Done sortkeys, doing qsort test\n");
101 qsort(data, size, maxlen*sizeof(UChar), compare_legacy);
|
| /external/icu/icu4c/source/samples/legacy/ |
| newcol.cpp | 38 // This one can be used for passing to qsort function
81 fprintf(stderr, "Done sortkeys, doing qsort test\n");
84 qsort(data, size, maxlen*sizeof(UChar), compare_current);
|
| oldcol.cpp | 39 // This one can be used for passing to qsort function
98 fprintf(stderr, "Done sortkeys, doing qsort test\n");
101 qsort(data, size, maxlen*sizeof(UChar), compare_legacy);
|
| /external/chromium_org/third_party/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/webrtc/src/system_wrappers/source/ |
| sort.cc | 14 // qsort() will be used.
23 #include <cstdlib> // qsort
77 qsort((SORT_KEY), (NUM_OF_ELEMENTS), sizeof(SortKey), (COMPARE_FUNC));\
348 qsort(data, numOfElements, sizeof(WebRtc_Word8), CompareWord8);
351 qsort(data, numOfElements, sizeof(WebRtc_UWord8), CompareUWord8);
354 qsort(data, numOfElements, sizeof(WebRtc_Word16), CompareWord16);
357 qsort(data, numOfElements, sizeof(WebRtc_UWord16), CompareUWord16);
360 qsort(data, numOfElements, sizeof(WebRtc_Word32), CompareWord32);
363 qsort(data, numOfElements, sizeof(WebRtc_UWord32), CompareUWord32);
366 qsort(data, numOfElements, sizeof(WebRtc_Word64), CompareWord64)
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| SortTest.cpp | 48 // Use qsort as the reference sort.
50 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int);
|
| /external/skia/tests/ |
| SortTest.cpp | 48 // Use qsort as the reference sort.
50 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int);
|
| /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".
110 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
186 qsort(a, r / es, es, cmp);
194 /* qsort(pn - r, r / es, es, cmp);*/
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/replay/ |
| ut_sim.c | 64 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
77 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
|
| /external/srtp/crypto/replay/ |
| ut_sim.c | 64 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
77 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
|
| /cts/suite/cts/deviceTests/simplecpu/src/com/android/cts/simplecpu/ |
| CpuNative.java | 24 * run qsort for given number of repetition
|
| /external/cmockery/cmockery_0_1_2/src/example/ |
| key_value.c | 52 qsort(key_values, number_of_key_values, sizeof(*key_values),
|
| /external/strace/linux/ |
| ioctlsort.c | 41 qsort(ioctls, nioctls, sizeof(ioctls[0]), compare);
|
| /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);*/
|
| yaffs_qsort.h | 36 extern void qsort (void *const pbase,
|
| /frameworks/base/tools/aapt/ |
| qsort_r_compat.h | 19 * reentrant variant of qsort that passes a user data pointer to its comparator.
|
