SkNxTest.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512
  1. /*
  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. #include "include/private/SkNx.h"
  8. #include "include/utils/SkRandom.h"
  9. #include "src/core/Sk4px.h"
  10. #include "tests/Test.h"
  11. template <int N>
  12. static void test_Nf(skiatest::Reporter* r) {
  13. auto assert_nearly_eq = [&](float eps, const SkNx<N, float>& v,
  14. float a, float b, float c, float d) {
  15. auto close = [=](float a, float b) { return fabsf(a-b) <= eps; };
  16. float vals[4];
  17. v.store(vals);
  18. bool ok = close(vals[0], a) && close(vals[1], b)
  19. && close( v[0], a) && close( v[1], b);
  20. REPORTER_ASSERT(r, ok);
  21. if (N == 4) {
  22. ok = close(vals[2], c) && close(vals[3], d)
  23. && close( v[2], c) && close( v[3], d);
  24. REPORTER_ASSERT(r, ok);
  25. }
  26. };
  27. auto assert_eq = [&](const SkNx<N, float>& v, float a, float b, float c, float d) {
  28. return assert_nearly_eq(0, v, a,b,c,d);
  29. };
  30. float vals[] = {3, 4, 5, 6};
  31. SkNx<N,float> a = SkNx<N,float>::Load(vals),
  32. b(a),
  33. c = a;
  34. SkNx<N,float> d;
  35. d = a;
  36. assert_eq(a, 3, 4, 5, 6);
  37. assert_eq(b, 3, 4, 5, 6);
  38. assert_eq(c, 3, 4, 5, 6);
  39. assert_eq(d, 3, 4, 5, 6);
  40. assert_eq(a+b, 6, 8, 10, 12);
  41. assert_eq(a*b, 9, 16, 25, 36);
  42. assert_eq(a*b-b, 6, 12, 20, 30);
  43. assert_eq((a*b).sqrt(), 3, 4, 5, 6);
  44. assert_eq(a/b, 1, 1, 1, 1);
  45. assert_eq(SkNx<N,float>(0)-a, -3, -4, -5, -6);
  46. SkNx<N,float> fours(4);
  47. assert_eq(fours.sqrt(), 2,2,2,2);
  48. assert_nearly_eq(0.001f, fours.rsqrt(), 0.5, 0.5, 0.5, 0.5);
  49. assert_nearly_eq(0.001f, fours.invert(), 0.25, 0.25, 0.25, 0.25);
  50. assert_eq(SkNx<N,float>::Min(a, fours), 3, 4, 4, 4);
  51. assert_eq(SkNx<N,float>::Max(a, fours), 4, 4, 5, 6);
  52. // Test some comparisons. This is not exhaustive.
  53. REPORTER_ASSERT(r, (a == b).allTrue());
  54. REPORTER_ASSERT(r, (a+b == a*b-b).anyTrue());
  55. REPORTER_ASSERT(r, !(a+b == a*b-b).allTrue());
  56. REPORTER_ASSERT(r, !(a+b == a*b).anyTrue());
  57. REPORTER_ASSERT(r, !(a != b).anyTrue());
  58. REPORTER_ASSERT(r, (a < fours).anyTrue());
  59. REPORTER_ASSERT(r, (a <= fours).anyTrue());
  60. REPORTER_ASSERT(r, !(a > fours).allTrue());
  61. REPORTER_ASSERT(r, !(a >= fours).allTrue());
  62. }
  63. DEF_TEST(SkNf, r) {
  64. test_Nf<2>(r);
  65. test_Nf<4>(r);
  66. }
  67. template <int N, typename T>
  68. void test_Ni(skiatest::Reporter* r) {
  69. auto assert_eq = [&](const SkNx<N,T>& v, T a, T b, T c, T d, T e, T f, T g, T h) {
  70. T vals[8];
  71. v.store(vals);
  72. switch (N) {
  73. case 8: REPORTER_ASSERT(r, vals[4] == e && vals[5] == f && vals[6] == g && vals[7] == h);
  74. case 4: REPORTER_ASSERT(r, vals[2] == c && vals[3] == d);
  75. case 2: REPORTER_ASSERT(r, vals[0] == a && vals[1] == b);
  76. }
  77. switch (N) {
  78. case 8: REPORTER_ASSERT(r, v[4] == e && v[5] == f &&
  79. v[6] == g && v[7] == h);
  80. case 4: REPORTER_ASSERT(r, v[2] == c && v[3] == d);
  81. case 2: REPORTER_ASSERT(r, v[0] == a && v[1] == b);
  82. }
  83. };
  84. T vals[] = { 1,2,3,4,5,6,7,8 };
  85. SkNx<N,T> a = SkNx<N,T>::Load(vals),
  86. b(a),
  87. c = a;
  88. SkNx<N,T> d;
  89. d = a;
  90. assert_eq(a, 1,2,3,4,5,6,7,8);
  91. assert_eq(b, 1,2,3,4,5,6,7,8);
  92. assert_eq(c, 1,2,3,4,5,6,7,8);
  93. assert_eq(d, 1,2,3,4,5,6,7,8);
  94. assert_eq(a+a, 2,4,6,8,10,12,14,16);
  95. assert_eq(a*a, 1,4,9,16,25,36,49,64);
  96. assert_eq(a*a-a, 0,2,6,12,20,30,42,56);
  97. assert_eq(a >> 2, 0,0,0,1,1,1,1,2);
  98. assert_eq(a << 1, 2,4,6,8,10,12,14,16);
  99. REPORTER_ASSERT(r, a[1] == 2);
  100. }
  101. DEF_TEST(SkNx, r) {
  102. test_Ni<2, uint16_t>(r);
  103. test_Ni<4, uint16_t>(r);
  104. test_Ni<8, uint16_t>(r);
  105. test_Ni<2, int>(r);
  106. test_Ni<4, int>(r);
  107. test_Ni<8, int>(r);
  108. }
  109. DEF_TEST(SkNi_min_lt, r) {
  110. // Exhaustively check the 8x8 bit space.
  111. for (int a = 0; a < (1<<8); a++) {
  112. for (int b = 0; b < (1<<8); b++) {
  113. Sk16b aw(a), bw(b);
  114. REPORTER_ASSERT(r, Sk16b::Min(aw, bw)[0] == SkTMin(a, b));
  115. REPORTER_ASSERT(r, !(aw < bw)[0] == !(a < b));
  116. }}
  117. // Exhausting the 16x16 bit space is kind of slow, so only do that in release builds.
  118. #ifdef SK_DEBUG
  119. SkRandom rand;
  120. for (int i = 0; i < (1<<16); i++) {
  121. uint16_t a = rand.nextU() >> 16,
  122. b = rand.nextU() >> 16;
  123. REPORTER_ASSERT(r, Sk16h::Min(Sk16h(a), Sk16h(b))[0] == SkTMin(a, b));
  124. }
  125. #else
  126. for (int a = 0; a < (1<<16); a++) {
  127. for (int b = 0; b < (1<<16); b++) {
  128. REPORTER_ASSERT(r, Sk16h::Min(Sk16h(a), Sk16h(b))[0] == SkTMin(a, b));
  129. }}
  130. #endif
  131. }
  132. DEF_TEST(SkNi_saturatedAdd, r) {
  133. for (int a = 0; a < (1<<8); a++) {
  134. for (int b = 0; b < (1<<8); b++) {
  135. int exact = a+b;
  136. if (exact > 255) { exact = 255; }
  137. if (exact < 0) { exact = 0; }
  138. REPORTER_ASSERT(r, Sk16b(a).saturatedAdd(Sk16b(b))[0] == exact);
  139. }
  140. }
  141. }
  142. DEF_TEST(SkNi_mulHi, r) {
  143. // First 8 primes.
  144. Sk4u a{ 0x00020000, 0x00030000, 0x00050000, 0x00070000 };
  145. Sk4u b{ 0x000b0000, 0x000d0000, 0x00110000, 0x00130000 };
  146. Sk4u q{22, 39, 85, 133};
  147. Sk4u c = a.mulHi(b);
  148. REPORTER_ASSERT(r, c[0] == q[0]);
  149. REPORTER_ASSERT(r, c[1] == q[1]);
  150. REPORTER_ASSERT(r, c[2] == q[2]);
  151. REPORTER_ASSERT(r, c[3] == q[3]);
  152. }
  153. DEF_TEST(Sk4px_muldiv255round, r) {
  154. for (int a = 0; a < (1<<8); a++) {
  155. for (int b = 0; b < (1<<8); b++) {
  156. int exact = (a*b+127)/255;
  157. // Duplicate a and b 16x each.
  158. Sk4px av = Sk16b(a),
  159. bv = Sk16b(b);
  160. // This way should always be exactly correct.
  161. int correct = (av * bv).div255()[0];
  162. REPORTER_ASSERT(r, correct == exact);
  163. // We're a bit more flexible on this method: correct for 0 or 255, otherwise off by <=1.
  164. int fast = av.approxMulDiv255(bv)[0];
  165. REPORTER_ASSERT(r, fast-exact >= -1 && fast-exact <= 1);
  166. if (a == 0 || a == 255 || b == 0 || b == 255) {
  167. REPORTER_ASSERT(r, fast == exact);
  168. }
  169. }
  170. }
  171. }
  172. DEF_TEST(SkNx_abs, r) {
  173. auto fs = Sk4f(0.0f, -0.0f, 2.0f, -4.0f).abs();
  174. REPORTER_ASSERT(r, fs[0] == 0.0f);
  175. REPORTER_ASSERT(r, fs[1] == 0.0f);
  176. REPORTER_ASSERT(r, fs[2] == 2.0f);
  177. REPORTER_ASSERT(r, fs[3] == 4.0f);
  178. auto fshi = Sk2f(0.0f, -0.0f).abs();
  179. auto fslo = Sk2f(2.0f, -4.0f).abs();
  180. REPORTER_ASSERT(r, fshi[0] == 0.0f);
  181. REPORTER_ASSERT(r, fshi[1] == 0.0f);
  182. REPORTER_ASSERT(r, fslo[0] == 2.0f);
  183. REPORTER_ASSERT(r, fslo[1] == 4.0f);
  184. }
  185. DEF_TEST(Sk4i_abs, r) {
  186. auto is = Sk4i(0, -1, 2, -2147483647).abs();
  187. REPORTER_ASSERT(r, is[0] == 0);
  188. REPORTER_ASSERT(r, is[1] == 1);
  189. REPORTER_ASSERT(r, is[2] == 2);
  190. REPORTER_ASSERT(r, is[3] == 2147483647);
  191. }
  192. DEF_TEST(Sk4i_minmax, r) {
  193. auto a = Sk4i(0, 2, 4, 6);
  194. auto b = Sk4i(1, 1, 3, 7);
  195. auto min = Sk4i::Min(a, b);
  196. auto max = Sk4i::Max(a, b);
  197. for(int i = 0; i < 4; ++i) {
  198. REPORTER_ASSERT(r, min[i] == SkTMin(a[i], b[i]));
  199. REPORTER_ASSERT(r, max[i] == SkTMax(a[i], b[i]));
  200. }
  201. }
  202. DEF_TEST(SkNx_floor, r) {
  203. auto fs = Sk4f(0.4f, -0.4f, 0.6f, -0.6f).floor();
  204. REPORTER_ASSERT(r, fs[0] == 0.0f);
  205. REPORTER_ASSERT(r, fs[1] == -1.0f);
  206. REPORTER_ASSERT(r, fs[2] == 0.0f);
  207. REPORTER_ASSERT(r, fs[3] == -1.0f);
  208. auto fs2 = Sk2f(0.4f, -0.4f).floor();
  209. REPORTER_ASSERT(r, fs2[0] == 0.0f);
  210. REPORTER_ASSERT(r, fs2[1] == -1.0f);
  211. auto fs3 = Sk2f(0.6f, -0.6f).floor();
  212. REPORTER_ASSERT(r, fs3[0] == 0.0f);
  213. REPORTER_ASSERT(r, fs3[1] == -1.0f);
  214. }
  215. DEF_TEST(SkNx_shuffle, r) {
  216. Sk4f f4(0,10,20,30);
  217. Sk2f f2 = SkNx_shuffle<2,1>(f4);
  218. REPORTER_ASSERT(r, f2[0] == 20);
  219. REPORTER_ASSERT(r, f2[1] == 10);
  220. f4 = SkNx_shuffle<0,1,1,0>(f2);
  221. REPORTER_ASSERT(r, f4[0] == 20);
  222. REPORTER_ASSERT(r, f4[1] == 10);
  223. REPORTER_ASSERT(r, f4[2] == 10);
  224. REPORTER_ASSERT(r, f4[3] == 20);
  225. }
  226. DEF_TEST(SkNx_int_float, r) {
  227. Sk4f f(-2.3f, 1.0f, 0.45f, 0.6f);
  228. Sk4i i = SkNx_cast<int>(f);
  229. REPORTER_ASSERT(r, i[0] == -2);
  230. REPORTER_ASSERT(r, i[1] == 1);
  231. REPORTER_ASSERT(r, i[2] == 0);
  232. REPORTER_ASSERT(r, i[3] == 0);
  233. f = SkNx_cast<float>(i);
  234. REPORTER_ASSERT(r, f[0] == -2.0f);
  235. REPORTER_ASSERT(r, f[1] == 1.0f);
  236. REPORTER_ASSERT(r, f[2] == 0.0f);
  237. REPORTER_ASSERT(r, f[3] == 0.0f);
  238. }
  239. #include "include/utils/SkRandom.h"
  240. DEF_TEST(SkNx_u16_float, r) {
  241. {
  242. // u16 --> float
  243. auto h4 = Sk4h(15, 17, 257, 65535);
  244. auto f4 = SkNx_cast<float>(h4);
  245. REPORTER_ASSERT(r, f4[0] == 15.0f);
  246. REPORTER_ASSERT(r, f4[1] == 17.0f);
  247. REPORTER_ASSERT(r, f4[2] == 257.0f);
  248. REPORTER_ASSERT(r, f4[3] == 65535.0f);
  249. }
  250. {
  251. // float -> u16
  252. auto f4 = Sk4f(15, 17, 257, 65535);
  253. auto h4 = SkNx_cast<uint16_t>(f4);
  254. REPORTER_ASSERT(r, h4[0] == 15);
  255. REPORTER_ASSERT(r, h4[1] == 17);
  256. REPORTER_ASSERT(r, h4[2] == 257);
  257. REPORTER_ASSERT(r, h4[3] == 65535);
  258. }
  259. // starting with any u16 value, we should be able to have a perfect round-trip in/out of floats
  260. //
  261. SkRandom rand;
  262. for (int i = 0; i < 10000; ++i) {
  263. const uint16_t s16[4] {
  264. (uint16_t)(rand.nextU() >> 16), (uint16_t)(rand.nextU() >> 16),
  265. (uint16_t)(rand.nextU() >> 16), (uint16_t)(rand.nextU() >> 16),
  266. };
  267. auto u4_0 = Sk4h::Load(s16);
  268. auto f4 = SkNx_cast<float>(u4_0);
  269. auto u4_1 = SkNx_cast<uint16_t>(f4);
  270. uint16_t d16[4];
  271. u4_1.store(d16);
  272. REPORTER_ASSERT(r, !memcmp(s16, d16, sizeof(s16)));
  273. }
  274. }
  275. // The SSE2 implementation of SkNx_cast<uint16_t>(Sk4i) is non-trivial, so worth a test.
  276. DEF_TEST(SkNx_int_u16, r) {
  277. // These are pretty hard to get wrong.
  278. for (int i = 0; i <= 0x7fff; i++) {
  279. uint16_t expected = (uint16_t)i;
  280. uint16_t actual = SkNx_cast<uint16_t>(Sk4i(i))[0];
  281. REPORTER_ASSERT(r, expected == actual);
  282. }
  283. // A naive implementation with _mm_packs_epi32 would succeed up to 0x7fff but fail here:
  284. for (int i = 0x8000; (1) && i <= 0xffff; i++) {
  285. uint16_t expected = (uint16_t)i;
  286. uint16_t actual = SkNx_cast<uint16_t>(Sk4i(i))[0];
  287. REPORTER_ASSERT(r, expected == actual);
  288. }
  289. }
  290. DEF_TEST(SkNx_4fLoad4Store4, r) {
  291. float src[] = {
  292. 0.0f, 1.0f, 2.0f, 3.0f,
  293. 4.0f, 5.0f, 6.0f, 7.0f,
  294. 8.0f, 9.0f, 10.0f, 11.0f,
  295. 12.0f, 13.0f, 14.0f, 15.0f
  296. };
  297. Sk4f a, b, c, d;
  298. Sk4f::Load4(src, &a, &b, &c, &d);
  299. REPORTER_ASSERT(r, 0.0f == a[0]);
  300. REPORTER_ASSERT(r, 4.0f == a[1]);
  301. REPORTER_ASSERT(r, 8.0f == a[2]);
  302. REPORTER_ASSERT(r, 12.0f == a[3]);
  303. REPORTER_ASSERT(r, 1.0f == b[0]);
  304. REPORTER_ASSERT(r, 5.0f == b[1]);
  305. REPORTER_ASSERT(r, 9.0f == b[2]);
  306. REPORTER_ASSERT(r, 13.0f == b[3]);
  307. REPORTER_ASSERT(r, 2.0f == c[0]);
  308. REPORTER_ASSERT(r, 6.0f == c[1]);
  309. REPORTER_ASSERT(r, 10.0f == c[2]);
  310. REPORTER_ASSERT(r, 14.0f == c[3]);
  311. REPORTER_ASSERT(r, 3.0f == d[0]);
  312. REPORTER_ASSERT(r, 7.0f == d[1]);
  313. REPORTER_ASSERT(r, 11.0f == d[2]);
  314. REPORTER_ASSERT(r, 15.0f == d[3]);
  315. float dst[16];
  316. Sk4f::Store4(dst, a, b, c, d);
  317. REPORTER_ASSERT(r, 0 == memcmp(dst, src, 16 * sizeof(float)));
  318. }
  319. DEF_TEST(SkNx_neg, r) {
  320. auto fs = -Sk4f(0.0f, -0.0f, 2.0f, -4.0f);
  321. REPORTER_ASSERT(r, fs[0] == 0.0f);
  322. REPORTER_ASSERT(r, fs[1] == 0.0f);
  323. REPORTER_ASSERT(r, fs[2] == -2.0f);
  324. REPORTER_ASSERT(r, fs[3] == 4.0f);
  325. auto fshi = -Sk2f(0.0f, -0.0f);
  326. auto fslo = -Sk2f(2.0f, -4.0f);
  327. REPORTER_ASSERT(r, fshi[0] == 0.0f);
  328. REPORTER_ASSERT(r, fshi[1] == 0.0f);
  329. REPORTER_ASSERT(r, fslo[0] == -2.0f);
  330. REPORTER_ASSERT(r, fslo[1] == 4.0f);
  331. }
  332. DEF_TEST(SkNx_thenElse, r) {
  333. auto fs = (Sk4f(0.0f, -0.0f, 2.0f, -4.0f) < 0).thenElse(-1, 1);
  334. REPORTER_ASSERT(r, fs[0] == 1);
  335. REPORTER_ASSERT(r, fs[1] == 1);
  336. REPORTER_ASSERT(r, fs[2] == 1);
  337. REPORTER_ASSERT(r, fs[3] == -1);
  338. auto fshi = (Sk2f(0.0f, -0.0f) < 0).thenElse(-1, 1);
  339. auto fslo = (Sk2f(2.0f, -4.0f) < 0).thenElse(-1, 1);
  340. REPORTER_ASSERT(r, fshi[0] == 1);
  341. REPORTER_ASSERT(r, fshi[1] == 1);
  342. REPORTER_ASSERT(r, fslo[0] == 1);
  343. REPORTER_ASSERT(r, fslo[1] == -1);
  344. }
  345. DEF_TEST(Sk4f_Load2, r) {
  346. float xy[8] = { 0,1,2,3,4,5,6,7 };
  347. Sk4f x,y;
  348. Sk4f::Load2(xy, &x,&y);
  349. REPORTER_ASSERT(r, x[0] == 0);
  350. REPORTER_ASSERT(r, x[1] == 2);
  351. REPORTER_ASSERT(r, x[2] == 4);
  352. REPORTER_ASSERT(r, x[3] == 6);
  353. REPORTER_ASSERT(r, y[0] == 1);
  354. REPORTER_ASSERT(r, y[1] == 3);
  355. REPORTER_ASSERT(r, y[2] == 5);
  356. REPORTER_ASSERT(r, y[3] == 7);
  357. }
  358. DEF_TEST(Sk2f_Load2, r) {
  359. float xy[4] = { 0,1,2,3 };
  360. Sk2f x,y;
  361. Sk2f::Load2(xy, &x,&y);
  362. REPORTER_ASSERT(r, x[0] == 0);
  363. REPORTER_ASSERT(r, x[1] == 2);
  364. REPORTER_ASSERT(r, y[0] == 1);
  365. REPORTER_ASSERT(r, y[1] == 3);
  366. }
  367. DEF_TEST(Sk2f_Store2, r) {
  368. Sk2f p0{0, 2};
  369. Sk2f p1{1, 3};
  370. float dst[4];
  371. Sk2f::Store2(dst, p0, p1);
  372. REPORTER_ASSERT(r, dst[0] == 0);
  373. REPORTER_ASSERT(r, dst[1] == 1);
  374. REPORTER_ASSERT(r, dst[2] == 2);
  375. REPORTER_ASSERT(r, dst[3] == 3);
  376. }
  377. DEF_TEST(Sk2f_Store3, r) {
  378. Sk2f p0{0, 3};
  379. Sk2f p1{1, 4};
  380. Sk2f p2{2, 5};
  381. float dst[6];
  382. Sk2f::Store3(dst, p0, p1, p2);
  383. REPORTER_ASSERT(r, dst[0] == 0);
  384. REPORTER_ASSERT(r, dst[1] == 1);
  385. REPORTER_ASSERT(r, dst[2] == 2);
  386. REPORTER_ASSERT(r, dst[3] == 3);
  387. REPORTER_ASSERT(r, dst[4] == 4);
  388. REPORTER_ASSERT(r, dst[5] == 5);
  389. }
  390. DEF_TEST(Sk2f_Store4, r) {
  391. Sk2f p0{0, 4};
  392. Sk2f p1{1, 5};
  393. Sk2f p2{2, 6};
  394. Sk2f p3{3, 7};
  395. float dst[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
  396. Sk2f::Store4(dst, p0, p1, p2, p3);
  397. REPORTER_ASSERT(r, dst[0] == 0);
  398. REPORTER_ASSERT(r, dst[1] == 1);
  399. REPORTER_ASSERT(r, dst[2] == 2);
  400. REPORTER_ASSERT(r, dst[3] == 3);
  401. REPORTER_ASSERT(r, dst[4] == 4);
  402. REPORTER_ASSERT(r, dst[5] == 5);
  403. REPORTER_ASSERT(r, dst[6] == 6);
  404. REPORTER_ASSERT(r, dst[7] == 7);
  405. // Ensure transposing to Sk4f works.
  406. Sk4f dst4f[2] = {{-1, -1, -1, -1}, {-1, -1, -1, -1}};
  407. Sk2f::Store4(dst4f, p0, p1, p2, p3);
  408. REPORTER_ASSERT(r, dst4f[0][0] == 0);
  409. REPORTER_ASSERT(r, dst4f[0][1] == 1);
  410. REPORTER_ASSERT(r, dst4f[0][2] == 2);
  411. REPORTER_ASSERT(r, dst4f[0][3] == 3);
  412. REPORTER_ASSERT(r, dst4f[1][0] == 4);
  413. REPORTER_ASSERT(r, dst4f[1][1] == 5);
  414. REPORTER_ASSERT(r, dst4f[1][2] == 6);
  415. REPORTER_ASSERT(r, dst4f[1][3] == 7);
  416. }
  417. DEF_TEST(Sk4f_minmax, r) {
  418. REPORTER_ASSERT(r, 3 == Sk4f(0,1,2,3).max());
  419. REPORTER_ASSERT(r, 2 == Sk4f(1,-5,2,-1).max());
  420. REPORTER_ASSERT(r, -1 == Sk4f(-2,-1,-6,-3).max());
  421. REPORTER_ASSERT(r, 3 == Sk4f(3,2,1,0).max());
  422. REPORTER_ASSERT(r, 0 == Sk4f(0,1,2,3).min());
  423. REPORTER_ASSERT(r, -5 == Sk4f(1,-5,2,-1).min());
  424. REPORTER_ASSERT(r, -6 == Sk4f(-2,-1,-6,-3).min());
  425. REPORTER_ASSERT(r, 0 == Sk4f(3,2,1,0).min());
  426. }
  427. DEF_TEST(SkNf_anyTrue_allTrue, r) {
  428. REPORTER_ASSERT(r, (Sk2f{1,2} < Sk2f{3,4}).anyTrue());
  429. REPORTER_ASSERT(r, (Sk2f{1,2} < Sk2f{3,4}).allTrue());
  430. REPORTER_ASSERT(r, (Sk2f{3,2} < Sk2f{1,4}).anyTrue());
  431. REPORTER_ASSERT(r, !(Sk2f{3,2} < Sk2f{1,4}).allTrue());
  432. REPORTER_ASSERT(r, !(Sk2f{3,4} < Sk2f{1,2}).anyTrue());
  433. REPORTER_ASSERT(r, (Sk4f{1,2,3,4} < Sk4f{3,4,5,6}).anyTrue());
  434. REPORTER_ASSERT(r, (Sk4f{1,2,3,4} < Sk4f{3,4,5,6}).allTrue());
  435. REPORTER_ASSERT(r, (Sk4f{1,2,3,4} < Sk4f{1,4,1,1}).anyTrue());
  436. REPORTER_ASSERT(r, !(Sk4f{1,2,3,4} < Sk4f{1,4,1,1}).allTrue());
  437. REPORTER_ASSERT(r, !(Sk4f{3,4,5,6} < Sk4f{1,2,3,4}).anyTrue());
  438. }