Home
last modified time | relevance | path

Searched refs:compar (Results 1 – 25 of 32) sorted by relevance

12

/freebsd-13.1/lib/libc/tests/stdlib/
H A Dtsearch_test.c58 compar(const void *a, const void *b) in compar() function
110 ATF_CHECK(tdelete(&key, &root, compar) != NULL); in ATF_TC_BODY()
116 tdelete(&key, &root, compar)); in ATF_TC_BODY()
122 *(int **)tfind(&key, &root, compar)); in ATF_TC_BODY()
124 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); in ATF_TC_BODY()
130 *(int **)tsearch(&key, &root, compar)); in ATF_TC_BODY()
133 &keys[key], &root, compar)); in ATF_TC_BODY()
149 ATF_CHECK(tdelete(&key, &root, compar) != NULL); in ATF_TC_BODY()
/freebsd-13.1/lib/libc/stdlib/
H A Dlsearch.c23 int (*compar)(const void *, const void *)) in lsearch()
26 return (lwork(key, base, nelp, width, compar, 1)); in lsearch()
30 int (*compar)(const void *, const void *)) in lfind()
33 return (lwork(key, base, nelp, width, compar, 0)); in lfind()
38 int (*compar)(const void *, const void *), int addelem) in lwork()
44 if (compar(key, ep) == 0) in lwork()
H A Dbsearch.c43 #define COMPAR(x,y) CALL_BLOCK(compar, x, y)
45 #define COMPAR(x,y) compar(x, y)
67 DECLARE_BLOCK(int, compar, const void *, const void *)) in bsearch_b() argument
71 int (*compar)(const void *, const void *)) in bsearch_b()
H A Dqsort_r.c14 qsort_b(void *base, size_t nel, size_t width, qsort_block compar) in qsort_b() argument
16 qsort_r(base, nel, width, compar, in qsort_b()
18 GET_BLOCK_FUNCTION(compar)); in qsort_b()
H A Dheapsort.c49 #define COMPAR(x, y) CALL_BLOCK(compar, x, y)
52 #define COMPAR(x, y) compar(x, y)
158 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar) in heapsort_b() argument
162 int (*compar)(const void *, const void *)) in heapsort_b()
H A Dtfind.c32 int (*compar)(const void *, const void *)) in tfind()
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ in tfind()
H A Dtsearch.c37 int (*compar)(const void *, const void *)) in tsearch()
68 cmp = compar(key, (*leaf)->key); in tsearch()
H A Dtdelete.c71 int (*compar)(const void *, const void *)) in tdelete()
93 cmp = compar(key, (*leaf)->key); in tdelete()
/freebsd-13.1/crypto/heimdal/lib/roken/
H A Dtsearch.c41 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-13.1/lib/libc/locale/
H A Dcollate.c252 int next, compar, l; in chainsearch() local
262 compar = *key - *p->str; in chainsearch()
263 if (compar == 0) { in chainsearch()
265 compar = wcsncmp(key, p->str, l); in chainsearch()
266 if (compar == 0) { in chainsearch()
271 if (compar > 0) in chainsearch()
284 int next, compar; in largesearch() local
294 compar = key - p->val; in largesearch()
295 if (compar == 0) in largesearch()
297 if (compar > 0) in largesearch()
/freebsd-13.1/sys/libkern/
H A Dbsearch.c59 int (*compar)(const void *, const void *)) in bsearch()
68 cmp = (*compar)(key, p); in bsearch()
/freebsd-13.1/usr.bin/systat/
H A Dpigs.c59 int compar(const void *, const void *);
96 qsort(pt, nproc, sizeof (struct p_times), compar); in showpigs()
191 compar(const void *a, const void *b) in compar() function
/freebsd-13.1/contrib/ofed/libibumad/
H A Dsysfs.c151 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 Dsysfs.h52 int (*compar)(const struct dirent **, const struct dirent **));
/freebsd-13.1/contrib/mandoc/
H A Dcompat_fts.c76 int (*compar)(const FTSENT **, const FTSENT **)) in fts_open()
98 sp->fts_compar = compar; in fts_open()
130 if (compar) { in fts_open()
142 if (compar && nitems > 1) in fts_open()
/freebsd-13.1/usr.sbin/nscd/
H A Dhashtable.h187 int (*compar) (const void *, const void *)) \
190 the_entry->field.size, sizeof(type), compar)); \
/freebsd-13.1/sys/sys/
H A Dlibkern.h165 int (*compar)(const void *, const void *));
167 int (*compar)(void *, const void *, const void *));
/freebsd-13.1/usr.sbin/lpr/common_source/
H A Dcommon.c75 static int compar(const void *_p1, const void *_p2);
184 qsort(queue, nitems, sizeof(struct jobqueue *), compar); in getq()
198 compar(const void *p1, const void *p2) in compar() function
/freebsd-13.1/sys/contrib/openzfs/include/sys/
H A Davl.h164 int (*compar) (const void *, const void *), size_t size, size_t offset);
/freebsd-13.1/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h172 int (*compar) (const void *, const void *), size_t size, size_t offset);
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A Dcstdlib58 int (*compar)(const void *, const void *));
60 int (*compar)(const void *, const void *));
/freebsd-13.1/sys/contrib/openzfs/module/avl/
H A Davl.c892 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), in avl_create()
896 ASSERT(compar); in avl_create()
903 tree->avl_compar = compar; in avl_create()
/freebsd-13.1/lib/libc/gen/
H A Dfts.c110 int (*compar)(const FTSENT * const *, const FTSENT * const *)) in fts_open()
134 sp->fts_compar = compar; in fts_open()
174 if (compar) { in fts_open()
187 if (compar && nitems > 1) in fts_open()
H A Dfts-compat11.c113 int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *)) in freebsd11_fts_open()
137 sp->fts_compar = compar; in freebsd11_fts_open()
177 if (compar) { in freebsd11_fts_open()
190 if (compar && nitems > 1) in freebsd11_fts_open()
H A Dfts-compat.c124 int (*compar)(const FTSENT * const *, const FTSENT * const *)) in __fts_open_44bsd()
143 sp->fts_compar = compar; in __fts_open_44bsd()
187 if (compar) { in __fts_open_44bsd()
200 if (compar && nitems > 1) in __fts_open_44bsd()

12