Jason Evans 0ee0e0c155 Implement compact rtree leaf element representation.
If a single virtual adddress pointer has enough unused bits to pack
{szind_t, extent_t *, bool, bool}, use a single pointer-sized field in
each rtree leaf element, rather than using three separate fields.  This
has little impact on access speed (fewer loads/stores, but more bit
twiddling), except that denser representation increases TLB
effectiveness.
2017-03-22 18:33:32 -07:00
..
2017-03-06 15:08:43 -08:00
2017-03-06 15:08:43 -08:00
2017-01-19 18:31:07 -08:00
2017-03-06 15:08:43 -08:00
2017-03-07 10:25:33 -08:00
2017-03-22 18:33:32 -07:00
2017-03-06 15:08:43 -08:00
2017-02-26 11:05:27 -08:00