170 				tmp = node->rb_left;  in __rb_insert()
172 				WRITE_ONCE(node->rb_left, parent);  in __rb_insert()
192 			WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */  in __rb_insert()
200 			tmp = gparent->rb_left;  in __rb_insert()
211 			tmp = parent->rb_left;  in __rb_insert()
215 				WRITE_ONCE(parent->rb_left, tmp);  in __rb_insert()
223 				tmp = node->rb_left;  in __rb_insert()
228 			WRITE_ONCE(parent->rb_left, gparent);  in __rb_insert()
268 				tmp1 = sibling->rb_left;  in ____rb_erase_color()
270 				WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
279 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
336 				WRITE_ONCE(sibling->rb_left, tmp1);  in ____rb_erase_color()
358 			tmp2 = sibling->rb_left;  in ____rb_erase_color()
360 			WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
369 			sibling = parent->rb_left;  in ____rb_erase_color()
373 				WRITE_ONCE(parent->rb_left, tmp1);  in ____rb_erase_color()
381 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
399 				tmp1 = tmp2->rb_left;  in ____rb_erase_color()
401 				WRITE_ONCE(tmp2->rb_left, sibling);  in ____rb_erase_color()
402 				WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
412 			WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
509 	while (n->rb_left)  in rb_first()
510 		n = n->rb_left;  in rb_first()
541 		while (node->rb_left)  in rb_next()
542 			node=node->rb_left;  in rb_next()
571 	if (node->rb_left) {  in rb_prev()
572 		node = node->rb_left;  in rb_prev()
582 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
598 	if (victim->rb_left)  in rb_replace_node()
599 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
625 	if (victim->rb_left)  in rb_replace_node_rcu()
626 		rb_set_parent(victim->rb_left, new);  in rb_replace_node_rcu()
641 		if (node->rb_left)  in rb_left_deepest_node()
642 			node = node->rb_left;  in rb_left_deepest_node()
658 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()