131 		tmp = gparent->rb_right;  in __rb_insert()
155 			tmp = parent->rb_right;  in __rb_insert()
171 				WRITE_ONCE(parent->rb_right, tmp);  in __rb_insert()
179 				tmp = node->rb_right;  in __rb_insert()
193 			WRITE_ONCE(parent->rb_right, gparent);  in __rb_insert()
214 				tmp = node->rb_right;  in __rb_insert()
216 				WRITE_ONCE(node->rb_right, parent);  in __rb_insert()
227 			WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */  in __rb_insert()
256 		sibling = parent->rb_right;  in ____rb_erase_color()
269 				WRITE_ONCE(parent->rb_right, tmp1);  in ____rb_erase_color()
277 			tmp1 = sibling->rb_right;  in ____rb_erase_color()
335 				tmp1 = tmp2->rb_right;  in ____rb_erase_color()
337 				WRITE_ONCE(tmp2->rb_right, sibling);  in ____rb_erase_color()
338 				WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
359 			WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
372 				tmp1 = sibling->rb_right;  in ____rb_erase_color()
374 				WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
383 				tmp2 = sibling->rb_right;  in ____rb_erase_color()
400 				WRITE_ONCE(sibling->rb_right, tmp1);  in ____rb_erase_color()
411 			tmp2 = sibling->rb_right;  in ____rb_erase_color()
413 			WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
522 	while (n->rb_right)  in rb_last()
523 		n = n->rb_right;  in rb_last()
539 	if (node->rb_right) {  in rb_next()
540 		node = node->rb_right;  in rb_next()
553 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()
573 		while (node->rb_right)  in rb_prev()
574 			node=node->rb_right;  in rb_prev()
600 	if (victim->rb_right)  in rb_replace_node()
601 		rb_set_parent(victim->rb_right, new);  in rb_replace_node()
627 	if (victim->rb_right)  in rb_replace_node_rcu()
628 		rb_set_parent(victim->rb_right, new);  in rb_replace_node_rcu()
643 		else if (node->rb_right)  in rb_left_deepest_node()
644 			node = node->rb_right;  in rb_left_deepest_node()
658 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()
661 		return rb_left_deepest_node(parent->rb_right);  in rb_next_postorder()