Lines Matching refs:fPurgeableQueue
162 fPurgeableQueue.remove(resource); in removeResource()
195 while (fPurgeableQueue.count()) { in abandonAll()
196 GrGpuResource* top = fPurgeableQueue.peek(); in abandonAll()
219 while (fPurgeableQueue.count()) { in releaseAll()
220 GrGpuResource* top = fPurgeableQueue.peek(); in releaseAll()
338 fPurgeableQueue.remove(resource); in refAndMakeResourceMRU()
376 fPurgeableQueue.insert(resource); in notifyCntReachedZero()
467 while (fPurgeableQueue.count()) { in purgeAsNeeded()
468 uint32_t oldestResourceTimestamp = fPurgeableQueue.peek()->cacheAccess().timestamp(); in purgeAsNeeded()
472 GrGpuResource* resource = fPurgeableQueue.peek(); in purgeAsNeeded()
479 while (stillOverbudget && fPurgeableQueue.count()) { in purgeAsNeeded()
480 GrGpuResource* resource = fPurgeableQueue.peek(); in purgeAsNeeded()
499 while (fPurgeableQueue.count()) { in purgeAllUnlocked()
500 GrGpuResource* resource = fPurgeableQueue.peek(); in purgeAllUnlocked()
547 sortedPurgeableResources.setReserve(fPurgeableQueue.count()); in getNextTimestamp()
549 while (fPurgeableQueue.count()) { in getNextTimestamp()
550 *sortedPurgeableResources.append() = fPurgeableQueue.peek(); in getNextTimestamp()
551 fPurgeableQueue.pop(); in getNextTimestamp()
591 fPurgeableQueue.insert(sortedPurgeableResources[i]); in getNextTimestamp()
623 for (int i = 0; i < fPurgeableQueue.count(); ++i) { in dumpMemoryStatistics()
624 fPurgeableQueue.at(i)->dumpMemoryStatistics(traceMemoryDump); in dumpMemoryStatistics()
697 for (int i = 0; i < fPurgeableQueue.count(); ++i) { in validate()
698 SkASSERT(fPurgeableQueue.at(i)->isPurgeable()); in validate()
699 SkASSERT(*fPurgeableQueue.at(i)->cacheAccess().accessCacheIndex() == i); in validate()
700 SkASSERT(!fPurgeableQueue.at(i)->wasDestroyed()); in validate()
701 stats.update(fPurgeableQueue.at(i)); in validate()
732 if (index < fPurgeableQueue.count() && fPurgeableQueue.at(index) == resource) { in isInCache()