| /external/jemalloc_new/test/unit/ |
| D | rtree.c | 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()
[all …]
|
| /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/jemalloc_new/include/jemalloc/internal/ |
| D | rtree.h | 108 # error Unsupported rtree height
112 bool rtree_new(rtree_t *rtree, bool zeroed);
126 void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
128 rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
173 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, in rtree_leaf_elm_bits_read() argument
211 rtree_leaf_elm_extent_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree, in rtree_leaf_elm_extent_read() argument
214 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_extent_read()
224 rtree_leaf_elm_szind_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree, in rtree_leaf_elm_szind_read() argument
227 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_szind_read()
236 rtree_leaf_elm_slab_read(UNUSED tsdn_t *tsdn, UNUSED rtree_t *rtree, in rtree_leaf_elm_slab_read() argument
[all …]
|
| /external/jemalloc_new/src/ |
| D | rtree.c | 13 rtree_new(rtree_t *rtree, bool zeroed) { in rtree_new() argument
16 memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */ in rtree_new()
22 if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE, in rtree_new()
31 rtree_node_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) { in rtree_node_alloc_impl() argument
38 rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) { in rtree_node_dalloc_impl() argument
46 rtree_leaf_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) { in rtree_leaf_alloc_impl() argument
53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) { in rtree_leaf_dalloc_impl() argument
63 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree, in rtree_delete_subtree() argument
72 rtree_delete_subtree(tsdn, rtree, node, level + in rtree_delete_subtree()
82 rtree_leaf_dalloc(tsdn, rtree, leaf); in rtree_delete_subtree()
[all …]
|
| /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/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/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 | 137 "src/rtree.c",
251 "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
|
| /external/jemalloc_new/ |
| D | Android.bp | 134 "src/rtree.c",
259 "test/unit/rtree.c",
|
| D | Makefile.in | 115 $(srcroot)src/rtree.c \
200 $(srcroot)test/unit/rtree.c \
|
| D | ChangeLog | 258 - Extensively optimize rtree via various methods:
259 + Add multiple layers of rtree lookup caching, since rtree lookups are now
261 + Determine rtree layout at compile time. (@jasone)
263 + Embed the root node in the top-level rtree data structure, thus avoiding
484 - Streamline fast paths of rtree operations. (@jasone)
783 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
|