/freebsd-11-stable/lib/libc/stdlib/ |
H A D | qsort_r.c | 14 qsort_b(void *base, size_t nel, size_t width, qsort_block compar) argument 16 qsort_r(base, nel, width, compar, 18 GET_BLOCK_FUNCTION(compar));
|
H A D | bsearch.c | 41 #define COMPAR(x,y) CALL_BLOCK(compar, x, y) 43 #define COMPAR(x,y) compar(x, y) 65 DECLARE_BLOCK(int, compar, const void *, const void *)) 69 int (*compar)(const void *, const void *))
|
H A D | tfind.c | 32 int (*compar)(const void *, const void *)) 41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
H A D | lsearch.c | 23 int (*compar)(const void *, const void *)) 26 return (lwork(key, base, nelp, width, compar, 1)); 30 int (*compar)(const void *, const void *)) 33 return (lwork(key, base, nelp, width, compar, 0)); 38 int (*compar)(const void *, const void *), int addelem) 44 if (compar(key, ep) == 0)
|
H A D | heapsort.c | 47 #define COMPAR(x, y) CALL_BLOCK(compar, x, y) 50 #define COMPAR(x, y) compar(x, y) 103 * action is the call to the compar function, a considerable optimization 156 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar) argument 160 int (*compar)(const void *, const void *))
|
H A D | tsearch.c | 37 int (*compar)(const void *, const void *)) 68 cmp = compar(key, (*leaf)->key);
|
H A D | tdelete.c | 71 int (*compar)(const void *, const void *)) 93 cmp = compar(key, (*leaf)->key);
|
/freebsd-11-stable/sys/libkern/ |
H A D | bsearch.c | 56 bsearch(key, base0, nmemb, size, compar) 61 int (*compar)(const void *, const void *); 70 cmp = (*compar)(key, p);
|
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | bsearch.c | 33 @deftypefn Supplemental void* bsearch (const void *@var{key}, const void *@var{base}, size_t @var{nmemb}, size_t @var{size}, int (*@var{compar})(const void *, const void *)) 38 should be sorted in ascending order according to the @var{compar} 72 register int (*compar)(const void *, const void *)) 80 cmp = (*compar)(key, p);
|
/freebsd-11-stable/contrib/binutils/libiberty/ |
H A D | bsearch.c | 33 @deftypefn Supplemental void* bsearch (const void *@var{key}, const void *@var{base}, size_t @var{nmemb}, size_t @var{size}, int (*@var{compar})(const void *, const void *)) 38 should be sorted in ascending order according to the @var{compar} 72 register int (*compar)(const void *, const void *)) 80 cmp = (*compar)(key, p);
|
/freebsd-11-stable/lib/libc/tests/stdlib/ |
H A D | tsearch_test.c | 54 compar(const void *a, const void *b) function 89 ATF_CHECK(tdelete(&key, &root, compar) != NULL); 93 tdelete(&key, &root, compar)); 99 *(int **)tfind(&key, &root, compar)); 101 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); 107 *(int **)tsearch(&key, &root, compar)); 110 &keys[key], &root, compar)); 121 ATF_CHECK(tdelete(&key, &root, compar) != NULL);
|
/freebsd-11-stable/crypto/heimdal/lib/roken/ |
H A D | tsearch.c | 41 int (*compar)(const void *, const void *)) 52 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */ 113 * compar: function to carry out node comparisons 117 int (*compar)(const void *, const void *)) 126 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) { 163 int (*compar)(const void *, const void *)) 173 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
/freebsd-11-stable/usr.bin/systat/ |
H A D | pigs.c | 57 int compar(const void *, const void *); 94 qsort(pt, nproc, sizeof (struct p_times), compar); 189 compar(const void *a, const void *b) function
|
/freebsd-11-stable/contrib/ofed/libibumad/ |
H A D | sysfs.h | 52 int (*compar)(const struct dirent **, const struct dirent **));
|
H A D | sysfs.c | 151 int (*compar)(const struct dirent **, const struct dirent **)) 252 if (cnt && compar) 254 (int (*)(const void *, const void *))compar);
|
/freebsd-11-stable/lib/libc/locale/ |
H A D | collate.c | 232 int next, compar, l; local 242 compar = *key - *p->str; 243 if (compar == 0) { 245 compar = wcsncmp(key, p->str, l); 246 if (compar == 0) { 251 if (compar > 0) 264 int next, compar; local 274 compar = key - p->val; 275 if (compar == 0) 277 if (compar > [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/sys/ |
H A D | avl.h | 159 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1 165 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
/freebsd-11-stable/sys/sys/ |
H A D | libkern.h | 136 int (*compar)(const void *, const void *)); 138 int (*compar)(void *, const void *, const void *));
|
/freebsd-11-stable/usr.sbin/nscd/ |
H A D | hashtable.h | 187 int (*compar) (const void *, const void *)) \ 190 the_entry->field.size, sizeof(type), compar)); \
|
/freebsd-11-stable/usr.sbin/lpr/common_source/ |
H A D | common.c | 73 static int compar(const void *_p1, const void *_p2); 182 qsort(queue, nitems, sizeof(struct jobqueue *), compar); 196 compar(const void *p1, const void *p2) function
|
/freebsd-11-stable/contrib/mdocml/ |
H A D | compat_fts.c | 76 int (*compar)(const FTSENT **, const FTSENT **)) 98 sp->fts_compar = compar; 130 if (compar) { 142 if (compar && nitems > 1)
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/ |
H A D | avl.c | 903 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), 907 ASSERT(compar); 914 tree->avl_compar = compar;
|
/freebsd-11-stable/lib/libc/gen/ |
H A D | fts-compat.c | 123 int (*compar)(const FTSENT * const *, const FTSENT * const *)) 142 sp->fts_compar = compar; 186 if (compar) { 199 if (compar && nitems > 1)
|
H A D | fts.c | 113 int (*compar)(const FTSENT * const *, const FTSENT * const *)) 137 sp->fts_compar = compar; 177 if (compar) { 190 if (compar && nitems > 1)
|
/freebsd-11-stable/contrib/dialog/ |
H A D | fselect.c | 347 compar(const void *a, const void *b) function 495 compar); 501 compar);
|