blob: 13e0a9f61fba5ba83327beaebcc52de1a464cd30 [file] [log] [blame]
mtkleinc9adb052015-03-30 10:50:27 -07001/*
2 * Copyright 2015 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
mtklein37478752015-06-15 10:58:42 -07008#include "Sk4px.h"
mtkleinc9adb052015-03-30 10:50:27 -07009#include "SkNx.h"
mtklein27e517a2015-05-14 17:53:04 -070010#include "SkRandom.h"
mtkleinc9adb052015-03-30 10:50:27 -070011#include "Test.h"
12
mtklein6f797092015-11-09 08:33:53 -080013template <int N>
mtkleinc9adb052015-03-30 10:50:27 -070014static void test_Nf(skiatest::Reporter* r) {
15
mtklein6c221b42015-11-20 13:53:19 -080016 auto assert_nearly_eq = [&](float eps, const SkNx<N, float>& v,
17 float a, float b, float c, float d) {
mtklein6f797092015-11-09 08:33:53 -080018 auto close = [=](float a, float b) { return fabsf(a-b) <= eps; };
19 float vals[4];
mtkleinc9adb052015-03-30 10:50:27 -070020 v.store(vals);
mtkleina156a8f2015-04-03 06:16:13 -070021 bool ok = close(vals[0], a) && close(vals[1], b)
22 && close(v.template kth<0>(), a) && close(v.template kth<1>(), b);
23 REPORTER_ASSERT(r, ok);
mtkleinc9adb052015-03-30 10:50:27 -070024 if (N == 4) {
mtkleina156a8f2015-04-03 06:16:13 -070025 ok = close(vals[2], c) && close(vals[3], d)
26 && close(v.template kth<2>(), c) && close(v.template kth<3>(), d);
27 REPORTER_ASSERT(r, ok);
mtkleinc9adb052015-03-30 10:50:27 -070028 }
29 };
mtklein6c221b42015-11-20 13:53:19 -080030 auto assert_eq = [&](const SkNx<N, float>& v, float a, float b, float c, float d) {
mtkleinc9adb052015-03-30 10:50:27 -070031 return assert_nearly_eq(0, v, a,b,c,d);
32 };
33
mtklein6f797092015-11-09 08:33:53 -080034 float vals[] = {3, 4, 5, 6};
mtklein6c221b42015-11-20 13:53:19 -080035 SkNx<N,float> a = SkNx<N,float>::Load(vals),
36 b(a),
37 c = a;
38 SkNx<N,float> d;
mtkleinc9adb052015-03-30 10:50:27 -070039 d = a;
40
41 assert_eq(a, 3, 4, 5, 6);
42 assert_eq(b, 3, 4, 5, 6);
43 assert_eq(c, 3, 4, 5, 6);
44 assert_eq(d, 3, 4, 5, 6);
45
46 assert_eq(a+b, 6, 8, 10, 12);
47 assert_eq(a*b, 9, 16, 25, 36);
48 assert_eq(a*b-b, 6, 12, 20, 30);
49 assert_eq((a*b).sqrt(), 3, 4, 5, 6);
50 assert_eq(a/b, 1, 1, 1, 1);
mtklein6c221b42015-11-20 13:53:19 -080051 assert_eq(SkNx<N,float>(0)-a, -3, -4, -5, -6);
mtkleinc9adb052015-03-30 10:50:27 -070052
mtklein6c221b42015-11-20 13:53:19 -080053 SkNx<N,float> fours(4);
mtkleinc9adb052015-03-30 10:50:27 -070054
55 assert_eq(fours.sqrt(), 2,2,2,2);
mtklein6f797092015-11-09 08:33:53 -080056 assert_nearly_eq(0.001f, fours.rsqrt0(), 0.5, 0.5, 0.5, 0.5);
57 assert_nearly_eq(0.001f, fours.rsqrt1(), 0.5, 0.5, 0.5, 0.5);
58 assert_nearly_eq(0.001f, fours.rsqrt2(), 0.5, 0.5, 0.5, 0.5);
mtkleinc9adb052015-03-30 10:50:27 -070059
mtklein6f797092015-11-09 08:33:53 -080060 assert_eq( fours. invert(), 0.25, 0.25, 0.25, 0.25);
61 assert_nearly_eq(0.001f, fours.approxInvert(), 0.25, 0.25, 0.25, 0.25);
mtkleinc9adb052015-03-30 10:50:27 -070062
mtklein6c221b42015-11-20 13:53:19 -080063 assert_eq(SkNx<N,float>::Min(a, fours), 3, 4, 4, 4);
64 assert_eq(SkNx<N,float>::Max(a, fours), 4, 4, 5, 6);
mtkleinc9adb052015-03-30 10:50:27 -070065
66 // Test some comparisons. This is not exhaustive.
67 REPORTER_ASSERT(r, (a == b).allTrue());
68 REPORTER_ASSERT(r, (a+b == a*b-b).anyTrue());
69 REPORTER_ASSERT(r, !(a+b == a*b-b).allTrue());
70 REPORTER_ASSERT(r, !(a+b == a*b).anyTrue());
71 REPORTER_ASSERT(r, !(a != b).anyTrue());
72 REPORTER_ASSERT(r, (a < fours).anyTrue());
73 REPORTER_ASSERT(r, (a <= fours).anyTrue());
74 REPORTER_ASSERT(r, !(a > fours).allTrue());
75 REPORTER_ASSERT(r, !(a >= fours).allTrue());
76}
77
78DEF_TEST(SkNf, r) {
mtklein6f797092015-11-09 08:33:53 -080079 test_Nf<2>(r);
80 test_Nf<4>(r);
mtkleinc9adb052015-03-30 10:50:27 -070081}
mtklein115acee2015-04-14 14:02:52 -070082
83template <int N, typename T>
84void test_Ni(skiatest::Reporter* r) {
mtklein6c221b42015-11-20 13:53:19 -080085 auto assert_eq = [&](const SkNx<N,T>& v, T a, T b, T c, T d, T e, T f, T g, T h) {
mtklein115acee2015-04-14 14:02:52 -070086 T vals[8];
87 v.store(vals);
88
89 switch (N) {
90 case 8: REPORTER_ASSERT(r, vals[4] == e && vals[5] == f && vals[6] == g && vals[7] == h);
91 case 4: REPORTER_ASSERT(r, vals[2] == c && vals[3] == d);
92 case 2: REPORTER_ASSERT(r, vals[0] == a && vals[1] == b);
93 }
mtklein1113da72015-04-27 12:08:01 -070094 switch (N) {
95 case 8: REPORTER_ASSERT(r, v.template kth<4>() == e && v.template kth<5>() == f &&
96 v.template kth<6>() == g && v.template kth<7>() == h);
97 case 4: REPORTER_ASSERT(r, v.template kth<2>() == c && v.template kth<3>() == d);
98 case 2: REPORTER_ASSERT(r, v.template kth<0>() == a && v.template kth<1>() == b);
99 }
mtklein115acee2015-04-14 14:02:52 -0700100 };
101
102 T vals[] = { 1,2,3,4,5,6,7,8 };
mtklein6c221b42015-11-20 13:53:19 -0800103 SkNx<N,T> a = SkNx<N,T>::Load(vals),
mtklein115acee2015-04-14 14:02:52 -0700104 b(a),
105 c = a;
mtklein6c221b42015-11-20 13:53:19 -0800106 SkNx<N,T> d;
mtklein115acee2015-04-14 14:02:52 -0700107 d = a;
108
109 assert_eq(a, 1,2,3,4,5,6,7,8);
110 assert_eq(b, 1,2,3,4,5,6,7,8);
111 assert_eq(c, 1,2,3,4,5,6,7,8);
112 assert_eq(d, 1,2,3,4,5,6,7,8);
113
114 assert_eq(a+a, 2,4,6,8,10,12,14,16);
115 assert_eq(a*a, 1,4,9,16,25,36,49,64);
116 assert_eq(a*a-a, 0,2,6,12,20,30,42,56);
117
118 assert_eq(a >> 2, 0,0,0,1,1,1,1,2);
119 assert_eq(a << 1, 2,4,6,8,10,12,14,16);
120
121 REPORTER_ASSERT(r, a.template kth<1>() == 2);
122}
123
mtklein6c221b42015-11-20 13:53:19 -0800124DEF_TEST(SkNx, r) {
mtklein115acee2015-04-14 14:02:52 -0700125 test_Ni<2, uint16_t>(r);
126 test_Ni<4, uint16_t>(r);
127 test_Ni<8, uint16_t>(r);
mtklein1113da72015-04-27 12:08:01 -0700128
129 test_Ni<2, int>(r);
130 test_Ni<4, int>(r);
131 test_Ni<8, int>(r);
mtklein115acee2015-04-14 14:02:52 -0700132}
mtklein27e517a2015-05-14 17:53:04 -0700133
mtkleine20633e2015-07-13 12:06:33 -0700134DEF_TEST(SkNi_min_lt, r) {
mtklein27e517a2015-05-14 17:53:04 -0700135 // Exhaustively check the 8x8 bit space.
136 for (int a = 0; a < (1<<8); a++) {
137 for (int b = 0; b < (1<<8); b++) {
mtkleine20633e2015-07-13 12:06:33 -0700138 Sk16b aw(a), bw(b);
139 REPORTER_ASSERT(r, Sk16b::Min(aw, bw).kth<0>() == SkTMin(a, b));
140 REPORTER_ASSERT(r, !(aw < bw).kth<0>() == !(a < b));
mtklein27e517a2015-05-14 17:53:04 -0700141 }}
142
143 // Exhausting the 16x16 bit space is kind of slow, so only do that in release builds.
144#ifdef SK_DEBUG
145 SkRandom rand;
146 for (int i = 0; i < (1<<16); i++) {
147 uint16_t a = rand.nextU() >> 16,
148 b = rand.nextU() >> 16;
mtkleine4c0bee2016-02-09 10:35:27 -0800149 REPORTER_ASSERT(r, Sk16h::Min(Sk16h(a), Sk16h(b)).kth<0>() == SkTMin(a, b));
mtklein27e517a2015-05-14 17:53:04 -0700150 }
151#else
152 for (int a = 0; a < (1<<16); a++) {
153 for (int b = 0; b < (1<<16); b++) {
mtkleine4c0bee2016-02-09 10:35:27 -0800154 REPORTER_ASSERT(r, Sk16h::Min(Sk16h(a), Sk16h(b)).kth<0>() == SkTMin(a, b));
mtklein27e517a2015-05-14 17:53:04 -0700155 }}
156#endif
157}
mtklein37478752015-06-15 10:58:42 -0700158
159DEF_TEST(SkNi_saturatedAdd, r) {
160 for (int a = 0; a < (1<<8); a++) {
161 for (int b = 0; b < (1<<8); b++) {
162 int exact = a+b;
163 if (exact > 255) { exact = 255; }
164 if (exact < 0) { exact = 0; }
165
166 REPORTER_ASSERT(r, Sk16b(a).saturatedAdd(Sk16b(b)).kth<0>() == exact);
167 }
168 }
169}
170
171DEF_TEST(Sk4px_muldiv255round, r) {
172 for (int a = 0; a < (1<<8); a++) {
173 for (int b = 0; b < (1<<8); b++) {
174 int exact = (a*b+127)/255;
175
176 // Duplicate a and b 16x each.
mtklein059ac002015-06-22 10:39:38 -0700177 auto av = Sk4px::DupAlpha(a),
178 bv = Sk4px::DupAlpha(b);
mtklein37478752015-06-15 10:58:42 -0700179
180 // This way should always be exactly correct.
mtklein059ac002015-06-22 10:39:38 -0700181 int correct = (av * bv).div255().kth<0>();
mtklein37478752015-06-15 10:58:42 -0700182 REPORTER_ASSERT(r, correct == exact);
183
184 // We're a bit more flexible on this method: correct for 0 or 255, otherwise off by <=1.
mtklein059ac002015-06-22 10:39:38 -0700185 int fast = av.approxMulDiv255(bv).kth<0>();
mtklein37478752015-06-15 10:58:42 -0700186 REPORTER_ASSERT(r, fast-exact >= -1 && fast-exact <= 1);
187 if (a == 0 || a == 255 || b == 0 || b == 255) {
188 REPORTER_ASSERT(r, fast == exact);
189 }
190 }
191 }
192}
mtklein4be181e2015-07-14 10:54:19 -0700193
194DEF_TEST(Sk4px_widening, r) {
195 SkPMColor colors[] = {
196 SkPreMultiplyColor(0xff00ff00),
197 SkPreMultiplyColor(0x40008000),
198 SkPreMultiplyColor(0x7f020406),
199 SkPreMultiplyColor(0x00000000),
200 };
201 auto packed = Sk4px::Load4(colors);
202
203 auto wideLo = packed.widenLo(),
204 wideHi = packed.widenHi(),
205 wideLoHi = packed.widenLoHi(),
206 wideLoHiAlt = wideLo + wideHi;
207 REPORTER_ASSERT(r, 0 == memcmp(&wideLoHi, &wideLoHiAlt, sizeof(wideLoHi)));
208}
mtkleina508f3c2015-09-01 06:29:45 -0700209
mtkleinc33065a2016-01-15 12:16:40 -0800210DEF_TEST(SkNx_abs, r) {
211 auto fs = Sk4f(0.0f, -0.0f, 2.0f, -4.0f).abs();
212 REPORTER_ASSERT(r, fs.kth<0>() == 0.0f);
213 REPORTER_ASSERT(r, fs.kth<1>() == 0.0f);
214 REPORTER_ASSERT(r, fs.kth<2>() == 2.0f);
215 REPORTER_ASSERT(r, fs.kth<3>() == 4.0f);
216}
mtklein629f25a2016-02-08 05:54:38 -0800217
mtkleine4c0bee2016-02-09 10:35:27 -0800218DEF_TEST(SkNx_shuffle, r) {
219 Sk4f f4(0,10,20,30);
mtklein629f25a2016-02-08 05:54:38 -0800220
mtkleine4c0bee2016-02-09 10:35:27 -0800221 Sk2f f2 = SkNx_shuffle<2,1>(f4);
222 REPORTER_ASSERT(r, f2[0] == 20);
223 REPORTER_ASSERT(r, f2[1] == 10);
224
225 f4 = SkNx_shuffle<0,1,1,0>(f2);
226 REPORTER_ASSERT(r, f4[0] == 20);
227 REPORTER_ASSERT(r, f4[1] == 10);
228 REPORTER_ASSERT(r, f4[2] == 10);
229 REPORTER_ASSERT(r, f4[3] == 20);
mtklein629f25a2016-02-08 05:54:38 -0800230}
231
mtkleine4c0bee2016-02-09 10:35:27 -0800232#include "SkRandom.h"
233
mtklein629f25a2016-02-08 05:54:38 -0800234DEF_TEST(SkNx_u16_float, r) {
235 {
236 // u16 --> float
237 auto h4 = Sk4h(15, 17, 257, 65535);
238 auto f4 = SkNx_cast<float>(h4);
mtklein629f25a2016-02-08 05:54:38 -0800239 REPORTER_ASSERT(r, f4.kth<0>() == 15.0f);
240 REPORTER_ASSERT(r, f4.kth<1>() == 17.0f);
241 REPORTER_ASSERT(r, f4.kth<2>() == 257.0f);
242 REPORTER_ASSERT(r, f4.kth<3>() == 65535.0f);
243 }
244 {
245 // float -> u16
246 auto f4 = Sk4f(15, 17, 257, 65535);
247 auto h4 = SkNx_cast<uint16_t>(f4);
mtklein629f25a2016-02-08 05:54:38 -0800248 REPORTER_ASSERT(r, h4.kth<0>() == 15);
249 REPORTER_ASSERT(r, h4.kth<1>() == 17);
250 REPORTER_ASSERT(r, h4.kth<2>() == 257);
251 REPORTER_ASSERT(r, h4.kth<3>() == 65535);
252 }
253
254 // starting with any u16 value, we should be able to have a perfect round-trip in/out of floats
255 //
256 SkRandom rand;
mtkleine4c0bee2016-02-09 10:35:27 -0800257 for (int i = 0; i < 10000; ++i) {
mtklein629f25a2016-02-08 05:54:38 -0800258 const uint16_t s16[4] {
259 (uint16_t)rand.nextU16(), (uint16_t)rand.nextU16(),
260 (uint16_t)rand.nextU16(), (uint16_t)rand.nextU16(),
261 };
262 auto u4_0 = Sk4h::Load(s16);
263 auto f4 = SkNx_cast<float>(u4_0);
264 auto u4_1 = SkNx_cast<uint16_t>(f4);
265 uint16_t d16[4];
266 u4_1.store(d16);
267 REPORTER_ASSERT(r, !memcmp(s16, d16, sizeof(s16)));
268 }
269}