292 		new_node = rbnode_construct(object, black);  in rbtree_insert()
369 		new_node = rbnode_construct(object, black);  in insert_successor_at()
429 		new_node = rbnode_construct(object, black);  in insert_predecessor_at()
587 	if (node->color == black && child)  in rbtree_remove_at()
744 				curr_node->parent->color = black;  in rbtree_insert_fixup()
745 				uncle->color = black;  in rbtree_insert_fixup()
765 				curr_node->parent->color = black;  in rbtree_insert_fixup()
785 				curr_node->parent->color = black;  in rbtree_insert_fixup()
786 				uncle->color = black;  in rbtree_insert_fixup()
806 				curr_node->parent->color = black;  in rbtree_insert_fixup()
818 	tree->root->color = black;  in rbtree_insert_fixup()
826 	while (curr_node != tree->root && curr_node->color == black) {  in rbtree_remove_fixup()
847 				sibling->color = black;  in rbtree_remove_fixup()
854 			    (!(sibling->left) || sibling->left->color == black)  in rbtree_remove_fixup()
856 				|| sibling->right->color == black)) {  in rbtree_remove_fixup()
867 					curr_node->parent->color = black;  in rbtree_remove_fixup()
885 						    black;  in rbtree_remove_fixup()
907 						sibling->right->color = black;  in rbtree_remove_fixup()
936 					curr_node->parent->color = black;  in rbtree_remove_fixup()
957 				sibling->color = black;  in rbtree_remove_fixup()
965 			    (!(sibling->left) || sibling->left->color == black)  in rbtree_remove_fixup()
967 				|| sibling->right->color == black)) {  in rbtree_remove_fixup()
976 					curr_node->parent->color = black;  in rbtree_remove_fixup()
995 						    black;  in rbtree_remove_fixup()
1017 						sibling->left->color = black;  in rbtree_remove_fixup()
1046 					curr_node->parent->color = black;  in rbtree_remove_fixup()
1055 	curr_node->color = black;  in rbtree_remove_fixup()