90    int numBuckets;  member
145       int oldNumBuckets = hash->numBuckets;  in util_data_rehash()
149       hash->numBuckets = primeForNumBits(hint);  in util_data_rehash()
150       hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets);  in util_data_rehash()
151       for (i = 0; i < hash->numBuckets; ++i)  in util_data_rehash()
166             beforeFirstNode = &hash->buckets[h % hash->numBuckets];  in util_data_rehash()
180    if (hash->size >= hash->numBuckets)  in util_data_might_grow()
186    if (hash->size <= (hash->numBuckets >> 3) &&  in util_data_has_shrunk()
197    int n = hash->numBuckets;  in util_data_first_node()
210    if (hash->data.d->numBuckets) {  in util_hash_find_node()
211       node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);  in util_hash_find_node()
259    hash->data.d->numBuckets = 0;  in util_hash_create()
268    int n = hash->data.d->numBuckets;  in util_hash_delete()
323    start = (node->key % a.d->numBuckets) + 1;  in util_hash_data_next()
325    n = a.d->numBuckets - start;  in util_hash_data_next()
380    node_ptr = (struct util_node**)(&hash->data.d->buckets[node->key % hash->data.d->numBuckets]);  in util_hash_erase()