| /illumos-gate/usr/src/lib/libdwarf/common/ |
| H A D | dwarf_tsearchhash.c | 159 int (*compar)(const void *, const void *),
351 int (*compar)(const void *, const void *)) in resize_table()
399 &newhead,compar, in resize_table()
411 &newhead,compar, in resize_table()
439 int (*compar)(const void *, const void *), in tsearch_inner()
462 resize_table(head,compar); in tsearch_inner()
481 kc = compar(key,s->keyptr); in tsearch_inner()
491 kc = compar(key,c->keyptr); in tsearch_inner()
518 int (*compar)(const void *, const void *)) in dwarf_tsearch()
531 r = tsearch_inner(key,head,compar,want_insert,&inserted,&nullme); in dwarf_tsearch()
[all …]
|
| /illumos-gate/usr/src/lib/libslp/clib/ |
| H A D | slp_search.c | 74 void *slp_tsearch(const void *ky, void **rtp, int (* compar)()) { in slp_tsearch() argument
82 int r = (*compar)(key, (*rootp)->key); /* T2: */ in slp_tsearch()
99 int (*compar)(const void *, const void *)) { in slp_tfind()
105 int r = (*compar)(key, (*rootp)->key); /* T2: */ in slp_tfind()
|
| /illumos-gate/usr/src/lib/libc/port/locale/ |
| H A D | collate.c | 217 int next, compar, l; in chainsearch() local
227 compar = *key - *p->str; in chainsearch()
228 if (compar == 0) { in chainsearch()
230 compar = wcsncmp(key, p->str, l); in chainsearch()
231 if (compar == 0) { in chainsearch()
236 if (compar > 0) in chainsearch()
249 int next, compar; in largesearch() local
259 compar = key - p->val; in largesearch()
260 if (compar == 0) in largesearch()
262 if (compar > 0) in largesearch()
|
| /illumos-gate/usr/src/lib/libc/port/gen/ |
| H A D | tsearch.c | 60 tsearch(const void *ky, void **rtp, int (*compar)()) in tsearch() argument
69 int r = (*compar)(key, (*rootp)->key); /* T2: */ in tsearch()
87 tdelete(const void *ky, void **rtp, int (*compar)()) in tdelete() argument
98 while ((ans = (*compar)(key, (*rootp)->key)) != 0) { in tdelete()
|
| H A D | lfind.c | 55 size_t width, int (*compar)()) in lfind() argument
62 if ((*compar)(key, base) == 0) in lfind()
|
| H A D | lsearch.c | 54 int (*compar)(const void *, const void *)) in lsearch()
62 if ((*compar)(key, base) == 0) in lsearch()
|
| H A D | tfind.c | 57 int (*compar)(const void *, const void *)) in tfind()
64 int r = (*compar)(key, (*rootp)->key); /* T2: */ in tfind()
|
| H A D | fts.c | 85 int (*compar)(const FTSENT **, const FTSENT **)) in fts_open()
107 sp->fts_compar = compar; in fts_open()
143 if (compar) { in fts_open()
155 if (compar && nitems > 1) in fts_open()
|
| /illumos-gate/usr/src/common/util/ |
| H A D | bsearch.c | 46 int (*compar)(const void *, const void *)) /* Comparison function */ in bsearch()
62 int res = (*compar)(ky, (void *)p); in bsearch()
|
| /illumos-gate/usr/src/lib/libbe/common/ |
| H A D | be_list.c | 166 int (*compar)(const void *, const void *) = be_qsort_compare_BEs_date; in be_sort() local
174 compar = be_qsort_compare_BEs_date; in be_sort()
177 compar = be_qsort_compare_BEs_date_rev; in be_sort()
180 compar = be_qsort_compare_BEs_name; in be_sort()
183 compar = be_qsort_compare_BEs_name_rev; in be_sort()
186 compar = be_qsort_compare_BEs_space; in be_sort()
189 compar = be_qsort_compare_BEs_space_rev; in be_sort()
197 return (be_sort_list(be_nodes, compar)); in be_sort()
701 be_sort_list(be_node_list_t **pstart, int (*compar)(const void *, const void *)) in be_sort_list()
728 qsort(ptrlist, nbe, sizeof (be_node_list_t *), compar); in be_sort_list()
|
| /illumos-gate/usr/src/cmd/nscd/ |
| H A D | cache.h | 267 int (*compar)(const void *, const void *); member
335 int (*compar) (const void *, const void *),
|
| H A D | cache.c | 461 if (nscdb->compar) { in hash_find()
462 if (nscdb->compar(entry, hashentry) == 0) in hash_find()
722 int (*compar) (const void *, const void *), in make_cache()
743 if (compar == NULL) { in make_cache()
745 nscdb->compar = nsc_db_ces_key_compar; in make_cache()
747 nscdb->compar = nsc_db_cis_key_compar; in make_cache()
749 nscdb->compar = nsc_db_int_key_compar; in make_cache()
753 nscdb->compar = compar; in make_cache()
757 avl_create(&nscdb->tree, nscdb->compar, sizeof (nsc_entry_t), in make_cache()
|
| /illumos-gate/usr/src/uts/common/sys/ |
| H A D | avl.h | 159 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
| /illumos-gate/usr/src/common/avl/ |
| H A D | avl.c | 887 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), in avl_create()
891 ASSERT(compar); in avl_create()
898 tree->avl_compar = compar; in avl_create()
|
| /illumos-gate/usr/src/lib/libzoneinfo/common/ |
| H A D | libzone.c | 89 static int compar(struct tz_country *, struct tz_country *);
406 (int (*)(const void *, const void *))compar); in get_tz_countries()
1381 compar(struct tz_country *p1, struct tz_country *p2) in compar() function
|
| /illumos-gate/usr/src/lib/libdtrace/common/ |
| H A D | dt_aggregate.c | 1249 int (*compar)(const void *, const void *)) in dt_aggregate_qsort()
1263 if (compar == NULL) { in dt_aggregate_qsort()
1265 compar = dt_aggregate_varvalcmp; in dt_aggregate_qsort()
1267 compar = dt_aggregate_varkeycmp; in dt_aggregate_qsort()
1271 qsort(base, nel, width, compar); in dt_aggregate_qsort()
|
| /illumos-gate/usr/src/cmd/ls/ |
| H A D | ls.c | 252 static int compar(struct lbuf **pp1, struct lbuf **pp2);
1092 (int (*)(const void *, const void *))compar); in main()
1170 (int (*)(const void *, const void *))compar); in pdirectory()
2364 compar(struct lbuf **pp1, struct lbuf **pp2) in compar() function
|
| /illumos-gate/usr/src/uts/common/fs/smbsrv/ |
| H A D | smb_kutil.c | 400 int (*compar) (const void *, const void *), in smb_lavl_constructor()
406 avl_create(&la->la_tree, compar, size, offset); in smb_lavl_constructor()
|
| /illumos-gate/usr/src/contrib/mDNSResponder/mDNSPosix/ |
| H A D | mDNSPosix.c | 1822 mDNSexport void mDNSPlatformQsort(void *base, int nel, int width, int (*compar)(const void *, const… in mDNSPlatformQsort()
1824 (void)qsort(base, nel, width, compar); in mDNSPlatformQsort()
|
| /illumos-gate/usr/src/uts/common/fs/zfs/ |
| H A D | btree.c | 177 zfs_btree_create(zfs_btree_t *tree, int (*compar) (const void *, const void *), in zfs_btree_create()
183 tree->bt_compar = compar; in zfs_btree_create()
|
| /illumos-gate/usr/src/boot/forth/ |
| H A D | support.4th | 1177 : compar ( addr1 addr2 -- flag )
1188 \ sorted, so insert should be ok. compar needs to implement < operator.
1194 r@ over cell- @ compar \ a[j-1] > v
|
| /illumos-gate/usr/src/cmd/zonestat/zonestat/ |
| H A D | zonestat.c | 1106 int (*compar)(const void *, const void *), int by) in zonestat_qsort()
1110 qsort(base, nel, width, compar); in zonestat_qsort()
|
| /illumos-gate/usr/src/uts/common/smbsrv/ |
| H A D | smb_kproto.h | 837 int (*compar) (const void *, const void *),
|
| /illumos-gate/usr/src/uts/common/fs/nfs/ |
| H A D | nfs_subr.c | 2461 int (*compar)(const void *, const void *), in make_rnode()
2592 avl_create(&rp->r_dir, compar, sizeof (rddir_cache), in make_rnode()
|
| /illumos-gate/usr/src/contrib/mDNSResponder/mDNSCore/ |
| H A D | mDNSEmbeddedAPI.h | 3030 extern void mDNSPlatformQsort (void *base, int nel, int width, int (*compar)(const void *, co…
|