rn_left
if (t->rn_left == tt)
x = t->rn_left;
p->rn_left = x;
t->rn_left->rn_parent = t;
if (p->rn_left == x)
p->rn_left = t;
rn = rn->rn_left;
rn = rn->rn_left;
rn = rn->rn_left;
rn = rn->rn_left;
rn = rn->rn_left;
left = root->rn_left;
((head)->rnh_treetop->rn_left == &(head)->rnh_nodes[0]) && \
x = x->rn_left;
x = x->rn_left;
parent->rn_left = left;
x = x->rn_left;
tt = t->rn_left;
p->rn_left = t;
t->rn_left = x;
if (x->rn_left == t)
x->rn_left = tt;
x = t->rn_left;
if (t->rn_left == tt)
t->rn_left = x;
if (p->rn_left == t)
p->rn_left = x;
x->rn_left->rn_parent = x;
bootpboot_p_tree(rn->rn_left);
size_cols_tree(rnode.rn_left);
p_tree(rnode.rn_left, is_rtentry);
(u_long)rnode->rn_left, (u_long)rnode->rn_right);