Home
last modified time | relevance | path

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

/memcached-1.6.32/
Dhash.c9 hash_func hash; variable
18 hash = jenkins_hash; in hash_init()
22 hash = MurmurHash3_x86_32; in hash_init()
26 hash = XXH3_hash; in hash_init()
Dproxy_jump_hash.c10 static uint32_t mcplib_dist_jump_hash_get_server(uint64_t hash, void *ctx) { in mcplib_dist_jump_hash_get_server() argument
16 hash = hash * 2862933555777941757ULL + 1; in mcplib_dist_jump_hash_get_server()
17 j = (b + 1) * ((double)(1LL << 31) / (double)((hash >> 33) + 1)); in mcplib_dist_jump_hash_get_server()
Dhash.h5 extern hash_func hash;
Dthread.c881 hv = hash(key, nkey); in item_get()
893 *hv = hash(key, nkey); in item_get_locked()
902 hv = hash(key, nkey); in item_touch()
915 hv = hash(ITEM_key(item), item->nkey); in item_remove()
936 hv = hash(ITEM_key(item), item->nkey); in item_unlink()
952 hv = hash(key, nkey); in add_delta()
966 hv = hash(ITEM_key(item), item->nkey); in store_item()
Dxxhash.h531 XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
636 XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
2119 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash); in XXH32_canonicalFromHash()
2120 memcpy(dst, &hash, sizeof(*dst)); in XXH32_canonicalFromHash()
2539 if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash); in XXH64_canonicalFromHash()
2540 memcpy(dst, &hash, sizeof(*dst)); in XXH64_canonicalFromHash()
5285 XXH128_canonicalFromHash(XXH128_canonical_t* dst, XXH128_hash_t hash) in XXH128_canonicalFromHash() argument
5289 hash.high64 = XXH_swap64(hash.high64); in XXH128_canonicalFromHash()
5290 hash.low64 = XXH_swap64(hash.low64); in XXH128_canonicalFromHash()
5292 memcpy(dst, &hash.high64, sizeof(hash.high64)); in XXH128_canonicalFromHash()
[all …]
Dproxy_ring_hash.c89 static uint32_t ketama_get_server(uint64_t hash, void *ctx) { in ketama_get_server() argument
91 unsigned int h = hash; in ketama_get_server()
Dstats_prefix.c56 hashval = hash(key, length) % PREFIX_HASH_SIZE; in stats_prefix_find()
Dassoc.c216 bucket = hash(ITEM_key(it), it->nkey) & hashmask(hashpower); in assoc_maintenance_thread()
Ditems.c392 uint32_t hv = hash(ITEM_key(it), it->nkey); in do_item_link_fixup()
611 uint32_t hv = hash(ITEM_key(iter), iter->nkey); in item_flush_expired()
625 do_item_unlink_nolock(iter, hash(ITEM_key(iter), iter->nkey)); in item_flush_expired()
1137 uint32_t hv = hash(ITEM_key(search), search->nkey); in lru_pull_tail()
Dtestapp.c47 hash_func hash; variable
308 int hashval = hash("abc", 3) % PREFIX_HASH_SIZE; in test_stats_prefix_dump()
355 if (hashval == hash(tmp, strlen(tmp) - 1) % PREFIX_HASH_SIZE) { in test_stats_prefix_dump()
2341 hash = jenkins_hash; in main()
DChangeLog386 * Steven Grimm <[email protected]>: New faster hash function.
596 * removing use of Judy; use a hash. (judy caused memory fragmentation)
Dcrawler.c570 uint32_t hv = hash(ITEM_key(search), search->nkey); in item_crawler_thread()
Dproxy.h296 typedef uint32_t (*hash_selector_func)(uint64_t hash, void *ctx);
Dproxy_lua.c977 uint64_t hash = p->key_hasher(key, len, p->hash_seed); in mcplib_pool_proxy_call_helper() local
978 uint32_t lookup = p->phc.selector_func(hash, p->phc.ctx); in mcplib_pool_proxy_call_helper()
Dslabs.c903 hv = hash(ITEM_key(it), it->nkey); in slab_rebalance_move()
Dconfigure.ac665 dnl Check if we're a little-endian or a big-endian system, needed by hash code
Dproxy_internal.c1470 hv = hash(key, nkey); in process_marithmetic_cmd()
Dproto_text.c1826 hv = hash(key, nkey); in process_marithmetic_command()
DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored
/memcached-1.6.32/doc/
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.
Dprotocol.txt1135 lru_crawler metadump <classid,classid,classid|all|hash>
1142 if "hash" is specified instead of a classid or "all", the crawler will dump
1143 items by directly walking the hash table instead of the LRU's. This makes it
1163 lru_crawler mgdump <classid,classid,classid|all|hash>
1168 If "hash" is specified instead of a classid or "all", the crawler will dump
1169 items by directly walking the hash table instead of the LRU's. This makes it
1396 | hash_power_level | 32u | Current size multiplier for hash table |
1397 | hash_bytes | 64u | Bytes currently used by hash tables |
1398 | hash_is_expanding | bool | Indicates if the hash table is being |
1490 | hashpower_init | 32 | Starting size multiplier for hash table |
DDoxyfile6 # All text after a hash (#) is considered a comment and will be ignored
/memcached-1.6.32/vendor/
Dfetch.sh16 if [ "$SHA" = "$hash" ]; then
/memcached-1.6.32/vendor/mcmc/
DREADME.md11 ability to add many servers to a hash table of some kind and routing keys to