blob: c85b04701bdce2e61226500a2b6c8ff87eabc3d5 [file] [log] [blame]
reed@google.com602a1d72013-07-23 19:13:54 +00001/*
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
8#include "Test.h"
reed@google.come4eb1222013-12-09 22:29:30 +00009#include "SkDiscardableMemory.h"
reed@google.com602a1d72013-07-23 19:13:54 +000010#include "SkScaledImageCache.h"
11
12static void make_bm(SkBitmap* bm, int w, int h) {
13 bm->setConfig(SkBitmap::kARGB_8888_Config, w, h);
14 bm->allocPixels();
15}
16
reed@google.come4eb1222013-12-09 22:29:30 +000017static const int COUNT = 10;
18static const int DIM = 256;
19
20static void test_cache(skiatest::Reporter* reporter, SkScaledImageCache& cache,
21 bool testPurge) {
reed@google.com602a1d72013-07-23 19:13:54 +000022 SkScaledImageCache::ID* id;
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000023
reed@google.com602a1d72013-07-23 19:13:54 +000024 SkBitmap bm[COUNT];
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000025
reed@google.com602a1d72013-07-23 19:13:54 +000026 SkScalar scale = 2;
reed@google.com0e661622013-07-23 19:27:48 +000027 for (int i = 0; i < COUNT; ++i) {
reed@google.com602a1d72013-07-23 19:13:54 +000028 SkBitmap tmp;
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000029
reed@google.com602a1d72013-07-23 19:13:54 +000030 make_bm(&bm[i], DIM, DIM);
31 id = cache.findAndLock(bm[i], scale, scale, &tmp);
32 REPORTER_ASSERT(reporter, NULL == id);
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000033
reed@google.com602a1d72013-07-23 19:13:54 +000034 make_bm(&tmp, DIM, DIM);
35 id = cache.addAndLock(bm[i], scale, scale, tmp);
36 REPORTER_ASSERT(reporter, NULL != id);
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000037
reed@google.com602a1d72013-07-23 19:13:54 +000038 SkBitmap tmp2;
39 SkScaledImageCache::ID* id2 = cache.findAndLock(bm[i], scale, scale,
40 &tmp2);
41 REPORTER_ASSERT(reporter, id == id2);
42 REPORTER_ASSERT(reporter, tmp.pixelRef() == tmp2.pixelRef());
43 REPORTER_ASSERT(reporter, tmp.width() == tmp2.width());
44 REPORTER_ASSERT(reporter, tmp.height() == tmp2.height());
45 cache.unlock(id2);
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000046
reed@google.com602a1d72013-07-23 19:13:54 +000047 cache.unlock(id);
48 }
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000049
reed@google.come4eb1222013-12-09 22:29:30 +000050 if (testPurge) {
51 // stress test, should trigger purges
52 for (size_t i = 0; i < COUNT * 100; ++i) {
53 scale += 1;
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000054
reed@google.come4eb1222013-12-09 22:29:30 +000055 SkBitmap tmp;
skia.committer@gmail.comcf0803b2013-12-10 07:02:03 +000056
reed@google.come4eb1222013-12-09 22:29:30 +000057 make_bm(&tmp, DIM, DIM);
58 id = cache.addAndLock(bm[0], scale, scale, tmp);
59 REPORTER_ASSERT(reporter, NULL != id);
60 cache.unlock(id);
61 }
reed@google.com602a1d72013-07-23 19:13:54 +000062 }
reed@google.com602a1d72013-07-23 19:13:54 +000063 cache.setByteLimit(0);
64}
65
reed@google.come4eb1222013-12-09 22:29:30 +000066static void TestImageCache(skiatest::Reporter* reporter) {
67 {
68 static const size_t defLimit = DIM * DIM * 4 * COUNT + 1024; // 1K slop
69 SkScaledImageCache cache(defLimit);
70 test_cache(reporter, cache, true);
71 }
72 {
73 SkScaledImageCache cache(SkDiscardableMemory::Create);
74 test_cache(reporter, cache, false);
75 }
76}
77
reed@google.com602a1d72013-07-23 19:13:54 +000078#include "TestClassDef.h"
79DEFINE_TESTCLASS("ImageCache", TestImageCacheClass, TestImageCache)
rmistry@google.comd6bab022013-12-02 13:50:38 +000080
81DEF_TEST(ImageCache_doubleAdd, r) {
82 // Adding the same key twice should be safe.
83 SkScaledImageCache cache(1024);
84
85 SkBitmap original;
86 original.setConfig(SkBitmap::kARGB_8888_Config, 40, 40);
87 original.allocPixels();
88
89 SkBitmap scaled;
90 scaled.setConfig(SkBitmap::kARGB_8888_Config, 20, 20);
91 scaled.allocPixels();
92
93 SkScaledImageCache::ID* id1 = cache.addAndLock(original, 0.5f, 0.5f, scaled);
94 SkScaledImageCache::ID* id2 = cache.addAndLock(original, 0.5f, 0.5f, scaled);
95 // We don't really care if id1 == id2 as long as unlocking both works.
96 cache.unlock(id1);
97 cache.unlock(id2);
98}