Jason Evans 8d0e04d42f Refactor rtree to be lock-free. ... 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).		2015-02-04 16:51:53 -08:00
..
jemalloc	Refactor rtree to be lock-free.	2015-02-04 16:51:53 -08:00
msvc_compat	Allow to build with clang-cl	2014-06-12 10:39:39 -07:00