132 				parent->rb_right = tmp = node->rb_left;  in __rb_insert()
133 				node->rb_left = parent;  in __rb_insert()
152 			gparent->rb_left = tmp;  /* == parent->rb_right */  in __rb_insert()
160 			tmp = gparent->rb_left;  in __rb_insert()
171 			tmp = parent->rb_left;  in __rb_insert()
174 				parent->rb_left = tmp = node->rb_right;  in __rb_insert()
182 				tmp = node->rb_left;  in __rb_insert()
187 			parent->rb_left = gparent;  in __rb_insert()
227 				parent->rb_right = tmp1 = sibling->rb_left;  in ____rb_erase_color()
228 				sibling->rb_left = parent;  in ____rb_erase_color()
237 				tmp2 = sibling->rb_left;  in ____rb_erase_color()
278 				sibling->rb_left = tmp1 = tmp2->rb_right;  in ____rb_erase_color()
300 			parent->rb_right = tmp2 = sibling->rb_left;  in ____rb_erase_color()
301 			sibling->rb_left = parent;  in ____rb_erase_color()
310 			sibling = parent->rb_left;  in ____rb_erase_color()
313 				parent->rb_left = tmp1 = sibling->rb_right;  in ____rb_erase_color()
321 			tmp1 = sibling->rb_left;  in ____rb_erase_color()
339 				sibling->rb_right = tmp1 = tmp2->rb_left;  in ____rb_erase_color()
340 				tmp2->rb_left = sibling;  in ____rb_erase_color()
341 				parent->rb_left = tmp2;  in ____rb_erase_color()
350 			parent->rb_left = tmp2 = sibling->rb_right;  in ____rb_erase_color()
425 	while (n->rb_left)  in rb_first()
426 		n = n->rb_left;  in rb_first()
457 		while (node->rb_left)  in rb_next()
458 			node=node->rb_left;  in rb_next()
487 	if (node->rb_left) {  in rb_prev()
488 		node = node->rb_left;   in rb_prev()
498 	while ((parent = rb_parent(node)) && node == parent->rb_left)  in rb_prev()
512 	if (victim->rb_left)  in rb_replace_node()
513 		rb_set_parent(victim->rb_left, new);  in rb_replace_node()
525 		if (node->rb_left)  in rb_left_deepest_node()
526 			node = node->rb_left;  in rb_left_deepest_node()
542 	if (parent && node == parent->rb_left && parent->rb_right) {  in rb_next_postorder()