944c8a3383
This allows leaf elements to differ in size from internal node elements. In principle it would be more correct to use a different type for each level of the tree, but due to implementation details related to atomic operations, we use casts anyway, thus counteracting the value of additional type correctness. Furthermore, such a scheme would require function code generation (via cpp macros), as well as either unwieldy type names for leaves or type aliases, e.g. typedef struct rtree_elm_d2_s rtree_leaf_elm_t; This alternate strategy would be more correct, and with less code duplication, but probably not worth the complexity.
48 lines
1.9 KiB
C
48 lines
1.9 KiB
C
#ifndef JEMALLOC_INTERNAL_RTREE_EXTERNS_H
|
|
#define JEMALLOC_INTERNAL_RTREE_EXTERNS_H
|
|
|
|
/*
|
|
* Split the bits into one to three partitions depending on number of
|
|
* significant bits. It the number of bits does not divide evenly into the
|
|
* number of levels, place one remainder bit per level starting at the leaf
|
|
* level.
|
|
*/
|
|
static const rtree_level_t rtree_levels[] = {
|
|
#if RTREE_HEIGHT == 1
|
|
{RTREE_NSB, RTREE_NHIB + RTREE_NSB}
|
|
#elif RTREE_HEIGHT == 2
|
|
{RTREE_NSB/2, RTREE_NHIB + RTREE_NSB/2},
|
|
{RTREE_NSB/2 + RTREE_NSB%2, RTREE_NHIB + RTREE_NSB}
|
|
#elif RTREE_HEIGHT == 3
|
|
{RTREE_NSB/3, RTREE_NHIB + RTREE_NSB/3},
|
|
{RTREE_NSB/3 + RTREE_NSB%3/2,
|
|
RTREE_NHIB + RTREE_NSB/3*2 + RTREE_NSB%3/2},
|
|
{RTREE_NSB/3 + RTREE_NSB%3 - RTREE_NSB%3/2, RTREE_NHIB + RTREE_NSB}
|
|
#else
|
|
# error Unsupported rtree height
|
|
#endif
|
|
};
|
|
|
|
bool rtree_new(rtree_t *rtree);
|
|
#ifdef JEMALLOC_JET
|
|
typedef rtree_node_elm_t *(rtree_node_alloc_t)(tsdn_t *, rtree_t *, size_t);
|
|
extern rtree_node_alloc_t *rtree_node_alloc;
|
|
typedef rtree_leaf_elm_t *(rtree_leaf_alloc_t)(tsdn_t *, rtree_t *, size_t);
|
|
extern rtree_leaf_alloc_t *rtree_leaf_alloc;
|
|
typedef void (rtree_node_dalloc_t)(tsdn_t *, rtree_t *, rtree_node_elm_t *);
|
|
extern rtree_node_dalloc_t *rtree_node_dalloc;
|
|
typedef void (rtree_leaf_dalloc_t)(tsdn_t *, rtree_t *, rtree_leaf_elm_t *);
|
|
extern rtree_leaf_dalloc_t *rtree_leaf_dalloc;
|
|
void rtree_delete(tsdn_t *tsdn, rtree_t *rtree);
|
|
#endif
|
|
rtree_leaf_elm_t *rtree_leaf_elm_lookup_hard(tsdn_t *tsdn, rtree_t *rtree,
|
|
rtree_ctx_t *rtree_ctx, uintptr_t key, bool dependent, bool init_missing);
|
|
void rtree_leaf_elm_witness_acquire(tsdn_t *tsdn, const rtree_t *rtree,
|
|
uintptr_t key, const rtree_leaf_elm_t *elm);
|
|
void rtree_leaf_elm_witness_access(tsdn_t *tsdn, const rtree_t *rtree,
|
|
const rtree_leaf_elm_t *elm);
|
|
void rtree_leaf_elm_witness_release(tsdn_t *tsdn, const rtree_t *rtree,
|
|
const rtree_leaf_elm_t *elm);
|
|
|
|
#endif /* JEMALLOC_INTERNAL_RTREE_EXTERNS_H */
|