Jason Evans 6f29a83924 Add rtree lookup path caching. ...

rtree-based extent lookups remain more expensive than chunk-based run
lookups, but with this optimization the fast path slowdown is ~3 CPU
cycles per metadata lookup (on Intel Core i7-4980HQ), versus ~11 cycles
prior.  The path caching speedup tends to degrade gracefully unless
allocated memory is spread far apart (as is the case when using a
mixture of sbrk() and mmap()).

2016-06-05 20:59:57 -07:00

7.2 KiB

Raw Blame History

View Raw