14 rtree_node_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {  in rtree_node_alloc_intercept()  argument
17 	if (rtree != &test_rtree) {  in rtree_node_alloc_intercept()
18 		return rtree_node_alloc_orig(tsdn, rtree, nelms);  in rtree_node_alloc_intercept()
21 	malloc_mutex_unlock(tsdn, &rtree->init_lock);  in rtree_node_alloc_intercept()
24 	malloc_mutex_lock(tsdn, &rtree->init_lock);  in rtree_node_alloc_intercept()
30 rtree_node_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,  in rtree_node_dalloc_intercept()  argument
32 	if (rtree != &test_rtree) {  in rtree_node_dalloc_intercept()
33 		rtree_node_dalloc_orig(tsdn, rtree, node);  in rtree_node_dalloc_intercept()
41 rtree_leaf_alloc_intercept(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {  in rtree_leaf_alloc_intercept()  argument
44 	if (rtree != &test_rtree) {  in rtree_leaf_alloc_intercept()
45 		return rtree_leaf_alloc_orig(tsdn, rtree, nelms);  in rtree_leaf_alloc_intercept()
48 	malloc_mutex_unlock(tsdn, &rtree->init_lock);  in rtree_leaf_alloc_intercept()
51 	malloc_mutex_lock(tsdn, &rtree->init_lock);  in rtree_leaf_alloc_intercept()
57 rtree_leaf_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree,  in rtree_leaf_dalloc_intercept()  argument
59 	if (rtree != &test_rtree) {  in rtree_leaf_dalloc_intercept()
60 		rtree_leaf_dalloc_orig(tsdn, rtree, leaf);  in rtree_leaf_dalloc_intercept()
72 	rtree_t *rtree = &test_rtree;  in TEST_BEGIN()  local
75 	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");  in TEST_BEGIN()
76 	assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE,  in TEST_BEGIN()
78 	rtree_delete(tsdn, rtree);  in TEST_BEGIN()
96 	rtree_t *rtree = &test_rtree;  in TEST_BEGIN()  local
99 	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");  in TEST_BEGIN()
101 	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, &extent_a,  in TEST_BEGIN()
104 	rtree_szind_slab_update(tsdn, rtree, &rtree_ctx, PAGE,  in TEST_BEGIN()
106 	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx, PAGE, true),  in TEST_BEGIN()
110 	assert_false(rtree_write(tsdn, rtree, &rtree_ctx, ~((uintptr_t)0),  in TEST_BEGIN()
113 	assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
117 	rtree_delete(tsdn, rtree);  in TEST_BEGIN()
131 	rtree_t *rtree = &test_rtree;  in TEST_BEGIN()  local
134 	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");  in TEST_BEGIN()
137 		assert_false(rtree_write(tsdn, rtree, &rtree_ctx, keys[i],  in TEST_BEGIN()
141 			assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
148 		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
151 		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);  in TEST_BEGIN()
154 	rtree_delete(tsdn, rtree);  in TEST_BEGIN()
164 	rtree_t *rtree = &test_rtree;  in TEST_BEGIN()  local
172 	assert_false(rtree_new(rtree, false), "Unexpected rtree_new() failure");  in TEST_BEGIN()
176 		rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree,  in TEST_BEGIN()
180 		rtree_leaf_elm_write(tsdn, rtree, elm, &extent, NSIZES, false);  in TEST_BEGIN()
181 		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
186 		assert_ptr_eq(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
193 		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);  in TEST_BEGIN()
194 		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
199 		assert_ptr_null(rtree_extent_read(tsdn, rtree, &rtree_ctx,  in TEST_BEGIN()
204 	rtree_delete(tsdn, rtree);  in TEST_BEGIN()