Home | History | Annotate | Download | only in unit

Lines Matching refs:rtree

3 #include "jemalloc/internal/rtree.h"
19 	rtree_t *rtree = &test_rtree;
22 	expect_false(rtree_new(rtree, base, false),
25 	expect_true(rtree_read_independent(tsdn, rtree, &rtree_ctx, PAGE,
26 	    &contents), "rtree_read_independent() should fail on empty rtree.");
60 	rtree_t *rtree = &test_rtree;
63 	expect_false(rtree_new(rtree, base, false),
72 	expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
74 	expect_false(rtree_write(tsdn, rtree, &rtree_ctx, PAGE, contents_a),
76 	rtree_contents_t read_contents_a = rtree_read(tsdn, rtree, &rtree_ctx,
91 	expect_false(rtree_write(tsdn, rtree, &rtree_ctx, ~((uintptr_t)0),
93 	rtree_contents_t read_contents_b = rtree_read(tsdn, rtree, &rtree_ctx,
118 	rtree_t *rtree = &test_rtree;
121 	expect_false(rtree_new(rtree, base, false),
132 		expect_false(rtree_write(tsdn, rtree, &rtree_ctx, keys[i],
135 			expect_ptr_eq(rtree_read(tsdn, rtree, &rtree_ctx,
142 		expect_ptr_null(rtree_read(tsdn, rtree, &rtree_ctx,
144 		    "Only leftmost rtree leaf should be set; i=%u", i);
145 		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
163 	rtree_t *rtree = &test_rtree;
171 	expect_false(rtree_new(rtree, base, false),
176 		rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree,
186 		rtree_leaf_elm_write(tsdn, rtree, elm, contents);
187 		expect_ptr_eq(rtree_read(tsdn, rtree, &rtree_ctx,
192 		expect_ptr_eq(rtree_read(tsdn, rtree, &rtree_ctx,
199 		rtree_clear(tsdn, rtree, &rtree_ctx, keys[i]);
200 		expect_ptr_null(rtree_read(tsdn, rtree, &rtree_ctx,
205 		expect_ptr_null(rtree_read(tsdn, rtree, &rtree_ctx,
218 test_rtree_range_write(tsdn_t *tsdn, rtree_t *rtree, uintptr_t start,
233 	expect_false(rtree_write(tsdn, rtree, &rtree_ctx, start,
235 	expect_false(rtree_write(tsdn, rtree, &rtree_ctx, end,
238 	rtree_write_range(tsdn, rtree, &rtree_ctx, start, end, contents);
240 		expect_ptr_eq(rtree_read(tsdn, rtree, &rtree_ctx,
244 	rtree_clear_range(tsdn, rtree, &rtree_ctx, start, end);
247 		elm = rtree_leaf_elm_lookup(tsdn, rtree, &rtree_ctx,
250 		expect_ptr_null(rtree_leaf_elm_read(tsdn, rtree, elm,
261 	rtree_t *rtree = &test_rtree;
262 	expect_false(rtree_new(rtree, base, false),
265 	/* Not crossing rtree node boundary first. */
268 	test_rtree_range_write(tsdn, rtree, start, end);
270 	/* Crossing rtree node boundary. */
274 	    "The range should span across two rtree nodes");
275 	test_rtree_range_write(tsdn, rtree, start, end);