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