ref: b25ebf7dde596eacebe807e305044a74ccb55d57
parent: 94285b79abb03e873614cf91d3d2c69ca5b68978
parent: e61573c5f4571d68af66e315e7d629483d664a51
author: Yunqing Wang <yunqingwang@google.com>
date: Tue Jul 10 07:19:14 EDT 2012
Merge "Add unit test for vp8_sixtap_predict functions"
--- /dev/null
+++ b/test/sixtap_predict_test.cc
@@ -1,0 +1,200 @@
+/*
+* Copyright (c) 2012 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 <math.h>
+#include <stdlib.h>
+#include <string.h>
+#include "test/util.h"
+#include "third_party/googletest/src/include/gtest/gtest.h"
+extern "C" {+#include "./vpx_config.h"
+#include "./vpx_rtcd.h"
+#include "vpx_ports/mem.h"
+#include "vpx/vpx_integer.h"
+}
+
+namespace {+
+class ACMRandom {+ public:
+ explicit ACMRandom(int seed) { Reset(seed); }+
+ void Reset(int seed) { srand(seed); }+
+ uint8_t Rand8(void) { return (rand() >> 8) & 0xff; }+
+ int PseudoUniform(int range) { return (rand() >> 8) % range; }+
+ int operator()(int n) { return PseudoUniform(n); }+
+ static int DeterministicSeed(void) { return 0xbaba; }+};
+
+typedef void (*sixtap_predict_fn_t)(uint8_t *src_ptr,
+ int src_pixels_per_line,
+ int xoffset,
+ int yoffset,
+ uint8_t *dst_ptr,
+ int dst_pitch);
+
+class SixtapPredictTest : public PARAMS(int, int, sixtap_predict_fn_t) {+ protected:
+ // Make test arrays big enough for 16x16 functions. Six-tap filters
+ // need 5 extra pixels outside of the macroblock.
+ static const int kSrcStride = 21;
+ static const int kDstStride = 16;
+
+ virtual void SetUp() {+ width_ = GET_PARAM(0);
+ height_ = GET_PARAM(1);
+ sixtap_predict_ = GET_PARAM(2);
+ memset(src_, 0, sizeof(src_));
+ memset(dst_, 0, sizeof(dst_));
+ memset(dst_c_, 0, sizeof(dst_c_));
+ }
+
+ int width_;
+ int height_;
+ sixtap_predict_fn_t sixtap_predict_;
+ // The src stores the macroblock we will filter on, and makes it 1 byte larger
+ // in order to test unaligned access. The result is stored in dst and dst_c(c
+ // reference code result).
+ DECLARE_ALIGNED(16, uint8_t, src_[kSrcStride * kSrcStride + 1]);
+ DECLARE_ALIGNED(16, uint8_t, dst_[kDstStride * kDstStride]);
+ DECLARE_ALIGNED(16, uint8_t, dst_c_[kDstStride * kDstStride]);
+};
+
+TEST_P(SixtapPredictTest, TestWithPresetData) {+ const size_t src_size = sizeof(src_) / sizeof(uint8_t);
+ const size_t dst_size = sizeof(dst_) / sizeof(uint8_t);
+
+ // Test input
+ static const uint8_t test_data[src_size] = {+ 216, 184, 4, 191, 82, 92, 41, 0, 1, 226, 236, 172, 20, 182, 42, 226, 177,
+ 79, 94, 77, 179, 203, 206, 198, 22, 192, 19, 75, 17, 192, 44, 233, 120,
+ 48, 168, 203, 141, 210, 203, 143, 180, 184, 59, 201, 110, 102, 171, 32,
+ 182, 10, 109, 105, 213, 60, 47, 236, 253, 67, 55, 14, 3, 99, 247, 124,
+ 148, 159, 71, 34, 114, 19, 177, 38, 203, 237, 239, 58, 83, 155, 91, 10,
+ 166, 201, 115, 124, 5, 163, 104, 2, 231, 160, 16, 234, 4, 8, 103, 153,
+ 167, 174, 187, 26, 193, 109, 64, 141, 90, 48, 200, 174, 204, 36, 184,
+ 114, 237, 43, 238, 242, 207, 86, 245, 182, 247, 6, 161, 251, 14, 8, 148,
+ 182, 182, 79, 208, 120, 188, 17, 6, 23, 65, 206, 197, 13, 242, 126, 128,
+ 224, 170, 110, 211, 121, 197, 200, 47, 188, 207, 208, 184, 221, 216, 76,
+ 148, 143, 156, 100, 8, 89, 117, 14, 112, 183, 221, 54, 197, 208, 180, 69,
+ 176, 94, 180, 131, 215, 121, 76, 7, 54, 28, 216, 238, 249, 176, 58, 142,
+ 64, 215, 242, 72, 49, 104, 87, 161, 32, 52, 216, 230, 4, 141, 44, 181,
+ 235, 224, 57, 195, 89, 134, 203, 144, 162, 163, 126, 156, 84, 185, 42,
+ 148, 145, 29, 221, 194, 134, 52, 100, 166, 105, 60, 140, 110, 201, 184,
+ 35, 181, 153, 93, 121, 243, 227, 68, 131, 134, 232, 2, 35, 60, 187, 77,
+ 209, 76, 106, 174, 15, 241, 227, 115, 151, 77, 175, 36, 187, 121, 221,
+ 223, 47, 118, 61, 168, 105, 32, 237, 236, 167, 213, 238, 202, 17, 170,
+ 24, 226, 247, 131, 145, 6, 116, 117, 121, 11, 194, 41, 48, 126, 162, 13,
+ 93, 209, 131, 154, 122, 237, 187, 103, 217, 99, 60, 200, 45, 78, 115, 69,
+ 49, 106, 200, 194, 112, 60, 56, 234, 72, 251, 19, 120, 121, 182, 134, 215,
+ 135, 10, 114, 2, 247, 46, 105, 209, 145, 165, 153, 191, 243, 12, 5, 36,
+ 119, 206, 231, 231, 11, 32, 209, 83, 27, 229, 204, 149, 155, 83, 109, 35,
+ 93, 223, 37, 84, 14, 142, 37, 160, 52, 191, 96, 40, 204, 101, 77, 67, 52,
+ 53, 43, 63, 85, 253, 147, 113, 226, 96, 6, 125, 179, 115, 161, 17, 83,
+ 198, 101, 98, 85, 139, 3, 137, 75, 99, 178, 23, 201, 255, 91, 253, 52,
+ 134, 60, 138, 131, 208, 251, 101, 48, 2, 227, 228, 118, 132, 245, 202,
+ 75, 91, 44, 160, 231, 47, 41, 50, 147, 220, 74, 92, 219, 165, 89, 16
+ };
+
+ // Expected result
+ static const uint8_t expected_dst[dst_size] = {+ 117, 102, 74, 135, 42, 98, 175, 206, 70, 73, 222, 197, 50, 24, 39, 49, 38,
+ 105, 90, 47, 169, 40, 171, 215, 200, 73, 109, 141, 53, 85, 177, 164, 79,
+ 208, 124, 89, 212, 18, 81, 145, 151, 164, 217, 153, 91, 154, 102, 102,
+ 159, 75, 164, 152, 136, 51, 213, 219, 186, 116, 193, 224, 186, 36, 231,
+ 208, 84, 211, 155, 167, 35, 59, 42, 76, 216, 149, 73, 201, 78, 149, 184,
+ 100, 96, 196, 189, 198, 188, 235, 195, 117, 129, 120, 129, 49, 25, 133,
+ 113, 69, 221, 114, 70, 143, 99, 157, 108, 189, 140, 78, 6, 55, 65, 240,
+ 255, 245, 184, 72, 90, 100, 116, 131, 39, 60, 234, 167, 33, 160, 88, 185,
+ 200, 157, 159, 176, 127, 151, 138, 102, 168, 106, 170, 86, 82, 219, 189,
+ 76, 33, 115, 197, 106, 96, 198, 136, 97, 141, 237, 151, 98, 137, 191,
+ 185, 2, 57, 95, 142, 91, 255, 185, 97, 137, 76, 162, 94, 173, 131, 193,
+ 161, 81, 106, 72, 135, 222, 234, 137, 66, 137, 106, 243, 210, 147, 95,
+ 15, 137, 110, 85, 66, 16, 96, 167, 147, 150, 173, 203, 140, 118, 196,
+ 84, 147, 160, 19, 95, 101, 123, 74, 132, 202, 82, 166, 12, 131, 166,
+ 189, 170, 159, 85, 79, 66, 57, 152, 132, 203, 194, 0, 1, 56, 146, 180,
+ 224, 156, 28, 83, 181, 79, 76, 80, 46, 160, 175, 59, 106, 43, 87, 75,
+ 136, 85, 189, 46, 71, 200, 90
+ };
+
+ uint8_t *src = const_cast<uint8_t*>(test_data);
+
+ sixtap_predict_(&src[kSrcStride * 2 + 2 + 1], kSrcStride,
+ 2, 2, dst_, kDstStride);
+
+ for (int i = 0; i < height_; ++i)
+ for (int j = 0; j < width_; ++j)
+ ASSERT_EQ(expected_dst[i * kDstStride + j], dst_[i * kDstStride + j])
+ << "i==" << (i * width_ + j);
+}
+
+TEST_P(SixtapPredictTest, TestWithRandomData) {+ const size_t src_size = sizeof(src_) / sizeof(uint8_t);
+
+ ACMRandom rnd(ACMRandom::DeterministicSeed());
+ for (size_t i = 0; i < src_size; ++i)
+ src_[i] = rnd.Rand8();
+
+ // Run tests for all possible offsets.
+ for (int xoffset = 0; xoffset < 8; ++xoffset) {+ for (int yoffset = 0; yoffset < 8; ++yoffset) {+ // Call c reference function.
+ // Move start point to next pixel to test if the function reads
+ // unaligned data correctly.
+ vp8_sixtap_predict16x16_c(&src_[kSrcStride * 2 + 2 + 1], kSrcStride,
+ xoffset, yoffset, dst_c_, kDstStride);
+
+ // Run test.
+ sixtap_predict_(&src_[kSrcStride * 2 + 2 + 1], kSrcStride,
+ xoffset, yoffset, dst_, kDstStride);
+
+ for (int i = 0; i < height_; ++i)
+ for (int j = 0; j < width_; ++j)
+ ASSERT_EQ(dst_c_[i * kDstStride + j], dst_[i * kDstStride + j])
+ << "i==" << (i * width_ + j);
+ }
+ }
+}
+
+using std::tr1::make_tuple;
+INSTANTIATE_TEST_CASE_P(
+ C, SixtapPredictTest, ::testing::Values(
+ make_tuple(16, 16, vp8_sixtap_predict16x16_c),
+ make_tuple(8, 8, vp8_sixtap_predict8x8_c),
+ make_tuple(8, 4, vp8_sixtap_predict8x4_c),
+ make_tuple(4, 4, vp8_sixtap_predict4x4_c)));
+#if HAVE_MMX
+INSTANTIATE_TEST_CASE_P(
+ MMX, SixtapPredictTest, ::testing::Values(
+ make_tuple(16, 16, vp8_sixtap_predict16x16_mmx),
+ make_tuple(8, 8, vp8_sixtap_predict8x8_mmx),
+ make_tuple(8, 4, vp8_sixtap_predict8x4_mmx),
+ make_tuple(4, 4, vp8_sixtap_predict4x4_mmx)));
+#endif
+#if HAVE_SSE2
+INSTANTIATE_TEST_CASE_P(
+ SSE2, SixtapPredictTest, ::testing::Values(
+ make_tuple(16, 16, vp8_sixtap_predict16x16_sse2),
+ make_tuple(8, 8, vp8_sixtap_predict8x8_sse2),
+ make_tuple(8, 4, vp8_sixtap_predict8x4_sse2)));
+#endif
+#if HAVE_SSSE3
+INSTANTIATE_TEST_CASE_P(
+ SSSE3, SixtapPredictTest, ::testing::Values(
+ make_tuple(16, 16, vp8_sixtap_predict16x16_ssse3),
+ make_tuple(8, 8, vp8_sixtap_predict8x8_ssse3),
+ make_tuple(8, 4, vp8_sixtap_predict8x4_ssse3),
+ make_tuple(4, 4, vp8_sixtap_predict4x4_ssse3)));
+#endif
+} // namespace
--- a/test/test.mk
+++ b/test/test.mk
@@ -1,5 +1,6 @@
LIBVPX_TEST_SRCS-yes += test.mk
LIBVPX_TEST_SRCS-yes += test_libvpx.cc
+LIBVPX_TEST_SRCS-yes += util.h
##
## BLACK BOX TESTS
@@ -31,6 +32,7 @@
LIBVPX_TEST_SRCS-yes += idctllm_test.cc
LIBVPX_TEST_SRCS-yes += intrapred_test.cc
LIBVPX_TEST_SRCS-$(CONFIG_POSTPROC) += pp_filter_test.cc
+LIBVPX_TEST_SRCS-yes += sixtap_predict_test.cc
endif
--- /dev/null
+++ b/test/util.h
@@ -1,0 +1,18 @@
+/*
+ * Copyright (c) 2012 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.
+ */
+
+#ifndef TEST_UTIL_H_
+#define TEST_UTIL_H_
+
+// Macros
+#define PARAMS(...) ::testing::TestWithParam< std::tr1::tuple< __VA_ARGS__ > >
+#define GET_PARAM(k) std::tr1::get< k >(GetParam())
+
+#endif // TEST_UTIL_H_