Home | History | Annotate | Download | only in gen

Lines Matching refs:rb_left

281 	self->rb_left = parent->rb_nodes[position];
512 	 * Since we are childless, we know that self->rb_left is pointing
515 	father->rb_nodes[which] = self->rb_left;
684 		|| rb_tree_check_node(rbt, standin->rb_left, NULL, false));
833 		    && RB_BLACK_P(brother->rb_left)
866 				KASSERT(RB_BLACK_P(brother->rb_left));
883 		    && RB_BLACK_P(brother->rb_left)
887 			KASSERT(RB_BLACK_P(brother->rb_left));
1067 	left = rb_tree_count_black(self->rb_left);
1151 				    && RB_BLACK_P(self->rb_left)
1161 				    && RB_BLACK_P(brother->rb_left)
1172 				    && RB_RED_P(self->rb_left)
1173 				    && RB_CHILDLESS_P(self->rb_left))
1200 					|| RB_RED_P(relative->rb_left)
1218 			|| RB_CHILDLESS_P(self->rb_left)
1233 		KASSERT(RB_TWOCHILDREN_P(self->rb_left)
1235 			|| RB_CHILDLESS_P(self->rb_right->rb_left)
1236 			|| RB_CHILDLESS_P(self->rb_right->rb_left->rb_left)
1237 			|| RB_CHILDLESS_P(self->rb_right->rb_left->rb_right)
1239 			|| RB_CHILDLESS_P(self->rb_right->rb_right->rb_left)
1248 			|| RB_CHILDLESS_P(self->rb_left)
1249 			|| RB_CHILDLESS_P(self->rb_left->rb_left)
1250 			|| RB_CHILDLESS_P(self->rb_left->rb_left->rb_left)
1251 			|| RB_CHILDLESS_P(self->rb_left->rb_left->rb_right)
1252 			|| RB_CHILDLESS_P(self->rb_left->rb_right)
1253 			|| RB_CHILDLESS_P(self->rb_left->rb_right->rb_left)
1254 			|| RB_CHILDLESS_P(self->rb_left->rb_right->rb_right));
1329 		rb_tree_mark_depth(rbt, self->rb_left, depths, depth + 1);
1335 		rb_tree_mark_depth(rbt, self->rb_left, depths, depth + 1);