131 				parent->rb_right = tmp = node->rb_left;  in __rb_insert()
132 				node->rb_left = parent;  in __rb_insert()
151 			gparent->rb_left = tmp;  /* == parent->rb_right */  in __rb_insert()
159 			tmp = gparent->rb_left;  in __rb_insert()
170 			tmp = parent->rb_left;  in __rb_insert()
173 				parent->rb_left = tmp = node->rb_right;  in __rb_insert()
181 				tmp = node->rb_left;  in __rb_insert()
186 			parent->rb_left = gparent;  in __rb_insert()
226 				parent->rb_right = tmp1 = sibling->rb_left;  in ____rb_erase_color()
227 				sibling->rb_left = parent;  in ____rb_erase_color()
236 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
277 				sibling->rb_left = tmp1 = tmp2->rb_right;  in ____rb_erase_color()
299 			parent->rb_right = tmp2 = sibling->rb_left;  in ____rb_erase_color()
300 			sibling->rb_left = parent;  in ____rb_erase_color()
309 			sibling = parent->rb_left;  in ____rb_erase_color()
312 				parent->rb_left = tmp1 = sibling->rb_right;  in ____rb_erase_color()
320 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
338 				sibling->rb_right = tmp1 = tmp2->rb_left;  in ____rb_erase_color()
339 				tmp2->rb_left = sibling;  in ____rb_erase_color()
340 				parent->rb_left = tmp2;  in ____rb_erase_color()
349 			parent->rb_left = tmp2 = sibling->rb_right;  in ____rb_erase_color()
420 	while (n->rb_left)  in rb_first()
421 		n = n->rb_left;  in rb_first()
450 		while (node->rb_left)  in rb_next()
451 			node=node->rb_left;  in rb_next()
479 	if (node->rb_left) {  in rb_prev()
480 		node = node->rb_left;  in rb_prev()
490 	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()
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()