unbound/util/rbtree.c

163 	while (node != rbtree->root && node->parent->color == RED) {
169 			if (uncle->color == RED) {
171 				node->parent->color = BLACK;
172 				uncle->color = BLACK;
175 				node->parent->parent->color = RED;
186 				node->parent->color = BLACK;
187 				node->parent->parent->color = RED;
194 			if (uncle->color == RED) {
196 				node->parent->color = BLACK;
197 				uncle->color = BLACK;
200 				node->parent->parent->color = RED;
211 				node->parent->color = BLACK;
212 				node->parent->parent->color = RED;
217 	rbtree->root->color = BLACK;
256 	data->color = RED;
349 		swap_int8(&to_delete->color, &smright->color);
387 	if(to_delete->color == RED)
391 	else if(child->color == RED)
394 		if(child!=RBTREE_NULL) child->color = BLACK;
402 	to_delete->color = BLACK;
424 		if(sibling->color == RED)
426 			child_parent->color = RED;
427 			sibling->color = BLACK;
436 		if(child_parent->color == BLACK
437 			&& sibling->color == BLACK
438 			&& sibling->left->color == BLACK
439 			&& sibling->right->color == BLACK)
442 				sibling->color = RED;
453 	if(child_parent->color == RED
454 		&& sibling->color == BLACK
455 		&& sibling->left->color == BLACK
456 		&& sibling->right->color == BLACK)
460 			sibling->color = RED;
461 		child_parent->color = BLACK;
469 		&& sibling->color == BLACK
470 		&& sibling->right->color == RED
471 		&& sibling->left->color == BLACK)
473 		sibling->color = RED;
474 		sibling->right->color = BLACK;
481 		&& sibling->color == BLACK
482 		&& sibling->left->color == RED
483 		&& sibling->right->color == BLACK)
485 		sibling->color = RED;
486 		sibling->left->color = BLACK;
494 	sibling->color = child_parent->color;
495 	child_parent->color = BLACK;
498 		log_assert(sibling->left->color == RED);
499 		sibling->left->color = BLACK;
504 		log_assert(sibling->right->color == RED);
505 		sibling->right->color = BLACK;