tree 838975c3aba811925e90601b61d301b0b7d6d3b3
parent 2b1fc90b7b109c5efac7974b8f9abe269ecb6daf
author Dave Watson <davejwatson@fb.com> 1456257981 -0800
committer Jason Evans <je@fb.com> 1456279776 -0800

Separate arena_avail trees

Separate run trees by index, replacing the previous quantize logic.
Quantization by index is now performed only on insertion / removal from
the tree, and not on node comparison, saving some cpu.  This also means
we don't have to dereference the miscelm* pointers, saving half of the
memory loads from miscelms/mapbits that have fallen out of cache.  A
linear scan of the indicies appears to be fast enough.

The only cost of this is an extra tree array in each arena.