Lines Matching defs:rtree
13 rtree_new(rtree_t *rtree, bool zeroed) {
16 memset(rtree, 0, sizeof(rtree_t)); /* Clear root. */
22 if (malloc_mutex_init(&rtree->init_lock, "rtree", WITNESS_RANK_RTREE,
31 rtree_node_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
38 rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) {
46 rtree_leaf_alloc_impl(tsdn_t *tsdn, rtree_t *rtree, size_t nelms) {
53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) {
63 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree,
72 rtree_delete_subtree(tsdn, rtree, node, level +
82 rtree_leaf_dalloc(tsdn, rtree, leaf);
87 if (subtree != rtree->root) {
88 rtree_node_dalloc(tsdn, rtree, subtree);
94 rtree_delete(tsdn_t *tsdn, rtree_t *rtree) {
96 rtree_delete_subtree(tsdn, rtree, rtree->root, 0);
102 rtree_node_init(tsdn_t *tsdn, rtree_t *rtree, unsigned level,
104 malloc_mutex_lock(tsdn, &rtree->init_lock);
111 node = rtree_node_alloc(tsdn, rtree, ZU(1) <<
114 malloc_mutex_unlock(tsdn, &rtree->init_lock);
123 malloc_mutex_unlock(tsdn, &rtree->init_lock);
129 rtree_leaf_init(tsdn_t *tsdn, rtree_t *rtree, atomic_p_t *elmp) {
130 malloc_mutex_lock(tsdn, &rtree->init_lock);
137 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) <<
140 malloc_mutex_unlock(tsdn, &rtree->init_lock);
149 malloc_mutex_unlock(tsdn, &rtree->init_lock);
181 rtree_child_node_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
187 node = rtree_node_init(tsdn, rtree, level + 1, &elm->child);
210 rtree_child_leaf_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm,
216 leaf = rtree_leaf_init(tsdn, rtree, &elm->child);
223 rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree, rtree_ctx_t *rtree_ctx,
228 node = rtree->root;
230 leaf = rtree->root;
252 rtree_child_node_read(tsdn, rtree, \
258 rtree_child_leaf_read(tsdn, rtree, \
265 * Cache replacement upon hard lookup (i.e. L1 & L2 rtree cache miss):