156 				tmp = node->rb_left;  in __rb_insert()
158 				WRITE_ONCE(node->rb_left, parent);  in __rb_insert()
177 			WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */  in __rb_insert()
185 			tmp = gparent->rb_left;  in __rb_insert()
196 			tmp = parent->rb_left;  in __rb_insert()
200 				WRITE_ONCE(parent->rb_left, tmp);  in __rb_insert()
208 				tmp = node->rb_left;  in __rb_insert()
213 			WRITE_ONCE(parent->rb_left, gparent);  in __rb_insert()
253 				tmp1 = sibling->rb_left;  in ____rb_erase_color()
255 				WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
264 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
306 				WRITE_ONCE(sibling->rb_left, tmp1);  in ____rb_erase_color()
328 			tmp2 = sibling->rb_left;  in ____rb_erase_color()
330 			WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
339 			sibling = parent->rb_left;  in ____rb_erase_color()
343 				WRITE_ONCE(parent->rb_left, tmp1);  in ____rb_erase_color()
351 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
369 				tmp1 = tmp2->rb_left;  in ____rb_erase_color()
371 				WRITE_ONCE(tmp2->rb_left, sibling);  in ____rb_erase_color()
372 				WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
382 			WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
457 	while (n->rb_left)  in rb_first()
458 		n = n->rb_left;  in rb_first()
489 		while (node->rb_left)  in rb_next()
490 			node=node->rb_left;  in rb_next()
519 	if (node->rb_left) {  in rb_prev()
520 		node = node->rb_left;   in rb_prev()
530 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
544 	if (victim->rb_left)  in rb_replace_node()
545 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
557 		if (node->rb_left)  in rb_left_deepest_node()
558 			node = node->rb_left;  in rb_left_deepest_node()
574 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()