64     unsigned level) {  in rtree_delete_subtree()  argument
65 	size_t nchildren = ZU(1) << rtree_levels[level].bits;  in rtree_delete_subtree()
66 	if (level + 2 < RTREE_HEIGHT) {  in rtree_delete_subtree()
72 				rtree_delete_subtree(tsdn, rtree, node, level +  in rtree_delete_subtree()
102 rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigned level,  in rtree_node_init()  argument
112 		    rtree_levels[level].bits);  in rtree_node_init()
182     unsigned level, bool dependent) {  in rtree_child_node_read()  argument
187 		node = rtree_node_init(tsdn, rtree, level + 1, &elm->child);  in rtree_child_node_read()
211     unsigned level, bool dependent) {  in rtree_child_leaf_read()  argument
243 #define RTREE_GET_CHILD(level) {					\  in rtree_leaf_elm_lookup_hard()  argument
244 		assert(level < RTREE_HEIGHT-1);				\  in rtree_leaf_elm_lookup_hard()
245 		if (level != 0 && !dependent &&				\  in rtree_leaf_elm_lookup_hard()
249 		uintptr_t subkey = rtree_subkey(key, level);		\  in rtree_leaf_elm_lookup_hard()
250 		if (level + 2 < RTREE_HEIGHT) {				\  in rtree_leaf_elm_lookup_hard()
253 			    &node[subkey], level, dependent) :		\  in rtree_leaf_elm_lookup_hard()
259 			    &node[subkey], level, dependent) :		\  in rtree_leaf_elm_lookup_hard()
269 #define RTREE_GET_LEAF(level) {						\  in rtree_leaf_elm_lookup_hard()  argument
270 		assert(level == RTREE_HEIGHT-1);			\  in rtree_leaf_elm_lookup_hard()
288 		uintptr_t subkey = rtree_subkey(key, level);		\  in rtree_leaf_elm_lookup_hard()