use a slab-backed `BTree*` implementation

[ickk]

Using a slab-backed BTree will improve performance by reducing the frequency of allocations / frees. It is also possible to turn orderly-allocator into something that may be suitable for firm- or hard-realtime by pre-allocating the space for all nodes at initialisation time

Possible options:

• minimal custom implementation
• btree-slab