27 	struct rb_node *right = node->rb_right;  in __rb_rotate_left()
30 	if ((node->rb_right = right->rb_left))  in __rb_rotate_left()
41 			parent->rb_right = right;  in __rb_rotate_left()
53 	if ((node->rb_left = left->rb_right))  in __rb_rotate_right()
54 		rb_set_parent(left->rb_right, node);  in __rb_rotate_right()
55 	left->rb_right = node;  in __rb_rotate_right()
61 		if (node == parent->rb_right)  in __rb_rotate_right()
62 			parent->rb_right = left;  in __rb_rotate_right()
82 				register struct rb_node *uncle = gparent->rb_right;  in rb_insert_color()
93 			if (parent->rb_right == node)  in rb_insert_color()
145 			other = parent->rb_right;  in __rb_erase_color()
151 				other = parent->rb_right;  in __rb_erase_color()
154 			    (!other->rb_right || rb_is_black(other->rb_right)))  in __rb_erase_color()
162 				if (!other->rb_right || rb_is_black(other->rb_right))  in __rb_erase_color()
169 					other = parent->rb_right;  in __rb_erase_color()
173 				if (other->rb_right)  in __rb_erase_color()
174 					rb_set_black(other->rb_right);  in __rb_erase_color()
191 			    (!other->rb_right || rb_is_black(other->rb_right)))  in __rb_erase_color()
202 					if ((o_right = other->rb_right))  in __rb_erase_color()
228 		child = node->rb_right;  in rb_erase()
229 	else if (!node->rb_right)  in rb_erase()
235 		node = node->rb_right;  in rb_erase()
238 		child = node->rb_right;  in rb_erase()
245 			parent->rb_right = child;  in rb_erase()
251 		node->rb_right = old->rb_right;  in rb_erase()
259 				rb_parent(old)->rb_right = node;  in rb_erase()
264 		if (old->rb_right)  in rb_erase()
265 			rb_set_parent(old->rb_right, node);  in rb_erase()
279 			parent->rb_right = child;  in rb_erase()
315 	if (node->rb_right) {  in rb_next()
316 		node = node->rb_right;   in rb_next()
329 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()