/freebsd-current/lib/libc/stdlib/ |
H A D | qsort_r_compat.c | 12 qsort_b(void *base, size_t nel, size_t width, qsort_block compar) argument 14 __qsort_r_compat(base, nel, width, compar, 16 GET_BLOCK_FUNCTION(compar));
|
H A D | lsearch.c | 20 int (*compar)(const void *, const void *)) 23 return (lwork(key, base, nelp, width, compar, 1)); 27 int (*compar)(const void *, const void *)) 30 return (lwork(key, base, nelp, width, compar, 0)); 35 int (*compar)(const void *, const void *), int addelem) 41 if (compar(key, ep) == 0)
|
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) 66 int (*compar)(const void *, const void *)) 61 bsearch_b(const void *key, const void *base0, size_t nmemb, size_t size, compar_block compar) argument
|
H A D | tfind.c | 30 int (*compar)(const void *, const void *)) 39 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
H A D | heapsort.c | 43 #define COMPAR(x, y) CALL_BLOCK(compar, x, y) 46 #define COMPAR(x, y) compar(x, y) 99 * action is the call to the compar function, a considerable optimization 152 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar) argument 156 int (*compar)(const void *, const void *))
|
H A D | tsearch.c | 34 int (*compar)(const void *, const void *)) 65 cmp = compar(key, (*leaf)->key);
|
H A D | tdelete.c | 68 int (*compar)(const void *, const void *)) 90 cmp = compar(key, (*leaf)->key);
|
/freebsd-current/sys/libkern/ |
H A D | bsearch.c | 53 int (*compar)(const void *, const void *)) 62 cmp = (*compar)(key, p);
|
/freebsd-current/lib/libc/tests/stdlib/ |
H A D | tsearch_test.c | 55 compar(const void *a, const void *b) function 107 ATF_CHECK(tdelete(&key, &root, compar) != NULL); 113 tdelete(&key, &root, compar)); 119 *(int **)tfind(&key, &root, compar)); 121 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); 127 *(int **)tsearch(&key, &root, compar)); 130 &keys[key], &root, compar)); 146 ATF_CHECK(tdelete(&key, &root, compar) != NULL);
|
/freebsd-current/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-current/usr.bin/systat/ |
H A D | pigs.c | 51 int compar(const void *, const void *); 88 qsort(pt, nproc, sizeof (struct p_times), compar); 180 compar(const void *a, const void *b) function
|
/freebsd-current/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-current/lib/libc/locale/ |
H A D | collate.c | 260 int next, compar, l; local 270 compar = *key - *p->str; 271 if (compar == 0) { 273 compar = wcsncmp(key, p->str, l); 274 if (compar == 0) { 279 if (compar > 0) 292 int next, compar; local 302 compar = key - p->val; 303 if (compar == 0) 305 if (compar > [all...] |
/freebsd-current/sys/cddl/contrib/opensolaris/uts/common/sys/ |
H A D | avl.h | 166 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1 172 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
/freebsd-current/sys/contrib/openzfs/include/sys/ |
H A D | avl.h | 158 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1 164 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
/freebsd-current/usr.sbin/nscd/ |
H A D | hashtable.h | 185 int (*compar) (const void *, const void *)) \ 188 the_entry->field.size, sizeof(type), compar)); \
|
/freebsd-current/include/ |
H A D | stdlib.h | 360 void *thunk, int (*compar)(void *, const void *, const void *)) { 361 __qsort_r_compat(base, nmemb, size, thunk, compar);
|
/freebsd-current/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); 190 compar(const void *p1, const void *p2) function
|
/freebsd-current/contrib/mandoc/ |
H A D | compat_fts.c | 71 int (*compar)(const FTSENT **, const FTSENT **)) 93 sp->fts_compar = compar; 125 if (compar) { 137 if (compar && nitems > 1)
|
/freebsd-current/sys/sys/ |
H A D | libkern.h | 201 int (*compar)(const void *, const void *)); 203 int (*compar)(const void *, const void *, void *), void *thunk);
|
/freebsd-current/sys/contrib/openzfs/module/avl/ |
H A D | avl.c | 875 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), 879 ASSERT(compar); 886 tree->avl_compar = compar;
|
/freebsd-current/lib/libc/gen/ |
H A D | fts-compat.c | 119 int (*compar)(const FTSENT * const *, const FTSENT * const *)) 138 sp->fts_compar = compar; 182 if (compar) { 195 if (compar && nitems > 1)
|
H A D | fts.c | 106 int (*compar)(const FTSENT * const *, const FTSENT * const *)) 130 sp->fts_compar = compar; 170 if (compar) { 183 if (compar && nitems > 1)
|
H A D | fts-compat11.c | 108 int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *)) 132 sp->fts_compar = compar; 172 if (compar) { 185 if (compar && nitems > 1)
|