OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2010 Google Inc. | 2 * Copyright 2010 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #ifndef SkGlyphCache_Globals_DEFINED | 8 #ifndef SkGlyphCache_Globals_DEFINED |
9 #define SkGlyphCache_Globals_DEFINED | 9 #define SkGlyphCache_Globals_DEFINED |
10 | 10 |
11 #include "SkGlyphCache.h" | 11 #include "SkGlyphCache.h" |
12 #include "SkMutex.h" | 12 #include "SkMutex.h" |
13 #include "SkSpinlock.h" | 13 #include "SkSpinlock.h" |
14 #include "SkTLS.h" | 14 #include "SkTLS.h" |
15 | 15 |
16 #ifndef SK_DEFAULT_FONT_CACHE_COUNT_LIMIT | 16 #ifndef SK_DEFAULT_FONT_CACHE_COUNT_LIMIT |
17 #define SK_DEFAULT_FONT_CACHE_COUNT_LIMIT 2048 | 17 #define SK_DEFAULT_FONT_CACHE_COUNT_LIMIT 2048 |
18 #endif | 18 #endif |
19 | 19 |
20 #ifndef SK_DEFAULT_FONT_CACHE_LIMIT | 20 #ifndef SK_DEFAULT_FONT_CACHE_LIMIT |
21 #define SK_DEFAULT_FONT_CACHE_LIMIT (2 * 1024 * 1024) | 21 #define SK_DEFAULT_FONT_CACHE_LIMIT (2 * 1024 * 1024) |
22 #endif | 22 #endif |
23 | 23 |
24 /////////////////////////////////////////////////////////////////////////////// | 24 /////////////////////////////////////////////////////////////////////////////// |
25 | 25 |
26 class SkGlyphCache_Globals { | 26 class SkGlyphCache_Globals { |
27 public: | 27 public: |
28 SkGlyphCache_Globals() { | 28 SkGlyphCache_Globals() { |
29 fHead = NULL; | 29 fHead = NULL; |
30 fTotalMemoryUsed = 0; | 30 fTotalMemoryUsed.store(0); |
31 fCacheSizeLimit = SK_DEFAULT_FONT_CACHE_LIMIT; | 31 fCacheSizeLimit = SK_DEFAULT_FONT_CACHE_LIMIT; |
32 fCacheCount = 0; | 32 fCacheCount = 0; |
33 fCacheCountLimit = SK_DEFAULT_FONT_CACHE_COUNT_LIMIT; | 33 fCacheCountLimit = SK_DEFAULT_FONT_CACHE_COUNT_LIMIT; |
34 } | 34 } |
35 | 35 |
36 ~SkGlyphCache_Globals() { | 36 ~SkGlyphCache_Globals() { |
37 SkGlyphCache* cache = fHead; | 37 SkGlyphCache* cache = fHead; |
38 while (cache) { | 38 while (cache) { |
39 SkGlyphCache* next = cache->fNext; | 39 SkGlyphCache* next = cache->fNext; |
40 SkDELETE(cache); | 40 SkDELETE(cache); |
41 cache = next; | 41 cache = next; |
42 } | 42 } |
43 } | 43 } |
44 | 44 |
45 SkSpinlock fLock; | 45 SkSpinlock fLock; |
46 | 46 |
47 SkGlyphCache* internalGetHead() const { return fHead; } | 47 SkGlyphCache* internalGetHead() const { return fHead; } |
48 SkGlyphCache* internalGetTail() const; | 48 SkGlyphCache* internalGetTail() const; |
49 | 49 |
50 size_t getTotalMemoryUsed() const { return fTotalMemoryUsed; } | 50 size_t getTotalMemoryUsed() const { return fTotalMemoryUsed.load(); } |
| 51 void increaseTotalMemoryUsed(size_t increase) { fTotalMemoryUsed.fetch_add(i
ncrease);} |
51 int getCacheCountUsed() const { return fCacheCount; } | 52 int getCacheCountUsed() const { return fCacheCount; } |
52 | 53 |
53 #ifdef SK_DEBUG | 54 #ifdef SK_DEBUG |
54 void validate() const; | 55 void validate() const; |
55 #else | 56 #else |
56 void validate() const {} | 57 void validate() const {} |
57 #endif | 58 #endif |
58 | 59 |
59 int getCacheCountLimit() const { return fCacheCountLimit; } | 60 int getCacheCountLimit() const { return fCacheCountLimit; } |
60 int setCacheCountLimit(int limit); | 61 int setCacheCountLimit(int limit); |
61 | 62 |
62 size_t getCacheSizeLimit() const { return fCacheSizeLimit; } | 63 size_t getCacheSizeLimit() const { return fCacheSizeLimit; } |
63 size_t setCacheSizeLimit(size_t limit); | 64 size_t setCacheSizeLimit(size_t limit); |
64 | 65 |
65 // returns true if this cache is over-budget either due to size limit | 66 // returns true if this cache is over-budget either due to size limit |
66 // or count limit. | 67 // or count limit. |
67 bool isOverBudget() const { | 68 bool isOverBudget() const { |
68 return fCacheCount > fCacheCountLimit || | 69 return fCacheCount > fCacheCountLimit || |
69 fTotalMemoryUsed > fCacheSizeLimit; | 70 fTotalMemoryUsed.load() > fCacheSizeLimit; |
70 } | 71 } |
71 | 72 |
72 void purgeAll(); // does not change budget | 73 void purgeAll(); // does not change budget |
73 | 74 |
74 // call when a glyphcache is available for caching (i.e. not in use) | 75 // call when a glyphcache is available for caching (i.e. not in use) |
75 void attachCacheToHead(SkGlyphCache*); | 76 void attachCacheToHead(SkGlyphCache*); |
76 | 77 |
77 // can only be called when the mutex is already held | 78 // can only be called when the mutex is already held |
78 void internalDetachCache(SkGlyphCache*); | 79 //void internalDetachCache(SkGlyphCache*); |
79 void internalAttachCacheToHead(SkGlyphCache*); | 80 void internalMoveToHead(SkGlyphCache *); |
| 81 // Checkout budgets, modulated by the specified min-bytes-needed-to-purge, |
| 82 // and attempt to purge caches to match. |
| 83 // Returns number of bytes freed. |
| 84 void internalDetachCache(SkGlyphCache* cache); |
| 85 size_t internalPurge(size_t minBytesNeeded = 0); |
80 | 86 |
81 private: | 87 private: |
82 SkGlyphCache* fHead; | 88 SkGlyphCache* fHead; |
83 size_t fTotalMemoryUsed; | 89 SkAtomic<size_t> fTotalMemoryUsed; |
84 size_t fCacheSizeLimit; | 90 size_t fCacheSizeLimit; |
85 int32_t fCacheCountLimit; | 91 int32_t fCacheCountLimit; |
86 int32_t fCacheCount; | 92 int32_t fCacheCount; |
87 | 93 |
88 // Checkout budgets, modulated by the specified min-bytes-needed-to-purge, | |
89 // and attempt to purge caches to match. | |
90 // Returns number of bytes freed. | |
91 size_t internalPurge(size_t minBytesNeeded = 0); | |
92 }; | 94 }; |
93 | 95 |
94 #endif | 96 #endif |
OLD | NEW |