HomeSort by: relevance | last modified time | path
    Searched refs:leafkey (Results 1 - 11 of 11) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/src/
rtree.c 175 uintptr_t leafkey = rtree_leafkey(key); local
177 assert(rtree_ctx->cache[i].leafkey != leafkey);
180 assert(rtree_ctx->l2_cache[i].leafkey != leafkey);
222 rtree_ctx->l2_cache[0].leafkey = \
223 rtree_ctx->cache[slot].leafkey; \
226 uintptr_t leafkey = rtree_leafkey(key); \
227 rtree_ctx->cache[slot].leafkey = leafkey; \
    [all...]
  /src/external/bsd/jemalloc/dist/src/
rtree.c 175 uintptr_t leafkey = rtree_leafkey(key); local
177 assert(rtree_ctx->cache[i].leafkey != leafkey);
180 assert(rtree_ctx->l2_cache[i].leafkey != leafkey);
224 rtree_ctx->l2_cache[0].leafkey = \
225 rtree_ctx->cache[slot].leafkey; \
227 uintptr_t leafkey = rtree_leafkey(key); \
228 rtree_ctx->cache[slot].leafkey = leafkey; \
    [all...]
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
rtree.h 341 uintptr_t leafkey = rtree_leafkey(key); local
342 assert(leafkey != RTREE_LEAFKEY_INVALID);
344 if (unlikely(rtree_ctx->cache[slot].leafkey != leafkey)) {
363 uintptr_t leafkey = rtree_leafkey(key); local
364 assert(leafkey != RTREE_LEAFKEY_INVALID);
367 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
378 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \
    [all...]
rtree_tsd.h 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
48 uintptr_t leafkey; member in struct:rtree_ctx_cache_elm_s
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
rtree.h 341 uintptr_t leafkey = rtree_leafkey(key); local
342 assert(leafkey != RTREE_LEAFKEY_INVALID);
344 if (unlikely(rtree_ctx->cache[slot].leafkey != leafkey)) {
363 uintptr_t leafkey = rtree_leafkey(key); local
364 assert(leafkey != RTREE_LEAFKEY_INVALID);
367 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
378 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \
    [all...]
rtree_tsd.h 5 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
48 uintptr_t leafkey; member in struct:rtree_ctx_cache_elm_s
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
rtree.h 354 uintptr_t leafkey = rtree_leafkey(key); local
355 assert(leafkey != RTREE_LEAFKEY_INVALID);
357 if (unlikely(rtree_ctx->cache[slot].leafkey != leafkey)) {
376 uintptr_t leafkey = rtree_leafkey(key); local
377 assert(leafkey != RTREE_LEAFKEY_INVALID);
380 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
392 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \
    [all...]
rtree_tsd.h 7 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
55 uintptr_t leafkey; member in struct:rtree_ctx_cache_elm_s
  /src/external/bsd/jemalloc/include/jemalloc/internal/
rtree.h 354 uintptr_t leafkey = rtree_leafkey(key); local
355 assert(leafkey != RTREE_LEAFKEY_INVALID);
357 if (unlikely(rtree_ctx->cache[slot].leafkey != leafkey)) {
376 uintptr_t leafkey = rtree_leafkey(key); local
377 assert(leafkey != RTREE_LEAFKEY_INVALID);
380 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) {
392 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \
    [all...]
rtree_tsd.h 7 * Number of leafkey/leaf pairs to cache in L1 and L2 level respectively. Each
55 uintptr_t leafkey; member in struct:rtree_ctx_cache_elm_s
  /src/sys/kern/
subr_thmap.c 428 const void *leafkey = THMAP_GETPTR(thmap, leaf->key); local
429 return len == leaf->len && memcmp(key, leafkey, len) == 0;

Completed in 23 milliseconds