Searched refs:n_buckets (Results 1 – 2 of 2) sorted by relevance
26 n_buckets = h["indirect"]["n_buckets"]30 n_buckets = hashmap_type_info[h["type"]]["n_direct_buckets"]37 dib_raw_addr = storage_ptr + hashmap_type_info[h["type"]]["entry_size"] * n_buckets40 for i in range(0, n_buckets):55 for i in range(1, n_buckets):68 … if len(blocks) > 1 and blocks[0][0] == blocks[0][1] and blocks[-1][0] == n_buckets - 1:
163 unsigned n_buckets; /* number of buckets */ member302 static unsigned n_buckets(HashmapBase *h) { in n_buckets() function303 return h->has_indirect ? h->indirect.n_buckets in n_buckets()346 return (unsigned) (hash % n_buckets(h)); in base_bucket_hash()410 ((uint8_t*) storage_ptr(h) + hashmap_type_info[h->type].entry_size * n_buckets(h)); in dib_raw_ptr()415 : n_buckets(h) + idx - from; in bucket_distance()450 for ( ; idx < n_buckets(h); idx++) in skip_free_buckets()499 return (idx + 1U) % n_buckets(h); in next_idx()503 return (n_buckets(h) + idx - 1U) % n_buckets(h); in prev_idx()1014 assert(idx < n_buckets(h)); in hashmap_base_put_boldly()[all …]