154 				tmp = node->rb_left;  in __rb_insert()
156 				WRITE_ONCE(node->rb_left, parent);  in __rb_insert()
176 			WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */  in __rb_insert()
184 			tmp = gparent->rb_left;  in __rb_insert()
195 			tmp = parent->rb_left;  in __rb_insert()
199 				WRITE_ONCE(parent->rb_left, tmp);  in __rb_insert()
207 				tmp = node->rb_left;  in __rb_insert()
212 			WRITE_ONCE(parent->rb_left, gparent);  in __rb_insert()
252 				tmp1 = sibling->rb_left;  in ____rb_erase_color()
254 				WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
263 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
320 				WRITE_ONCE(sibling->rb_left, tmp1);  in ____rb_erase_color()
342 			tmp2 = sibling->rb_left;  in ____rb_erase_color()
344 			WRITE_ONCE(sibling->rb_left, parent);  in ____rb_erase_color()
353 			sibling = parent->rb_left;  in ____rb_erase_color()
357 				WRITE_ONCE(parent->rb_left, tmp1);  in ____rb_erase_color()
365 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
383 				tmp1 = tmp2->rb_left;  in ____rb_erase_color()
385 				WRITE_ONCE(tmp2->rb_left, sibling);  in ____rb_erase_color()
386 				WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
396 			WRITE_ONCE(parent->rb_left, tmp2);  in ____rb_erase_color()
469 	while (n->rb_left)  in rb_first()
470 		n = n->rb_left;  in rb_first()
499 		while (node->rb_left)  in rb_next()
500 			node = node->rb_left;  in rb_next()
528 	if (node->rb_left) {  in rb_prev()
529 		node = node->rb_left;  in rb_prev()
539 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
554 	if (victim->rb_left)  in rb_replace_node()
555 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
564 		if (node->rb_left)  in rb_left_deepest_node()
565 			node = node->rb_left;  in rb_left_deepest_node()
581 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()