reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2013 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 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 8 | #ifndef SkResourceCache_DEFINED |
| 9 | #define SkResourceCache_DEFINED |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 10 | |
| 11 | #include "SkBitmap.h" |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 12 | #include "SkMessageBus.h" |
| 13 | #include "SkTDArray.h" |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 14 | |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame] | 15 | class SkCachedData; |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 16 | class SkDiscardableMemory; |
ssid | 33c594c | 2015-08-27 09:23:54 -0700 | [diff] [blame] | 17 | class SkTraceMemoryDump; |
reed@google.com | d94697c | 2013-07-24 14:31:33 +0000 | [diff] [blame] | 18 | |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 19 | /** |
| 20 | * Cache object for bitmaps (with possible scale in X Y as part of the key). |
| 21 | * |
| 22 | * Multiple caches can be instantiated, but each instance is not implicitly |
| 23 | * thread-safe, so if a given instance is to be shared across threads, the |
| 24 | * caller must manage the access itself (e.g. via a mutex). |
| 25 | * |
| 26 | * As a convenience, a global instance is also defined, which can be safely |
| 27 | * access across threads via the static methods (e.g. FindAndLock, etc.). |
| 28 | */ |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 29 | class SkResourceCache { |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 30 | public: |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 31 | struct Key { |
bungeman | 70bb808 | 2016-02-17 10:13:49 -0800 | [diff] [blame] | 32 | /** Key subclasses must call this after their own fields and data are initialized. |
| 33 | * All fields and data must be tightly packed. |
| 34 | * @param nameSpace must be unique per Key subclass. |
| 35 | * @param sharedID == 0 means ignore this field, does not support group purging. |
| 36 | * @param dataSize is size of fields and data of the subclass, must be a multiple of 4. |
| 37 | */ |
| 38 | void init(void* nameSpace, uint64_t sharedID, size_t dataSize); |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 39 | |
bungeman | 70bb808 | 2016-02-17 10:13:49 -0800 | [diff] [blame] | 40 | /** Returns the size of this key. */ |
| 41 | size_t size() const { |
| 42 | return fCount32 << 2; |
| 43 | } |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 44 | |
| 45 | void* getNamespace() const { return fNamespace; } |
| 46 | uint64_t getSharedID() const { return ((uint64_t)fSharedID_hi << 32) | fSharedID_lo; } |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 47 | |
| 48 | // This is only valid after having called init(). |
| 49 | uint32_t hash() const { return fHash; } |
| 50 | |
| 51 | bool operator==(const Key& other) const { |
| 52 | const uint32_t* a = this->as32(); |
| 53 | const uint32_t* b = other.as32(); |
mtklein | 484bbe5 | 2014-10-21 10:55:22 -0700 | [diff] [blame] | 54 | for (int i = 0; i < fCount32; ++i) { // (This checks fCount == other.fCount first.) |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 55 | if (a[i] != b[i]) { |
| 56 | return false; |
| 57 | } |
| 58 | } |
| 59 | return true; |
| 60 | } |
| 61 | |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 62 | private: |
fmalita | 171e5b7 | 2014-10-22 11:20:40 -0700 | [diff] [blame] | 63 | int32_t fCount32; // local + user contents count32 |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 64 | uint32_t fHash; |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 65 | // split uint64_t into hi and lo so we don't force ourselves to pad on 32bit machines. |
| 66 | uint32_t fSharedID_lo; |
| 67 | uint32_t fSharedID_hi; |
fmalita | 171e5b7 | 2014-10-22 11:20:40 -0700 | [diff] [blame] | 68 | void* fNamespace; // A unique namespace tag. This is hashed. |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 69 | /* uint32_t fContents32[] */ |
| 70 | |
| 71 | const uint32_t* as32() const { return (const uint32_t*)this; } |
reed | 4f987e9 | 2014-08-20 13:41:56 -0700 | [diff] [blame] | 72 | }; |
| 73 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 74 | struct Rec { |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 75 | typedef SkResourceCache::Key Key; |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 76 | |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 77 | Rec() {} |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 78 | virtual ~Rec() {} |
| 79 | |
| 80 | uint32_t getHash() const { return this->getKey().hash(); } |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 81 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 82 | virtual const Key& getKey() const = 0; |
| 83 | virtual size_t bytesUsed() const = 0; |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 84 | |
reed | 216b643 | 2015-08-19 12:25:40 -0700 | [diff] [blame] | 85 | // for memory usage diagnostics |
| 86 | virtual const char* getCategory() const = 0; |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 87 | virtual SkDiscardableMemory* diagnostic_only_getDiscardable() const { return nullptr; } |
reed | 216b643 | 2015-08-19 12:25:40 -0700 | [diff] [blame] | 88 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 89 | // for SkTDynamicHash::Traits |
| 90 | static uint32_t Hash(const Key& key) { return key.hash(); } |
| 91 | static const Key& GetKey(const Rec& rec) { return rec.getKey(); } |
| 92 | |
| 93 | private: |
| 94 | Rec* fNext; |
| 95 | Rec* fPrev; |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 96 | |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 97 | friend class SkResourceCache; |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 98 | }; |
| 99 | |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 100 | // Used with SkMessageBus |
| 101 | struct PurgeSharedIDMessage { |
| 102 | PurgeSharedIDMessage(uint64_t sharedID) : fSharedID(sharedID) {} |
| 103 | |
| 104 | uint64_t fSharedID; |
| 105 | }; |
| 106 | |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 107 | typedef const Rec* ID; |
| 108 | |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 109 | /** |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 110 | * Callback function for find(). If called, the cache will have found a match for the |
| 111 | * specified Key, and will pass in the corresponding Rec, along with a caller-specified |
| 112 | * context. The function can read the data in Rec, and copy whatever it likes into context |
| 113 | * (casting context to whatever it really is). |
| 114 | * |
| 115 | * The return value determines what the cache will do with the Rec. If the function returns |
| 116 | * true, then the Rec is considered "valid". If false is returned, the Rec will be considered |
| 117 | * "stale" and will be purged from the cache. |
| 118 | */ |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 119 | typedef bool (*FindVisitor)(const Rec&, void* context); |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 120 | |
| 121 | /** |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 122 | * Returns a locked/pinned SkDiscardableMemory instance for the specified |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 123 | * number of bytes, or nullptr on failure. |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 124 | */ |
| 125 | typedef SkDiscardableMemory* (*DiscardableFactory)(size_t bytes); |
| 126 | |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 127 | /* |
| 128 | * The following static methods are thread-safe wrappers around a global |
| 129 | * instance of this cache. |
| 130 | */ |
| 131 | |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 132 | /** |
| 133 | * Returns true if the visitor was called on a matching Key, and the visitor returned true. |
| 134 | * |
| 135 | * Find() will search the cache for the specified Key. If no match is found, return false and |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 136 | * do not call the FindVisitor. If a match is found, return whatever the visitor returns. |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 137 | * Its return value is interpreted to mean: |
| 138 | * true : Rec is valid |
| 139 | * false : Rec is "stale" -- the cache will purge it. |
| 140 | */ |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 141 | static bool Find(const Key& key, FindVisitor, void* context); |
reed | 680fb9e | 2014-08-26 09:08:04 -0700 | [diff] [blame] | 142 | static void Add(Rec*); |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 143 | |
reed | 216b643 | 2015-08-19 12:25:40 -0700 | [diff] [blame] | 144 | typedef void (*Visitor)(const Rec&, void* context); |
| 145 | // Call the visitor for every Rec in the cache. |
| 146 | static void VisitAll(Visitor, void* context); |
| 147 | |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 148 | static size_t GetTotalBytesUsed(); |
| 149 | static size_t GetTotalByteLimit(); |
| 150 | static size_t SetTotalByteLimit(size_t newLimit); |
| 151 | |
| 152 | static size_t SetSingleAllocationByteLimit(size_t); |
| 153 | static size_t GetSingleAllocationByteLimit(); |
reed | 1d9e80f | 2015-01-26 11:24:37 -0800 | [diff] [blame] | 154 | static size_t GetEffectiveSingleAllocationByteLimit(); |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 155 | |
reed | 56b00d9 | 2014-09-11 12:22:34 -0700 | [diff] [blame] | 156 | static void PurgeAll(); |
| 157 | |
reed | 216b643 | 2015-08-19 12:25:40 -0700 | [diff] [blame] | 158 | static void TestDumpMemoryStatistics(); |
| 159 | |
ssid | 33c594c | 2015-08-27 09:23:54 -0700 | [diff] [blame] | 160 | /** Dump memory usage statistics of every Rec in the cache using the |
| 161 | SkTraceMemoryDump interface. |
| 162 | */ |
| 163 | static void DumpMemoryStatistics(SkTraceMemoryDump* dump); |
| 164 | |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 165 | /** |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 166 | * Returns the DiscardableFactory used by the global cache, or nullptr. |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 167 | */ |
| 168 | static DiscardableFactory GetDiscardableFactory(); |
| 169 | |
| 170 | /** |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 171 | * Use this allocator for bitmaps, so they can use ashmem when available. |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 172 | * Returns nullptr if the ResourceCache has not been initialized with a DiscardableFactory. |
piotaixr | 8159146 | 2014-09-02 11:27:11 -0700 | [diff] [blame] | 173 | */ |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 174 | static SkBitmap::Allocator* GetAllocator(); |
| 175 | |
qiankun.miao | d9aac34 | 2014-10-23 07:58:17 -0700 | [diff] [blame] | 176 | static SkCachedData* NewCachedData(size_t bytes); |
| 177 | |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 178 | static void PostPurgeSharedID(uint64_t sharedID); |
| 179 | |
reed@google.com | fa7fd80 | 2013-12-12 21:37:25 +0000 | [diff] [blame] | 180 | /** |
| 181 | * Call SkDebugf() with diagnostic information about the state of the cache |
| 182 | */ |
| 183 | static void Dump(); |
| 184 | |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 185 | /////////////////////////////////////////////////////////////////////////// |
| 186 | |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 187 | /** |
| 188 | * Construct the cache to call DiscardableFactory when it |
| 189 | * allocates memory for the pixels. In this mode, the cache has |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 190 | * not explicit budget, and so methods like getTotalBytesUsed() |
| 191 | * and getTotalByteLimit() will return 0, and setTotalByteLimit |
| 192 | * will ignore its argument and return 0. |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 193 | */ |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 194 | SkResourceCache(DiscardableFactory); |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 195 | |
| 196 | /** |
| 197 | * Construct the cache, allocating memory with malloc, and respect the |
| 198 | * byteLimit, purging automatically when a new image is added to the cache |
| 199 | * that pushes the total bytesUsed over the limit. Note: The limit can be |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 200 | * changed at runtime with setTotalByteLimit. |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 201 | */ |
reed | 011f39a | 2014-08-28 13:35:23 -0700 | [diff] [blame] | 202 | explicit SkResourceCache(size_t byteLimit); |
| 203 | ~SkResourceCache(); |
skia.committer@gmail.com | 7f1af50 | 2013-07-24 07:01:12 +0000 | [diff] [blame] | 204 | |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 205 | /** |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 206 | * Returns true if the visitor was called on a matching Key, and the visitor returned true. |
| 207 | * |
| 208 | * find() will search the cache for the specified Key. If no match is found, return false and |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 209 | * do not call the FindVisitor. If a match is found, return whatever the visitor returns. |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 210 | * Its return value is interpreted to mean: |
| 211 | * true : Rec is valid |
| 212 | * false : Rec is "stale" -- the cache will purge it. |
reed | 595aa05 | 2014-09-15 10:15:18 -0700 | [diff] [blame] | 213 | */ |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 214 | bool find(const Key&, FindVisitor, void* context); |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 215 | void add(Rec*); |
reed | 216b643 | 2015-08-19 12:25:40 -0700 | [diff] [blame] | 216 | void visitAll(Visitor, void* context); |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 217 | |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 218 | size_t getTotalBytesUsed() const { return fTotalBytesUsed; } |
| 219 | size_t getTotalByteLimit() const { return fTotalByteLimit; } |
skia.committer@gmail.com | 7f1af50 | 2013-07-24 07:01:12 +0000 | [diff] [blame] | 220 | |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 221 | /** |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 222 | * This is respected by SkBitmapProcState::possiblyScaleImage. |
| 223 | * 0 is no maximum at all; this is the default. |
| 224 | * setSingleAllocationByteLimit() returns the previous value. |
| 225 | */ |
| 226 | size_t setSingleAllocationByteLimit(size_t maximumAllocationSize); |
| 227 | size_t getSingleAllocationByteLimit() const; |
reed | 1d9e80f | 2015-01-26 11:24:37 -0800 | [diff] [blame] | 228 | // returns the logical single allocation size (pinning against the budget when the cache |
| 229 | // is not backed by discardable memory. |
| 230 | size_t getEffectiveSingleAllocationByteLimit() const; |
| 231 | |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 232 | /** |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 233 | * Set the maximum number of bytes available to this cache. If the current |
| 234 | * cache exceeds this new value, it will be purged to try to fit within |
| 235 | * this new limit. |
| 236 | */ |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 237 | size_t setTotalByteLimit(size_t newLimit); |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 238 | |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 239 | void purgeSharedID(uint64_t sharedID); |
| 240 | |
reed | 56b00d9 | 2014-09-11 12:22:34 -0700 | [diff] [blame] | 241 | void purgeAll() { |
| 242 | this->purgeAsNeeded(true); |
| 243 | } |
| 244 | |
reed | 30ad530 | 2014-09-16 10:39:55 -0700 | [diff] [blame] | 245 | DiscardableFactory discardableFactory() const { return fDiscardableFactory; } |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 246 | SkBitmap::Allocator* allocator() const { return fAllocator; }; |
| 247 | |
reed | 9d93c2e | 2014-10-08 05:17:12 -0700 | [diff] [blame] | 248 | SkCachedData* newCachedData(size_t bytes); |
| 249 | |
reed@google.com | fa7fd80 | 2013-12-12 21:37:25 +0000 | [diff] [blame] | 250 | /** |
| 251 | * Call SkDebugf() with diagnostic information about the state of the cache |
| 252 | */ |
| 253 | void dump() const; |
| 254 | |
reed@google.com | 5d1e558 | 2013-07-25 14:36:15 +0000 | [diff] [blame] | 255 | private: |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 256 | Rec* fHead; |
| 257 | Rec* fTail; |
| 258 | |
reed@google.com | 5d1e558 | 2013-07-25 14:36:15 +0000 | [diff] [blame] | 259 | class Hash; |
| 260 | Hash* fHash; |
| 261 | |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 262 | DiscardableFactory fDiscardableFactory; |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 263 | // the allocator is nullptr or one that matches discardables |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 264 | SkBitmap::Allocator* fAllocator; |
| 265 | |
halcanary | 805ef15 | 2014-07-17 06:58:01 -0700 | [diff] [blame] | 266 | size_t fTotalBytesUsed; |
| 267 | size_t fTotalByteLimit; |
| 268 | size_t fSingleAllocationByteLimit; |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 269 | int fCount; |
| 270 | |
reed | 7eeba25 | 2015-02-24 13:54:23 -0800 | [diff] [blame] | 271 | SkMessageBus<PurgeSharedIDMessage>::Inbox fPurgeSharedIDInbox; |
| 272 | |
| 273 | void checkMessages(); |
reed | 56b00d9 | 2014-09-11 12:22:34 -0700 | [diff] [blame] | 274 | void purgeAsNeeded(bool forcePurge = false); |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 275 | |
| 276 | // linklist management |
| 277 | void moveToHead(Rec*); |
| 278 | void addToHead(Rec*); |
mtklein | 18300a3 | 2016-03-16 13:53:35 -0700 | [diff] [blame^] | 279 | void release(Rec*); |
reed | c90e014 | 2014-09-15 11:39:44 -0700 | [diff] [blame] | 280 | void remove(Rec*); |
reed@google.com | e4eb122 | 2013-12-09 22:29:30 +0000 | [diff] [blame] | 281 | |
| 282 | void init(); // called by constructors |
| 283 | |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 284 | #ifdef SK_DEBUG |
| 285 | void validate() const; |
| 286 | #else |
| 287 | void validate() const {} |
| 288 | #endif |
| 289 | }; |
reed@google.com | 602a1d7 | 2013-07-23 19:13:54 +0000 | [diff] [blame] | 290 | #endif |