Johann committed Apr 21, 2016 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 ``````/* * Copyright (c) 2016 The WebM project authors. All Rights Reserved. * * Use of this source code is governed by a BSD-style license * that can be found in the LICENSE file in the root of the source * tree. An additional intellectual property rights grant can be found * in the file PATENTS. All contributing project authors may * be found in the AUTHORS file in the root of the source tree. */ #include #include "third_party/googletest/src/include/gtest/gtest.h" #include "./vpx_dsp_rtcd.h" #include "test/acm_random.h" #include "test/register_state_check.h" namespace { using ::libvpx_test::ACMRandom; `````` Johann committed Jun 13, 2016 24 ``````typedef void (*HadamardFunc)(const int16_t *a, int a_stride, int16_t *b); `````` Johann committed Apr 21, 2016 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 `````` void hadamard_loop(const int16_t *a, int a_stride, int16_t *out) { int16_t b[8]; for (int i = 0; i < 8; i += 2) { b[i + 0] = a[i * a_stride] + a[(i + 1) * a_stride]; b[i + 1] = a[i * a_stride] - a[(i + 1) * a_stride]; } int16_t c[8]; for (int i = 0; i < 8; i += 4) { c[i + 0] = b[i + 0] + b[i + 2]; c[i + 1] = b[i + 1] + b[i + 3]; c[i + 2] = b[i + 0] - b[i + 2]; c[i + 3] = b[i + 1] - b[i + 3]; } out[0] = c[0] + c[4]; out[7] = c[1] + c[5]; out[3] = c[2] + c[6]; out[4] = c[3] + c[7]; out[2] = c[0] - c[4]; out[6] = c[1] - c[5]; out[1] = c[2] - c[6]; out[5] = c[3] - c[7]; } `````` Johann committed Jun 13, 2016 49 ``````void reference_hadamard8x8(const int16_t *a, int a_stride, int16_t *b) { `````` Johann committed Apr 21, 2016 50 `````` int16_t buf[64]; `````` Johann committed Jun 13, 2016 51 `````` for (int i = 0; i < 8; ++i) { `````` Johann committed Apr 21, 2016 52 53 54 `````` hadamard_loop(a + i, a_stride, buf + i * 8); } `````` Johann committed Jun 13, 2016 55 `````` for (int i = 0; i < 8; ++i) { `````` Johann committed Apr 21, 2016 56 57 58 59 `````` hadamard_loop(buf + i, 8, b + i * 8); } } `````` Johann committed Jun 13, 2016 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 ``````void reference_hadamard16x16(const int16_t *a, int a_stride, int16_t *b) { /* The source is a 16x16 block. The destination is rearranged to 8x32. * Input is 9 bit. */ reference_hadamard8x8(a + 0 + 0 * a_stride, a_stride, b + 0); reference_hadamard8x8(a + 8 + 0 * a_stride, a_stride, b + 64); reference_hadamard8x8(a + 0 + 8 * a_stride, a_stride, b + 128); reference_hadamard8x8(a + 8 + 8 * a_stride, a_stride, b + 192); /* Overlay the 8x8 blocks and combine. */ for (int i = 0; i < 64; ++i) { /* 8x8 steps the range up to 15 bits. */ const int16_t a0 = b[0]; const int16_t a1 = b[64]; const int16_t a2 = b[128]; const int16_t a3 = b[192]; /* Prevent the result from escaping int16_t. */ const int16_t b0 = (a0 + a1) >> 1; const int16_t b1 = (a0 - a1) >> 1; const int16_t b2 = (a2 + a3) >> 1; const int16_t b3 = (a2 - a3) >> 1; /* Store a 16 bit value. */ b[ 0] = b0 + b2; b[ 64] = b1 + b3; b[128] = b0 - b2; b[192] = b1 - b3; ++b; } } class HadamardTestBase : public ::testing::TestWithParam { public: virtual void SetUp() { h_func_ = GetParam(); rnd_.Reset(ACMRandom::DeterministicSeed()); } protected: HadamardFunc h_func_; ACMRandom rnd_; }; class Hadamard8x8Test : public HadamardTestBase {}; TEST_P(Hadamard8x8Test, CompareReferenceRandom) { `````` James Zern committed Apr 22, 2016 107 108 109 `````` DECLARE_ALIGNED(16, int16_t, a[64]); DECLARE_ALIGNED(16, int16_t, b[64]); int16_t b_ref[64]; `````` Johann committed Jun 13, 2016 110 `````` for (int i = 0; i < 64; ++i) { `````` Johann committed Apr 21, 2016 111 112 113 114 115 `````` a[i] = rnd_.Rand9Signed(); } memset(b, 0, sizeof(b)); memset(b_ref, 0, sizeof(b_ref)); `````` Johann committed Jun 13, 2016 116 `````` reference_hadamard8x8(a, 8, b_ref); `````` Johann committed Apr 21, 2016 117 118 119 120 121 122 123 124 `````` ASM_REGISTER_STATE_CHECK(h_func_(a, 8, b)); // The order of the output is not important. Sort before checking. std::sort(b, b + 64); std::sort(b_ref, b_ref + 64); EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b))); } `````` Johann committed Jun 13, 2016 125 ``````TEST_P(Hadamard8x8Test, VaryStride) { `````` James Zern committed Apr 22, 2016 126 127 128 `````` DECLARE_ALIGNED(16, int16_t, a[64 * 8]); DECLARE_ALIGNED(16, int16_t, b[64]); int16_t b_ref[64]; `````` Johann committed Jun 13, 2016 129 `````` for (int i = 0; i < 64 * 8; ++i) { `````` Johann committed Apr 21, 2016 130 131 132 133 134 135 136 `````` a[i] = rnd_.Rand9Signed(); } for (int i = 8; i < 64; i += 8) { memset(b, 0, sizeof(b)); memset(b_ref, 0, sizeof(b_ref)); `````` Johann committed Jun 13, 2016 137 `````` reference_hadamard8x8(a, i, b_ref); `````` Johann committed Apr 21, 2016 138 139 140 141 142 143 144 145 146 `````` ASM_REGISTER_STATE_CHECK(h_func_(a, i, b)); // The order of the output is not important. Sort before checking. std::sort(b, b + 64); std::sort(b_ref, b_ref + 64); EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b))); } } `````` Johann committed Jun 13, 2016 147 ``````INSTANTIATE_TEST_CASE_P(C, Hadamard8x8Test, `````` Johann committed Apr 21, 2016 148 149 150 `````` ::testing::Values(&vpx_hadamard_8x8_c)); #if HAVE_SSE2 `````` Johann committed Jun 13, 2016 151 ``````INSTANTIATE_TEST_CASE_P(SSE2, Hadamard8x8Test, `````` Johann committed Apr 21, 2016 152 153 154 155 `````` ::testing::Values(&vpx_hadamard_8x8_sse2)); #endif // HAVE_SSE2 #if HAVE_SSSE3 && CONFIG_USE_X86INC && ARCH_X86_64 `````` Johann committed Jun 13, 2016 156 ``````INSTANTIATE_TEST_CASE_P(SSSE3, Hadamard8x8Test, `````` Johann committed Apr 21, 2016 157 158 `````` ::testing::Values(&vpx_hadamard_8x8_ssse3)); #endif // HAVE_SSSE3 && CONFIG_USE_X86INC && ARCH_X86_64 `````` Johann committed May 16, 2016 159 160 `````` #if HAVE_NEON `````` Johann committed Jun 13, 2016 161 ``````INSTANTIATE_TEST_CASE_P(NEON, Hadamard8x8Test, `````` Johann committed May 16, 2016 162 163 `````` ::testing::Values(&vpx_hadamard_8x8_neon)); #endif // HAVE_NEON `````` Johann committed Jun 13, 2016 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 `````` class Hadamard16x16Test : public HadamardTestBase {}; TEST_P(Hadamard16x16Test, CompareReferenceRandom) { DECLARE_ALIGNED(16, int16_t, a[16 * 16]); DECLARE_ALIGNED(16, int16_t, b[16 * 16]); int16_t b_ref[16 * 16]; for (int i = 0; i < 16 * 16; ++i) { a[i] = rnd_.Rand9Signed(); } memset(b, 0, sizeof(b)); memset(b_ref, 0, sizeof(b_ref)); reference_hadamard16x16(a, 16, b_ref); ASM_REGISTER_STATE_CHECK(h_func_(a, 16, b)); // The order of the output is not important. Sort before checking. std::sort(b, b + 16 * 16); std::sort(b_ref, b_ref + 16 * 16); EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b))); } TEST_P(Hadamard16x16Test, VaryStride) { DECLARE_ALIGNED(16, int16_t, a[16 * 16 * 8]); DECLARE_ALIGNED(16, int16_t, b[16 * 16]); int16_t b_ref[16 * 16]; for (int i = 0; i < 16 * 16 * 8; ++i) { a[i] = rnd_.Rand9Signed(); } for (int i = 8; i < 64; i += 8) { memset(b, 0, sizeof(b)); memset(b_ref, 0, sizeof(b_ref)); reference_hadamard16x16(a, i, b_ref); ASM_REGISTER_STATE_CHECK(h_func_(a, i, b)); // The order of the output is not important. Sort before checking. std::sort(b, b + 16 * 16); std::sort(b_ref, b_ref + 16 * 16); EXPECT_EQ(0, memcmp(b, b_ref, sizeof(b))); } } INSTANTIATE_TEST_CASE_P(C, Hadamard16x16Test, ::testing::Values(&vpx_hadamard_16x16_c)); #if HAVE_SSE2 INSTANTIATE_TEST_CASE_P(SSE2, Hadamard16x16Test, ::testing::Values(&vpx_hadamard_16x16_sse2)); #endif // HAVE_SSE2 `````` Johann committed Apr 21, 2016 215 ``} // namespace``