28 	struct rb_node *right = node->rb_right;  in __rb_rotate_left()
31 	if ((node->rb_right = right->rb_left))  in __rb_rotate_left()
42 			parent->rb_right = right;  in __rb_rotate_left()
54 	if ((node->rb_left = left->rb_right))  in __rb_rotate_right()
55 		rb_set_parent(left->rb_right, node);  in __rb_rotate_right()
56 	left->rb_right = node;  in __rb_rotate_right()
62 		if (node == parent->rb_right)  in __rb_rotate_right()
63 			parent->rb_right = left;  in __rb_rotate_right()
83 				register struct rb_node *uncle = gparent->rb_right;  in rb_insert_color()
94 			if (parent->rb_right == node)  in rb_insert_color()
147 			other = parent->rb_right;  in __rb_erase_color()
153 				other = parent->rb_right;  in __rb_erase_color()
156 			    (!other->rb_right || rb_is_black(other->rb_right)))  in __rb_erase_color()
164 				if (!other->rb_right || rb_is_black(other->rb_right))  in __rb_erase_color()
169 					other = parent->rb_right;  in __rb_erase_color()
173 				rb_set_black(other->rb_right);  in __rb_erase_color()
190 			    (!other->rb_right || rb_is_black(other->rb_right)))  in __rb_erase_color()
200 					rb_set_black(other->rb_right);  in __rb_erase_color()
224 		child = node->rb_right;  in rb_erase()
225 	else if (!node->rb_right)  in rb_erase()
231 		node = node->rb_right;  in rb_erase()
239 				rb_parent(old)->rb_right = node;  in rb_erase()
243 		child = node->rb_right;  in rb_erase()
254 			node->rb_right = old->rb_right;  in rb_erase()
255 			rb_set_parent(old->rb_right, node);  in rb_erase()
275 			parent->rb_right = child;  in rb_erase()
296 	if (node == parent->rb_left && parent->rb_right)  in rb_augment_path()
297 		func(parent->rb_right, data);  in rb_augment_path()
313 	else if (node->rb_right)  in rb_augment_insert()
314 		node = node->rb_right;  in rb_augment_insert()
327 	if (!node->rb_right && !node->rb_left)  in rb_augment_erase_begin()
329 	else if (!node->rb_right)  in rb_augment_erase_begin()
332 		deepest = node->rb_right;  in rb_augment_erase_begin()
335 		if (deepest->rb_right)  in rb_augment_erase_begin()
336 			deepest = deepest->rb_right;  in rb_augment_erase_begin()
377 	while (n->rb_right)  in rb_last()
378 		n = n->rb_right;  in rb_last()
392 	if (node->rb_right) {  in rb_next()
393 		node = node->rb_right;   in rb_next()
405 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()
423 		while (node->rb_right)  in rb_prev()
424 			node=node->rb_right;  in rb_prev()
447 			parent->rb_right = new;  in rb_replace_node()
453 	if (victim->rb_right)  in rb_replace_node()
454 		rb_set_parent(victim->rb_right, new);  in rb_replace_node()