radix_slot_t
radix_slot_t free_slots; // # of free slots
radix_slot_t radix; // coverage radix
radix_slot_t skip; // starting skip
radix_slot_t root_size; // size of the array(# of nodes in the tree)
#define BITMAP_RADIX (sizeof(radix_slot_t) * 8)
#define RADIX_SLOT_NONE ((radix_slot_t)-1)
extern radix_slot_t radix_bitmap_alloc(radix_bitmap *bmp, uint32 count);
extern void radix_bitmap_dealloc(radix_bitmap *bmp, radix_slot_t slotIndex,
radix_slot_t slotIndex;
static radix_slot_t
radix_leaf_alloc(radix_node *leaf, radix_slot_t slotIndex, int32 count)
static radix_slot_t
radix_node_alloc(radix_node *node, radix_slot_t slotIndex, int32 count,
radix_slot_t addr = RADIX_SLOT_NONE;
radix_slot_t
radix_slot_t addr = RADIX_SLOT_NONE;
radix_leaf_dealloc(radix_node *leaf, radix_slot_t slotIndex, uint32 count)
radix_node_dealloc(radix_node *node, radix_slot_t slotIndex, uint32 count,
uint32 radix, uint32 skip, radix_slot_t index)
radix_bitmap_dealloc(radix_bitmap *bmp, radix_slot_t slotIndex, uint32 count)