Lines Matching full:hash
4 * of in-memory, through mmaped file, growable hash table, that stores
29 /** store the hash mask, hash table size are always power of two */
32 /* there is (bucket factor * nr node) entry in hash table, this can seem
33 * excessive but hash coding eip don't give a good distributions and our
36 * re-enable zeroing hash table if BUCKET_FACTOR > 2 (roughly exact, you
41 /** a db hash node */
50 * the hash table (when growing we avoid to copy node array)
65 * odb_open(&hash, filename, ODB_RW, sizeof(header));
72 * the hash table: array of odb_index_t indexing the node array
77 odb_index_t * hash_base; /**< base memory of hash table */
86 struct list_head list; /**< hash bucket list */
165 /** check that the hash is well built */
186 * @param key the hash key
223 /* FIXME: better hash for eip value, needs to instrument code
226 * high order bits don't vary a lot, hash table start with 7 bits mask
227 * so this hash coding use bits 0-7, 8-15. Hash table is stored in
