Lines Matching defs:rehash
46 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
55 uint32_t max_entries, size, rehash;
58 #define ENTRY(max_entries, size, rehash) \
59 { max_entries, size, rehash, \
60 REMAINDER_MAGIC(size), REMAINDER_MAGIC(rehash) }
127 ht->rehash = hash_sizes[ht->size_index].rehash;
270 uint32_t double_hash = util_fast_urem32(hash, ht->rehash,
313 uint32_t double_hash = util_fast_urem32(hash, ht->rehash,
355 ht->rehash = hash_sizes[ht->size_index].rehash;
389 * Note that insertion may rearrange the table on a resize or rehash,
407 uint32_t double_hash = util_fast_urem32(hash, ht->rehash,
455 * Note that insertion may rearrange the table on a resize or rehash,