| H A D | ckh.c | 3 * Implementation of (2^1+,2) cuckoo hashing, where 2^1+ indicates that each 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash 9 * 51(2):122-144. 25 * #hashes | 1 | 2 | 4 | 8 | 26 * -- 64 ckhc_t *cell; ckh_bucket_search() local 82 size_t hashes[2], bucket, cell; ckh_isearch() local 104 ckhc_t *cell; ckh_try_bucket_insert() local 137 ckhc_t *cell; ckh_evict_reloc_insert() local 492 size_t cell; ckh_remove() local 524 size_t cell; ckh_search() local 543 ckh_string_hash(const void * key,size_t r_hash[2]) ckh_string_hash() argument 556 ckh_pointer_hash(const void * key,size_t r_hash[2]) ckh_pointer_hash() argument [all...] |