118 		tmp = gparent->rb_right;  in __rb_insert()
142 			tmp = parent->rb_right;  in __rb_insert()
157 				WRITE_ONCE(parent->rb_right, tmp);  in __rb_insert()
165 				tmp = node->rb_right;  in __rb_insert()
178 			WRITE_ONCE(parent->rb_right, gparent);  in __rb_insert()
199 				tmp = node->rb_right;  in __rb_insert()
201 				WRITE_ONCE(node->rb_right, parent);  in __rb_insert()
212 			WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */  in __rb_insert()
241 		sibling = parent->rb_right;  in ____rb_erase_color()
254 				WRITE_ONCE(parent->rb_right, tmp1);  in ____rb_erase_color()
262 			tmp1 = sibling->rb_right;  in ____rb_erase_color()
305 				tmp1 = tmp2->rb_right;  in ____rb_erase_color()
307 				WRITE_ONCE(tmp2->rb_right, sibling);  in ____rb_erase_color()
308 				WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
329 			WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
342 				tmp1 = sibling->rb_right;  in ____rb_erase_color()
344 				WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
353 				tmp2 = sibling->rb_right;  in ____rb_erase_color()
370 				WRITE_ONCE(sibling->rb_right, tmp1);  in ____rb_erase_color()
381 			tmp2 = sibling->rb_right;  in ____rb_erase_color()
383 			WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
470 	while (n->rb_right)  in rb_last()
471 		n = n->rb_right;  in rb_last()
487 	if (node->rb_right) {  in rb_next()
488 		node = node->rb_right;   in rb_next()
501 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()
521 		while (node->rb_right)  in rb_prev()
522 			node=node->rb_right;  in rb_prev()
546 	if (victim->rb_right)  in rb_replace_node()
547 		rb_set_parent(victim->rb_right, new);  in rb_replace_node()
559 		else if (node->rb_right)  in rb_left_deepest_node()
560 			node = node->rb_right;  in rb_left_deepest_node()
574 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()
577 		return rb_left_deepest_node(parent->rb_right);  in rb_next_postorder()