Searched refs:leafkey (Results 1 – 3 of 3) sorted by relevance
234 uintptr_t leafkey = rtree_leafkey(key); in rtree_leaf_elm_lookup_hard() local236 assert(rtree_ctx->cache[i].leafkey != leafkey); in rtree_leaf_elm_lookup_hard()239 assert(rtree_ctx->l2_cache[i].leafkey != leafkey); in rtree_leaf_elm_lookup_hard()281 rtree_ctx->l2_cache[0].leafkey = \ in rtree_leaf_elm_lookup_hard()282 rtree_ctx->cache[slot].leafkey; \ in rtree_leaf_elm_lookup_hard()285 uintptr_t leafkey = rtree_leafkey(key); \ in rtree_leaf_elm_lookup_hard()286 rtree_ctx->cache[slot].leafkey = leafkey; \ in rtree_leaf_elm_lookup_hard()312 cache->leafkey = RTREE_LEAFKEY_INVALID; in rtree_ctx_data_init()317 cache->leafkey = RTREE_LEAFKEY_INVALID; in rtree_ctx_data_init()
333 uintptr_t leafkey = rtree_leafkey(key); in rtree_leaf_elm_lookup() local334 assert(leafkey != RTREE_LEAFKEY_INVALID); in rtree_leaf_elm_lookup()337 if (likely(rtree_ctx->cache[slot].leafkey == leafkey)) { in rtree_leaf_elm_lookup()348 if (likely(rtree_ctx->l2_cache[i].leafkey == leafkey)) { \ in rtree_leaf_elm_lookup()353 rtree_ctx->l2_cache[i].leafkey = \ in rtree_leaf_elm_lookup()354 rtree_ctx->l2_cache[i - 1].leafkey; \ in rtree_leaf_elm_lookup()357 rtree_ctx->l2_cache[i - 1].leafkey = \ in rtree_leaf_elm_lookup()358 rtree_ctx->cache[slot].leafkey; \ in rtree_leaf_elm_lookup()362 rtree_ctx->l2_cache[0].leafkey = \ in rtree_leaf_elm_lookup()363 rtree_ctx->cache[slot].leafkey; \ in rtree_leaf_elm_lookup()[all …]
36 uintptr_t leafkey; member