115 		tmp = gparent->rb_right;  in __rb_insert()
139 			tmp = parent->rb_right;  in __rb_insert()
155 				WRITE_ONCE(parent->rb_right, tmp);  in __rb_insert()
163 				tmp = node->rb_right;  in __rb_insert()
177 			WRITE_ONCE(parent->rb_right, gparent);  in __rb_insert()
198 				tmp = node->rb_right;  in __rb_insert()
200 				WRITE_ONCE(node->rb_right, parent);  in __rb_insert()
211 			WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */  in __rb_insert()
240 		sibling = parent->rb_right;  in ____rb_erase_color()
253 				WRITE_ONCE(parent->rb_right, tmp1);  in ____rb_erase_color()
261 			tmp1 = sibling->rb_right;  in ____rb_erase_color()
319 				tmp1 = tmp2->rb_right;  in ____rb_erase_color()
321 				WRITE_ONCE(tmp2->rb_right, sibling);  in ____rb_erase_color()
322 				WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
343 			WRITE_ONCE(parent->rb_right, tmp2);  in ____rb_erase_color()
356 				tmp1 = sibling->rb_right;  in ____rb_erase_color()
358 				WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
367 				tmp2 = sibling->rb_right;  in ____rb_erase_color()
384 				WRITE_ONCE(sibling->rb_right, tmp1);  in ____rb_erase_color()
395 			tmp2 = sibling->rb_right;  in ____rb_erase_color()
397 			WRITE_ONCE(sibling->rb_right, parent);  in ____rb_erase_color()
486 	while (n->rb_right)  in rb_last()
487 		n = n->rb_right;  in rb_last()
503 	if (node->rb_right) {  in rb_next()
504 		node = node->rb_right;  in rb_next()
517 	while ((parent = rb_parent(node)) && node == parent->rb_right)  in rb_next()
537 		while (node->rb_right)  in rb_prev()
538 			node = node->rb_right;  in rb_prev()
564 	if (victim->rb_right)  in rb_replace_node()
565 		rb_set_parent(victim->rb_right, new);  in rb_replace_node()
581 	if (victim->rb_right)  in rb_replace_node_rcu()
582 		rb_set_parent(victim->rb_right, new);  in rb_replace_node_rcu()
597 		else if (node->rb_right)  in rb_left_deepest_node()
598 			node = node->rb_right;  in rb_left_deepest_node()
612 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()
615 		return rb_left_deepest_node(parent->rb_right);  in rb_next_postorder()