122 				parent->rb_right = tmp = node->rb_left;  in __rb_insert()
123 				node->rb_left = parent;  in __rb_insert()
142 			gparent->rb_left = tmp;  /* == parent->rb_right */  in __rb_insert()
150 			tmp = gparent->rb_left;  in __rb_insert()
161 			tmp = parent->rb_left;  in __rb_insert()
164 				parent->rb_left = tmp = node->rb_right;  in __rb_insert()
172 				tmp = node->rb_left;  in __rb_insert()
177 			parent->rb_left = gparent;  in __rb_insert()
217 				parent->rb_right = tmp1 = sibling->rb_left;  in ____rb_erase_color()
218 				sibling->rb_left = parent;  in ____rb_erase_color()
227 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
268 				sibling->rb_left = tmp1 = tmp2->rb_right;  in ____rb_erase_color()
290 			parent->rb_right = tmp2 = sibling->rb_left;  in ____rb_erase_color()
291 			sibling->rb_left = parent;  in ____rb_erase_color()
300 			sibling = parent->rb_left;  in ____rb_erase_color()
303 				parent->rb_left = tmp1 = sibling->rb_right;  in ____rb_erase_color()
311 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
329 				sibling->rb_right = tmp1 = tmp2->rb_left;  in ____rb_erase_color()
330 				tmp2->rb_left = sibling;  in ____rb_erase_color()
331 				parent->rb_left = tmp2;  in ____rb_erase_color()
340 			parent->rb_left = tmp2 = sibling->rb_right;  in ____rb_erase_color()
415 	while (n->rb_left)  in rb_first()
416 		n = n->rb_left;  in rb_first()
447 		while (node->rb_left)  in rb_next()
448 			node=node->rb_left;  in rb_next()
477 	if (node->rb_left) {  in rb_prev()
478 		node = node->rb_left;   in rb_prev()
488 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
502 	if (victim->rb_left)  in rb_replace_node()
503 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
515 		if (node->rb_left)  in rb_left_deepest_node()
516 			node = node->rb_left;  in rb_left_deepest_node()
532 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()