123 				parent->rb_right = tmp = node->rb_left;  in __rb_insert()
124 				node->rb_left = parent;  in __rb_insert()
143 			gparent->rb_left = tmp;  /* == parent->rb_right */  in __rb_insert()
151 			tmp = gparent->rb_left;  in __rb_insert()
162 			tmp = parent->rb_left;  in __rb_insert()
165 				parent->rb_left = tmp = node->rb_right;  in __rb_insert()
173 				tmp = node->rb_left;  in __rb_insert()
178 			parent->rb_left = gparent;  in __rb_insert()
218 				parent->rb_right = tmp1 = sibling->rb_left;  in ____rb_erase_color()
219 				sibling->rb_left = parent;  in ____rb_erase_color()
228 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
269 				sibling->rb_left = tmp1 = tmp2->rb_right;  in ____rb_erase_color()
291 			parent->rb_right = tmp2 = sibling->rb_left;  in ____rb_erase_color()
292 			sibling->rb_left = parent;  in ____rb_erase_color()
301 			sibling = parent->rb_left;  in ____rb_erase_color()
304 				parent->rb_left = tmp1 = sibling->rb_right;  in ____rb_erase_color()
312 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
330 				sibling->rb_right = tmp1 = tmp2->rb_left;  in ____rb_erase_color()
331 				tmp2->rb_left = sibling;  in ____rb_erase_color()
332 				parent->rb_left = tmp2;  in ____rb_erase_color()
341 			parent->rb_left = tmp2 = sibling->rb_right;  in ____rb_erase_color()
416 	while (n->rb_left)  in rb_first()
417 		n = n->rb_left;  in rb_first()
448 		while (node->rb_left)  in rb_next()
449 			node=node->rb_left;  in rb_next()
478 	if (node->rb_left) {  in rb_prev()
479 		node = node->rb_left;   in rb_prev()
489 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
503 	if (victim->rb_left)  in rb_replace_node()
504 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
516 		if (node->rb_left)  in rb_left_deepest_node()
517 			node = node->rb_left;  in rb_left_deepest_node()
533 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()