44 	node->parent = node->right = node->left = NULL;  in rbnode_construct()
57 	rbnode_destruct(node->left, d);  in rbnode_destruct()
69 	int ileftdepth = (node->left) ? rbnode_depth(node->left) : 0;  in rbnode_depth()
80 	while (node->left)  in rbnode_minimum()
81 		node = node->left;  in rbnode_minimum()
118 		while (succ_node->left)  in rbnode_successor()
119 			succ_node = succ_node->left;  in rbnode_successor()
143 	if (node->left) {  in rbnode_predecessor()
150 		pred_node = node->left;  in rbnode_predecessor()
161 		while (pred_node && prev_node == pred_node->left) {  in rbnode_predecessor()
189 	if (node->left) {  in rbnode_duplicate()
190 		dup_node->left = rbnode_duplicate(node->left);  in rbnode_duplicate()
191 		dup_node->left->parent = dup_node;  in rbnode_duplicate()
193 		dup_node->left = NULL;  in rbnode_duplicate()
205 	rbnode_traverse(node->left, op);  in rbnode_traverse()
321 			if (!(cur_node->left)) {  in rbtree_insert()
325 				cur_node->left = new_node;  in rbtree_insert()
330 				cur_node = cur_node->left;  in rbtree_insert()
389 		parent->left = new_node;  in insert_successor_at()
402 			parent->left = new_node;  in insert_successor_at()
457 		if (!(at_node->left)) {  in insert_predecessor_at()
459 			parent->left = new_node;  in insert_predecessor_at()
461 			parent = rbnode_maximum(at_node->left);  in insert_predecessor_at()
502 	if (node->left && node->right) {  in rbtree_remove_at()
518 		rb_node *succ_left = succ_node->left;  in rbtree_remove_at()
523 		succ_node->left = node->left;  in rbtree_remove_at()
528 		node->left = succ_left;  in rbtree_remove_at()
533 			if (succ_node == node->parent->left)  in rbtree_remove_at()
534 				node->parent->left = node;  in rbtree_remove_at()
539 		if (node->left)  in rbtree_remove_at()
540 			node->left->parent = node;  in rbtree_remove_at()
545 			if (node == succ_node->parent->left)  in rbtree_remove_at()
546 				succ_node->parent->left = succ_node;  in rbtree_remove_at()
553 		if (succ_node->left)  in rbtree_remove_at()
554 			succ_node->left->parent = succ_node;  in rbtree_remove_at()
562 	child = (node->left) ? node->left : node->right;  in rbtree_remove_at()
577 		if (node == node->parent->left)  in rbtree_remove_at()
578 			node->parent->left = child;  in rbtree_remove_at()
593 	node->left = NULL;  in rbtree_remove_at()
638 		cur_node = (comp_result > 0) ? cur_node->left : cur_node->right;  in rbtree_find()
651 	x_node->right = y_node->left;  in rbtree_rotate_left()
654 	if (y_node->left != NULL)  in rbtree_rotate_left()
655 		y_node->left->parent = x_node;  in rbtree_rotate_left()
665 		if (x_node == x_node->parent->left)  in rbtree_rotate_left()
666 			x_node->parent->left = y_node;  in rbtree_rotate_left()
672 	y_node->left = x_node;  in rbtree_rotate_left()
681 	rb_node *x_node = y_node->left;  in rbtree_rotate_right()
684 	y_node->left = x_node->right;  in rbtree_rotate_right()
698 		if (y_node == y_node->parent->left)  in rbtree_rotate_right()
699 			y_node->parent->left = x_node;  in rbtree_rotate_right()
731 		if (curr_node->parent == grandparent->left) {  in rbtree_insert_fixup()
777 			uncle = grandparent->left;  in rbtree_insert_fixup()
798 				if (curr_node == curr_node->parent->left) {  in rbtree_insert_fixup()
831 		if (curr_node == curr_node->parent->left) {  in rbtree_remove_fixup()
854 			    (!(sibling->left) || sibling->left->color == black)  in rbtree_remove_fixup()
945 			sibling = curr_node->parent->left;  in rbtree_remove_fixup()
961 				sibling = curr_node->parent->left;  in rbtree_remove_fixup()
965 			    (!(sibling->left) || sibling->left->color == black)  in rbtree_remove_fixup()
1009 					if (sibling->left  in rbtree_remove_fixup()
1010 					    && sibling->left->color == red) {  in rbtree_remove_fixup()
1017 						sibling->left->color = black;  in rbtree_remove_fixup()
1033 						    curr_node->parent->left;  in rbtree_remove_fixup()