OLD | NEW |
1 #include "Test.h" | 1 #include "Test.h" |
2 #include "Sk4x.h" | 2 #include "Sk4x.h" |
3 | 3 |
4 #define ASSERT_EQ(a, b) REPORTER_ASSERT(r, a.equal(b).allTrue()) | 4 #define ASSERT_EQ(a, b) REPORTER_ASSERT(r, a.equal(b).allTrue()) |
5 #define ASSERT_NE(a, b) REPORTER_ASSERT(r, a.notEqual(b).allTrue()) | 5 #define ASSERT_NE(a, b) REPORTER_ASSERT(r, a.notEqual(b).allTrue()) |
6 | 6 |
7 DEF_TEST(Sk4x_Construction, r) { | 7 DEF_TEST(Sk4x_Construction, r) { |
8 Sk4f uninitialized; | 8 Sk4f uninitialized; |
9 Sk4f zero(0,0,0,0); | 9 Sk4f zero(0,0,0,0); |
10 Sk4f foo(1,2,3,4), | 10 Sk4f foo(1,2,3,4), |
(...skipping 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
86 | 86 |
87 DEF_TEST(Sk4x_ExplicitPromotion, r) { | 87 DEF_TEST(Sk4x_ExplicitPromotion, r) { |
88 ASSERT_EQ(Sk4f(2,4,6,8), Sk4f(1,2,3,4) * Sk4f(2.0f)); | 88 ASSERT_EQ(Sk4f(2,4,6,8), Sk4f(1,2,3,4) * Sk4f(2.0f)); |
89 } | 89 } |
90 | 90 |
91 DEF_TEST(Sk4x_Sqrt, r) { | 91 DEF_TEST(Sk4x_Sqrt, r) { |
92 Sk4f squares(4, 16, 25, 121), | 92 Sk4f squares(4, 16, 25, 121), |
93 roots(2, 4, 5, 11); | 93 roots(2, 4, 5, 11); |
94 // .sqrt() should be pretty precise. | 94 // .sqrt() should be pretty precise. |
95 Sk4f error = roots.subtract(squares.sqrt()); | 95 Sk4f error = roots.subtract(squares.sqrt()); |
96 REPORTER_ASSERT(r, error.greaterThanEqual(Sk4f(0.0f)).allTrue()); | 96 REPORTER_ASSERT(r, (error > Sk4f(-0.000001f)).allTrue()); |
97 REPORTER_ASSERT(r, error.lessThan(Sk4f(0.000001f)).allTrue()); | 97 REPORTER_ASSERT(r, (error < Sk4f(+0.000001f)).allTrue()); |
98 | 98 |
99 // .rsqrt() isn't so precise (for SSE), but should be pretty close. | 99 // .rsqrt() isn't so precise (for SSE), but should be pretty close. |
100 error = roots.subtract(squares.multiply(squares.rsqrt())); | 100 error = roots.subtract(squares.multiply(squares.rsqrt())); |
101 REPORTER_ASSERT(r, error.greaterThanEqual(Sk4f(0.0f)).allTrue()); | 101 REPORTER_ASSERT(r, (error > Sk4f(-0.01f)).allTrue()); |
102 REPORTER_ASSERT(r, error.lessThan(Sk4f(0.01f)).allTrue()); | 102 REPORTER_ASSERT(r, (error < Sk4f(+0.01f)).allTrue()); |
103 } | 103 } |
104 | 104 |
105 DEF_TEST(Sk4x_Comparison, r) { | 105 DEF_TEST(Sk4x_Comparison, r) { |
106 ASSERT_EQ(Sk4f(1,2,3,4), Sk4f(1,2,3,4)); | 106 ASSERT_EQ(Sk4f(1,2,3,4), Sk4f(1,2,3,4)); |
107 ASSERT_NE(Sk4f(4,3,2,1), Sk4f(1,2,3,4)); | 107 ASSERT_NE(Sk4f(4,3,2,1), Sk4f(1,2,3,4)); |
108 | 108 |
109 ASSERT_EQ(Sk4i(-1,-1,0,-1), Sk4f(1,2,5,4) == Sk4f(1,2,3,4)); | 109 ASSERT_EQ(Sk4i(-1,-1,0,-1), Sk4f(1,2,5,4) == Sk4f(1,2,3,4)); |
110 | 110 |
111 ASSERT_EQ(Sk4i(-1,-1,-1,-1), Sk4f(1,2,3,4) < Sk4f(2,3,4,5)); | 111 ASSERT_EQ(Sk4i(-1,-1,-1,-1), Sk4f(1,2,3,4) < Sk4f(2,3,4,5)); |
112 ASSERT_EQ(Sk4i(-1,-1,-1,-1), Sk4f(1,2,3,4) <= Sk4f(2,3,4,5)); | 112 ASSERT_EQ(Sk4i(-1,-1,-1,-1), Sk4f(1,2,3,4) <= Sk4f(2,3,4,5)); |
(...skipping 19 matching lines...) Expand all Loading... |
132 } | 132 } |
133 | 133 |
134 DEF_TEST(Sk4x_Swizzle, r) { | 134 DEF_TEST(Sk4x_Swizzle, r) { |
135 ASSERT_EQ(Sk4f(3,4,1,2), Sk4f(1,2,3,4).zwxy()); | 135 ASSERT_EQ(Sk4f(3,4,1,2), Sk4f(1,2,3,4).zwxy()); |
136 ASSERT_EQ(Sk4f(1,2,5,6), Sk4f::XYAB(Sk4f(1,2,3,4), Sk4f(5,6,7,8))); | 136 ASSERT_EQ(Sk4f(1,2,5,6), Sk4f::XYAB(Sk4f(1,2,3,4), Sk4f(5,6,7,8))); |
137 ASSERT_EQ(Sk4f(3,4,7,8), Sk4f::ZWCD(Sk4f(1,2,3,4), Sk4f(5,6,7,8))); | 137 ASSERT_EQ(Sk4f(3,4,7,8), Sk4f::ZWCD(Sk4f(1,2,3,4), Sk4f(5,6,7,8))); |
138 ASSERT_EQ(Sk4i(3,4,1,2), Sk4i(1,2,3,4).zwxy()); | 138 ASSERT_EQ(Sk4i(3,4,1,2), Sk4i(1,2,3,4).zwxy()); |
139 ASSERT_EQ(Sk4i(1,2,5,6), Sk4i::XYAB(Sk4i(1,2,3,4), Sk4i(5,6,7,8))); | 139 ASSERT_EQ(Sk4i(1,2,5,6), Sk4i::XYAB(Sk4i(1,2,3,4), Sk4i(5,6,7,8))); |
140 ASSERT_EQ(Sk4i(3,4,7,8), Sk4i::ZWCD(Sk4i(1,2,3,4), Sk4i(5,6,7,8))); | 140 ASSERT_EQ(Sk4i(3,4,7,8), Sk4i::ZWCD(Sk4i(1,2,3,4), Sk4i(5,6,7,8))); |
141 } | 141 } |
OLD | NEW |