22 		rtree_t rtree;  in TEST_BEGIN()  local
23 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
25 		assert_ptr_null(rtree_get(&rtree, 0, false),  in TEST_BEGIN()
27 		rtree_delete(&rtree);  in TEST_BEGIN()
38 		rtree_t rtree;  in TEST_BEGIN()  local
39 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
42 		rtree_set(&rtree, 0, &node_a);  in TEST_BEGIN()
43 		assert_ptr_eq(rtree_get(&rtree, 0, true), &node_a,  in TEST_BEGIN()
46 		rtree_set(&rtree, ~((uintptr_t)0), &node_b);  in TEST_BEGIN()
47 		assert_ptr_eq(rtree_get(&rtree, ~((uintptr_t)0), true), &node_b,  in TEST_BEGIN()
50 		rtree_delete(&rtree);  in TEST_BEGIN()
63 		rtree_t rtree;  in TEST_BEGIN()  local
65 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
69 			rtree_set(&rtree, keys[j], &node);  in TEST_BEGIN()
71 				assert_ptr_eq(rtree_get(&rtree, keys[k], true),  in TEST_BEGIN()
78 			assert_ptr_null(rtree_get(&rtree,  in TEST_BEGIN()
82 			rtree_set(&rtree, keys[j], NULL);  in TEST_BEGIN()
85 		rtree_delete(&rtree);  in TEST_BEGIN()
102 		rtree_t rtree;  in TEST_BEGIN()  local
104 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
109 			rtree_set(&rtree, keys[j], &node);  in TEST_BEGIN()
110 			assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,  in TEST_BEGIN()
114 			assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,  in TEST_BEGIN()
119 			rtree_set(&rtree, keys[j], NULL);  in TEST_BEGIN()
120 			assert_ptr_null(rtree_get(&rtree, keys[j], true),  in TEST_BEGIN()
124 			assert_ptr_null(rtree_get(&rtree, keys[j], true),  in TEST_BEGIN()
128 		rtree_delete(&rtree);  in TEST_BEGIN()