Add onMemoryDump to GrContext

src/gpu/GrResourceCache.cpp

 
 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #include "GrResourceCache.h"
@@ skipping 546 matching lines @@
                 }
             };
             Less less;
             SkTQSort(fNonpurgeableResources.begin(), fNonpurgeableResources.end() - 1, less);
 
             // Pick resources out of the purgeable and non-purgeable arrays based on lowest
             // timestamp and assign new timestamps.
             int currP = 0;
             int currNP = 0;
             while (currP < sortedPurgeableResources.count() &&
-                   currNP < fNonpurgeableResources.count()) {                
+                   currNP < fNonpurgeableResources.count()) {
                 uint32_t tsP = sortedPurgeableResources[currP]->cacheAccess().timestamp();
                 uint32_t tsNP = fNonpurgeableResources[currNP]->cacheAccess().timestamp();
                 SkASSERT(tsP != tsNP);
                 if (tsP < tsNP) {
                     sortedPurgeableResources[currP++]->cacheAccess().setTimestamp(fTimestamp++);
                 } else {
                     // Correct the index in the nonpurgeable array stored on the resource post-sort.
                     *fNonpurgeableResources[currNP]->cacheAccess().accessCacheIndex() = currNP;
                     fNonpurgeableResources[currNP++]->cacheAccess().setTimestamp(fTimestamp++);
                 }
@@ skipping 11 matching lines @@
             // Rebuild the queue.
             for (int i = 0; i < sortedPurgeableResources.count(); ++i) {
                 fPurgeableQueue.insert(sortedPurgeableResources[i]);
             }
 
             this->validate();
             SkASSERT(count == this->getResourceCount());
 
             // count should be the next timestamp we return.
             SkASSERT(fTimestamp == SkToU32(count));
-            
+
             // The historical timestamps of flushes are now invalid.
             this->resetFlushTimestamps();
-        }        
+        }
     }
     return fTimestamp++;
 }
 
 void GrResourceCache::notifyFlushOccurred() {
     if (fFlushTimestamps) {
         SkASSERT(SkIsPow2(fMaxUnusedFlushes));
         fLastFlushTimestampIndex = (fLastFlushTimestampIndex + 1) & (fMaxUnusedFlushes - 1);
         // get the timestamp before accessing fFlushTimestamps because getNextTimestamp will
         // reallocate fFlushTimestamps on timestamp overflow.
         uint32_t timestamp = this->getNextTimestamp();
         fFlushTimestamps[fLastFlushTimestampIndex] = timestamp;
         this->purgeAsNeeded();
     }
 }
 
+void GrResourceCache::dumpMemoryStatistics(SkTraceMemoryDump* traceMemoryDump) const {
+    for (int i = 0; i < fNonpurgeableResources.count(); ++i) {
+        fNonpurgeableResources[i]->dumpMemoryStatistics(traceMemoryDump);
+    }
+    for (int i = 0; i < fPurgeableQueue.count(); ++i) {
+        fPurgeableQueue.at(i)->dumpMemoryStatistics(traceMemoryDump);
+    }
+}
+
 #ifdef SK_DEBUG
 void GrResourceCache::validate() const {
     // Reduce the frequency of validations for large resource counts.
     static SkRandom gRandom;
     int mask = (SkNextPow2(fCount + 1) >> 5) - 1;
     if (~mask && (gRandom.nextU() & mask)) {
         return;
     }
 
     struct Stats {
@@ skipping 95 matching lines @@
         return true;
     }
     if (index < fNonpurgeableResources.count() && fNonpurgeableResources[index] == resource) {
         return true;
     }
     SkDEBUGFAIL("Resource index should be -1 or the resource should be in the cache.");
     return false;
 }
 
 #endif