| /freebsd/lib/libc/tests/stdlib/ |
| H A D | tsearch_test.c | 55 compar(const void *a, const void *b) in compar() function
107 ATF_CHECK(tdelete(&key, &root, compar) != NULL); in ATF_TC_BODY()
113 tdelete(&key, &root, compar)); in ATF_TC_BODY()
119 *(int **)tfind(&key, &root, compar)); in ATF_TC_BODY()
121 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); in ATF_TC_BODY()
127 *(int **)tsearch(&key, &root, compar)); in ATF_TC_BODY()
130 &keys[key], &root, compar)); in ATF_TC_BODY()
146 ATF_CHECK(tdelete(&key, &root, compar) != NULL); in ATF_TC_BODY()
|
| /freebsd/lib/libc/stdlib/ |
| H A D | lsearch.c | 20 int (*compar)(const void *, const void *)) in lsearch()
23 return (lwork(key, base, nelp, width, compar, 1)); in lsearch()
27 int (*compar)(const void *, const void *)) in lfind()
30 return (lwork(key, base, nelp, width, compar, 0)); in lfind()
35 int (*compar)(const void *, const void *), int addelem) in lwork()
41 if (compar(key, ep) == 0) in lwork()
|
| H A D | bsearch.c | 37 #define COMPAR(x,y) CALL_BLOCK(compar, x, y)
40 #define COMPAR(x,y) compar(x, y)
62 compar_block compar) in bsearch_b() argument
66 int (*compar)(const void *, const void *)) in bsearch_b()
|
| H A D | qsort_r_compat.c | 12 qsort_b(void *base, size_t nel, size_t width, qsort_block compar) in qsort_b() argument
14 __qsort_r_compat(base, nel, width, compar, in qsort_b()
16 GET_BLOCK_FUNCTION(compar)); in qsort_b()
|
| H A D | heapsort.c | 43 #define COMPAR(x, y) CALL_BLOCK(compar, x, y)
46 #define COMPAR(x, y) compar(x, y)
152 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar) in heapsort_b() argument
156 int (*compar)(const void *, const void *)) in heapsort_b()
|
| H A D | tfind.c | 30 int (*compar)(const void *, const void *)) in tfind()
39 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in tfind()
|
| H A D | tsearch.c | 34 int (*compar)(const void *, const void *)) in tsearch()
65 cmp = compar(key, (*leaf)->key); in tsearch()
|
| H A D | tdelete.c | 68 int (*compar)(const void *, const void *)) in tdelete()
90 cmp = compar(key, (*leaf)->key); in tdelete()
|
| /freebsd/crypto/heimdal/lib/roken/ |
| H A D | tsearch.c | 41 int (*compar)(const void *, const void *)) in rk_tsearch()
52 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in rk_tsearch()
117 int (*compar)(const void *, const void *)) in rk_tdelete()
126 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) { in rk_tdelete()
163 int (*compar)(const void *, const void *)) in rk_tfind()
173 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in rk_tfind()
|
| /freebsd/lib/libc/locale/ |
| H A D | collate.c | 260 int next, compar, l; in chainsearch() local
270 compar = *key - *p->str; in chainsearch()
271 if (compar == 0) { in chainsearch()
273 compar = wcsncmp(key, p->str, l); in chainsearch()
274 if (compar == 0) { in chainsearch()
279 if (compar > 0) in chainsearch()
292 int next, compar; in largesearch() local
302 compar = key - p->val; in largesearch()
303 if (compar == 0) in largesearch()
305 if (compar > 0) in largesearch()
|
| /freebsd/sys/libkern/ |
| H A D | bsearch.c | 53 int (*compar)(const void *, const void *)) in bsearch()
62 cmp = (*compar)(key, p); in bsearch()
|
| /freebsd/usr.bin/systat/ |
| H A D | pigs.c | 51 int compar(const void *, const void *);
88 qsort(pt, nproc, sizeof (struct p_times), compar); in showpigs()
180 compar(const void *a, const void *b) in compar() function
|
| /freebsd/contrib/ofed/libibumad/ |
| H A D | sysfs.c | 151 int (*compar)(const struct dirent **, const struct dirent **)) in sys_scandir()
252 if (cnt && compar) in sys_scandir()
254 (int (*)(const void *, const void *))compar); in sys_scandir()
|
| H A D | sysfs.h | 52 int (*compar)(const struct dirent **, const struct dirent **));
|
| /freebsd/contrib/mandoc/ |
| H A D | compat_fts.c | 71 int (*compar)(const FTSENT **, const FTSENT **)) in fts_open()
93 sp->fts_compar = compar; in fts_open()
125 if (compar) { in fts_open()
137 if (compar && nitems > 1) in fts_open()
|
| /freebsd/usr.sbin/nscd/ |
| H A D | hashtable.h | 185 int (*compar) (const void *, const void *)) \
188 the_entry->field.size, sizeof(type), compar)); \
|
| /freebsd/include/ |
| H A D | stdlib.h | 360 void *thunk, int (*compar)(void *, const void *, const void *)) { in qsort_r()
361 __qsort_r_compat(base, nmemb, size, thunk, compar); in qsort_r()
|
| /freebsd/usr.sbin/lpr/common_source/ |
| H A D | common.c | 67 static int compar(const void *_p1, const void *_p2);
176 qsort(queue, nitems, sizeof(struct jobqueue *), compar); in getq()
190 compar(const void *p1, const void *p2) in compar() function
|
| /freebsd/sys/contrib/openzfs/include/sys/ |
| H A D | avl.h | 164 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
| /freebsd/sys/cddl/contrib/opensolaris/uts/common/sys/ |
| H A D | avl.h | 172 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | cstdlib | 58 int (*compar)(const void *, const void *));
60 int (*compar)(const void *, const void *));
|
| /freebsd/sys/sys/ |
| H A D | libkern.h | 245 int (*compar)(const void *, const void *));
247 int (*compar)(const void *, const void *, void *), void *thunk);
|
| /freebsd/sys/contrib/openzfs/module/avl/ |
| H A D | avl.c | 875 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), in avl_create()
879 ASSERT(compar); in avl_create()
886 tree->avl_compar = compar; in avl_create()
|
| /freebsd/lib/libc/gen/ |
| H A D | fts-compat11.c | 108 int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *)) in freebsd11_fts_open()
132 sp->fts_compar = compar; in freebsd11_fts_open()
172 if (compar) { in freebsd11_fts_open()
185 if (compar && nitems > 1) in freebsd11_fts_open()
|
| H A D | fts.c | 107 int (*compar)(const FTSENT * const *, const FTSENT * const *)) in fts_open()
131 sp->fts_compar = compar; in fts_open()
171 if (compar) { in fts_open()
184 if (compar && nitems > 1) in fts_open()
|