91     for (int i = 0; i < fStorage.count(); i++) {  in ~SkBitmapHeap()
94             if (fUnusedSlots[j] == fStorage[i]->fSlot) {  in ~SkBitmapHeap()
100             fBytesAllocated -= fStorage[i]->fBytesAllocated;  in ~SkBitmapHeap()
103     fBytesAllocated -= (fStorage.count() * sizeof(SkBitmapHeapEntry));  in ~SkBitmapHeap()
106     fStorage.deleteAll();  in ~SkBitmapHeap()
154     SkASSERT(fStorage.count() >= fPreferredCount);  in findEntryToReplace()
158         SkBitmapHeapEntry* heapEntry = fStorage[iter->fStorageSlot];  in findEntryToReplace()
186         SkBitmapHeapEntry* heapEntry = fStorage[iter->fStorageSlot];  in freeMemoryIfPossible()
209             fBytesAllocated -= (fStorage.count() * sizeof(SkBitmapHeapEntry));  in freeMemoryIfPossible()
210             fStorage.deleteAll();  in freeMemoryIfPossible()
233         *entry = fStorage[fLookupTable[index]->fStorageSlot];  in findInLookupTable()
266     fBytesAllocated -= fStorage[entry->fStorageSlot]->fBytesAllocated;  in removeEntryFromLookupTable()
296     if (fPreferredCount != UNLIMITED_SIZE && fStorage.count() >= fPreferredCount) {  in insert()
301             entry = fStorage[lookupEntry->fStorageSlot];  in insert()
318             entry = fStorage[slot];  in insert()
321             fStorage.append(1, &entry);  in insert()
322             entry->fSlot = fStorage.count() - 1;  in insert()
341         if (fStorage.count() - 1 == entry->fSlot) {  in insert()
343             fStorage.remove(entry->fSlot);  in insert()