compar
int (*compar)(const void *, const void *))
while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
int (*compar)(const void *, const void *))
if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
int (*compar)(const void *, const void *))
if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
void *thunk, int (*compar)(void *, const void *, const void *)) {
__qsort_r_compat(base, nmemb, size, thunk, compar);
int (*compar)(const FTSENT * const *, const FTSENT * const *))
sp->fts_compar = compar;
if (compar) {
if (compar && nitems > 1)
int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *))
sp->fts_compar = compar;
if (compar) {
if (compar && nitems > 1)
int (*compar)(const FTSENT * const *, const FTSENT * const *))
sp->fts_compar = compar;
int (^compar)(const FTSENT * const *, const FTSENT * const *))
fts_open_b(char * const *argv, int options, fts_block compar)
if (compar == NULL)
compar = Block_copy(compar);
if (compar->isa != &_NSConcreteGlobalBlock)
compar = _Block_copy(compar);
if (compar == NULL) {
sp->fts_compar_b = compar;
Block_release(compar);
if (compar->isa != &_NSConcreteGlobalBlock)
_Block_release(compar);
int next, compar, l;
compar = *key - *p->str;
if (compar == 0) {
compar = wcsncmp(key, p->str, l);
if (compar == 0) {
if (compar > 0)
int next, compar;
compar = key - p->val;
if (compar == 0)
if (compar > 0)
#define COMPAR(x,y) CALL_BLOCK(compar, x, y)
#define COMPAR(x,y) compar(x, y)
compar_block compar)
int (*compar)(const void *, const void *))
heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar)
int (*compar)(const void *, const void *))
#define COMPAR(x, y) CALL_BLOCK(compar, x, y)
#define COMPAR(x, y) compar(x, y)
int (*compar)(const void *, const void *))
return (lwork(key, base, nelp, width, compar, 1));
int (*compar)(const void *, const void *))
return (lwork(key, base, nelp, width, compar, 0));
int (*compar)(const void *, const void *), int addelem)
if (compar(key, ep) == 0)
qsort_b(void *base, size_t nel, size_t width, qsort_block compar)
__qsort_r_compat(base, nel, width, compar,
GET_BLOCK_FUNCTION(compar));
int (*compar)(const void *, const void *))
cmp = compar(key, (*leaf)->key);
int (*compar)(const void *, const void *))
if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
int (*compar)(const void *, const void *))
cmp = compar(key, (*leaf)->key);
ATF_CHECK(tdelete(&key, &root, compar) != NULL);
tdelete(&key, &root, compar));
*(int **)tfind(&key, &root, compar));
ATF_CHECK_EQ(NULL, tfind(&key, &root, compar));
*(int **)tsearch(&key, &root, compar));
&keys[key], &root, compar));
ATF_CHECK(tdelete(&key, &root, compar) != NULL);
int (*compar)(const void *, const void *))
cmp = (*compar)(key, p);
size_t size, int (*compar) (const void *, const void *))
res = compar(key, (const void *)((caddr_t)base + mid * size));
res = compar(key, (const void *)((caddr_t)base + mid * size));
int (*compar) (const void *, const void *))
item = (caddr_t)bsearch(key, base, nmemb, size, compar);
size_t size, int (*compar) (const void *, const void *));
int (*compar) (const void *, const void *));
int (*compar)(const void *, const void *));
int (*compar)(const void *, const void *, void *), void *thunk);
int compar(const void *, const void *);
qsort(pt, nproc, sizeof (struct p_times), compar);
qsort(queue, nitems, sizeof(struct jobqueue *), compar);
static int compar(const void *_p1, const void *_p2);
int (*compar) (const void *, const void *)) \
the_entry->field.size, sizeof(type), compar)); \