2012-06-28 20:43:58 +02:00
|
|
|
/*
|
|
|
|
* 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 <string.h>
|
|
|
|
#include <limits.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
extern "C" {
|
|
|
|
#include "./vpx_config.h"
|
2012-11-09 02:09:30 +01:00
|
|
|
#include "./vp8_rtcd.h"
|
2012-06-28 20:43:58 +02:00
|
|
|
#include "vp8/common/blockd.h"
|
2012-08-28 02:13:09 +02:00
|
|
|
#include "vpx_mem/vpx_mem.h"
|
2012-06-28 20:43:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#include "test/acm_random.h"
|
|
|
|
#include "test/util.h"
|
|
|
|
#include "third_party/googletest/src/include/gtest/gtest.h"
|
|
|
|
|
|
|
|
|
|
|
|
typedef unsigned int (*sad_m_by_n_fn_t)(const unsigned char *source_ptr,
|
|
|
|
int source_stride,
|
|
|
|
const unsigned char *reference_ptr,
|
|
|
|
int reference_stride,
|
2012-06-26 20:37:33 +02:00
|
|
|
unsigned int max_sad);
|
2012-06-28 20:43:58 +02:00
|
|
|
|
|
|
|
using libvpx_test::ACMRandom;
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
class SADTest : public PARAMS(int, int, sad_m_by_n_fn_t) {
|
2012-08-28 02:13:09 +02:00
|
|
|
public:
|
|
|
|
static void SetUpTestCase() {
|
|
|
|
source_data_ = reinterpret_cast<uint8_t*>(
|
|
|
|
vpx_memalign(kDataAlignment, kDataBufferSize));
|
|
|
|
reference_data_ = reinterpret_cast<uint8_t*>(
|
|
|
|
vpx_memalign(kDataAlignment, kDataBufferSize));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void TearDownTestCase() {
|
|
|
|
vpx_free(source_data_);
|
|
|
|
source_data_ = NULL;
|
|
|
|
vpx_free(reference_data_);
|
|
|
|
reference_data_ = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
static const int kDataAlignment = 16;
|
|
|
|
static const int kDataBufferSize = 16 * 32;
|
|
|
|
|
2012-06-28 20:43:58 +02:00
|
|
|
virtual void SetUp() {
|
|
|
|
sad_fn_ = GET_PARAM(2);
|
|
|
|
height_ = GET_PARAM(1);
|
|
|
|
width_ = GET_PARAM(0);
|
|
|
|
source_stride_ = width_ * 2;
|
|
|
|
reference_stride_ = width_ * 2;
|
|
|
|
rnd_.Reset(ACMRandom::DeterministicSeed());
|
|
|
|
}
|
|
|
|
|
|
|
|
sad_m_by_n_fn_t sad_fn_;
|
2012-06-26 20:37:33 +02:00
|
|
|
virtual unsigned int SAD(unsigned int max_sad) {
|
2012-06-28 20:43:58 +02:00
|
|
|
return sad_fn_(source_data_, source_stride_,
|
|
|
|
reference_data_, reference_stride_,
|
|
|
|
max_sad);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Sum of Absolute Differences. Given two blocks, calculate the absolute
|
|
|
|
// difference between two pixels in the same relative location; accumulate.
|
|
|
|
unsigned int ReferenceSAD(unsigned int max_sad) {
|
|
|
|
unsigned int sad = 0;
|
|
|
|
|
|
|
|
for (int h = 0; h < height_; ++h) {
|
|
|
|
for (int w = 0; w < width_; ++w) {
|
|
|
|
sad += abs(source_data_[h * source_stride_ + w]
|
|
|
|
- reference_data_[h * reference_stride_ + w]);
|
|
|
|
}
|
|
|
|
if (sad > max_sad) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return sad;
|
|
|
|
}
|
|
|
|
|
|
|
|
void FillConstant(uint8_t *data, int stride, uint8_t fill_constant) {
|
|
|
|
for (int h = 0; h < height_; ++h) {
|
|
|
|
for (int w = 0; w < width_; ++w) {
|
|
|
|
data[h * stride + w] = fill_constant;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void FillRandom(uint8_t *data, int stride) {
|
|
|
|
for (int h = 0; h < height_; ++h) {
|
|
|
|
for (int w = 0; w < width_; ++w) {
|
|
|
|
data[h * stride + w] = rnd_.Rand8();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void CheckSad(unsigned int max_sad) {
|
|
|
|
unsigned int reference_sad, exp_sad;
|
|
|
|
|
|
|
|
reference_sad = ReferenceSAD(max_sad);
|
|
|
|
exp_sad = SAD(max_sad);
|
|
|
|
|
|
|
|
if (reference_sad <= max_sad) {
|
|
|
|
ASSERT_EQ(exp_sad, reference_sad);
|
|
|
|
} else {
|
|
|
|
// Alternative implementations are not required to check max_sad
|
|
|
|
ASSERT_GE(exp_sad, reference_sad);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle blocks up to 16x16 with stride up to 32
|
|
|
|
int height_, width_;
|
2012-08-28 02:13:09 +02:00
|
|
|
static uint8_t* source_data_;
|
2012-06-28 20:43:58 +02:00
|
|
|
int source_stride_;
|
2012-08-28 02:13:09 +02:00
|
|
|
static uint8_t* reference_data_;
|
2012-06-28 20:43:58 +02:00
|
|
|
int reference_stride_;
|
|
|
|
|
|
|
|
ACMRandom rnd_;
|
|
|
|
};
|
|
|
|
|
2012-08-28 02:13:09 +02:00
|
|
|
uint8_t* SADTest::source_data_ = NULL;
|
|
|
|
uint8_t* SADTest::reference_data_ = NULL;
|
|
|
|
|
2012-06-28 20:43:58 +02:00
|
|
|
TEST_P(SADTest, MaxRef) {
|
|
|
|
FillConstant(source_data_, source_stride_, 0);
|
|
|
|
FillConstant(reference_data_, reference_stride_, 255);
|
2012-06-26 20:37:33 +02:00
|
|
|
CheckSad(UINT_MAX);
|
2012-06-28 20:43:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_P(SADTest, MaxSrc) {
|
|
|
|
FillConstant(source_data_, source_stride_, 255);
|
|
|
|
FillConstant(reference_data_, reference_stride_, 0);
|
2012-06-26 20:37:33 +02:00
|
|
|
CheckSad(UINT_MAX);
|
2012-06-28 20:43:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_P(SADTest, ShortRef) {
|
|
|
|
int tmp_stride = reference_stride_;
|
|
|
|
reference_stride_ >>= 1;
|
|
|
|
FillRandom(source_data_, source_stride_);
|
|
|
|
FillRandom(reference_data_, reference_stride_);
|
2012-06-26 20:37:33 +02:00
|
|
|
CheckSad(UINT_MAX);
|
2012-06-28 20:43:58 +02:00
|
|
|
reference_stride_ = tmp_stride;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_P(SADTest, UnalignedRef) {
|
|
|
|
// The reference frame, but not the source frame, may be unaligned for
|
|
|
|
// certain types of searches.
|
|
|
|
int tmp_stride = reference_stride_;
|
|
|
|
reference_stride_ -= 1;
|
|
|
|
FillRandom(source_data_, source_stride_);
|
|
|
|
FillRandom(reference_data_, reference_stride_);
|
2012-06-26 20:37:33 +02:00
|
|
|
CheckSad(UINT_MAX);
|
2012-06-28 20:43:58 +02:00
|
|
|
reference_stride_ = tmp_stride;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_P(SADTest, ShortSrc) {
|
|
|
|
int tmp_stride = source_stride_;
|
|
|
|
source_stride_ >>= 1;
|
|
|
|
FillRandom(source_data_, source_stride_);
|
|
|
|
FillRandom(reference_data_, reference_stride_);
|
2012-06-26 20:37:33 +02:00
|
|
|
CheckSad(UINT_MAX);
|
2012-06-28 20:43:58 +02:00
|
|
|
source_stride_ = tmp_stride;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_P(SADTest, MaxSAD) {
|
|
|
|
// Verify that, when max_sad is set, the implementation does not return a
|
|
|
|
// value lower than the reference.
|
|
|
|
FillConstant(source_data_, source_stride_, 255);
|
|
|
|
FillConstant(reference_data_, reference_stride_, 0);
|
|
|
|
CheckSad(128);
|
|
|
|
}
|
|
|
|
|
2012-08-15 20:54:41 +02:00
|
|
|
using std::tr1::make_tuple;
|
|
|
|
|
|
|
|
const sad_m_by_n_fn_t sad_16x16_c = vp8_sad16x16_c;
|
|
|
|
const sad_m_by_n_fn_t sad_8x16_c = vp8_sad8x16_c;
|
|
|
|
const sad_m_by_n_fn_t sad_16x8_c = vp8_sad16x8_c;
|
|
|
|
const sad_m_by_n_fn_t sad_8x8_c = vp8_sad8x8_c;
|
|
|
|
const sad_m_by_n_fn_t sad_4x4_c = vp8_sad4x4_c;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(C, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_c),
|
|
|
|
make_tuple(8, 16, sad_8x16_c),
|
|
|
|
make_tuple(16, 8, sad_16x8_c),
|
|
|
|
make_tuple(8, 8, sad_8x8_c),
|
|
|
|
make_tuple(4, 4, sad_4x4_c)));
|
2012-06-28 20:43:58 +02:00
|
|
|
|
|
|
|
// ARM tests
|
|
|
|
#if HAVE_MEDIA
|
2012-08-15 20:54:41 +02:00
|
|
|
const sad_m_by_n_fn_t sad_16x16_armv6 = vp8_sad16x16_armv6;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(MEDIA, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_armv6)));
|
2012-06-28 20:43:58 +02:00
|
|
|
|
|
|
|
#endif
|
|
|
|
#if HAVE_NEON
|
2012-08-15 20:54:41 +02:00
|
|
|
const sad_m_by_n_fn_t sad_16x16_neon = vp8_sad16x16_neon;
|
|
|
|
const sad_m_by_n_fn_t sad_8x16_neon = vp8_sad8x16_neon;
|
|
|
|
const sad_m_by_n_fn_t sad_16x8_neon = vp8_sad16x8_neon;
|
|
|
|
const sad_m_by_n_fn_t sad_8x8_neon = vp8_sad8x8_neon;
|
|
|
|
const sad_m_by_n_fn_t sad_4x4_neon = vp8_sad4x4_neon;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(NEON, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_neon),
|
|
|
|
make_tuple(8, 16, sad_8x16_neon),
|
|
|
|
make_tuple(16, 8, sad_16x8_neon),
|
|
|
|
make_tuple(8, 8, sad_8x8_neon),
|
|
|
|
make_tuple(4, 4, sad_4x4_neon)));
|
2012-06-28 20:43:58 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
// X86 tests
|
|
|
|
#if HAVE_MMX
|
2012-08-15 20:54:41 +02:00
|
|
|
const sad_m_by_n_fn_t sad_16x16_mmx = vp8_sad16x16_mmx;
|
|
|
|
const sad_m_by_n_fn_t sad_8x16_mmx = vp8_sad8x16_mmx;
|
|
|
|
const sad_m_by_n_fn_t sad_16x8_mmx = vp8_sad16x8_mmx;
|
|
|
|
const sad_m_by_n_fn_t sad_8x8_mmx = vp8_sad8x8_mmx;
|
|
|
|
const sad_m_by_n_fn_t sad_4x4_mmx = vp8_sad4x4_mmx;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(MMX, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_mmx),
|
|
|
|
make_tuple(8, 16, sad_8x16_mmx),
|
|
|
|
make_tuple(16, 8, sad_16x8_mmx),
|
|
|
|
make_tuple(8, 8, sad_8x8_mmx),
|
|
|
|
make_tuple(4, 4, sad_4x4_mmx)));
|
2012-06-28 20:43:58 +02:00
|
|
|
#endif
|
|
|
|
#if HAVE_SSE2
|
2012-08-15 20:54:41 +02:00
|
|
|
const sad_m_by_n_fn_t sad_16x16_wmt = vp8_sad16x16_wmt;
|
|
|
|
const sad_m_by_n_fn_t sad_8x16_wmt = vp8_sad8x16_wmt;
|
|
|
|
const sad_m_by_n_fn_t sad_16x8_wmt = vp8_sad16x8_wmt;
|
|
|
|
const sad_m_by_n_fn_t sad_8x8_wmt = vp8_sad8x8_wmt;
|
|
|
|
const sad_m_by_n_fn_t sad_4x4_wmt = vp8_sad4x4_wmt;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(SSE2, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_wmt),
|
|
|
|
make_tuple(8, 16, sad_8x16_wmt),
|
|
|
|
make_tuple(16, 8, sad_16x8_wmt),
|
|
|
|
make_tuple(8, 8, sad_8x8_wmt),
|
|
|
|
make_tuple(4, 4, sad_4x4_wmt)));
|
2012-06-28 20:43:58 +02:00
|
|
|
#endif
|
|
|
|
#if HAVE_SSSE3
|
2012-08-15 20:54:41 +02:00
|
|
|
const sad_m_by_n_fn_t sad_16x16_sse3 = vp8_sad16x16_sse3;
|
2012-06-28 20:43:58 +02:00
|
|
|
INSTANTIATE_TEST_CASE_P(SSE3, SADTest, ::testing::Values(
|
2012-08-15 20:54:41 +02:00
|
|
|
make_tuple(16, 16, sad_16x16_sse3)));
|
2012-06-28 20:43:58 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
} // namespace
|