130           fRight(right) {  in SparseNameTree()
132         SkASSERT(fRight.get());  in SparseNameTree()
144         if (fLeft->end() + 1 == fRight->first()) {  in internalAllocate()
147             fRight.reset(fRight->removeLeftmostContiguousRange(&removedCount));  in internalAllocate()
149             if (NULL == fRight.get()) {  in internalAllocate()
158         SkASSERT(fLeft->end() + 1 < fRight->first());  in internalAllocate()
166             return fRight.detach();  in removeLeftmostContiguousRange()
174         GrGLuint name = fRight->appendNames(count);  in appendNames()
175         SkASSERT(fRight->end() == fEnd + count);  in appendNames()
193                 return fRight.detach();  in free()
198             fRight.reset(fRight->free(name));  in free()
199             if (NULL == fRight) {  in free()
212         if (fLeft->height() > fRight->height() + 1) {  in rebalance()
213             return this->rebalanceImpl<&SparseNameTree::fLeft, &SparseNameTree::fRight>();  in rebalance()
215         if (fRight->height() > fLeft->height() + 1) {  in rebalance()
216             return this->rebalanceImpl<&SparseNameTree::fRight, &SparseNameTree::fLeft>();  in rebalance()
260         SkASSERT(fLeft->end() < fRight->first()); // There must be a gap between left and right.  in updateStats()
262         fEnd = fRight->end();  in updateStats()
263         fHeight = 1 + SkMax32(fLeft->height(), fRight->height());  in updateStats()
267     SkAutoTUnref<SparseNameRange> fRight;  member in GrGLNameAllocator::SparseNameTree