2 * Copyright 2013 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
8 #include "src/core/SkResourceCache.h"
10 #include "include/core/SkTraceMemoryDump.h"
11 #include "include/private/SkMutex.h"
12 #include "include/private/SkTo.h"
13 #include "src/core/SkDiscardableMemory.h"
14 #include "src/core/SkImageFilter_Base.h"
15 #include "src/core/SkMessageBus.h"
16 #include "src/core/SkMipmap.h"
17 #include "src/core/SkOpts.h"
22 DECLARE_SKMESSAGEBUS_MESSAGE(SkResourceCache::PurgeSharedIDMessage, uint32_t, true)
24 static inline bool SkShouldPostMessageToBus(
25 const SkResourceCache::PurgeSharedIDMessage&, uint32_t) {
26 // SkResourceCache is typically used as a singleton and we don't label Inboxes so all messages
31 // This can be defined by the caller's build system
32 //#define SK_USE_DISCARDABLE_SCALEDIMAGECACHE
34 #ifndef SK_DISCARDABLEMEMORY_SCALEDIMAGECACHE_COUNT_LIMIT
35 # define SK_DISCARDABLEMEMORY_SCALEDIMAGECACHE_COUNT_LIMIT 1024
38 #ifndef SK_DEFAULT_IMAGE_CACHE_LIMIT
39 #define SK_DEFAULT_IMAGE_CACHE_LIMIT (32 * 1024 * 1024)
42 void SkResourceCache::Key::init(void* nameSpace, uint64_t sharedID, size_t dataSize) {
43 SkASSERT(SkAlign4(dataSize) == dataSize);
45 // fCount32 and fHash are not hashed
46 static const int kUnhashedLocal32s = 2; // fCache32 + fHash
47 static const int kSharedIDLocal32s = 2; // fSharedID_lo + fSharedID_hi
48 static const int kHashedLocal32s = kSharedIDLocal32s + (sizeof(fNamespace) >> 2);
49 static const int kLocal32s = kUnhashedLocal32s + kHashedLocal32s;
51 static_assert(sizeof(Key) == (kLocal32s << 2), "unaccounted_key_locals");
52 static_assert(sizeof(Key) == offsetof(Key, fNamespace) + sizeof(fNamespace),
53 "namespace_field_must_be_last");
55 fCount32 = SkToS32(kLocal32s + (dataSize >> 2));
56 fSharedID_lo = (uint32_t)(sharedID & 0xFFFFFFFF);
57 fSharedID_hi = (uint32_t)(sharedID >> 32);
58 fNamespace = nameSpace;
59 // skip unhashed fields when computing the hash
60 fHash = SkOpts::hash(this->as32() + kUnhashedLocal32s,
61 (fCount32 - kUnhashedLocal32s) << 2);
64 #include "include/private/SkTHash.h"
68 static uint32_t Hash(const SkResourceCache::Key& key) { return key.hash(); }
69 static const SkResourceCache::Key& GetKey(const SkResourceCache::Rec* rec) {
75 class SkResourceCache::Hash :
76 public SkTHashTable<SkResourceCache::Rec*, SkResourceCache::Key, HashTraits> {};
79 ///////////////////////////////////////////////////////////////////////////////
81 void SkResourceCache::init() {
87 fSingleAllocationByteLimit = 0;
89 // One of these should be explicit set by the caller after we return.
91 fDiscardableFactory = nullptr;
94 SkResourceCache::SkResourceCache(DiscardableFactory factory)
95 : fPurgeSharedIDInbox(SK_InvalidUniqueID) {
97 fDiscardableFactory = factory;
100 SkResourceCache::SkResourceCache(size_t byteLimit)
101 : fPurgeSharedIDInbox(SK_InvalidUniqueID) {
103 fTotalByteLimit = byteLimit;
106 SkResourceCache::~SkResourceCache() {
109 Rec* next = rec->fNext;
116 ////////////////////////////////////////////////////////////////////////////////
118 bool SkResourceCache::find(const Key& key, FindVisitor visitor, void* context) {
119 this->checkMessages();
121 if (auto found = fHash->find(key)) {
123 if (visitor(*rec, context)) {
124 this->moveToHead(rec); // for our LRU
127 this->remove(rec); // stale
134 static void make_size_str(size_t size, SkString* str) {
135 const char suffix[] = { 'b', 'k', 'm', 'g', 't', 0 };
137 while (suffix[i] && (size > 1024)) {
141 str->printf("%zu%c", size, suffix[i]);
144 static bool gDumpCacheTransactions;
146 void SkResourceCache::add(Rec* rec, void* payload) {
147 this->checkMessages();
150 // See if we already have this key (racy inserts, etc.)
151 if (Rec** preexisting = fHash->find(rec->getKey())) {
152 Rec* prev = *preexisting;
153 if (prev->canBePurged()) {
154 // if it can be purged, the install may fail, so we have to remove it
157 // if it cannot be purged, we reuse it and delete the new one
158 prev->postAddInstall(payload);
164 this->addToHead(rec);
166 rec->postAddInstall(payload);
168 if (gDumpCacheTransactions) {
169 SkString bytesStr, totalStr;
170 make_size_str(rec->bytesUsed(), &bytesStr);
171 make_size_str(fTotalBytesUsed, &totalStr);
172 SkDebugf("RC: add %5s %12p key %08x -- total %5s, count %d\n",
173 bytesStr.c_str(), rec, rec->getHash(), totalStr.c_str(), fCount);
176 // since the new rec may push us over-budget, we perform a purge check now
177 this->purgeAsNeeded();
180 void SkResourceCache::remove(Rec* rec) {
181 SkASSERT(rec->canBePurged());
182 size_t used = rec->bytesUsed();
183 SkASSERT(used <= fTotalBytesUsed);
186 fHash->remove(rec->getKey());
188 fTotalBytesUsed -= used;
191 //SkDebugf("-RC count [%3d] bytes %d\n", fCount, fTotalBytesUsed);
193 if (gDumpCacheTransactions) {
194 SkString bytesStr, totalStr;
195 make_size_str(used, &bytesStr);
196 make_size_str(fTotalBytesUsed, &totalStr);
197 SkDebugf("RC: remove %5s %12p key %08x -- total %5s, count %d\n",
198 bytesStr.c_str(), rec, rec->getHash(), totalStr.c_str(), fCount);
204 void SkResourceCache::purgeAsNeeded(bool forcePurge) {
208 if (fDiscardableFactory) {
209 countLimit = SK_DISCARDABLEMEMORY_SCALEDIMAGECACHE_COUNT_LIMIT;
210 byteLimit = UINT32_MAX; // no limit based on bytes
212 countLimit = SK_MaxS32; // no limit based on count
213 byteLimit = fTotalByteLimit;
218 if (!forcePurge && fTotalBytesUsed < byteLimit && fCount < countLimit) {
222 Rec* prev = rec->fPrev;
223 if (rec->canBePurged()) {
230 //#define SK_TRACK_PURGE_SHAREDID_HITRATE
232 #ifdef SK_TRACK_PURGE_SHAREDID_HITRATE
233 static int gPurgeCallCounter;
234 static int gPurgeHitCounter;
237 void SkResourceCache::purgeSharedID(uint64_t sharedID) {
242 #ifdef SK_TRACK_PURGE_SHAREDID_HITRATE
243 gPurgeCallCounter += 1;
246 // go backwards, just like purgeAsNeeded, just to make the code similar.
247 // could iterate either direction and still be correct.
250 Rec* prev = rec->fPrev;
251 if (rec->getKey().getSharedID() == sharedID) {
252 // even though the "src" is now dead, caches could still be in-flight, so
253 // we have to check if it can be removed.
254 if (rec->canBePurged()) {
257 #ifdef SK_TRACK_PURGE_SHAREDID_HITRATE
264 #ifdef SK_TRACK_PURGE_SHAREDID_HITRATE
266 gPurgeHitCounter += 1;
269 SkDebugf("PurgeShared calls=%d hits=%d rate=%g\n", gPurgeCallCounter, gPurgeHitCounter,
270 gPurgeHitCounter * 100.0 / gPurgeCallCounter);
274 void SkResourceCache::visitAll(Visitor visitor, void* context) {
275 // go backwards, just like purgeAsNeeded, just to make the code similar.
276 // could iterate either direction and still be correct.
279 visitor(*rec, context);
284 ///////////////////////////////////////////////////////////////////////////////////////////////////
286 size_t SkResourceCache::setTotalByteLimit(size_t newLimit) {
287 size_t prevLimit = fTotalByteLimit;
288 fTotalByteLimit = newLimit;
289 if (newLimit < prevLimit) {
290 this->purgeAsNeeded();
295 SkCachedData* SkResourceCache::newCachedData(size_t bytes) {
296 this->checkMessages();
298 if (fDiscardableFactory) {
299 SkDiscardableMemory* dm = fDiscardableFactory(bytes);
300 return dm ? new SkCachedData(bytes, dm) : nullptr;
302 return new SkCachedData(sk_malloc_throw(bytes), bytes);
306 ///////////////////////////////////////////////////////////////////////////////
308 void SkResourceCache::release(Rec* rec) {
309 Rec* prev = rec->fPrev;
310 Rec* next = rec->fNext;
313 SkASSERT(fHead == rec);
325 rec->fNext = rec->fPrev = nullptr;
328 void SkResourceCache::moveToHead(Rec* rec) {
347 void SkResourceCache::addToHead(Rec* rec) {
350 rec->fPrev = nullptr;
359 fTotalBytesUsed += rec->bytesUsed();
365 ///////////////////////////////////////////////////////////////////////////////
368 void SkResourceCache::validate() const {
369 if (nullptr == fHead) {
370 SkASSERT(nullptr == fTail);
371 SkASSERT(0 == fTotalBytesUsed);
375 if (fHead == fTail) {
376 SkASSERT(nullptr == fHead->fPrev);
377 SkASSERT(nullptr == fHead->fNext);
378 SkASSERT(fHead->bytesUsed() == fTotalBytesUsed);
382 SkASSERT(nullptr == fHead->fPrev);
383 SkASSERT(fHead->fNext);
384 SkASSERT(nullptr == fTail->fNext);
385 SkASSERT(fTail->fPrev);
389 const Rec* rec = fHead;
392 used += rec->bytesUsed();
393 SkASSERT(used <= fTotalBytesUsed);
396 SkASSERT(fCount == count);
402 SkASSERT(used >= rec->bytesUsed());
403 used -= rec->bytesUsed();
407 SkASSERT(0 == count);
412 void SkResourceCache::dump() const {
415 SkDebugf("SkResourceCache: count=%d bytes=%zu %s\n",
416 fCount, fTotalBytesUsed, fDiscardableFactory ? "discardable" : "malloc");
419 size_t SkResourceCache::setSingleAllocationByteLimit(size_t newLimit) {
420 size_t oldLimit = fSingleAllocationByteLimit;
421 fSingleAllocationByteLimit = newLimit;
425 size_t SkResourceCache::getSingleAllocationByteLimit() const {
426 return fSingleAllocationByteLimit;
429 size_t SkResourceCache::getEffectiveSingleAllocationByteLimit() const {
430 // fSingleAllocationByteLimit == 0 means the caller is asking for our default
431 size_t limit = fSingleAllocationByteLimit;
433 // if we're not discardable (i.e. we are fixed-budget) then cap the single-limit
435 if (nullptr == fDiscardableFactory) {
437 limit = fTotalByteLimit;
439 limit = std::min(limit, fTotalByteLimit);
445 void SkResourceCache::checkMessages() {
446 SkTArray<PurgeSharedIDMessage> msgs;
447 fPurgeSharedIDInbox.poll(&msgs);
448 for (int i = 0; i < msgs.count(); ++i) {
449 this->purgeSharedID(msgs[i].fSharedID);
453 ///////////////////////////////////////////////////////////////////////////////
455 static SkResourceCache* gResourceCache = nullptr;
456 static SkMutex& resource_cache_mutex() {
457 static SkMutex& mutex = *(new SkMutex);
461 /** Must hold resource_cache_mutex() when calling. */
462 static SkResourceCache* get_cache() {
463 // resource_cache_mutex() is always held when this is called, so we don't need to be fancy in here.
464 resource_cache_mutex().assertHeld();
465 if (nullptr == gResourceCache) {
466 #ifdef SK_USE_DISCARDABLE_SCALEDIMAGECACHE
467 gResourceCache = new SkResourceCache(SkDiscardableMemory::Create);
469 gResourceCache = new SkResourceCache(SK_DEFAULT_IMAGE_CACHE_LIMIT);
472 return gResourceCache;
475 size_t SkResourceCache::GetTotalBytesUsed() {
476 SkAutoMutexExclusive am(resource_cache_mutex());
477 return get_cache()->getTotalBytesUsed();
480 size_t SkResourceCache::GetTotalByteLimit() {
481 SkAutoMutexExclusive am(resource_cache_mutex());
482 return get_cache()->getTotalByteLimit();
485 size_t SkResourceCache::SetTotalByteLimit(size_t newLimit) {
486 SkAutoMutexExclusive am(resource_cache_mutex());
487 return get_cache()->setTotalByteLimit(newLimit);
490 SkResourceCache::DiscardableFactory SkResourceCache::GetDiscardableFactory() {
491 SkAutoMutexExclusive am(resource_cache_mutex());
492 return get_cache()->discardableFactory();
495 SkCachedData* SkResourceCache::NewCachedData(size_t bytes) {
496 SkAutoMutexExclusive am(resource_cache_mutex());
497 return get_cache()->newCachedData(bytes);
500 void SkResourceCache::Dump() {
501 SkAutoMutexExclusive am(resource_cache_mutex());
505 size_t SkResourceCache::SetSingleAllocationByteLimit(size_t size) {
506 SkAutoMutexExclusive am(resource_cache_mutex());
507 return get_cache()->setSingleAllocationByteLimit(size);
510 size_t SkResourceCache::GetSingleAllocationByteLimit() {
511 SkAutoMutexExclusive am(resource_cache_mutex());
512 return get_cache()->getSingleAllocationByteLimit();
515 size_t SkResourceCache::GetEffectiveSingleAllocationByteLimit() {
516 SkAutoMutexExclusive am(resource_cache_mutex());
517 return get_cache()->getEffectiveSingleAllocationByteLimit();
520 void SkResourceCache::PurgeAll() {
521 SkAutoMutexExclusive am(resource_cache_mutex());
522 return get_cache()->purgeAll();
525 void SkResourceCache::CheckMessages() {
526 SkAutoMutexExclusive am(resource_cache_mutex());
527 return get_cache()->checkMessages();
530 bool SkResourceCache::Find(const Key& key, FindVisitor visitor, void* context) {
531 SkAutoMutexExclusive am(resource_cache_mutex());
532 return get_cache()->find(key, visitor, context);
535 void SkResourceCache::Add(Rec* rec, void* payload) {
536 SkAutoMutexExclusive am(resource_cache_mutex());
537 get_cache()->add(rec, payload);
540 void SkResourceCache::VisitAll(Visitor visitor, void* context) {
541 SkAutoMutexExclusive am(resource_cache_mutex());
542 get_cache()->visitAll(visitor, context);
545 void SkResourceCache::PostPurgeSharedID(uint64_t sharedID) {
547 SkMessageBus<PurgeSharedIDMessage, uint32_t>::Post(PurgeSharedIDMessage(sharedID));
551 ///////////////////////////////////////////////////////////////////////////////
553 #include "include/core/SkGraphics.h"
554 #include "include/core/SkImageFilter.h"
556 size_t SkGraphics::GetResourceCacheTotalBytesUsed() {
557 return SkResourceCache::GetTotalBytesUsed();
560 size_t SkGraphics::GetResourceCacheTotalByteLimit() {
561 return SkResourceCache::GetTotalByteLimit();
564 size_t SkGraphics::SetResourceCacheTotalByteLimit(size_t newLimit) {
565 return SkResourceCache::SetTotalByteLimit(newLimit);
568 size_t SkGraphics::GetResourceCacheSingleAllocationByteLimit() {
569 return SkResourceCache::GetSingleAllocationByteLimit();
572 size_t SkGraphics::SetResourceCacheSingleAllocationByteLimit(size_t newLimit) {
573 return SkResourceCache::SetSingleAllocationByteLimit(newLimit);
576 void SkGraphics::PurgeResourceCache() {
577 SkImageFilter_Base::PurgeCache();
578 return SkResourceCache::PurgeAll();
583 static void dump_visitor(const SkResourceCache::Rec& rec, void*) {
584 SkDebugf("RC: %12s bytes %9zu discardable %p\n",
585 rec.getCategory(), rec.bytesUsed(), rec.diagnostic_only_getDiscardable());
588 void SkResourceCache::TestDumpMemoryStatistics() {
589 VisitAll(dump_visitor, nullptr);
592 static void sk_trace_dump_visitor(const SkResourceCache::Rec& rec, void* context) {
593 SkTraceMemoryDump* dump = static_cast<SkTraceMemoryDump*>(context);
594 SkString dumpName = SkStringPrintf("skia/sk_resource_cache/%s_%p", rec.getCategory(), &rec);
595 SkDiscardableMemory* discardable = rec.diagnostic_only_getDiscardable();
597 dump->setDiscardableMemoryBacking(dumpName.c_str(), *discardable);
599 // The discardable memory size will be calculated by dumper, but we also dump what we think
600 // the size of object in memory is irrespective of whether object is live or dead.
601 dump->dumpNumericValue(dumpName.c_str(), "discardable_size", "bytes", rec.bytesUsed());
603 dump->dumpNumericValue(dumpName.c_str(), "size", "bytes", rec.bytesUsed());
604 dump->setMemoryBacking(dumpName.c_str(), "malloc", nullptr);
608 void SkResourceCache::DumpMemoryStatistics(SkTraceMemoryDump* dump) {
609 // Since resource could be backed by malloc or discardable, the cache always dumps detailed
610 // stats to be accurate.
611 VisitAll(sk_trace_dump_visitor, dump);