{
struct eb_node *head = sub;
- struct eb_troot *new_left = eb_dotag(&new->branches, EB_LEFT);
- struct eb_troot *new_rght = eb_dotag(&new->branches, EB_RGHT);
- struct eb_troot *new_leaf = eb_dotag(&new->branches, EB_LEAF);
+ eb_troot_t *new_left = eb_dotag(&new->branches, EB_LEFT);
+ eb_troot_t *new_rght = eb_dotag(&new->branches, EB_RGHT);
+ eb_troot_t *new_leaf = eb_dotag(&new->branches, EB_LEAF);
/* first, identify the deepest hole on the right branch */
while (eb_gettag(head->branches.b[EB_RGHT]) != EB_LEAF) {