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 		assert_false(rtree_set(&rtree, 0, &node_a),  in TEST_BEGIN()
44 		assert_ptr_eq(rtree_get(&rtree, 0, true), &node_a,  in TEST_BEGIN()
47 		assert_false(rtree_set(&rtree, ~((uintptr_t)0), &node_b),  in TEST_BEGIN()
49 		assert_ptr_eq(rtree_get(&rtree, ~((uintptr_t)0), true), &node_b,  in TEST_BEGIN()
52 		rtree_delete(&rtree);  in TEST_BEGIN()
65 		rtree_t rtree;  in TEST_BEGIN()  local
67 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
71 			assert_false(rtree_set(&rtree, keys[j], &node),  in TEST_BEGIN()
74 				assert_ptr_eq(rtree_get(&rtree, keys[k], true),  in TEST_BEGIN()
81 			assert_ptr_null(rtree_get(&rtree,  in TEST_BEGIN()
85 			assert_false(rtree_set(&rtree, keys[j], NULL),  in TEST_BEGIN()
89 		rtree_delete(&rtree);  in TEST_BEGIN()
106 		rtree_t rtree;  in TEST_BEGIN()  local
108 		assert_false(rtree_new(&rtree, i, node_alloc, node_dalloc),  in TEST_BEGIN()
113 			assert_false(rtree_set(&rtree, keys[j], &node),  in TEST_BEGIN()
115 			assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,  in TEST_BEGIN()
119 			assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node,  in TEST_BEGIN()
124 			assert_false(rtree_set(&rtree, keys[j], NULL),  in TEST_BEGIN()
126 			assert_ptr_null(rtree_get(&rtree, keys[j], true),  in TEST_BEGIN()
130 			assert_ptr_null(rtree_get(&rtree, keys[j], true),  in TEST_BEGIN()
134 		rtree_delete(&rtree);  in TEST_BEGIN()