Lines Matching defs:pc
358 Child pc = kLeft_Child; // suppress uninit warning
364 gpc = pc;
365 pc = fComp(x->fItem, n->fItem) ? kLeft_Child : kRight_Child;
366 first = first && kLeft_Child == pc;
367 last = last && kRight_Child == pc;
370 n = p->fChildren[pc];
386 p->fChildren[pc] = x;
396 // make sure pc and gpc are correct
397 SkASSERT(NULL == p || p->fChildren[pc] == x);
430 pc = (p->fChildren[kLeft_Child] == x) ? kLeft_Child :
448 if (pc != gpc) {
449 if (kRight_Child == pc) {
454 pc = kLeft_Child;
460 pc = kRight_Child;
467 SkASSERT(NULL == p->fChildren[1-pc] ||
468 kBlack_Color == p->fChildren[1-pc]->fColor);
474 if (kLeft_Child == pc) {
639 Child pc;
641 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : kRight_Child;
653 p->fChildren[pc] = NULL;
663 Node* s = p->fChildren[1-pc];
679 // p's child on its pc side. x's children are/were black. The
704 if (kLeft_Child == pc) {
742 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child :
746 s = p->fChildren[1-pc];
766 if (kLeft_Child == pc && !srRed) {
773 } else if (kRight_Child == pc && !slRed) {
781 // now p is either red or black, x and s are red and s's 1-pc
785 // Whether p was red or black, we've increased its pc subtree
791 if (kLeft_Child == pc) {
831 p->fChildren[pc] = c1;
