| /* |
| * Copyright 2015 Google Inc. |
| * |
| * Use of this source code is governed by a BSD-style license that can be |
| * found in the LICENSE file. |
| */ |
| |
| #include "src/gpu/text/GrTextBlobCache.h" |
| |
| DECLARE_SKMESSAGEBUS_MESSAGE(GrTextBlobCache::PurgeBlobMessage) |
| |
| // This function is captured by the above macro using implementations from SkMessageBus.h |
| static inline bool SkShouldPostMessageToBus( |
| const GrTextBlobCache::PurgeBlobMessage& msg, uint32_t msgBusUniqueID) { |
| return msg.fContextID == msgBusUniqueID; |
| } |
| |
| GrTextBlobCache::GrTextBlobCache(PurgeMore purgeMore, uint32_t messageBusID) |
| : fPurgeMore(purgeMore) |
| , fSizeBudget(kDefaultBudget) |
| , fMessageBusID(messageBusID) |
| , fPurgeBlobInbox(messageBusID) { } |
| |
| GrTextBlobCache::~GrTextBlobCache() { |
| this->freeAll(); |
| } |
| |
| sk_sp<GrTextBlob> |
| GrTextBlobCache::makeCachedBlob(const SkGlyphRunList& glyphRunList, const GrTextBlob::Key& key, |
| const SkMaskFilterBase::BlurRec& blurRec, |
| const SkMatrix& viewMatrix, GrColor color, bool forceW) { |
| sk_sp<GrTextBlob> cacheBlob(GrTextBlob::Make(glyphRunList, viewMatrix, color, forceW)); |
| cacheBlob->setupKey(key, blurRec, glyphRunList.paint()); |
| this->add(cacheBlob); |
| glyphRunList.temporaryShuntBlobNotifyAddedToCache(fMessageBusID); |
| return cacheBlob; |
| } |
| |
| sk_sp<GrTextBlob> GrTextBlobCache::find(const GrTextBlob::Key& key) const { |
| const auto* idEntry = fBlobIDCache.find(key.fUniqueID); |
| return idEntry ? idEntry->find(key) : nullptr; |
| } |
| |
| void GrTextBlobCache::remove(GrTextBlob* blob) { |
| auto id = GrTextBlob::GetKey(*blob).fUniqueID; |
| auto* idEntry = fBlobIDCache.find(id); |
| SkASSERT(idEntry); |
| |
| fCurrentSize -= blob->size(); |
| fBlobList.remove(blob); |
| idEntry->removeBlob(blob); |
| if (idEntry->fBlobs.empty()) { |
| fBlobIDCache.remove(id); |
| } |
| } |
| |
| void GrTextBlobCache::makeMRU(GrTextBlob* blob) { |
| if (fBlobList.head() == blob) { |
| return; |
| } |
| |
| fBlobList.remove(blob); |
| fBlobList.addToHead(blob); |
| } |
| |
| void GrTextBlobCache::freeAll() { |
| fBlobIDCache.foreach([this](uint32_t, BlobIDCacheEntry* entry) { |
| for (const auto& blob : entry->fBlobs) { |
| fBlobList.remove(blob.get()); |
| } |
| }); |
| |
| fBlobIDCache.reset(); |
| |
| fCurrentSize = 0; |
| |
| // There should be no allocations in the memory pool at this point |
| SkASSERT(fBlobList.isEmpty()); |
| } |
| |
| void GrTextBlobCache::setBudget(size_t budget) { |
| fSizeBudget = budget; |
| this->checkPurge(); |
| } |
| |
| void GrTextBlobCache::PostPurgeBlobMessage(uint32_t blobID, uint32_t cacheID) { |
| SkASSERT(blobID != SK_InvalidGenID); |
| SkMessageBus<PurgeBlobMessage>::Post(PurgeBlobMessage(blobID, cacheID)); |
| } |
| |
| void GrTextBlobCache::purgeStaleBlobs() { |
| SkTArray<PurgeBlobMessage> msgs; |
| fPurgeBlobInbox.poll(&msgs); |
| |
| for (const auto& msg : msgs) { |
| auto* idEntry = fBlobIDCache.find(msg.fBlobID); |
| if (!idEntry) { |
| // no cache entries for id |
| continue; |
| } |
| |
| // remove all blob entries from the LRU list |
| for (const auto& blob : idEntry->fBlobs) { |
| fCurrentSize -= blob->size(); |
| fBlobList.remove(blob.get()); |
| } |
| |
| // drop the idEntry itself (unrefs all blobs) |
| fBlobIDCache.remove(msg.fBlobID); |
| } |
| } |
| |
| void GrTextBlobCache::checkPurge(GrTextBlob* blob) { |
| // First, purge all stale blob IDs. |
| this->purgeStaleBlobs(); |
| |
| // If we are still over budget, then unref until we are below budget again |
| if (fCurrentSize > fSizeBudget) { |
| TextBlobList::Iter iter; |
| iter.init(fBlobList, TextBlobList::Iter::kTail_IterStart); |
| GrTextBlob* lruBlob = nullptr; |
| while (fCurrentSize > fSizeBudget && (lruBlob = iter.get()) && lruBlob != blob) { |
| // Backup the iterator before removing and unrefing the blob |
| iter.prev(); |
| |
| this->remove(lruBlob); |
| } |
| |
| // If we break out of the loop with lruBlob == blob, then we haven't purged enough |
| // use the call back and try to free some more. If we are still overbudget after this, |
| // then this single textblob is over our budget |
| if (blob && lruBlob == blob) { |
| fPurgeMore(); |
| } |
| |
| #ifdef SPEW_BUDGET_MESSAGE |
| if (fCurrentSize > fSizeBudget) { |
| SkDebugf("Single textblob is larger than our whole budget"); |
| } |
| #endif |
| } |
| } |
| |
| void GrTextBlobCache::add(sk_sp<GrTextBlob> blob) { |
| auto id = GrTextBlob::GetKey(*blob).fUniqueID; |
| auto* idEntry = fBlobIDCache.find(id); |
| if (!idEntry) { |
| idEntry = fBlobIDCache.set(id, BlobIDCacheEntry(id)); |
| } |
| |
| // Safe to retain a raw ptr temporarily here, because the cache will hold a ref. |
| GrTextBlob* rawBlobPtr = blob.get(); |
| fBlobList.addToHead(rawBlobPtr); |
| fCurrentSize += blob->size(); |
| idEntry->addBlob(std::move(blob)); |
| |
| this->checkPurge(rawBlobPtr); |
| } |
| |
| GrTextBlobCache::BlobIDCacheEntry::BlobIDCacheEntry() : fID(SK_InvalidGenID) {} |
| |
| GrTextBlobCache::BlobIDCacheEntry::BlobIDCacheEntry(uint32_t id) : fID(id) {} |
| |
| uint32_t GrTextBlobCache::BlobIDCacheEntry::GetKey(const GrTextBlobCache::BlobIDCacheEntry& entry) { |
| return entry.fID; |
| } |
| |
| void GrTextBlobCache::BlobIDCacheEntry::addBlob(sk_sp<GrTextBlob> blob) { |
| SkASSERT(blob); |
| SkASSERT(GrTextBlob::GetKey(*blob).fUniqueID == fID); |
| SkASSERT(!this->find(GrTextBlob::GetKey(*blob))); |
| |
| fBlobs.emplace_back(std::move(blob)); |
| } |
| |
| void GrTextBlobCache::BlobIDCacheEntry::removeBlob(GrTextBlob* blob) { |
| SkASSERT(blob); |
| SkASSERT(GrTextBlob::GetKey(*blob).fUniqueID == fID); |
| |
| auto index = this->findBlobIndex(GrTextBlob::GetKey(*blob)); |
| SkASSERT(index >= 0); |
| |
| fBlobs.removeShuffle(index); |
| } |
| |
| sk_sp<GrTextBlob> GrTextBlobCache::BlobIDCacheEntry::find(const GrTextBlob::Key& key) const { |
| auto index = this->findBlobIndex(key); |
| return index < 0 ? nullptr : fBlobs[index]; |
| } |
| |
| int GrTextBlobCache::BlobIDCacheEntry::findBlobIndex(const GrTextBlob::Key& key) const { |
| for (int i = 0; i < fBlobs.count(); ++i) { |
| if (GrTextBlob::GetKey(*fBlobs[i]) == key) { |
| return i; |
| } |
| } |
| return -1; |
| } |