HomeSort by: relevance | last modified time | path
    Searched refs:h_buckets (Results 1 - 3 of 3) sorted by relevancy

  /src/external/cddl/osnet/dist/common/ctf/
ctf_hash.c 49 hp->h_buckets = __UNCONST(_CTF_EMPTY);
58 hp->h_buckets = ctf_alloc(sizeof (*hp->h_buckets) * hp->h_nbuckets);
61 if (hp->h_buckets == NULL || hp->h_chains == NULL) {
66 memset(hp->h_buckets, 0, sizeof (*hp->h_buckets) * hp->h_nbuckets);
123 hep->h_next = hp->h_buckets[h];
124 hp->h_buckets[h] = hp->h_free++;
157 for (i = hp->h_buckets[h]; i != 0; i = hep->h_next) {
172 if (hp->h_buckets != NULL && hp->h_nbuckets != 1)
    [all...]
ctf_impl.h 73 uint_t *h_buckets; /* hash bucket array (chain indices) */ member in struct:ctf_hash
  /src/external/cddl/osnet/dist/tools/ctf/cvt/
hash.c 50 list_t **h_buckets; member in struct:hash
103 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets);
116 list_add(&hash->h_buckets[bucket], key);
144 (void) list_remove(&hash->h_buckets[bucket], key,
154 return (list_iter(hash->h_buckets[bucket], fun, private) < 0);
185 return (list_iter(hash->h_buckets[bucket], hash_find_list_cb,
227 if (hash->h_buckets[i] != NULL) {
228 if ((cbrc = list_iter(hash->h_buckets[i], fun,
244 num += list_count(hash->h_buckets[i]);
258 list_free(hash->h_buckets[i], datafree, private)
    [all...]

Completed in 15 milliseconds