30 	if ((node->rb_right = right->rb_left))  in __rb_rotate_left()
31 		rb_set_parent(right->rb_left, node);  in __rb_rotate_left()
32 	right->rb_left = node;  in __rb_rotate_left()
38 		if (node == parent->rb_left)  in __rb_rotate_left()
39 			parent->rb_left = right;  in __rb_rotate_left()
50 	struct rb_node *left = node->rb_left;  in __rb_rotate_right()
53 	if ((node->rb_left = left->rb_right))  in __rb_rotate_right()
64 			parent->rb_left = left;  in __rb_rotate_right()
79 		if (parent == gparent->rb_left)  in rb_insert_color()
107 				register struct rb_node *uncle = gparent->rb_left;  in rb_insert_color()
118 			if (parent->rb_left == node)  in rb_insert_color()
143 		if (parent->rb_left == node)  in __rb_erase_color()
153 			if ((!other->rb_left || rb_is_black(other->rb_left)) &&  in __rb_erase_color()
165 					if ((o_left = other->rb_left))  in __rb_erase_color()
182 			other = parent->rb_left;  in __rb_erase_color()
188 				other = parent->rb_left;  in __rb_erase_color()
190 			if ((!other->rb_left || rb_is_black(other->rb_left)) &&  in __rb_erase_color()
199 				if (!other->rb_left || rb_is_black(other->rb_left))  in __rb_erase_color()
206 					other = parent->rb_left;  in __rb_erase_color()
210 				if (other->rb_left)  in __rb_erase_color()
211 					rb_set_black(other->rb_left);  in __rb_erase_color()
227 	if (!node->rb_left)  in rb_erase()
230 		child = node->rb_left;  in rb_erase()
236 		while ((left = node->rb_left) != NULL)  in rb_erase()
248 			parent->rb_left = child;  in rb_erase()
252 		node->rb_left = old->rb_left;  in rb_erase()
256 			if (rb_parent(old)->rb_left == old)  in rb_erase()
257 				rb_parent(old)->rb_left = node;  in rb_erase()
263 		rb_set_parent(old->rb_left, node);  in rb_erase()
276 		if (parent->rb_left == node)  in rb_erase()
277 			parent->rb_left = child;  in rb_erase()
299 	while (n->rb_left)  in rb_first()
300 		n = n->rb_left;  in rb_first()
317 		while (node->rb_left)  in rb_next()
318 			node=node->rb_left;  in rb_next()