Lines Matching defs:fRoot
176 Node* fRoot;
227 fRoot = NULL;
236 RecursiveDelete(fRoot);
256 Node* n = fRoot;
272 Node* n = fRoot;
292 Node* n = fRoot;
310 return onCountOf(fRoot, t);
335 RecursiveDelete(fRoot);
336 fRoot = NULL;
357 Node* n = fRoot;
380 fRoot = x;
424 SkASSERT(fRoot == x);
504 SkASSERT(fRoot == n);
505 fRoot = s;
536 SkASSERT(fRoot == n);
537 fRoot = s;
616 SkASSERT(fRoot == x);
617 fRoot = x->fChildren[c];
618 if (fRoot) {
619 fRoot->fParent = NULL;
620 fRoot->fColor = kBlack_Color;
623 fLast = fRoot;
626 fFirst = fRoot;
738 SkASSERT(fRoot == x);
852 SkASSERT(NULL == fRoot->fParent);
856 SkASSERT(kBlack_Color == fRoot->fColor);
858 SkASSERT(fFirst == fRoot);
859 SkASSERT(fLast == fRoot);
860 SkASSERT(0 == fRoot->fChildren[kLeft_Child]);
861 SkASSERT(0 == fRoot->fChildren[kRight_Child]);
864 SkASSERT(NULL == fRoot);
870 int count = checkNode(fRoot, &bh);
