99d68445ef
Expand and restructure the rtree API such that all common operations can be achieved with minimal work, regardless of whether the rtree leaf fields are independent versus packed into a single atomic pointer.
52 lines
1.1 KiB
C
52 lines
1.1 KiB
C
#ifndef JEMALLOC_INTERNAL_RTREE_STRUCTS_H
|
|
#define JEMALLOC_INTERNAL_RTREE_STRUCTS_H
|
|
|
|
struct rtree_node_elm_s {
|
|
atomic_p_t child; /* (rtree_{node,leaf}_elm_t *) */
|
|
};
|
|
|
|
struct rtree_leaf_elm_s {
|
|
atomic_p_t le_extent; /* (extent_t *) */
|
|
atomic_u_t le_szind; /* (szind_t) */
|
|
atomic_b_t le_slab; /* (bool) */
|
|
};
|
|
|
|
struct rtree_leaf_elm_witness_s {
|
|
const rtree_leaf_elm_t *elm;
|
|
witness_t witness;
|
|
};
|
|
|
|
struct rtree_leaf_elm_witness_tsd_s {
|
|
rtree_leaf_elm_witness_t witnesses[RTREE_ELM_ACQUIRE_MAX];
|
|
};
|
|
|
|
struct rtree_level_s {
|
|
/* Number of key bits distinguished by this level. */
|
|
unsigned bits;
|
|
/*
|
|
* Cumulative number of key bits distinguished by traversing to
|
|
* corresponding tree level.
|
|
*/
|
|
unsigned cumbits;
|
|
};
|
|
|
|
struct rtree_ctx_cache_elm_s {
|
|
uintptr_t leafkey;
|
|
rtree_leaf_elm_t *leaf;
|
|
};
|
|
|
|
struct rtree_ctx_s {
|
|
#ifndef _MSC_VER
|
|
JEMALLOC_ALIGNED(CACHELINE)
|
|
#endif
|
|
rtree_ctx_cache_elm_t cache[RTREE_CTX_NCACHE];
|
|
};
|
|
|
|
struct rtree_s {
|
|
/* An rtree_{internal,leaf}_elm_t *. */
|
|
atomic_p_t root;
|
|
malloc_mutex_t init_lock;
|
|
};
|
|
|
|
#endif /* JEMALLOC_INTERNAL_RTREE_STRUCTS_H */
|