Lines Matching defs:hash
83 * http://blog.booking.com/hardening-perls-hash-function.html
112 /* In several functions it is advantageous to have the hash table extended
175 uint8_t hash_key[HASH_KEY_SIZE]; /* hash key; changes during resize */
203 /* Hashmaps with directly stored entries all use this shared hash key.
212 const struct hash_ops *hash_ops; /* hash and compare ops to use */
227 /* Specific hash types
287 .hash = string_hash_func,
302 .hash = trivial_hash_func,
320 .hash = uint64_hash_func,
339 .hash = devt_hash_func,
379 return (unsigned) (h->hash_ops->hash(p, hash_key(h)) % n_buckets(h));
387 /* Returns a hash function key to use. In order to keep things
389 * new hash table. Instead, we'll just reuse the most recently
391 * are rehashing an entire hash table because we reached a
456 * Having an overflow DIB value is very unlikely. The hash function
460 * hash table with load factor 0.8 the probability of a given entry
462 * This returns the correct DIB value by recomputing the hash value in
1134 /* Get a new hash key. If we've just upgraded to indirect storage,
1242 unsigned hash, idx;
1246 hash = bucket_hash(h, key);
1247 idx = bucket_scan(h, hash, key);
1258 return hashmap_put_boldly(h, hash, &swap, true);
1264 unsigned hash, idx;
1268 hash = bucket_hash(s, key);
1269 idx = bucket_scan(s, hash, key);
1275 return hashmap_put_boldly(s, hash, &swap, true);
1281 unsigned hash, idx;
1285 hash = bucket_hash(h, key);
1286 idx = bucket_scan(h, hash, key);
1307 return hashmap_put_boldly(h, hash, &swap, true);
1312 unsigned hash, idx;
1316 hash = bucket_hash(h, key);
1317 idx = bucket_scan(h, hash, key);
1328 unsigned hash, idx;
1333 hash = bucket_hash(h, key);
1334 idx = bucket_scan(h, hash, key);
1344 unsigned hash, idx;
1349 hash = bucket_hash(h, key);
1350 idx = bucket_scan(h, hash, key);
1362 unsigned hash;
1367 hash = bucket_hash(h, key);
1368 return bucket_scan(h, hash, key) != IDX_NIL;
1373 unsigned hash, idx;
1379 hash = bucket_hash(h, key);
1380 idx = bucket_scan(h, hash, key);
1393 unsigned hash, idx;
1402 hash = bucket_hash(h, key);
1403 idx = bucket_scan(h, hash, key);
1511 unsigned hash, idx;
1516 hash = bucket_hash(h, key);
1517 idx = bucket_scan(h, hash, key);
1794 unsigned hash, idx;
1801 hash = bucket_hash(h, key);
1802 idx = bucket_scan(h, hash, key);