Home
last modified time | relevance | path

Searched refs:RTREE_HEIGHT (Results 1 – 2 of 2) sorted by relevance

/f-stack/app/redis-5.0.5/deps/jemalloc/src/
H A Drtree.c61 # if RTREE_HEIGHT > 1
66 if (level + 2 < RTREE_HEIGHT) { in rtree_delete_subtree()
95 # if RTREE_HEIGHT > 1 in rtree_delete()
227 #if RTREE_HEIGHT > 1 in rtree_leaf_elm_lookup_hard()
244 assert(level < RTREE_HEIGHT-1); \ in rtree_leaf_elm_lookup_hard()
250 if (level + 2 < RTREE_HEIGHT) { \ in rtree_leaf_elm_lookup_hard()
270 assert(level == RTREE_HEIGHT-1); \ in rtree_leaf_elm_lookup_hard()
291 if (RTREE_HEIGHT > 1) { in rtree_leaf_elm_lookup_hard()
294 if (RTREE_HEIGHT > 2) { in rtree_leaf_elm_lookup_hard()
297 if (RTREE_HEIGHT > 3) { in rtree_leaf_elm_lookup_hard()
[all …]
/f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/
H A Drtree.h25 # define RTREE_HEIGHT 1 macro
27 # define RTREE_HEIGHT 2 macro
29 # define RTREE_HEIGHT 3 macro
83 #if RTREE_HEIGHT > 1
84 rtree_node_elm_t root[1U << (RTREE_NSB/RTREE_HEIGHT)];
86 rtree_leaf_elm_t root[1U << (RTREE_NSB/RTREE_HEIGHT)];
97 #if RTREE_HEIGHT == 1
99 #elif RTREE_HEIGHT == 2
102 #elif RTREE_HEIGHT == 3
135 rtree_levels[RTREE_HEIGHT-1].bits); in rtree_leafkey()
[all …]