Home	Sort by: relevance | last modified time | path

Full Search in project(s): src xsrc Definition Symbol File Path History   | | Help

    Searched defs:leafkey (Results 1 - 22 of 22) sorted by relevancy

/src/external/bsd/jemalloc.old/dist/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_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)) { 348 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ 353 rtree_ctx->l2_cache[i].leafkey = \ 354 rtree_ctx->l2_cache[i - 1].leafkey; \ 357 rtree_ctx->l2_cache[i - 1].leafkey = \ 358 rtree_ctx->cache[slot].leafkey; \     [all...]
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)) { 348 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ 353 rtree_ctx->l2_cache[i].leafkey = \ 354 rtree_ctx->l2_cache[i - 1].leafkey; \ 357 rtree_ctx->l2_cache[i - 1].leafkey = \ 358 rtree_ctx->cache[slot].leafkey; \     [all...]
/src/external/bsd/jemalloc.old/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_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)) { 348 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ 353 rtree_ctx->l2_cache[i].leafkey = \ 354 rtree_ctx->l2_cache[i - 1].leafkey; \ 357 rtree_ctx->l2_cache[i - 1].leafkey = \ 358 rtree_ctx->cache[slot].leafkey; \     [all...]
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)) { 348 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ 353 rtree_ctx->l2_cache[i].leafkey = \ 354 rtree_ctx->l2_cache[i - 1].leafkey; \ 357 rtree_ctx->l2_cache[i - 1].leafkey = \ 358 rtree_ctx->cache[slot].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); 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...]
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/include/jemalloc/internal/
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
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
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.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...]
/src/external/bsd/jemalloc/include/jemalloc/internal/
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
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
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.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...]
/src/external/bsd/jemalloc.old/dist/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); 281 rtree_ctx->l2_cache[0].leafkey = \ 282 rtree_ctx->cache[slot].leafkey; \ 285 uintptr_t leafkey = rtree_leafkey(key); \ 286 rtree_ctx->cache[slot].leafkey = leafkey; \     [all...]
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); 281 rtree_ctx->l2_cache[0].leafkey = \ 282 rtree_ctx->cache[slot].leafkey; \ 285 uintptr_t leafkey = rtree_leafkey(key); \ 286 rtree_ctx->cache[slot].leafkey = leafkey; \     [all...]
/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;
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 90 milliseconds

Indexes created Tue Feb 24 01:34:59 UTC 2026