Lines Matching defs:leaf
33 /* Use compact leaf representation if virtual address encoding allows. */
43 atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
49 * Single pointer-width field containing all three leaf element fields.
93 * number of levels, place one remainder bit per level starting at the leaf
338 rtree_leaf_elm_t *leaf = rtree_ctx->cache[slot].leaf;
339 assert(leaf != NULL);
341 return &leaf[subkey];
349 rtree_leaf_elm_t *leaf = rtree_ctx->l2_cache[i].leaf; \
350 assert(leaf != NULL); \
355 rtree_ctx->l2_cache[i].leaf = \
356 rtree_ctx->l2_cache[i - 1].leaf; \
359 rtree_ctx->l2_cache[i - 1].leaf = \
360 rtree_ctx->cache[slot].leaf; \
364 rtree_ctx->l2_cache[0].leaf = \
365 rtree_ctx->cache[slot].leaf; \
368 rtree_ctx->cache[slot].leaf = leaf; \
370 return &leaf[subkey]; \
Indexes created Mon Mar 02 05:31:46 UTC 2026