Lines Matching refs:fParent
146 Node* fParent;
380 x->fParent = NULL;
386 x->fParent = p;
419 p = x->fParent;
427 gp = p->fParent;
492 Node* d = n->fParent;
505 s->fParent = d;
507 n->fParent = s;
510 b->fParent = n;
524 Node* d = n->fParent;
537 s->fParent = d;
539 n->fParent = s;
542 b->fParent = n;
563 while (NULL != x->fParent && x == x->fParent->fChildren[kRight_Child]) {
564 x = x->fParent;
566 return x->fParent;
579 while (NULL != x->fParent && x == x->fParent->fChildren[kLeft_Child]) {
580 x = x->fParent;
582 return x->fParent;
611 } else if (NULL == x->fParent) {
617 fRoot->fParent = NULL;
638 Node* p = x->fParent;
667 GrAssert(p == s->fParent);
684 GrAssert(p == s->fParent);
685 GrAssert(NULL == x || x->fParent == p);
715 GrAssert(p == s->fParent);
716 GrAssert(NULL == x || p == x->fParent);
734 p = x->fParent;
746 GrAssert(p == s->fParent);
828 c1->fParent = p;
850 GrAssert(NULL == fRoot->fParent);
902 if (n->fChildren[kLeft_Child] == n->fParent &&
903 NULL != n->fParent) {
906 if (n->fChildren[kRight_Child] == n->fParent &&
907 NULL != n->fParent) {
916 if (n->fChildren[kLeft_Child]->fParent != n) {
931 if (n->fChildren[kRight_Child]->fParent != n) {
