Searched refs:rtree (Results 1 – 8 of 8) sorted by relevance
| /third_party/ulib/jemalloc/test/unit/ |
| A D | rtree.c | 13 if (rtree != test_rtree) in rtree_node_alloc_intercept()
27 if (rtree != test_rtree) { in rtree_node_dalloc_intercept()
43 rtree_t rtree; in TEST_BEGIN() local
45 test_rtree = &rtree; in TEST_BEGIN()
63 rtree_t rtree; member
151 rtree_t rtree; in TEST_BEGIN() local
153 test_rtree = &rtree; in TEST_BEGIN()
187 rtree_t rtree; in TEST_BEGIN() local
190 test_rtree = &rtree; in TEST_BEGIN()
234 rtree_t rtree; in TEST_BEGIN() local
[all …]
|
| /third_party/ulib/jemalloc/include/jemalloc/internal/ |
| A D | rtree_inlines.h | 6 unsigned rtree_ctx_start_level(const rtree_t *rtree,
45 return (rtree->height - 1); in rtree_start_level()
49 assert(start_level < rtree->height); in rtree_start_level()
70 assert(start_level < rtree->height); in rtree_ctx_start_level()
79 rtree->levels[level].bits) - 1)); in rtree_subkey()
154 subtree = rtree->levels[level].subtree; in rtree_subtree_tryread()
157 &rtree->levels[level].subtree_pun); in rtree_subtree_tryread()
191 rtree_start_level(rtree, key); in rtree_elm_lookup()
203 rtree_subtree_read(tsdn, rtree, in rtree_elm_lookup()
205 rtree_subtree_tryread(rtree, in rtree_elm_lookup()
[all …]
|
| A D | rtree_externs.h | 6 bool rtree_new(rtree_t *rtree, unsigned bits);
12 void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
14 rtree_elm_t *rtree_subtree_read_hard(tsdn_t *tsdn, rtree_t *rtree,
16 rtree_elm_t *rtree_child_read_hard(tsdn_t *tsdn, rtree_t *rtree,
18 void rtree_elm_witness_acquire(tsdn_t *tsdn, const rtree_t *rtree,
20 void rtree_elm_witness_access(tsdn_t *tsdn, const rtree_t *rtree,
22 void rtree_elm_witness_release(tsdn_t *tsdn, const rtree_t *rtree,
|
| A D | jemalloc_internal.h.in | 1053 * which induces rtree lookup load dependencies.
|
| /third_party/ulib/jemalloc/src/ |
| A D | rtree.c | 15 rtree_new(rtree_t *rtree, unsigned bits) in rtree_new() argument
33 rtree->height = height; in rtree_new()
36 rtree->levels[0].subtree = NULL; in rtree_new()
39 rtree->levels[0].cumbits = rtree->levels[0].bits; in rtree_new()
42 rtree->levels[i].subtree = NULL; in rtree_new()
44 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + in rtree_new()
103 if (level + 1 < rtree->height) { in rtree_delete_subtree()
115 rtree_node_dalloc(tsdn, rtree, node); in rtree_delete_subtree()
123 for (i = 0; i < rtree->height; i++) { in rtree_delete()
141 rtree->levels[level].bits); in rtree_node_init()
[all …]
|
| /third_party/ulib/jemalloc/ |
| A D | rules.mk | 30 $(GET_LOCAL_DIR)/src/rtree.c \
|
| A D | Makefile.in | 109 $(srcroot)src/rtree.c \
187 $(srcroot)test/unit/rtree.c \
|
| A D | ChangeLog | 110 - Streamline fast paths of rtree operations. (@jasone)
409 - Refactor rtree (radix tree for chunk lookups) to be lock-free, and make
|
Completed in 16 milliseconds