epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 2 | /* |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 3 | * Copyright 2010 Google Inc. |
| 4 | * |
| 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 7 | */ |
| 8 | |
epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 9 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 10 | #include "SkGradientBitmapCache.h" |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 11 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 12 | struct SkGradientBitmapCache::Entry { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 13 | Entry* fPrev; |
| 14 | Entry* fNext; |
| 15 | |
| 16 | void* fBuffer; |
| 17 | size_t fSize; |
| 18 | SkBitmap fBitmap; |
| 19 | |
vandebo@chromium.org | 3c89818 | 2011-06-22 05:01:28 +0000 | [diff] [blame] | 20 | Entry(const void* buffer, size_t size, const SkBitmap& bm) |
| 21 | : fPrev(NULL), |
| 22 | fNext(NULL), |
| 23 | fBitmap(bm) { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 24 | fBuffer = sk_malloc_throw(size); |
| 25 | fSize = size; |
| 26 | memcpy(fBuffer, buffer, size); |
| 27 | } |
| 28 | |
| 29 | ~Entry() { sk_free(fBuffer); } |
| 30 | |
| 31 | bool equals(const void* buffer, size_t size) const { |
| 32 | return (fSize == size) && !memcmp(fBuffer, buffer, size); |
| 33 | } |
| 34 | }; |
| 35 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 36 | SkGradientBitmapCache::SkGradientBitmapCache(int max) : fMaxEntries(max) { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 37 | fEntryCount = 0; |
| 38 | fHead = fTail = NULL; |
| 39 | |
| 40 | this->validate(); |
| 41 | } |
| 42 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 43 | SkGradientBitmapCache::~SkGradientBitmapCache() { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 44 | this->validate(); |
| 45 | |
| 46 | Entry* entry = fHead; |
| 47 | while (entry) { |
| 48 | Entry* next = entry->fNext; |
| 49 | delete entry; |
| 50 | entry = next; |
| 51 | } |
| 52 | } |
| 53 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 54 | SkGradientBitmapCache::Entry* SkGradientBitmapCache::detach(Entry* entry) const { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 55 | if (entry->fPrev) { |
| 56 | SkASSERT(fHead != entry); |
| 57 | entry->fPrev->fNext = entry->fNext; |
| 58 | } else { |
| 59 | SkASSERT(fHead == entry); |
| 60 | fHead = entry->fNext; |
| 61 | } |
| 62 | if (entry->fNext) { |
| 63 | SkASSERT(fTail != entry); |
| 64 | entry->fNext->fPrev = entry->fPrev; |
| 65 | } else { |
| 66 | SkASSERT(fTail == entry); |
| 67 | fTail = entry->fPrev; |
| 68 | } |
| 69 | return entry; |
| 70 | } |
| 71 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 72 | void SkGradientBitmapCache::attachToHead(Entry* entry) const { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 73 | entry->fPrev = NULL; |
| 74 | entry->fNext = fHead; |
| 75 | if (fHead) { |
| 76 | fHead->fPrev = entry; |
| 77 | } else { |
| 78 | fTail = entry; |
| 79 | } |
| 80 | fHead = entry; |
| 81 | } |
| 82 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 83 | bool SkGradientBitmapCache::find(const void* buffer, size_t size, SkBitmap* bm) const { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 84 | AutoValidate av(this); |
| 85 | |
| 86 | Entry* entry = fHead; |
| 87 | while (entry) { |
| 88 | if (entry->equals(buffer, size)) { |
| 89 | if (bm) { |
| 90 | *bm = entry->fBitmap; |
| 91 | } |
| 92 | // move to the head of our list, so we purge it last |
| 93 | this->detach(entry); |
| 94 | this->attachToHead(entry); |
| 95 | return true; |
| 96 | } |
| 97 | entry = entry->fNext; |
| 98 | } |
| 99 | return false; |
| 100 | } |
| 101 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 102 | void SkGradientBitmapCache::add(const void* buffer, size_t len, const SkBitmap& bm) { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 103 | AutoValidate av(this); |
reed@google.com | e49d571 | 2011-01-19 14:30:26 +0000 | [diff] [blame] | 104 | |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 105 | if (fEntryCount == fMaxEntries) { |
reed@google.com | e49d571 | 2011-01-19 14:30:26 +0000 | [diff] [blame] | 106 | SkASSERT(fTail); |
| 107 | delete this->detach(fTail); |
| 108 | fEntryCount -= 1; |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 109 | } |
| 110 | |
tomhudson@google.com | 060ef18 | 2012-07-24 12:22:40 +0000 | [diff] [blame] | 111 | Entry* entry = SkNEW_ARGS(Entry, (buffer, len, bm)); |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 112 | this->attachToHead(entry); |
| 113 | fEntryCount += 1; |
| 114 | } |
| 115 | |
| 116 | /////////////////////////////////////////////////////////////////////////////// |
| 117 | |
| 118 | #ifdef SK_DEBUG |
| 119 | |
reed | a6cac4c | 2014-08-21 10:50:25 -0700 | [diff] [blame] | 120 | void SkGradientBitmapCache::validate() const { |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 121 | SkASSERT(fEntryCount >= 0 && fEntryCount <= fMaxEntries); |
reed@google.com | e49d571 | 2011-01-19 14:30:26 +0000 | [diff] [blame] | 122 | |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 123 | if (fEntryCount > 0) { |
| 124 | SkASSERT(NULL == fHead->fPrev); |
| 125 | SkASSERT(NULL == fTail->fNext); |
| 126 | |
| 127 | if (fEntryCount == 1) { |
| 128 | SkASSERT(fHead == fTail); |
| 129 | } else { |
| 130 | SkASSERT(fHead != fTail); |
| 131 | } |
| 132 | |
| 133 | Entry* entry = fHead; |
| 134 | int count = 0; |
| 135 | while (entry) { |
| 136 | count += 1; |
| 137 | entry = entry->fNext; |
| 138 | } |
| 139 | SkASSERT(count == fEntryCount); |
reed@google.com | e49d571 | 2011-01-19 14:30:26 +0000 | [diff] [blame] | 140 | |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 141 | entry = fTail; |
| 142 | while (entry) { |
| 143 | count -= 1; |
| 144 | entry = entry->fPrev; |
| 145 | } |
| 146 | SkASSERT(0 == count); |
| 147 | } else { |
| 148 | SkASSERT(NULL == fHead); |
| 149 | SkASSERT(NULL == fTail); |
reed@google.com | e49d571 | 2011-01-19 14:30:26 +0000 | [diff] [blame] | 150 | } |
reed@google.com | dc731fd | 2010-12-23 15:19:47 +0000 | [diff] [blame] | 151 | } |
| 152 | |
| 153 | #endif |