/third_party/e2fsprogs/lib/support/ |
D | sort_r.h | 61 int (*compar)(const void *_a, in sort_r_cmpswap() 66 if(compar(a, b, arg) > 0) { in sort_r_cmpswap() 93 int (*compar)(const void *_a, in sort_r_simple() 107 for(pj = pi; pj > b && sort_r_cmpswap(pj-w,pj,w,compar,arg); pj -= w) {} in sort_r_simple() 129 if(compar(l[0],l[1],arg) > 0) { SORT_R_SWAP(l[0], l[1], tmp); } in sort_r_simple() 130 if(compar(l[1],l[2],arg) > 0) { in sort_r_simple() 132 if(compar(l[0],l[1],arg) > 0) { SORT_R_SWAP(l[0], l[1], tmp); } in sort_r_simple() 168 cmp = compar(pl, pivot, arg); in sort_r_simple() 181 cmp = compar(pr, pivot, arg); in sort_r_simple() 209 sort_r_simple(b, (pl-ple)/w, w, compar, arg); in sort_r_simple() [all …]
|
/third_party/ejdb/src/util/ |
D | sort_r.h | 67 int (*compar)(const void *_a, in sort_r_cmpswap() 71 if (compar(a, b, arg) > 0) { in sort_r_cmpswap() 102 int (*compar)(const void *_a, in sort_r_simple() 115 for (pj = pi; pj > b && sort_r_cmpswap(pj - w, pj, w, compar, arg); pj -= w) { in sort_r_simple() 136 if (compar(l[0], l[1], arg) > 0) { in sort_r_simple() 139 if (compar(l[1], l[2], arg) > 0) { in sort_r_simple() 141 if (compar(l[0], l[1], arg) > 0) { in sort_r_simple() 181 cmp = compar(pl, pivot, arg); in sort_r_simple() 199 cmp = compar(pr, pivot, arg); in sort_r_simple() 230 sort_r_simple(b, (pl - ple) / w, w, compar, arg); in sort_r_simple() [all …]
|
/third_party/mesa3d/src/util/ |
D | u_qsort.h | 36 int (*compar)(const void *, const void *, void *), 41 int (*compar)(const void*, const void*, void*); member 56 int (*compar)(const void *, const void *, void *), in util_qsort_r() 65 compar, in util_qsort_r() 71 qsort_r(base, nmemb, size, compar, arg); in util_qsort_r() 79 compar, in util_qsort_r() 85 qsort_s(base, nmemb, size, compar, arg); in util_qsort_r() 89 util_tls_qsort_r(base, nmemb, size, compar, arg); in util_qsort_r()
|
D | u_qsort.cpp | 38 int (*compar)(const void *, const void *, void *), in util_tls_qsort_r() 41 tl_qsort_r_compar = compar; in util_tls_qsort_r() 51 return data->compar(elem1, elem2, data->args); in util_qsort_adapter()
|
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/ |
D | tsearch.c | 23 tsearch(vkey, vrootp, compar) in tsearch() argument 26 int (*compar)(const void *, const void *); 37 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ 57 tfind(vkey, vrootp, compar) in tfind() argument 60 int (*compar)(const void *, const void *); 70 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ 88 int (*compar)(const void *, const void *)) in tdelete() 97 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) { in tdelete()
|
/third_party/musl/src/search/ |
D | lsearch.c | 5 int (*compar)(const void *, const void *)) in lsearch() 12 if (compar(key, p[i]) == 0) in lsearch() 19 size_t width, int (*compar)(const void *, const void *)) in lfind() 26 if (compar(key, p[i]) == 0) in lfind()
|
/third_party/node/deps/nghttp2/lib/ |
D | nghttp2_ksl.c | 53 int nghttp2_ksl_init(nghttp2_ksl *ksl, nghttp2_ksl_compar compar, size_t keylen, in nghttp2_ksl_init() argument 64 ksl->compar = compar; in nghttp2_ksl_init() 246 nghttp2_ksl_compar compar) { in ksl_bsearch() argument 253 if (compar((nghttp2_ksl_key *)node->key, key)) { in ksl_bsearch() 279 i = ksl_bsearch(ksl, blk, key, ksl->compar); in nghttp2_ksl_insert() 283 !ksl->compar(key, nghttp2_ksl_nth_node(ksl, blk, i)->key)) { in nghttp2_ksl_insert() 326 if (ksl->compar((nghttp2_ksl_key *)node->key, key)) { in nghttp2_ksl_insert() 328 if (ksl->compar((nghttp2_ksl_key *)node->key, key)) { in nghttp2_ksl_insert() 456 static int key_equal(nghttp2_ksl_compar compar, const nghttp2_ksl_key *lhs, in key_equal() argument 458 return !compar(lhs, rhs) && !compar(rhs, lhs); in key_equal() [all …]
|
D | nghttp2_ksl.h | 136 nghttp2_ksl_compar compar; member 156 int nghttp2_ksl_init(nghttp2_ksl *ksl, nghttp2_ksl_compar compar, size_t keylen, 215 nghttp2_ksl_compar compar);
|
/third_party/nghttp2/lib/ |
D | nghttp2_ksl.c | 53 int nghttp2_ksl_init(nghttp2_ksl *ksl, nghttp2_ksl_compar compar, size_t keylen, in nghttp2_ksl_init() argument 64 ksl->compar = compar; in nghttp2_ksl_init() 246 nghttp2_ksl_compar compar) { in ksl_bsearch() argument 253 if (compar((nghttp2_ksl_key *)node->key, key)) { in ksl_bsearch() 279 i = ksl_bsearch(ksl, blk, key, ksl->compar); in nghttp2_ksl_insert() 283 !ksl->compar(key, nghttp2_ksl_nth_node(ksl, blk, i)->key)) { in nghttp2_ksl_insert() 326 if (ksl->compar((nghttp2_ksl_key *)node->key, key)) { in nghttp2_ksl_insert() 328 if (ksl->compar((nghttp2_ksl_key *)node->key, key)) { in nghttp2_ksl_insert() 456 static int key_equal(nghttp2_ksl_compar compar, const nghttp2_ksl_key *lhs, in key_equal() argument 458 return !compar(lhs, rhs) && !compar(rhs, lhs); in key_equal() [all …]
|
D | nghttp2_ksl.h | 136 nghttp2_ksl_compar compar; member 156 int nghttp2_ksl_init(nghttp2_ksl *ksl, nghttp2_ksl_compar compar, size_t keylen, 215 nghttp2_ksl_compar compar);
|
/third_party/skia/third_party/externals/harfbuzz/src/ |
D | hb-algs.hh | 860 int (*compar)(const void *_key, const void *_item, Ts... _ds), in hb_bsearch_impl() 873 int c = compar ((const void *) hb_addressof (key), (const void *) p, ds...); in hb_bsearch_impl() 892 int (*compar)(const void *_key, const void *_item) = _hb_cmp_method<K, V>) 897 return hb_bsearch_impl (&pos, key, base, nmemb, stride, compar) ? 905 int (*compar)(const void *_key, const void *_item, Ts... _ds), in hb_bsearch() 911 return hb_bsearch_impl (&pos, key, base, nmemb, stride, compar, ds...) ? in hb_bsearch() 954 int (*compar)(const void *_a, in sort_r_cmpswap() 959 if(compar(a, b, ds...) > 0) { in sort_r_cmpswap() 986 int (*compar)(const void *_a, in sort_r_simple() 1000 for(pj = pi; pj > b && sort_r_cmpswap(pj-w,pj,w,compar,ds...); pj -= w) {} in sort_r_simple() [all …]
|
D | hb-buffer.hh | 386 …HB_INTERNAL void sort (unsigned int start, unsigned int end, int(*compar)(const hb_glyph_info_t *,…
|
/third_party/harfbuzz/src/ |
D | hb-algs.hh | 839 int (*compar)(const void *_key, const void *_item, Ts... _ds), in hb_bsearch_impl() 852 int c = compar ((const void *) hb_addressof (key), (const void *) p, ds...); in hb_bsearch_impl() 871 int (*compar)(const void *_key, const void *_item) = _hb_cmp_method<K, V>) 876 return hb_bsearch_impl (&pos, key, base, nmemb, stride, compar) ? 884 int (*compar)(const void *_key, const void *_item, Ts... _ds), in hb_bsearch() 890 return hb_bsearch_impl (&pos, key, base, nmemb, stride, compar, ds...) ? in hb_bsearch() 933 int (*compar)(const void *_a, in sort_r_cmpswap() 938 if(compar(a, b, ds...) > 0) { in sort_r_cmpswap() 965 int (*compar)(const void *_a, in sort_r_simple() 979 for(pj = pi; pj > b && sort_r_cmpswap(pj-w,pj,w,compar,ds...); pj -= w) {} in sort_r_simple() [all …]
|
D | hb-buffer.hh | 386 …HB_INTERNAL void sort (unsigned int start, unsigned int end, int(*compar)(const hb_glyph_info_t *,…
|
/third_party/gettext/gettext-runtime/intl/ |
D | tsearch.h | 48 int (*compar) (const void *, const void *)); 53 int (*compar) (const void *, const void *)); 59 int (*compar) (const void *, const void *));
|
D | tsearch.c | 262 __tsearch (const void *key, void **vrootp, __compar_fn_t compar) in __tsearch() argument 283 r = (*compar) (key, root->key); in __tsearch() 329 __tfind (key, vrootp, compar) 332 __compar_fn_t compar; variable 346 r = (*compar) (key, root->key); 363 __tdelete (const void *key, void **vrootp, __compar_fn_t compar) in weak_alias() 384 while ((cmp = (*compar) (key, (*rootp)->key)) != 0) in weak_alias()
|
/third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
D | hb-algs.hh | 610 int (*compar)(const void *_key, const void *_item, Ts... _ds), in hb_bsearch() 618 int c = compar (key, p, ds...); in hb_bsearch() 659 int (*compar)(const void *_a, const void *_b, in sort_r_cmpswap() 664 if(compar(a, b, arg) > 0) { in sort_r_cmpswap() 673 int (*compar)(const void *_a, const void *_b, in sort_r_simple() 682 for(pj = pi; pj > b && sort_r_cmpswap(pj-w,pj,w,compar,arg); pj -= w) {} in sort_r_simple() 698 if(compar(l[0],l[1],arg) > 0) { tmp=l[0]; l[0]=l[1]; l[1]=tmp; } in sort_r_simple() 699 if(compar(l[1],l[2],arg) > 0) { in sort_r_simple() 701 if(compar(l[0],l[1],arg) > 0) { tmp=l[0]; l[0]=l[1]; l[1]=tmp; } in sort_r_simple() 715 if(sort_r_cmpswap(pl, pr, w, compar, arg)) { in sort_r_simple() [all …]
|
D | hb-buffer.hh | 348 …HB_INTERNAL void sort (unsigned int start, unsigned int end, int(*compar)(const hb_glyph_info_t *,…
|
/third_party/grpc/third_party/upb/upb/ |
D | msg.c | 222 int (*compar)(const void *, const void *); in _upb_mapsorter_pushmap() local 228 compar = _upb_mapsorter_cmpi64; in _upb_mapsorter_pushmap() 232 compar = _upb_mapsorter_cmpu64; in _upb_mapsorter_pushmap() 238 compar = _upb_mapsorter_cmpi32; in _upb_mapsorter_pushmap() 242 compar = _upb_mapsorter_cmpu32; in _upb_mapsorter_pushmap() 245 compar = _upb_mapsorter_cmpbool; in _upb_mapsorter_pushmap() 248 compar = _upb_mapsorter_cmpstr; in _upb_mapsorter_pushmap() 254 qsort(&s->entries[sorted->start], map_size, sizeof(*s->entries), compar); in _upb_mapsorter_pushmap()
|
/third_party/toybox/toys/posix/ |
D | cut.c | 170 static int compar(unsigned *a, unsigned *b) in compar() function 238 qsort(toybuf, TT.pairs, 8, (void *)compar); in cut_main()
|
/third_party/libuv/src/unix/ |
D | os390-syscalls.h | 63 int (*compar)(const struct dirent **,
|
D | os390-syscalls.c | 36 int (*compar)(const struct dirent**, in scandir() 75 (int (*)(const void *, const void *)) compar); in scandir()
|
/third_party/eudev/src/shared/ |
D | util.h | 328 int (*compar) (const void *, const void *, void *), 388 int (*compar)(const void *, const void *)) { in qsort_safe() 393 qsort(base, nmemb, size, compar); in qsort_safe()
|
/third_party/FreeBSD/lib/libc/gen/ |
D | fts.c | 116 int (*compar)(const FTSENT * const *, const FTSENT * const *)) in fts_open() 140 sp->fts_compar = compar; in fts_open() 180 if (compar) { in fts_open() 193 if (compar && nitems > 1) in fts_open()
|
/third_party/e2fsprogs/misc/ |
D | create_inode.c | 745 int (*compar)(const struct dirent**, const struct dirent**)) { in scandir() 780 if (compar != NULL) { in scandir() 782 (int (*)(const void*, const void*))compar); in scandir()
|