Lines Matching defs:fChildren
145 Node* fChildren[2];
255 n = n->fChildren[kLeft_Child];
260 n = n->fChildren[kRight_Child];
272 n = n->fChildren[kLeft_Child];
277 n = n->fChildren[kLeft_Child];
279 n = n->fChildren[kRight_Child];
292 n = n->fChildren[kLeft_Child];
298 n = n->fChildren[kRight_Child];
314 n = n->fChildren[kLeft_Child];
318 count += onCountOf(n->fChildren[kLeft_Child], t);
319 count += onCountOf(n->fChildren[kRight_Child], t);
322 n = n->fChildren[kRight_Child];
345 x->fChildren[kLeft_Child] = NULL;
346 x->fChildren[kRight_Child] = NULL;
366 n = p->fChildren[pc];
382 p->fChildren[pc] = x;
393 SkASSERT(NULL == p || p->fChildren[pc] == x);
394 SkASSERT(NULL == gp || gp->fChildren[gpc] == p);
408 Node* u = gp->fChildren[1-gpc];
426 pc = (p->fChildren[kLeft_Child] == x) ? kLeft_Child :
429 gpc = (gp->fChildren[kLeft_Child] == p) ? kLeft_Child :
437 SkASSERT(NULL == gp->fChildren[1-gpc] || kBlack_Color == gp->fChildren[1-gpc]->fColor);
463 SkASSERT(NULL == p->fChildren[1-pc] ||
464 kBlack_Color == p->fChildren[1-pc]->fColor);
491 Node* s = n->fChildren[kLeft_Child];
493 Node* b = s->fChildren[kRight_Child];
496 Child c = d->fChildren[kLeft_Child] == n ? kLeft_Child :
498 d->fChildren[c] = s;
504 s->fChildren[kRight_Child] = n;
506 n->fChildren[kLeft_Child] = b;
514 GR_DEBUGASSERT(validateChildRelations(n->fChildren[kRight_Child], true));
516 GR_DEBUGASSERT(validateChildRelations(s->fChildren[kLeft_Child], true));
523 Node* s = n->fChildren[kRight_Child];
525 Node* b = s->fChildren[kLeft_Child];
528 Child c = d->fChildren[kRight_Child] == n ? kRight_Child :
530 d->fChildren[c] = s;
536 s->fChildren[kLeft_Child] = n;
538 n->fChildren[kRight_Child] = b;
546 GR_DEBUGASSERT(validateChildRelations(n->fChildren[kLeft_Child], true));
548 GR_DEBUGASSERT(validateChildRelations(s->fChildren[kRight_Child], true));
554 if (NULL != x->fChildren[kRight_Child]) {
555 x = x->fChildren[kRight_Child];
556 while (NULL != x->fChildren[kLeft_Child]) {
557 x = x->fChildren[kLeft_Child];
561 while (NULL != x->fParent && x == x->fParent->fChildren[kRight_Child]) {
570 if (NULL != x->fChildren[kLeft_Child]) {
571 x = x->fChildren[kLeft_Child];
572 while (NULL != x->fChildren[kRight_Child]) {
573 x = x->fChildren[kRight_Child];
577 while (NULL != x->fParent && x == x->fParent->fChildren[kLeft_Child]) {
589 bool hasLeft = NULL != x->fChildren[kLeft_Child];
590 bool hasRight = NULL != x->fChildren[kRight_Child];
599 Node* s = x->fChildren[kRight_Child];
600 while (NULL != s->fChildren[kLeft_Child]) {
601 s = s->fChildren[kLeft_Child];
613 fRoot = x->fChildren[c];
637 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : kRight_Child;
639 if (NULL == x->fChildren[c]) {
649 p->fChildren[pc] = NULL;
659 Node* s = p->fChildren[1-pc];
686 sl = s->fChildren[kLeft_Child];
687 sr = s->fChildren[kRight_Child];
707 sl = s->fChildren[kLeft_Child];
708 sr = s->fChildren[kRight_Child];
738 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child :
742 s = p->fChildren[1-pc];
768 //sl = s->fChildren[kLeft_Child]; don't need this
775 //sr = s->fChildren[kRight_Child]; don't need this
807 SkASSERT(kRed_Color == x->fChildren[c]->fColor);
810 Node* c1 = x->fChildren[c];
814 while (NULL != fFirst->fChildren[kLeft_Child]) {
815 fFirst = fFirst->fChildren[kLeft_Child];
821 while (NULL != fLast->fChildren[kRight_Child]) {
822 fLast = fLast->fChildren[kRight_Child];
827 p->fChildren[pc] = c1;
838 RecursiveDelete(x->fChildren[kLeft_Child]);
839 RecursiveDelete(x->fChildren[kRight_Child]);
856 SkASSERT(0 == fRoot->fChildren[kLeft_Child]);
857 SkASSERT(0 == fRoot->fChildren[kRight_Child]);
882 int cl = checkNode(n->fChildren[kLeft_Child], &leftBh);
883 int cr = checkNode(n->fChildren[kRight_Child], &rightBh);
895 if (NULL != n->fChildren[kLeft_Child] ||
896 NULL != n->fChildren[kRight_Child]) {
897 if (n->fChildren[kLeft_Child] == n->fChildren[kRight_Child]) {
900 if (n->fChildren[kLeft_Child] == n->fParent &&
904 if (n->fChildren[kRight_Child] == n->fParent &&
908 if (NULL != n->fChildren[kLeft_Child]) {
910 kRed_Color == n->fChildren[kLeft_Child]->fColor &&
914 if (n->fChildren[kLeft_Child]->fParent != n) {
917 if (!(fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) ||
918 (!fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) &&
919 !fComp(n->fItem, n->fChildren[kLeft_Child]->fItem)))) {
923 if (NULL != n->fChildren[kRight_Child]) {
925 kRed_Color == n->fChildren[kRight_Child]->fColor &&
929 if (n->fChildren[kRight_Child]->fParent != n) {
932 if (!(fComp(n->fItem, n->fChildren[kRight_Child]->fItem) ||
933 (!fComp(n->fChildren[kRight_Child]->fItem, n->fItem) &&
934 !fComp(n->fItem, n->fChildren[kRight_Child]->fItem)))) {
