Home
last modified time | relevance | path

Searched refs:leafkey (Results 1 – 3 of 3) sorted by relevance

/src/contrib/jemalloc/src/
H A Drtree.c175 uintptr_t leafkey = rtree_leafkey(key); in rtree_leaf_elm_lookup_hard() local
177 assert(rtree_ctx->cache[i].leafkey != leafkey); in rtree_leaf_elm_lookup_hard()
180 assert(rtree_ctx->l2_cache[i].leafkey != leafkey); in rtree_leaf_elm_lookup_hard()
222 rtree_ctx->l2_cache[0].leafkey = \ in rtree_leaf_elm_lookup_hard()
223 rtree_ctx->cache[slot].leafkey; \ in rtree_leaf_elm_lookup_hard()
226 uintptr_t leafkey = rtree_leafkey(key); \ in rtree_leaf_elm_lookup_hard()
227 rtree_ctx->cache[slot].leafkey = leafkey; \ in rtree_leaf_elm_lookup_hard()
253 cache->leafkey = RTREE_LEAFKEY_INVALID; in rtree_ctx_data_init()
258 cache->leafkey = RTREE_LEAFKEY_INVALID; in rtree_ctx_data_init()
/src/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h341 uintptr_t leafkey = rtree_leafkey(key); in rtree_leaf_elm_lookup_fast() local
342 assert(leafkey != RTREE_LEAFKEY_INVALID); in rtree_leaf_elm_lookup_fast()
344 if (unlikely(rtree_ctx->cache[slot].leafkey != leafkey)) { in rtree_leaf_elm_lookup_fast()
363 uintptr_t leafkey = rtree_leafkey(key); in rtree_leaf_elm_lookup() local
364 assert(leafkey != RTREE_LEAFKEY_INVALID); in rtree_leaf_elm_lookup()
367 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) { in rtree_leaf_elm_lookup()
378 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ in rtree_leaf_elm_lookup()
383 rtree_ctx->l2_cache[i].leafkey = \ in rtree_leaf_elm_lookup()
384 rtree_ctx->l2_cache[i - 1].leafkey; \ in rtree_leaf_elm_lookup()
387 rtree_ctx->l2_cache[i - 1].leafkey = \ in rtree_leaf_elm_lookup()
[all …]
H A Drtree_tsd.h48 uintptr_t leafkey; member