2 * Copyright 2013 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
8 #include "SkDiscardableMemory.h"
9 #include "SkResourceCache.h"
13 static void* gGlobalAddress;
14 struct TestingKey : public SkResourceCache::Key {
18 TestingKey(intptr_t value) : fPtr(&gGlobalAddress), fValue(value) {
19 this->init(sizeof(fPtr) + sizeof(fValue));
22 struct TestingRec : public SkResourceCache::Rec {
23 TestingRec(const TestingKey& key, uint32_t value) : fKey(key), fValue(value) {}
28 virtual const Key& getKey() const SK_OVERRIDE { return fKey; }
29 virtual size_t bytesUsed() const SK_OVERRIDE { return sizeof(fKey) + sizeof(fValue); }
31 static bool Visitor(const SkResourceCache::Rec& baseRec, void* context) {
32 const TestingRec& rec = static_cast<const TestingRec&>(baseRec);
33 intptr_t* result = (intptr_t*)context;
41 static const int COUNT = 10;
42 static const int DIM = 256;
44 static void test_cache(skiatest::Reporter* reporter, SkResourceCache& cache, bool testPurge) {
45 for (int i = 0; i < COUNT; ++i) {
49 REPORTER_ASSERT(reporter, !cache.find(key, TestingRec::Visitor, &value));
50 REPORTER_ASSERT(reporter, -1 == value);
52 cache.add(SkNEW_ARGS(TestingRec, (key, i)));
54 REPORTER_ASSERT(reporter, cache.find(key, TestingRec::Visitor, &value));
55 REPORTER_ASSERT(reporter, i == value);
59 // stress test, should trigger purges
60 for (size_t i = 0; i < COUNT * 100; ++i) {
62 cache.add(SkNEW_ARGS(TestingRec, (key, i)));
66 // test the originals after all that purging
67 for (int i = 0; i < COUNT; ++i) {
69 (void)cache.find(TestingKey(i), TestingRec::Visitor, &value);
72 cache.setTotalByteLimit(0);
75 #include "SkDiscardableMemoryPool.h"
77 static SkDiscardableMemoryPool* gPool;
78 static SkDiscardableMemory* pool_factory(size_t bytes) {
80 return gPool->create(bytes);
83 DEF_TEST(ImageCache, reporter) {
84 static const size_t defLimit = DIM * DIM * 4 * COUNT + 1024; // 1K slop
87 SkResourceCache cache(defLimit);
88 test_cache(reporter, cache, true);
91 SkAutoTUnref<SkDiscardableMemoryPool> pool(
92 SkDiscardableMemoryPool::Create(defLimit, NULL));
94 SkResourceCache cache(pool_factory);
95 test_cache(reporter, cache, true);
98 SkResourceCache cache(SkDiscardableMemory::Create);
99 test_cache(reporter, cache, false);
103 DEF_TEST(ImageCache_doubleAdd, r) {
104 // Adding the same key twice should be safe.
105 SkResourceCache cache(4096);
109 cache.add(SkNEW_ARGS(TestingRec, (key, 2)));
110 cache.add(SkNEW_ARGS(TestingRec, (key, 3)));
112 // Lookup can return either value.
114 REPORTER_ASSERT(r, cache.find(key, TestingRec::Visitor, &value));
115 REPORTER_ASSERT(r, 2 == value || 3 == value);