Lines Matching defs:fRoot
172 Node* fRoot;
223 fRoot = NULL;
232 RecursiveDelete(fRoot);
252 Node* n = fRoot;
268 Node* n = fRoot;
288 Node* n = fRoot;
306 return onCountOf(fRoot, t);
331 RecursiveDelete(fRoot);
332 fRoot = NULL;
353 Node* n = fRoot;
376 fRoot = x;
420 SkASSERT(fRoot == x);
500 SkASSERT(fRoot == n);
501 fRoot = s;
532 SkASSERT(fRoot == n);
533 fRoot = s;
612 SkASSERT(fRoot == x);
613 fRoot = x->fChildren[c];
614 if (NULL != fRoot) {
615 fRoot->fParent = NULL;
616 fRoot->fColor = kBlack_Color;
619 fLast = fRoot;
622 fFirst = fRoot;
734 SkASSERT(fRoot == x);
848 SkASSERT(NULL == fRoot->fParent);
852 SkASSERT(kBlack_Color == fRoot->fColor);
854 SkASSERT(fFirst == fRoot);
855 SkASSERT(fLast == fRoot);
856 SkASSERT(0 == fRoot->fChildren[kLeft_Child]);
857 SkASSERT(0 == fRoot->fChildren[kRight_Child]);
860 SkASSERT(NULL == fRoot);
866 int count = checkNode(fRoot, &bh);
