Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 13 of 13) sorted by relevance

/memcached-1.4.29/doc/
H A Dthreads.txt8 central hash table, LRU lists, and some statistics counters are covered by
14 - A secondary small hash table of locks is used to lock an item by its hash
17 - This secondary hash table is mapped to the central hash tables buckets. This
18 allows multiple threads to access the hash table in parallel. Only one
19 thread may read or write against a particular hash table bucket.
H A Dprotocol.txt630 | hash_power_level | 32u | Current size multiplier for hash table |
631 | hash_bytes | 64u | Bytes currently used by hash tables |
632 | hash_is_expanding | bool | Indicates if the hash table is being |
712 | hashpower_init | 32 | Starting size multiplier for hash table |
H A DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored
/memcached-1.4.29/
H A Dhash.c10 hash = jenkins_hash; in hash_init()
14 hash = MurmurHash3_x86_32; in hash_init()
H A Dthread.c551 hv = hash(key, nkey); in item_get()
561 hv = hash(key, nkey); in item_touch()
575 hv = hash(ITEM_key(item), item->nkey); in item_link()
588 hv = hash(ITEM_key(item), item->nkey); in item_remove()
609 hv = hash(ITEM_key(item), item->nkey); in item_unlink()
620 hv = hash(ITEM_key(item), item->nkey); in item_update()
637 hv = hash(key, nkey); in add_delta()
651 hv = hash(ITEM_key(item), item->nkey); in store_item()
H A Dhash.h5 hash_func hash; variable
H A Dstats.c86 hashval = hash(key, length) % PREFIX_HASH_SIZE; in stats_prefix_find()
298 int hashval = hash("abc", 3) % PREFIX_HASH_SIZE; in test_prefix_dump()
334 if (hashval == hash(tmp, strlen(tmp)) % PREFIX_HASH_SIZE) { in test_prefix_dump()
H A Dassoc.c229 bucket = hash(ITEM_key(it), it->nkey) & hashmask(hashpower); in assoc_maintenance_thread()
H A Ditems.c869 uint32_t hv = hash(ITEM_key(search), search->nkey); in lru_pull_tail()
1375 uint32_t hv = hash(ITEM_key(search), search->nkey); in item_crawler_thread()
H A DChangeLog382 * Steven Grimm <[email protected]>: New faster hash function.
592 * removing use of Judy; use a hash. (judy caused memory fragmentation)
H A Dconfigure.ac418 dnl Check if we're a little-endian or a big-endian system, needed by hash code
H A Dslabs.c821 hv = hash(ITEM_key(it), it->nkey); in slab_rebalance_move()
H A DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored