| /external/jemalloc/src/ |
| D | rtree.c | 13 rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc, in rtree_new() argument
32 rtree->alloc = alloc; in rtree_new()
33 rtree->dalloc = dalloc; in rtree_new()
34 rtree->height = height; in rtree_new()
37 rtree->levels[0].subtree = NULL; in rtree_new()
38 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL : in rtree_new()
40 rtree->levels[0].cumbits = rtree->levels[0].bits; in rtree_new()
43 rtree->levels[i].subtree = NULL; in rtree_new()
44 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL; in rtree_new()
45 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + in rtree_new()
[all …]
|
| /external/jemalloc/include/jemalloc/internal/ |
| D | rtree.h | 98 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
100 void rtree_delete(rtree_t *rtree);
101 rtree_node_elm_t *rtree_subtree_read_hard(rtree_t *rtree,
103 rtree_node_elm_t *rtree_child_read_hard(rtree_t *rtree,
111 unsigned rtree_start_level(rtree_t *rtree, uintptr_t key);
112 uintptr_t rtree_subkey(rtree_t *rtree, uintptr_t key, unsigned level);
117 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
121 void rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm,
123 rtree_node_elm_t *rtree_subtree_tryread(rtree_t *rtree, unsigned level,
[all …]
|
| D | jemalloc_internal.h.in | 388 #include "jemalloc/internal/rtree.h"
425 #include "jemalloc/internal/rtree.h"
523 #include "jemalloc/internal/rtree.h"
555 #include "jemalloc/internal/rtree.h"
|
| /external/jemalloc/test/unit/ |
| D | rtree.c | 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()
[all …]
|
| /external/skqp/tests/ |
| D | RTreeTest.cpp | 76 SkRTree rtree; in DEF_TEST() local
77 REPORTER_ASSERT(reporter, 0 == rtree.getCount()); in DEF_TEST()
83 rtree.insert(rects.get(), NUM_RECTS); in DEF_TEST()
86 run_queries(reporter, rand, rects, rtree); in DEF_TEST()
87 REPORTER_ASSERT(reporter, NUM_RECTS == rtree.getCount()); in DEF_TEST()
88 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree.getDepth() && in DEF_TEST()
89 expectedDepthMax >= rtree.getDepth()); in DEF_TEST()
|
| /external/skia/tests/ |
| D | RTreeTest.cpp | 76 SkRTree rtree; in DEF_TEST() local
77 REPORTER_ASSERT(reporter, 0 == rtree.getCount()); in DEF_TEST()
83 rtree.insert(rects.get(), NUM_RECTS); in DEF_TEST()
86 run_queries(reporter, rand, rects, rtree); in DEF_TEST()
87 REPORTER_ASSERT(reporter, NUM_RECTS == rtree.getCount()); in DEF_TEST()
88 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree.getDepth() && in DEF_TEST()
89 expectedDepthMax >= rtree.getDepth()); in DEF_TEST()
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| D | XObject.java | 347 public DocumentFragment rtree(XPathContext support) in rtree() method in XObject
376 public DocumentFragment rtree() in rtree() method in XObject
|
| /external/jemalloc/ |
| D | Android.bp | 122 "src/rtree.c",
233 "test/unit/rtree.c",
|
| D | Makefile.in | 105 $(srcroot)src/rtree.c \
183 $(srcroot)test/unit/rtree.c \
|
| D | ChangeLog | 110 - Streamline fast paths of rtree operations. (@jasone)
409 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
|