8d0e04d42f
Recent huge allocation refactoring associates huge allocations with arenas, but it remains necessary to quickly look up huge allocation metadata during reallocation/deallocation. A global radix tree remains a good solution to this problem, but locking would have become the primary bottleneck after (upcoming) migration of chunk management from global to per arena data structures. This lock-free implementation uses double-checked reads to traverse the tree, so that in the steady state, each read or write requires only a single atomic operation. This implementation also assures that no more than two tree levels actually exist, through a combination of careful virtual memory allocation which makes large sparse nodes cheap, and skipping the root node on x64 (possible because the top 16 bits are all 0 in practice). |
||
|---|---|---|
| .. | ||
| internal | ||
| jemalloc_defs.h.in | ||
| jemalloc_macros.h.in | ||
| jemalloc_mangle.sh | ||
| jemalloc_protos.h.in | ||
| jemalloc_rename.sh | ||
| jemalloc_typedefs.h.in | ||
| jemalloc.sh | ||