94     for (int i = 0; i < fStorage.count(); i++) {  in ~SkBitmapHeap()
97             if (fUnusedSlots[j] == fStorage[i]->fSlot) {  in ~SkBitmapHeap()
103             fBytesAllocated -= fStorage[i]->fBytesAllocated;  in ~SkBitmapHeap()
106     fBytesAllocated -= (fStorage.count() * sizeof(SkBitmapHeapEntry));  in ~SkBitmapHeap()
109     fStorage.deleteAll();  in ~SkBitmapHeap()
157     SkASSERT(fStorage.count() >= fPreferredCount);  in findEntryToReplace()
161         SkBitmapHeapEntry* heapEntry = fStorage[iter->fStorageSlot];  in findEntryToReplace()
189         SkBitmapHeapEntry* heapEntry = fStorage[iter->fStorageSlot];  in freeMemoryIfPossible()
212             fBytesAllocated -= (fStorage.count() * sizeof(SkBitmapHeapEntry));  in freeMemoryIfPossible()
213             fStorage.deleteAll();  in freeMemoryIfPossible()
236         *entry = fStorage[fLookupTable[index]->fStorageSlot];  in findInLookupTable()
269     fBytesAllocated -= fStorage[entry->fStorageSlot]->fBytesAllocated;  in removeEntryFromLookupTable()
299     if (fPreferredCount != UNLIMITED_SIZE && fStorage.count() >= fPreferredCount) {  in insert()
304             entry = fStorage[lookupEntry->fStorageSlot];  in insert()
321             entry = fStorage[slot];  in insert()
324             fStorage.append(1, &entry);  in insert()
325             entry->fSlot = fStorage.count() - 1;  in insert()
344         if (fStorage.count() - 1 == entry->fSlot) {  in insert()
346             fStorage.remove(entry->fSlot);  in insert()