reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2014 Google Inc. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
| 6 | */ |
| 7 | |
| 8 | #include "SkBitmapCache.h" |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 9 | #include "SkResourceCache.h" |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 10 | #include "SkMipMap.h" |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 11 | #include "SkRect.h" |
| 12 | |
reed | 14b6aba | 2014-08-29 10:25:26 -0700 | [diff] [blame] | 13 | SkBitmap::Allocator* SkBitmapCache::GetAllocator() { |
| 14 | return SkResourceCache::GetAllocator(); |
| 15 | } |
| 16 | |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 17 | /** |
| 18 | This function finds the bounds of the bitmap *within its pixelRef*. |
| 19 | If the bitmap lacks a pixelRef, it will return an empty rect, since |
| 20 | that doesn't make sense. This may be a useful enough function that |
| 21 | it should be somewhere else (in SkBitmap?). |
| 22 | */ |
| 23 | static SkIRect get_bounds_from_bitmap(const SkBitmap& bm) { |
| 24 | if (!(bm.pixelRef())) { |
| 25 | return SkIRect::MakeEmpty(); |
| 26 | } |
| 27 | SkIPoint origin = bm.pixelRefOrigin(); |
| 28 | return SkIRect::MakeXYWH(origin.fX, origin.fY, bm.width(), bm.height()); |
| 29 | } |
| 30 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 31 | struct BitmapKey : public SkResourceCache::Key { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 32 | public: |
| 33 | BitmapKey(uint32_t genID, SkScalar scaleX, SkScalar scaleY, const SkIRect& bounds) |
| 34 | : fGenID(genID) |
| 35 | , fScaleX(scaleX) |
| 36 | , fScaleY(scaleY) |
| 37 | , fBounds(bounds) |
| 38 | { |
| 39 | this->init(sizeof(fGenID) + sizeof(fScaleX) + sizeof(fScaleY) + sizeof(fBounds)); |
| 40 | } |
qiankun.miao | 045bb7f | 2014-08-25 06:08:25 -0700 | [diff] [blame] | 41 | |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 42 | uint32_t fGenID; |
| 43 | SkScalar fScaleX; |
| 44 | SkScalar fScaleY; |
| 45 | SkIRect fBounds; |
| 46 | }; |
| 47 | |
| 48 | ////////////////////////////////////////////////////////////////////////////////////////// |
| 49 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 50 | struct BitmapRec : public SkResourceCache::Rec { |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 51 | BitmapRec(uint32_t genID, SkScalar scaleX, SkScalar scaleY, const SkIRect& bounds, |
| 52 | const SkBitmap& result) |
| 53 | : fKey(genID, scaleX, scaleY, bounds) |
| 54 | , fBitmap(result) |
| 55 | {} |
| 56 | |
| 57 | BitmapKey fKey; |
| 58 | SkBitmap fBitmap; |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 59 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 60 | virtual const Key& getKey() const SK_OVERRIDE { return fKey; } |
| 61 | virtual size_t bytesUsed() const SK_OVERRIDE { return sizeof(fKey) + fBitmap.getSize(); } |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 62 | |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 63 | static bool Visitor(const SkResourceCache::Rec& baseRec, void* contextBitmap) { |
| 64 | const BitmapRec& rec = static_cast<const BitmapRec&>(baseRec); |
| 65 | SkBitmap* result = (SkBitmap*)contextBitmap; |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 66 | |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 67 | *result = rec.fBitmap; |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 68 | result->lockPixels(); |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 69 | return SkToBool(result->getPixels()); |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 70 | } |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 71 | }; |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 72 | |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 73 | #define CHECK_LOCAL(localCache, localName, globalName, ...) \ |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 74 | ((localCache) ? localCache->localName(__VA_ARGS__) : SkResourceCache::globalName(__VA_ARGS__)) |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 75 | |
| 76 | bool SkBitmapCache::Find(const SkBitmap& src, SkScalar invScaleX, SkScalar invScaleY, SkBitmap* result, |
| 77 | SkResourceCache* localCache) { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 78 | if (0 == invScaleX || 0 == invScaleY) { |
| 79 | // degenerate, and the key we use for mipmaps |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 80 | return false; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 81 | } |
| 82 | BitmapKey key(src.getGenerationID(), invScaleX, invScaleY, get_bounds_from_bitmap(src)); |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 83 | |
| 84 | return CHECK_LOCAL(localCache, find, Find, key, BitmapRec::Visitor, result); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 85 | } |
| 86 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 87 | void SkBitmapCache::Add(const SkBitmap& src, SkScalar invScaleX, SkScalar invScaleY, |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 88 | const SkBitmap& result, SkResourceCache* localCache) { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 89 | if (0 == invScaleX || 0 == invScaleY) { |
| 90 | // degenerate, and the key we use for mipmaps |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 91 | return; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 92 | } |
reed | 14b6aba | 2014-08-29 10:25:26 -0700 | [diff] [blame] | 93 | SkASSERT(result.isImmutable()); |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 94 | BitmapRec* rec = SkNEW_ARGS(BitmapRec, (src.getGenerationID(), invScaleX, invScaleY, |
| 95 | get_bounds_from_bitmap(src), result)); |
| 96 | CHECK_LOCAL(localCache, add, Add, rec); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 97 | } |
| 98 | |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 99 | bool SkBitmapCache::Find(uint32_t genID, const SkIRect& subset, SkBitmap* result, |
| 100 | SkResourceCache* localCache) { |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 101 | BitmapKey key(genID, SK_Scalar1, SK_Scalar1, subset); |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 102 | |
| 103 | return CHECK_LOCAL(localCache, find, Find, key, BitmapRec::Visitor, result); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 104 | } |
| 105 | |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 106 | bool SkBitmapCache::Add(uint32_t genID, const SkIRect& subset, const SkBitmap& result, |
| 107 | SkResourceCache* localCache) { |
reed | 14b6aba | 2014-08-29 10:25:26 -0700 | [diff] [blame] | 108 | SkASSERT(result.isImmutable()); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 109 | |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 110 | if (subset.isEmpty() |
| 111 | || subset.top() < 0 |
| 112 | || subset.left() < 0 |
| 113 | || result.width() != subset.width() |
| 114 | || result.height() != subset.height()) { |
| 115 | return false; |
| 116 | } else { |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 117 | BitmapRec* rec = SkNEW_ARGS(BitmapRec, (genID, SK_Scalar1, SK_Scalar1, subset, result)); |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 118 | |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 119 | CHECK_LOCAL(localCache, add, Add, rec); |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 120 | return true; |
| 121 | } |
| 122 | } |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 123 | ////////////////////////////////////////////////////////////////////////////////////////// |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 124 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 125 | struct MipMapRec : public SkResourceCache::Rec { |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 126 | MipMapRec(const SkBitmap& src, const SkMipMap* result) |
| 127 | : fKey(src.getGenerationID(), 0, 0, get_bounds_from_bitmap(src)) |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 128 | , fMipMap(result) |
| 129 | { |
| 130 | fMipMap->attachToCacheAndRef(); |
reed | 92561a0 | 2014-10-02 13:47:08 -0700 | [diff] [blame] | 131 | } |
piotaixr | 42b0dfe | 2014-09-03 11:33:13 -0700 | [diff] [blame] | 132 | |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 133 | virtual ~MipMapRec() { |
| 134 | fMipMap->detachFromCacheAndUnref(); |
| 135 | } |
reed | 37c5a81 | 2014-10-03 13:23:30 -0700 | [diff] [blame] | 136 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 137 | virtual const Key& getKey() const SK_OVERRIDE { return fKey; } |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 138 | virtual size_t bytesUsed() const SK_OVERRIDE { return sizeof(fKey) + fMipMap->size(); } |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 139 | |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 140 | static bool Visitor(const SkResourceCache::Rec& baseRec, void* contextMip) { |
| 141 | const MipMapRec& rec = static_cast<const MipMapRec&>(baseRec); |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 142 | const SkMipMap* mm = SkRef(rec.fMipMap); |
| 143 | // the call to ref() above triggers a "lock" in the case of discardable memory, |
| 144 | // which means we can now check for null (in case the lock failed). |
| 145 | if (NULL == mm->data()) { |
| 146 | mm->unref(); // balance our call to ref() |
| 147 | return false; |
| 148 | } |
| 149 | // the call must call unref() when they are done. |
| 150 | *(const SkMipMap**)contextMip = mm; |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 151 | return true; |
| 152 | } |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 153 | |
| 154 | private: |
| 155 | BitmapKey fKey; |
| 156 | const SkMipMap* fMipMap; |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 157 | }; |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 158 | |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 159 | const SkMipMap* SkMipMapCache::FindAndRef(const SkBitmap& src, SkResourceCache* localCache) { |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 160 | BitmapKey key(src.getGenerationID(), 0, 0, get_bounds_from_bitmap(src)); |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 161 | const SkMipMap* result; |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 162 | |
| 163 | if (!CHECK_LOCAL(localCache, find, Find, key, MipMapRec::Visitor, &result)) { |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 164 | result = NULL; |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 165 | } |
| 166 | return result; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 167 | } |
| 168 | |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 169 | static SkResourceCache::DiscardableFactory get_fact(SkResourceCache* localCache) { |
| 170 | return localCache ? localCache->GetDiscardableFactory() |
| 171 | : SkResourceCache::GetDiscardableFactory(); |
| 172 | } |
| 173 | |
| 174 | const SkMipMap* SkMipMapCache::AddAndRef(const SkBitmap& src, SkResourceCache* localCache) { |
| 175 | SkMipMap* mipmap = SkMipMap::Build(src, get_fact(localCache)); |
| 176 | if (mipmap) { |
| 177 | MipMapRec* rec = SkNEW_ARGS(MipMapRec, (src, mipmap)); |
| 178 | CHECK_LOCAL(localCache, add, Add, rec); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 179 | } |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame^] | 180 | return mipmap; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 181 | } |
| 182 | |