Lines Matching defs:rehash
79 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
84 uint32_t max_entries, size, rehash;
87 #define ENTRY(max_entries, size, rehash) \
88 { max_entries, size, rehash, \
89 REMAINDER_MAGIC(size), REMAINDER_MAGIC(rehash) }
157 ht->rehash = hash_sizes[ht->size_index].rehash;
315 uint32_t double_hash = 1 + util_fast_urem32(hash, ht->rehash,
369 uint32_t double_hash = 1 + util_fast_urem32(hash, ht->rehash,
413 ht->rehash = hash_sizes[ht->size_index].rehash;
445 uint32_t double_hash = 1 + util_fast_urem32(hash, ht->rehash,
502 * Note that insertion may rearrange the table on a resize or rehash,