rb_left
iter = &(*iter)->rb_left;
link = &parent->rb.rb_left;
link = &rb->rb_left; \
link = &rb->rb_left;
rb = rb->rb_left;
rb = node->rb_hole_addr.rb_left;
p = &rb->rb_left;
p = &rb->rb_left;
rb = rb->rb_left;
rb = rb->rb_left;
rb = rb->rb_left;
iter = iter->rb_left;
iter = &(*iter)->rb_left;
iter = iter->rb_left;
iter = iter->rb_left;
p = &rb->rb_left;
rb = rb->rb_left;
p = &parent->rb_left;
p = &parent->rb_left;
p = &parent->rb_left;
parent = &rb->rb_left;
iter = &parent->rb_left; \
if (p->rb_left == victim)
p->rb_left = new;
if (victim->rb_left)
rb_set_parent(victim->rb_left, new);
&& RB_BLACK_P(self->rb_left)
&& RB_BLACK_P(brother->rb_left)
&& RB_RED_P(self->rb_left)
&& RB_CHILDLESS_P(self->rb_left))
|| RB_RED_P(relative->rb_left)
|| RB_CHILDLESS_P(self->rb_left)
KASSERT(RB_TWOCHILDREN_P(self->rb_left)
|| 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_left)
|| RB_CHILDLESS_P(self->rb_left)
|| RB_CHILDLESS_P(self->rb_left->rb_left)
|| RB_CHILDLESS_P(self->rb_left->rb_left->rb_left)
|| 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_left, depths, depth + 1);
rb_tree_mark_depth(rbt, self->rb_left, depths, depth + 1);
self->rb_left = parent->rb_nodes[position];
father->rb_nodes[which] = self->rb_left;
|| rb_tree_check_node(rbt, standin->rb_left, NULL, false));
&& RB_BLACK_P(brother->rb_left)
KASSERT(RB_BLACK_P(brother->rb_left));
&& RB_BLACK_P(brother->rb_left)
KASSERT(RB_BLACK_P(brother->rb_left));
left = rb_tree_count_black(self->rb_left);
#define rb_left rb_nodes[RB_DIR_LEFT]
#define RB_LEFT_SENTINEL_P(rb) RB_SENTINEL_P((rb)->rb_left)