Home
last modified time | relevance | path

Searched refs:rtree_node_elm_t (Results 1 – 3 of 3) sorted by relevance

/external/jemalloc_new/src/
Drtree.c30 static rtree_node_elm_t *
32 return (rtree_node_elm_t *)base_alloc(tsdn, b0get(), nelms * in rtree_node_alloc_impl()
33 sizeof(rtree_node_elm_t), CACHELINE); in rtree_node_alloc_impl()
38 rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) { in rtree_node_dalloc_impl()
63 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *subtree, in rtree_delete_subtree()
68 rtree_node_elm_t *node = in rtree_delete_subtree()
69 (rtree_node_elm_t *)atomic_load_p(&subtree[i].child, in rtree_delete_subtree()
101 static rtree_node_elm_t *
109 rtree_node_elm_t *node = atomic_load_p(elmp, ATOMIC_RELAXED); in rtree_node_init()
155 rtree_node_valid(rtree_node_elm_t *node) { in rtree_node_valid()
[all …]
/external/jemalloc_new/test/unit/
Drtree.c13 static rtree_node_elm_t *
15 rtree_node_elm_t *node; in rtree_node_alloc_intercept()
22 node = (rtree_node_elm_t *)calloc(nelms, sizeof(rtree_node_elm_t)); in rtree_node_alloc_intercept()
31 rtree_node_elm_t *node) { in rtree_node_dalloc_intercept()
/external/jemalloc_new/include/jemalloc/internal/
Drtree.h41 typedef struct rtree_node_elm_s rtree_node_elm_t; typedef
84 rtree_node_elm_t root[1U << (RTREE_NSB/RTREE_HEIGHT)];
114 typedef rtree_node_elm_t *(rtree_node_alloc_t)(tsdn_t *, rtree_t *, size_t);
120 typedef void (rtree_node_dalloc_t)(tsdn_t *, rtree_t *, rtree_node_elm_t *);