HomeSort by relevance Sort by last modified time
    Searched refs:leafkey (Results 1 - 3 of 3) sorted by null

  /external/jemalloc_new/include/jemalloc/internal/
rtree_tsd.h 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
36 uintptr_t leafkey; member in struct:rtree_ctx_cache_elm_s
rtree.h 333 uintptr_t leafkey = rtree_leafkey(key); local
334 assert(leafkey != RTREE_LEAFKEY_INVALID);
337 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
353 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \
363 rtree_ctx->l2_cache[i].leafkey = \
364 rtree_ctx->l2_cache[i - 1].leafkey; \
367 rtree_ctx->l2_cache[i - 1].leafkey = \
368 rtree_ctx->cache[slot].leafkey; \
    [all...]
  /external/jemalloc_new/src/
rtree.c 234 uintptr_t leafkey = rtree_leafkey(key); local
236 assert(rtree_ctx->cache[i].leafkey != leafkey);
239 assert(rtree_ctx->l2_cache[i].leafkey != leafkey);
287 rtree_ctx->l2_cache[0].leafkey = \
288 rtree_ctx->cache[slot].leafkey; \
291 uintptr_t leafkey = rtree_leafkey(key); \
292 rtree_ctx->cache[slot].leafkey = leafkey; \
    [all...]

Completed in 67 milliseconds