compar
(int (*)(const void *, const void *))compar);
(int (*)(const void *, const void *))compar);
static int compar(struct lbuf **pp1, struct lbuf **pp2);
if (nscdb->compar) {
if (nscdb->compar(entry, hashentry) == 0)
int (*compar) (const void *, const void *),
if (compar == NULL) {
nscdb->compar = nsc_db_ces_key_compar;
nscdb->compar = nsc_db_cis_key_compar;
nscdb->compar = nsc_db_int_key_compar;
nscdb->compar = compar;
avl_create(&nscdb->tree, nscdb->compar, sizeof (nsc_entry_t),
int (*compar)(const void *, const void *);
int (*compar) (const void *, const void *),
int (*compar)(const void *, const void *), int by)
qsort(base, nel, width, compar);
avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *),
ASSERT(compar);
tree->avl_compar = compar;
int (*compar)(const void *, const void *)) /* Comparison function */
int res = (*compar)(ky, (void *)p);
int (*compar)(const void *, const void *) = be_qsort_compare_BEs_date;
compar = be_qsort_compare_BEs_date;
compar = be_qsort_compare_BEs_date_rev;
compar = be_qsort_compare_BEs_name;
compar = be_qsort_compare_BEs_name_rev;
compar = be_qsort_compare_BEs_space;
compar = be_qsort_compare_BEs_space_rev;
return (be_sort_list(be_nodes, compar));
be_sort_list(be_node_list_t **pstart, int (*compar)(const void *, const void *))
qsort(ptrlist, nbe, sizeof (be_node_list_t *), compar);
sp->fts_compar = compar;
if (compar) {
if (compar && nitems > 1)
int (*compar)(const FTSENT **, const FTSENT **))
size_t width, int (*compar)())
if ((*compar)(key, base) == 0)
int (*compar)(const void *, const void *))
if ((*compar)(key, base) == 0)
int (*compar)(const void *, const void *))
int r = (*compar)(key, (*rootp)->key); /* T2: */
tsearch(const void *ky, void **rtp, int (*compar)())
int r = (*compar)(key, (*rootp)->key); /* T2: */
tdelete(const void *ky, void **rtp, int (*compar)())
while ((ans = (*compar)(key, (*rootp)->key)) != 0) {
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)
int (*compar)(const void *, const void *))
if (compar == NULL) {
compar = dt_aggregate_varvalcmp;
compar = dt_aggregate_varkeycmp;
qsort(base, nel, width, compar);
int (*compar)(const void *, const void *),
int (*compar)(const void *, const void *))
&newhead,compar,
&newhead,compar,
int (*compar)(const void *, const void *),
resize_table(head,compar);
kc = compar(key,s->keyptr);
kc = compar(key,c->keyptr);
int (*compar)(const void *, const void *))
r = tsearch_inner(key,head,compar,want_insert,&inserted,&nullme);
int (*compar)(const void *, const void *))
r = tsearch_inner(key,head,compar,only_find,&inserted,&nullme);
int (*compar)(const void *, const void *))
found = tsearch_inner(key,head,compar,want_delete,&inserted,
int r = (*compar)(key, (*rootp)->key); /* T2: */
void *slp_tsearch(const void *ky, void **rtp, int (* compar)()) {
int r = (*compar)(key, (*rootp)->key); /* T2: */
int (*compar)(const void *, const void *)) {
(int (*)(const void *, const void *))compar);
static int compar(struct tz_country *, struct tz_country *);
int (*compar)(const void *, const void *),
avl_create(&rp->r_dir, compar, sizeof (rddir_cache),
int (*compar) (const void *, const void *),
avl_create(&la->la_tree, compar, size, offset);
zfs_btree_create(zfs_btree_t *tree, int (*compar) (const void *, const void *),
tree->bt_compar = compar;
int (*compar) (const void *, const void *),
int (*compar) (const void *, const void *), size_t size, size_t offset);