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