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 | |
| 13 | /** |
| 14 | This function finds the bounds of the bitmap *within its pixelRef*. |
| 15 | If the bitmap lacks a pixelRef, it will return an empty rect, since |
| 16 | that doesn't make sense. This may be a useful enough function that |
| 17 | it should be somewhere else (in SkBitmap?). |
| 18 | */ |
| 19 | static SkIRect get_bounds_from_bitmap(const SkBitmap& bm) { |
| 20 | if (!(bm.pixelRef())) { |
| 21 | return SkIRect::MakeEmpty(); |
| 22 | } |
| 23 | SkIPoint origin = bm.pixelRefOrigin(); |
| 24 | return SkIRect::MakeXYWH(origin.fX, origin.fY, bm.width(), bm.height()); |
| 25 | } |
| 26 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 27 | struct BitmapKey : public SkResourceCache::Key { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 28 | public: |
| 29 | BitmapKey(uint32_t genID, SkScalar scaleX, SkScalar scaleY, const SkIRect& bounds) |
| 30 | : fGenID(genID) |
| 31 | , fScaleX(scaleX) |
| 32 | , fScaleY(scaleY) |
| 33 | , fBounds(bounds) |
| 34 | { |
| 35 | this->init(sizeof(fGenID) + sizeof(fScaleX) + sizeof(fScaleY) + sizeof(fBounds)); |
| 36 | } |
qiankun.miao | 045bb7f | 2014-08-25 06:08:25 -0700 | [diff] [blame] | 37 | |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 38 | uint32_t fGenID; |
| 39 | SkScalar fScaleX; |
| 40 | SkScalar fScaleY; |
| 41 | SkIRect fBounds; |
| 42 | }; |
| 43 | |
| 44 | ////////////////////////////////////////////////////////////////////////////////////////// |
| 45 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 46 | struct BitmapRec : public SkResourceCache::Rec { |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 47 | BitmapRec(uint32_t genID, SkScalar scaleX, SkScalar scaleY, const SkIRect& bounds, |
| 48 | const SkBitmap& result) |
| 49 | : fKey(genID, scaleX, scaleY, bounds) |
| 50 | , fBitmap(result) |
| 51 | {} |
| 52 | |
| 53 | BitmapKey fKey; |
| 54 | SkBitmap fBitmap; |
| 55 | |
| 56 | virtual const Key& getKey() const SK_OVERRIDE { return fKey; } |
| 57 | virtual size_t bytesUsed() const SK_OVERRIDE { return sizeof(fKey) + fBitmap.getSize(); } |
| 58 | }; |
| 59 | |
| 60 | static bool find_and_return(const BitmapKey& key, SkBitmap* result) { |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 61 | const BitmapRec* rec = (BitmapRec*)SkResourceCache::FindAndLock(key); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 62 | if (rec) { |
| 63 | *result = rec->fBitmap; |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 64 | SkResourceCache::Unlock(rec); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 65 | |
| 66 | result->lockPixels(); |
| 67 | if (result->getPixels()) { |
| 68 | return true; |
| 69 | } |
| 70 | // todo: we should explicitly purge rec from the cache at this point, since |
| 71 | // it is effectively purged already (has no memory behind it) |
| 72 | result->reset(); |
| 73 | // fall-through to false |
| 74 | } |
| 75 | return false; |
| 76 | } |
| 77 | |
| 78 | bool SkBitmapCache::Find(const SkBitmap& src, SkScalar invScaleX, SkScalar invScaleY, |
| 79 | SkBitmap* result) { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 80 | if (0 == invScaleX || 0 == invScaleY) { |
| 81 | // degenerate, and the key we use for mipmaps |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 82 | return false; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 83 | } |
| 84 | BitmapKey key(src.getGenerationID(), invScaleX, invScaleY, get_bounds_from_bitmap(src)); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 85 | return find_and_return(key, result); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 86 | } |
| 87 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 88 | void SkBitmapCache::Add(const SkBitmap& src, SkScalar invScaleX, SkScalar invScaleY, |
| 89 | const SkBitmap& result) { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 90 | if (0 == invScaleX || 0 == invScaleY) { |
| 91 | // degenerate, and the key we use for mipmaps |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 92 | return; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 93 | } |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 94 | SkResourceCache::Add(SkNEW_ARGS(BitmapRec, (src.getGenerationID(), invScaleX, invScaleY, |
| 95 | get_bounds_from_bitmap(src), result))); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 96 | } |
| 97 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 98 | bool SkBitmapCache::Find(uint32_t genID, int width, int height, SkBitmap* result) { |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 99 | BitmapKey key(genID, SK_Scalar1, SK_Scalar1, SkIRect::MakeWH(width, height)); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 100 | return find_and_return(key, result); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 101 | } |
| 102 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 103 | void SkBitmapCache::Add(uint32_t genID, int width, int height, const SkBitmap& result) { |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 104 | SkResourceCache::Add(SkNEW_ARGS(BitmapRec, (genID, SK_Scalar1, SK_Scalar1, |
| 105 | SkIRect::MakeWH(width, height), result))); |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 106 | } |
| 107 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 108 | ////////////////////////////////////////////////////////////////////////////////////////// |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 109 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 110 | struct MipMapRec : public SkResourceCache::Rec { |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 111 | MipMapRec(const SkBitmap& src, const SkMipMap* result) |
| 112 | : fKey(src.getGenerationID(), 0, 0, get_bounds_from_bitmap(src)) |
| 113 | , fMipMap(SkRef(result)) |
| 114 | {} |
| 115 | |
| 116 | virtual ~MipMapRec() { |
| 117 | fMipMap->unref(); |
| 118 | } |
| 119 | |
| 120 | BitmapKey fKey; |
| 121 | const SkMipMap* fMipMap; |
| 122 | |
| 123 | virtual const Key& getKey() const SK_OVERRIDE { return fKey; } |
| 124 | virtual size_t bytesUsed() const SK_OVERRIDE { return sizeof(fKey) + fMipMap->getSize(); } |
| 125 | }; |
| 126 | |
| 127 | |
| 128 | const SkMipMap* SkMipMapCache::FindAndRef(const SkBitmap& src) { |
| 129 | BitmapKey key(src.getGenerationID(), 0, 0, get_bounds_from_bitmap(src)); |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 130 | const MipMapRec* rec = (MipMapRec*)SkResourceCache::FindAndLock(key); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 131 | const SkMipMap* result = NULL; |
| 132 | if (rec) { |
| 133 | result = SkRef(rec->fMipMap); |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 134 | SkResourceCache::Unlock(rec); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 135 | } |
| 136 | return result; |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 137 | } |
| 138 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 139 | void SkMipMapCache::Add(const SkBitmap& src, const SkMipMap* result) { |
| 140 | if (result) { |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame^] | 141 | SkResourceCache::Add(SkNEW_ARGS(MipMapRec, (src, result))); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 142 | } |
reed | 0461713 | 2014-08-21 09:46:49 -0700 | [diff] [blame] | 143 | } |
| 144 | |