games/trek/autover.c

72

Ship.cond = RED;

games/trek/checkcond.c

88

Ship.cond = RED;

games/trek/initquad.c

77

Ship.cond = RED;

sbin/unwind/libunbound/util/rbtree.c

163

while (node != rbtree->root && node->parent->color == RED) {

sbin/unwind/libunbound/util/rbtree.c

169

if (uncle->color == RED) {

sbin/unwind/libunbound/util/rbtree.c

175

node->parent->parent->color = RED;

sbin/unwind/libunbound/util/rbtree.c

187

node->parent->parent->color = RED;

sbin/unwind/libunbound/util/rbtree.c

194

if (uncle->color == RED) {

sbin/unwind/libunbound/util/rbtree.c

200

node->parent->parent->color = RED;

sbin/unwind/libunbound/util/rbtree.c

212

node->parent->parent->color = RED;

sbin/unwind/libunbound/util/rbtree.c

256

data->color = RED;

sbin/unwind/libunbound/util/rbtree.c

387

if(to_delete->color == RED)

sbin/unwind/libunbound/util/rbtree.c

391

else if(child->color == RED)

sbin/unwind/libunbound/util/rbtree.c

424

if(sibling->color == RED)

sbin/unwind/libunbound/util/rbtree.c

426

child_parent->color = RED;

sbin/unwind/libunbound/util/rbtree.c

442

sibling->color = RED;

sbin/unwind/libunbound/util/rbtree.c

453

if(child_parent->color == RED

sbin/unwind/libunbound/util/rbtree.c

460

sibling->color = RED;

sbin/unwind/libunbound/util/rbtree.c

470

&& sibling->right->color == RED

sbin/unwind/libunbound/util/rbtree.c

473

sibling->color = RED;

sbin/unwind/libunbound/util/rbtree.c

482

&& sibling->left->color == RED

sbin/unwind/libunbound/util/rbtree.c

485

sibling->color = RED;

sbin/unwind/libunbound/util/rbtree.c

498

log_assert(sibling->left->color == RED);

sbin/unwind/libunbound/util/rbtree.c

504

log_assert(sibling->right->color == RED);

usr.sbin/nsd/rbtree.c

136

while (node != rbtree->root && node->parent->color == RED) {

usr.sbin/nsd/rbtree.c

142

if (uncle->color == RED) {

usr.sbin/nsd/rbtree.c

148

node->parent->parent->color = RED;

usr.sbin/nsd/rbtree.c

160

node->parent->parent->color = RED;

usr.sbin/nsd/rbtree.c

167

if (uncle->color == RED) {

usr.sbin/nsd/rbtree.c

173

node->parent->parent->color = RED;

usr.sbin/nsd/rbtree.c

185

node->parent->parent->color = RED;

usr.sbin/nsd/rbtree.c

235

data->color = RED;

usr.sbin/nsd/rbtree.c

377

if(to_delete->color == RED)

usr.sbin/nsd/rbtree.c

381

else if(child->color == RED)

usr.sbin/nsd/rbtree.c

418

if(sibling->color == RED)

usr.sbin/nsd/rbtree.c

420

child_parent->color = RED;

usr.sbin/nsd/rbtree.c

436

sibling->color = RED;

usr.sbin/nsd/rbtree.c

447

if(child_parent->color == RED

usr.sbin/nsd/rbtree.c

454

sibling->color = RED;

usr.sbin/nsd/rbtree.c

464

&& sibling->right->color == RED

usr.sbin/nsd/rbtree.c

467

sibling->color = RED;

usr.sbin/nsd/rbtree.c

476

&& sibling->left->color == RED

usr.sbin/nsd/rbtree.c

479

sibling->color = RED;

usr.sbin/nsd/rbtree.c

492

assert(sibling->left->color == RED);

usr.sbin/nsd/rbtree.c

498

assert(sibling->right->color == RED);

usr.sbin/unbound/util/rbtree.c

163

while (node != rbtree->root && node->parent->color == RED) {

usr.sbin/unbound/util/rbtree.c

169

if (uncle->color == RED) {

usr.sbin/unbound/util/rbtree.c

175

node->parent->parent->color = RED;

usr.sbin/unbound/util/rbtree.c

187

node->parent->parent->color = RED;

usr.sbin/unbound/util/rbtree.c

194

if (uncle->color == RED) {

usr.sbin/unbound/util/rbtree.c

200

node->parent->parent->color = RED;

usr.sbin/unbound/util/rbtree.c

212

node->parent->parent->color = RED;

usr.sbin/unbound/util/rbtree.c

256

data->color = RED;

usr.sbin/unbound/util/rbtree.c

387

if(to_delete->color == RED)

usr.sbin/unbound/util/rbtree.c

391

else if(child->color == RED)

usr.sbin/unbound/util/rbtree.c

424

if(sibling->color == RED)

usr.sbin/unbound/util/rbtree.c

426

child_parent->color = RED;

usr.sbin/unbound/util/rbtree.c

442

sibling->color = RED;

usr.sbin/unbound/util/rbtree.c

453

if(child_parent->color == RED

usr.sbin/unbound/util/rbtree.c

460

sibling->color = RED;

usr.sbin/unbound/util/rbtree.c

470

&& sibling->right->color == RED

usr.sbin/unbound/util/rbtree.c

473

sibling->color = RED;

usr.sbin/unbound/util/rbtree.c

482

&& sibling->left->color == RED

usr.sbin/unbound/util/rbtree.c

485

sibling->color = RED;

usr.sbin/unbound/util/rbtree.c

498

log_assert(sibling->left->color == RED);

usr.sbin/unbound/util/rbtree.c

504

log_assert(sibling->right->color == RED);