Home
last modified time | relevance | path

Searched refs:h_buckets (Results 1 – 3 of 3) sorted by relevance

/titanic_41/usr/src/tools/ctf/cvt/
H A Dhash.c45 list_t **h_buckets; member
97 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets); in hash_new()
110 list_add(&hash->h_buckets[bucket], key); in hash_add()
137 (void) list_remove(&hash->h_buckets[bucket], key, in hash_remove()
147 return (list_iter(hash->h_buckets[bucket], fun, private) < 0); in hash_match()
177 return (list_iter(hash->h_buckets[bucket], (int (*)())hash_find_list_cb, in hash_find_iter()
218 if (hash->h_buckets[i] != NULL) { in hash_iter()
219 if ((cbrc = list_iter(hash->h_buckets[i], fun, in hash_iter()
235 num += list_count(hash->h_buckets[i]); in hash_count()
249 list_free(hash->h_buckets[i], datafree, private); in hash_free()
[all …]
/titanic_41/usr/src/common/ctf/
H A Dctf_hash.c46 hp->h_buckets = (ushort_t *)_CTF_EMPTY; in ctf_hash_create()
55 hp->h_buckets = ctf_alloc(sizeof (ushort_t) * hp->h_nbuckets); in ctf_hash_create()
58 if (hp->h_buckets == NULL || hp->h_chains == NULL) { in ctf_hash_create()
63 bzero(hp->h_buckets, sizeof (ushort_t) * hp->h_nbuckets); in ctf_hash_create()
120 hep->h_next = hp->h_buckets[h]; in ctf_hash_insert()
121 hp->h_buckets[h] = hp->h_free++; in ctf_hash_insert()
154 for (i = hp->h_buckets[h]; i != 0; i = hep->h_next) { in ctf_hash_lookup()
169 if (hp->h_buckets != NULL && hp->h_nbuckets != 1) { in ctf_hash_destroy()
170 ctf_free(hp->h_buckets, sizeof (ushort_t) * hp->h_nbuckets); in ctf_hash_destroy()
171 hp->h_buckets = NULL; in ctf_hash_destroy()
H A Dctf_impl.h73 ushort_t *h_buckets; /* hash bucket array (chain indices) */ member