rb_right
iter = &(*iter)->rb_right;
link = &hole_node->rb.rb_right;
link = &parent->rb.rb_right;
link = &rb->rb_right; \
link = &rb->rb_right;
rb = rb->rb_right;
rb = node->rb_hole_addr.rb_right;
p = &rb->rb_right;
p = &rb->rb_right;
rb = rb->rb_right;
rb = rb->rb_right;
rb = rb->rb_right;
iter = iter->rb_right;
iter = &(*iter)->rb_right;
iter = iter->rb_right;
iter = iter->rb_right;
p = &rb->rb_right;
rb = rb->rb_right;
p = &parent->rb_right;
p = &parent->rb_right;
p = &parent->rb_right;
parent = &rb->rb_right;
iter = &parent->rb_right; \
p->rb_right = new;
if (victim->rb_right)
rb_set_parent(victim->rb_right, new);
&& RB_BLACK_P(self->rb_right)));
&& RB_BLACK_P(brother->rb_right)));
&& RB_RED_P(self->rb_right)
&& RB_CHILDLESS_P(self->rb_right)));
|| RB_RED_P(relative->rb_right)
|| RB_CHILDLESS_P(self->rb_right)
|| RB_CHILDLESS_P(self->rb_right)
|| RB_CHILDLESS_P(self->rb_right->rb_left)
|| RB_CHILDLESS_P(self->rb_right->rb_left->rb_left)
|| RB_CHILDLESS_P(self->rb_right->rb_left->rb_right)
|| RB_CHILDLESS_P(self->rb_right->rb_right)
|| RB_CHILDLESS_P(self->rb_right->rb_right->rb_left)
|| RB_CHILDLESS_P(self->rb_right->rb_right->rb_right));
KASSERT(RB_TWOCHILDREN_P(self->rb_right)
|| RB_CHILDLESS_P(self->rb_left->rb_left->rb_right)
|| RB_CHILDLESS_P(self->rb_left->rb_right)
|| RB_CHILDLESS_P(self->rb_left->rb_right->rb_left)
|| RB_CHILDLESS_P(self->rb_left->rb_right->rb_right));
rb_tree_mark_depth(rbt, self->rb_right, depths, depth + 1);
rb_tree_mark_depth(rbt, self->rb_right, depths, depth + 1);
self->rb_right = parent->rb_nodes[position];
which = (father == grandpa->rb_right);
|| rb_tree_check_node(rbt, standin->rb_right, NULL, false));
&& RB_BLACK_P(brother->rb_right)) {
KASSERT(RB_BLACK_P(brother->rb_right));
&& RB_BLACK_P(brother->rb_right)) {
KASSERT(RB_BLACK_P(brother->rb_right));
right = rb_tree_count_black(self->rb_right);
#define rb_right rb_nodes[RB_DIR_RIGHT]
#define RB_RIGHT_SENTINEL_P(rb) RB_SENTINEL_P((rb)->rb_right)