25 	BLACK			/* Color.  */
119 	while (node != rbtree->root && node->parent->color == RED) {  in rbtree_insert_fixup()
125 			if (uncle->color == RED) {  in rbtree_insert_fixup()
127 				node->parent->color = BLACK;  in rbtree_insert_fixup()
128 				uncle->color = BLACK;  in rbtree_insert_fixup()
131 				node->parent->parent->color = RED;  in rbtree_insert_fixup()
142 				node->parent->color = BLACK;  in rbtree_insert_fixup()
143 				node->parent->parent->color = RED;  in rbtree_insert_fixup()
150 			if (uncle->color == RED) {  in rbtree_insert_fixup()
152 				node->parent->color = BLACK;  in rbtree_insert_fixup()
153 				uncle->color = BLACK;  in rbtree_insert_fixup()
156 				node->parent->parent->color = RED;  in rbtree_insert_fixup()
167 				node->parent->color = BLACK;  in rbtree_insert_fixup()
168 				node->parent->parent->color = RED;  in rbtree_insert_fixup()
173 	rbtree->root->color = BLACK;  in rbtree_insert_fixup()
211 	data->color = RED;  in rbtree_insert()
299 		swap_int8(&to_delete->color, &smright->color);  in rbtree_delete()
337 	if(to_delete->color == RED)  in rbtree_delete()
341 	else if(child->color == RED)  in rbtree_delete()
344 		if(child!=RBTREE_NULL) child->color = BLACK;  in rbtree_delete()
352 	to_delete->color = BLACK;  in rbtree_delete()
373 		if(sibling->color == RED)  in rbtree_delete_fixup()
375 			child_parent->color = RED;  in rbtree_delete_fixup()
376 			sibling->color = BLACK;  in rbtree_delete_fixup()
385 		if(child_parent->color == BLACK  in rbtree_delete_fixup()
386 			&& sibling->color == BLACK  in rbtree_delete_fixup()
387 			&& sibling->left->color == BLACK  in rbtree_delete_fixup()
388 			&& sibling->right->color == BLACK)  in rbtree_delete_fixup()
391 				sibling->color = RED;  in rbtree_delete_fixup()
402 	if(child_parent->color == RED  in rbtree_delete_fixup()
403 		&& sibling->color == BLACK  in rbtree_delete_fixup()
404 		&& sibling->left->color == BLACK  in rbtree_delete_fixup()
405 		&& sibling->right->color == BLACK)  in rbtree_delete_fixup()
409 			sibling->color = RED;  in rbtree_delete_fixup()
410 		child_parent->color = BLACK;  in rbtree_delete_fixup()
418 		&& sibling->color == BLACK  in rbtree_delete_fixup()
419 		&& sibling->right->color == RED  in rbtree_delete_fixup()
420 		&& sibling->left->color == BLACK)  in rbtree_delete_fixup()
422 		sibling->color = RED;  in rbtree_delete_fixup()
423 		sibling->right->color = BLACK;  in rbtree_delete_fixup()
430 		&& sibling->color == BLACK  in rbtree_delete_fixup()
431 		&& sibling->left->color == RED  in rbtree_delete_fixup()
432 		&& sibling->right->color == BLACK)  in rbtree_delete_fixup()
434 		sibling->color = RED;  in rbtree_delete_fixup()
435 		sibling->left->color = BLACK;  in rbtree_delete_fixup()
443 	sibling->color = child_parent->color;  in rbtree_delete_fixup()
444 	child_parent->color = BLACK;  in rbtree_delete_fixup()
447 		assert(sibling->left->color == RED);  in rbtree_delete_fixup()
448 		sibling->left->color = BLACK;  in rbtree_delete_fixup()
453 		assert(sibling->right->color == RED);  in rbtree_delete_fixup()
454 		sibling->right->color = BLACK;  in rbtree_delete_fixup()