717 	rb_node *curr_node = node;  in rbtree_insert_fixup()  local
723 	while (curr_node != tree->root && curr_node->parent->color == red) {  in rbtree_insert_fixup()
729 		grandparent = curr_node->parent->parent;  in rbtree_insert_fixup()
731 		if (curr_node->parent == grandparent->left) {  in rbtree_insert_fixup()
744 				curr_node->parent->color = black;  in rbtree_insert_fixup()
749 				curr_node = grandparent;  in rbtree_insert_fixup()
757 				if (curr_node == curr_node->parent->right) {  in rbtree_insert_fixup()
758 					curr_node = curr_node->parent;  in rbtree_insert_fixup()
759 					rbtree_rotate_left(tree, curr_node);  in rbtree_insert_fixup()
765 				curr_node->parent->color = black;  in rbtree_insert_fixup()
785 				curr_node->parent->color = black;  in rbtree_insert_fixup()
790 				curr_node = grandparent;  in rbtree_insert_fixup()
798 				if (curr_node == curr_node->parent->left) {  in rbtree_insert_fixup()
799 					curr_node = curr_node->parent;  in rbtree_insert_fixup()
800 					rbtree_rotate_right(tree, curr_node);  in rbtree_insert_fixup()
806 				curr_node->parent->color = black;  in rbtree_insert_fixup()
823 	rb_node *curr_node = node;  in rbtree_remove_fixup()  local
826 	while (curr_node != tree->root && curr_node->color == black) {  in rbtree_remove_fixup()
831 		if (curr_node == curr_node->parent->left) {  in rbtree_remove_fixup()
835 			sibling = curr_node->parent->right;  in rbtree_remove_fixup()
848 				curr_node->parent->color = red;  in rbtree_remove_fixup()
849 				rbtree_rotate_left(tree, curr_node->parent);  in rbtree_remove_fixup()
850 				sibling = curr_node->parent->right;  in rbtree_remove_fixup()
861 				if (curr_node->parent->color == red) {  in rbtree_remove_fixup()
867 					curr_node->parent->color = black;  in rbtree_remove_fixup()
869 					curr_node = tree->root;  in rbtree_remove_fixup()
876 					curr_node = curr_node->parent;  in rbtree_remove_fixup()
883 					if (curr_node->parent->color == red) {  in rbtree_remove_fixup()
884 						curr_node->parent->color =  in rbtree_remove_fixup()
888 						curr_node = tree->root;  in rbtree_remove_fixup()
890 						curr_node = curr_node->parent;  in rbtree_remove_fixup()
909 								   curr_node->  in rbtree_remove_fixup()
923 						    curr_node->parent->right;  in rbtree_remove_fixup()
932 					if (curr_node->parent->parent)  in rbtree_remove_fixup()
933 						curr_node->parent->parent->  in rbtree_remove_fixup()
935 						    curr_node->parent->color;  in rbtree_remove_fixup()
936 					curr_node->parent->color = black;  in rbtree_remove_fixup()
938 					curr_node = tree->root;  in rbtree_remove_fixup()
945 			sibling = curr_node->parent->left;  in rbtree_remove_fixup()
958 				curr_node->parent->color = red;  in rbtree_remove_fixup()
959 				rbtree_rotate_right(tree, curr_node->parent);  in rbtree_remove_fixup()
961 				sibling = curr_node->parent->left;  in rbtree_remove_fixup()
970 				if (curr_node->parent->color == red) {  in rbtree_remove_fixup()
976 					curr_node->parent->color = black;  in rbtree_remove_fixup()
980 					curr_node = tree->root;  in rbtree_remove_fixup()
987 					curr_node = curr_node->parent;  in rbtree_remove_fixup()
993 					if (curr_node->parent->color == red) {  in rbtree_remove_fixup()
994 						curr_node->parent->color =  in rbtree_remove_fixup()
998 						curr_node = tree->root;  in rbtree_remove_fixup()
1000 						curr_node = curr_node->parent;  in rbtree_remove_fixup()
1019 								    curr_node->  in rbtree_remove_fixup()
1033 						    curr_node->parent->left;  in rbtree_remove_fixup()
1042 					if (curr_node->parent->parent)  in rbtree_remove_fixup()
1043 						curr_node->parent->parent->  in rbtree_remove_fixup()
1045 						    curr_node->parent->color;  in rbtree_remove_fixup()
1046 					curr_node->parent->color = black;  in rbtree_remove_fixup()
1048 					curr_node = tree->root;  in rbtree_remove_fixup()
1055 	curr_node->color = black;  in rbtree_remove_fixup()