blob: bf7c95fa57effd7b10eea1be24c64a1f18a74aac [file] [log] [blame]
epoger@google.comec3ed6a2011-07-28 14:26:00 +00001/*
2 * Copyright 2011 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 */
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +00007
tfarina@chromium.org8f6884a2014-01-24 20:56:26 +00008#include "SkRandom.h"
reed@google.com63c1ad82011-04-18 14:15:36 +00009#include "Test.h"
rileya@google.com589708b2012-07-26 20:04:23 +000010#include "gradients/SkClampRange.h"
reed@google.com63c1ad82011-04-18 14:15:36 +000011
12static skiatest::Reporter* gReporter;
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000013#define R_ASSERT(cond) if (!(cond)) { \
14 SkDebugf("%d: %s\n", __LINE__, #cond); \
15 REPORTER_ASSERT(gReporter, cond); \
reed@google.com13659f12011-04-18 19:59:38 +000016}
17
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000018// Arbitrary sentinel values outside [0, 0xFFFF].
19static const int kV0 = -42, kV1 = -53, kRamp = -64;
reed@google.com13659f12011-04-18 19:59:38 +000020
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000021static void check_value(int64_t bigfx, int expected) {
22 if (bigfx < 0) {
23 R_ASSERT(expected == kV0);
24 } else if (bigfx > 0xFFFF) {
25 R_ASSERT(expected == kV1);
26 } else if (bigfx == 0xFFFF) {
27 // Either one is fine (and we do see both).
28 R_ASSERT(expected == kV1 || expected == kRamp);
29 } else {
30 R_ASSERT(expected == kRamp);
reed@google.com63c1ad82011-04-18 14:15:36 +000031 }
reed@google.com63c1ad82011-04-18 14:15:36 +000032}
33
reed@google.com63c1ad82011-04-18 14:15:36 +000034static void slow_check(const SkClampRange& range,
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000035 const SkFixed fx, SkFixed dx, int count) {
reed@google.com63c1ad82011-04-18 14:15:36 +000036 SkASSERT(range.fCount0 + range.fCount1 + range.fCount2 == count);
reed@google.com13659f12011-04-18 19:59:38 +000037
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000038 // If dx is large, fx will overflow if updated naively. So we use more bits.
39 int64_t bigfx = fx;
40
reed@google.com33a94e22014-04-18 19:36:22 +000041 for (int i = 0; i < range.fCount0; i++) {
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000042 check_value(bigfx, range.fV0);
43 bigfx += dx;
reed@google.com33a94e22014-04-18 19:36:22 +000044 }
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000045
reed@google.com33a94e22014-04-18 19:36:22 +000046 for (int i = 0; i < range.fCount1; i++) {
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000047 check_value(bigfx, kRamp);
48 bigfx += dx;
reed@google.com33a94e22014-04-18 19:36:22 +000049 }
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000050
reed@google.com33a94e22014-04-18 19:36:22 +000051 for (int i = 0; i < range.fCount2; i++) {
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000052 check_value(bigfx, range.fV1);
53 bigfx += dx;
reed@google.com63c1ad82011-04-18 14:15:36 +000054 }
55}
56
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +000057
reed@google.com63c1ad82011-04-18 14:15:36 +000058static void test_range(SkFixed fx, SkFixed dx, int count) {
59 SkClampRange range;
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000060 range.init(fx, dx, count, kV0, kV1);
reed@google.com63c1ad82011-04-18 14:15:36 +000061 slow_check(range, fx, dx, count);
62}
63
64#define ff(x) SkIntToFixed(x)
65
tfarina@chromium.orge4fafb12013-12-12 21:11:12 +000066DEF_TEST(ClampRange, reporter) {
reed@google.com63c1ad82011-04-18 14:15:36 +000067 gReporter = reporter;
68
69 test_range(0, 0, 20);
70 test_range(0xFFFF, 0, 20);
71 test_range(-ff(2), 0, 20);
72 test_range( ff(2), 0, 20);
rmistry@google.comd6176b02012-08-23 18:14:13 +000073
reed@google.com63c1ad82011-04-18 14:15:36 +000074 test_range(-10, 1, 20);
75 test_range(10, -1, 20);
76 test_range(-10, 3, 20);
77 test_range(10, -3, 20);
reed@google.com13659f12011-04-18 19:59:38 +000078
79 test_range(ff(1), ff(16384), 100);
80 test_range(ff(-1), ff(-16384), 100);
81 test_range(ff(1)/2, ff(16384), 100);
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000082 // TODO(reed): skia:2481, fix whatever bug this is, then uncomment
83 //test_range(ff(1)/2, ff(-16384), 100);
reed@google.com13659f12011-04-18 19:59:38 +000084
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +000085 SkRandom rand;
rmistry@google.comd6176b02012-08-23 18:14:13 +000086
reed@google.com63c1ad82011-04-18 14:15:36 +000087 // test non-overflow cases
88 for (int i = 0; i < 1000000; i++) {
89 SkFixed fx = rand.nextS() >> 1;
90 SkFixed sx = rand.nextS() >> 1;
91 int count = rand.nextU() % 1000 + 1;
92 SkFixed dx = (sx - fx) / count;
93 test_range(fx, dx, count);
94 }
rmistry@google.comd6176b02012-08-23 18:14:13 +000095
commit-bot@chromium.org86398e52014-04-30 16:51:51 +000096 // TODO(reed): skia:2481, fix whatever bug this is, then uncomment
97 /*
reed@google.com63c1ad82011-04-18 14:15:36 +000098 // test overflow cases
reed@google.com13659f12011-04-18 19:59:38 +000099 for (int i = 0; i < 100000; i++) {
reed@google.com63c1ad82011-04-18 14:15:36 +0000100 SkFixed fx = rand.nextS();
reed@google.com13659f12011-04-18 19:59:38 +0000101 SkFixed dx = rand.nextS();
reed@google.com63c1ad82011-04-18 14:15:36 +0000102 int count = rand.nextU() % 1000 + 1;
reed@google.com63c1ad82011-04-18 14:15:36 +0000103 test_range(fx, dx, count);
104 }
commit-bot@chromium.org86398e52014-04-30 16:51:51 +0000105 */
reed@google.com63c1ad82011-04-18 14:15:36 +0000106}