2 * Copyright (c) 2016 The WebM project authors. All Rights Reserved.
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
15 #include "third_party/googletest/src/include/gtest/gtest.h"
17 #include "./vpx_config.h"
18 #include "./vpx_dsp_rtcd.h"
19 #include "test/acm_random.h"
20 #include "test/clear_system_state.h"
21 #include "test/register_state_check.h"
22 #include "test/util.h"
23 #include "vpx_ports/mem.h"
25 using libvpx_test::ACMRandom;
28 const int kNumIterations = 10000;
30 typedef uint64_t (*SSI16Func)(const int16_t *src, int stride, int size);
31 typedef std::tr1::tuple<SSI16Func, SSI16Func> SumSquaresParam;
33 class SumSquaresTest : public ::testing::TestWithParam<SumSquaresParam> {
35 virtual ~SumSquaresTest() {}
36 virtual void SetUp() {
37 ref_func_ = GET_PARAM(0);
38 tst_func_ = GET_PARAM(1);
41 virtual void TearDown() { libvpx_test::ClearSystemState(); }
48 TEST_P(SumSquaresTest, OperationCheck) {
49 ACMRandom rnd(ACMRandom::DeterministicSeed());
50 DECLARE_ALIGNED(16, int16_t, src[256 * 256]);
51 const int msb = 11; // Up to 12 bit input
52 const int limit = 1 << (msb + 1);
54 for (int k = 0; k < kNumIterations; k++) {
55 const int size = 4 << rnd(6); // Up to 128x128
56 int stride = 4 << rnd(7); // Up to 256 stride
57 while (stride < size) { // Make sure it's valid
61 for (int i = 0; i < size; ++i) {
62 for (int j = 0; j < size; ++j) {
63 src[i * stride + j] = rnd(2) ? rnd(limit) : -rnd(limit);
67 const uint64_t res_ref = ref_func_(src, stride, size);
69 ASM_REGISTER_STATE_CHECK(res_tst = tst_func_(src, stride, size));
71 ASSERT_EQ(res_ref, res_tst) << "Error: Sum Squares Test"
72 << " C output does not match optimized output.";
76 TEST_P(SumSquaresTest, ExtremeValues) {
77 ACMRandom rnd(ACMRandom::DeterministicSeed());
78 DECLARE_ALIGNED(16, int16_t, src[256 * 256]);
79 const int msb = 11; // Up to 12 bit input
80 const int limit = 1 << (msb + 1);
82 for (int k = 0; k < kNumIterations; k++) {
83 const int size = 4 << rnd(6); // Up to 128x128
84 int stride = 4 << rnd(7); // Up to 256 stride
85 while (stride < size) { // Make sure it's valid
89 const int val = rnd(2) ? limit - 1 : -(limit - 1);
90 for (int i = 0; i < size; ++i) {
91 for (int j = 0; j < size; ++j) {
92 src[i * stride + j] = val;
96 const uint64_t res_ref = ref_func_(src, stride, size);
98 ASM_REGISTER_STATE_CHECK(res_tst = tst_func_(src, stride, size));
100 ASSERT_EQ(res_ref, res_tst) << "Error: Sum Squares Test"
101 << " C output does not match optimized output.";
105 using std::tr1::make_tuple;
108 INSTANTIATE_TEST_CASE_P(
109 SSE2, SumSquaresTest,
110 ::testing::Values(make_tuple(&vpx_sum_squares_2d_i16_c,
111 &vpx_sum_squares_2d_i16_sse2)));
115 INSTANTIATE_TEST_CASE_P(MSA, SumSquaresTest, ::testing::Values(make_tuple(
116 &vpx_sum_squares_2d_i16_c,
117 &vpx_sum_squares_2d_i16_msa)));