intrapred_test.cc 12.1 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
/*
 *  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>
Johann's avatar
Johann committed
13
#include "test/acm_random.h"
14
#include "test/clear_system_state.h"
15
#include "test/register_state_check.h"
16
#include "third_party/googletest/src/include/gtest/gtest.h"
17

Yaowu Xu's avatar
Yaowu Xu committed
18
19
#include "./vpx_config.h"
#include "./vp8_rtcd.h"
20
#include "vp8/common/blockd.h"
21
#include "vpx_mem/vpx_mem.h"
22
23
24

namespace {

Johann's avatar
Johann committed
25
26
using libvpx_test::ACMRandom;

27
class IntraPredBase {
28
 public:
James Zern's avatar
James Zern committed
29
  virtual ~IntraPredBase() { libvpx_test::ClearSystemState(); }
30

31
 protected:
32
33
34
35
36
  void SetupMacroblock(MACROBLOCKD *mbptr,
                       MODE_INFO *miptr,
                       uint8_t *data,
                       int block_size,
                       int stride,
37
                       int num_planes) {
38
39
40
41
42
    mbptr_ = mbptr;
    miptr_ = miptr;
    mbptr_->up_available = 1;
    mbptr_->left_available = 1;
    mbptr_->mode_info_context = miptr_;
43
44
45
46
47
48
49
50
51
52
    stride_ = stride;
    block_size_ = block_size;
    num_planes_ = num_planes;
    for (int p = 0; p < num_planes; p++)
      data_ptr_[p] = data + stride * (block_size + 1) * p +
                     stride + block_size;
  }

  void FillRandom() {
    // Fill edges with random data
Johann's avatar
Johann committed
53
    ACMRandom rnd(ACMRandom::DeterministicSeed());
54
55
    for (int p = 0; p < num_planes_; p++) {
      for (int x = -1 ; x <= block_size_; x++)
Johann's avatar
Johann committed
56
        data_ptr_[p][x - stride_] = rnd.Rand8();
57
      for (int y = 0; y < block_size_; y++)
Johann's avatar
Johann committed
58
        data_ptr_[p][y * stride_ - 1] = rnd.Rand8();
59
60
61
62
63
64
    }
  }

  virtual void Predict(MB_PREDICTION_MODE mode) = 0;

  void SetLeftUnavailable() {
65
    mbptr_->left_available = 0;
66
67
68
69
70
71
    for (int p = 0; p < num_planes_; p++)
      for (int i = -1; i < block_size_; ++i)
        data_ptr_[p][stride_ * i - 1] = 129;
  }

  void SetTopUnavailable() {
72
    mbptr_->up_available = 0;
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
    for (int p = 0; p < num_planes_; p++)
      memset(&data_ptr_[p][-1 - stride_], 127, block_size_ + 2);
  }

  void SetTopLeftUnavailable() {
    SetLeftUnavailable();
    SetTopUnavailable();
  }

  int BlockSizeLog2Min1() const {
    switch (block_size_) {
      case 16:
        return 3;
      case 8:
        return 2;
      default:
        return 0;
    }
  }

  // check DC prediction output against a reference
  void CheckDCPrediction() const {
    for (int p = 0; p < num_planes_; p++) {
      // calculate expected DC
      int expected;
98
99
100
101
      if (mbptr_->up_available || mbptr_->left_available) {
        int sum = 0, shift = BlockSizeLog2Min1() + mbptr_->up_available +
                             mbptr_->left_available;
        if (mbptr_->up_available)
102
103
          for (int x = 0; x < block_size_; x++)
            sum += data_ptr_[p][x - stride_];
104
        if (mbptr_->left_available)
105
106
107
          for (int y = 0; y < block_size_; y++)
            sum += data_ptr_[p][y * stride_ - 1];
        expected = (sum + (1 << (shift - 1))) >> shift;
Yaowu Xu's avatar
Yaowu Xu committed
108
      } else {
109
        expected = 0x80;
Yaowu Xu's avatar
Yaowu Xu committed
110
      }
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
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
      // check that all subsequent lines are equal to the first
      for (int y = 1; y < block_size_; ++y)
        ASSERT_EQ(0, memcmp(data_ptr_[p], &data_ptr_[p][y * stride_],
                            block_size_));
      // within the first line, ensure that each pixel has the same value
      for (int x = 1; x < block_size_; ++x)
        ASSERT_EQ(data_ptr_[p][0], data_ptr_[p][x]);
      // now ensure that that pixel has the expected (DC) value
      ASSERT_EQ(expected, data_ptr_[p][0]);
    }
  }

  // check V prediction output against a reference
  void CheckVPrediction() const {
    // check that all lines equal the top border
    for (int p = 0; p < num_planes_; p++)
      for (int y = 0; y < block_size_; y++)
        ASSERT_EQ(0, memcmp(&data_ptr_[p][-stride_],
                            &data_ptr_[p][y * stride_], block_size_));
  }

  // check H prediction output against a reference
  void CheckHPrediction() const {
    // for each line, ensure that each pixel is equal to the left border
    for (int p = 0; p < num_planes_; p++)
      for (int y = 0; y < block_size_; y++)
        for (int x = 0; x < block_size_; x++)
          ASSERT_EQ(data_ptr_[p][-1 + y * stride_],
                    data_ptr_[p][x + y * stride_]);
  }

  static int ClipByte(int value) {
    if (value > 255)
      return 255;
    else if (value < 0)
      return 0;
    return value;
  }

  // check TM prediction output against a reference
  void CheckTMPrediction() const {
    for (int p = 0; p < num_planes_; p++)
      for (int y = 0; y < block_size_; y++)
        for (int x = 0; x < block_size_; x++) {
          const int expected = ClipByte(data_ptr_[p][x - stride_]
                                      + data_ptr_[p][stride_ * y - 1]
                                      - data_ptr_[p][-1 - stride_]);
          ASSERT_EQ(expected, data_ptr_[p][y * stride_ + x]);
       }
  }

  // Actual test
  void RunTest() {
    {
      SCOPED_TRACE("DC_PRED");
      FillRandom();
      Predict(DC_PRED);
      CheckDCPrediction();
    }
    {
      SCOPED_TRACE("DC_PRED LEFT");
      FillRandom();
      SetLeftUnavailable();
      Predict(DC_PRED);
      CheckDCPrediction();
    }
    {
      SCOPED_TRACE("DC_PRED TOP");
      FillRandom();
      SetTopUnavailable();
      Predict(DC_PRED);
      CheckDCPrediction();
    }
    {
      SCOPED_TRACE("DC_PRED TOP_LEFT");
      FillRandom();
      SetTopLeftUnavailable();
      Predict(DC_PRED);
      CheckDCPrediction();
    }
    {
      SCOPED_TRACE("H_PRED");
      FillRandom();
      Predict(H_PRED);
      CheckHPrediction();
    }
    {
      SCOPED_TRACE("V_PRED");
      FillRandom();
      Predict(V_PRED);
      CheckVPrediction();
    }
    {
      SCOPED_TRACE("TM_PRED");
      FillRandom();
      Predict(TM_PRED);
      CheckTMPrediction();
    }
  }

211
212
  MACROBLOCKD *mbptr_;
  MODE_INFO *miptr_;
213
214
215
216
217
218
  uint8_t *data_ptr_[2];  // in the case of Y, only [0] is used
  int stride_;
  int block_size_;
  int num_planes_;
};

219
220
221
222
223
224
typedef void (*IntraPredYFunc)(MACROBLOCKD *x,
                               uint8_t *yabove_row,
                               uint8_t *yleft,
                               int left_stride,
                               uint8_t *ypred_ptr,
                               int y_stride);
225

James Zern's avatar
James Zern committed
226
227
class IntraPredYTest
    : public IntraPredBase,
228
      public ::testing::TestWithParam<IntraPredYFunc> {
229
230
 public:
  static void SetUpTestCase() {
231
232
233
234
    mb_ = reinterpret_cast<MACROBLOCKD*>(
        vpx_memalign(32, sizeof(MACROBLOCKD)));
    mi_ = reinterpret_cast<MODE_INFO*>(
        vpx_memalign(32, sizeof(MODE_INFO)));
235
236
237
238
239
240
    data_array_ = reinterpret_cast<uint8_t*>(
        vpx_memalign(kDataAlignment, kDataBufferSize));
  }

  static void TearDownTestCase() {
    vpx_free(data_array_);
241
242
    vpx_free(mi_);
    vpx_free(mb_);
243
244
245
    data_array_ = NULL;
  }

246
247
 protected:
  static const int kBlockSize = 16;
248
  static const int kDataAlignment = 16;
249
  static const int kStride = kBlockSize * 3;
250
251
252
253
254
255
  // We use 48 so that the data pointer of the first pixel in each row of
  // each macroblock is 16-byte aligned, and this gives us access to the
  // top-left and top-right corner pixels belonging to the top-left/right
  // macroblocks.
  // We use 17 lines so we have one line above us for top-prediction.
  static const int kDataBufferSize = kStride * (kBlockSize + 1);
256
257
258

  virtual void SetUp() {
    pred_fn_ = GetParam();
259
    SetupMacroblock(mb_, mi_, data_array_, kBlockSize, kStride, 1);
260
261
262
  }

  virtual void Predict(MB_PREDICTION_MODE mode) {
263
    mbptr_->mode_info_context->mbmi.mode = mode;
264
265
266
267
    ASM_REGISTER_STATE_CHECK(pred_fn_(mbptr_,
                                      data_ptr_[0] - kStride,
                                      data_ptr_[0] - 1, kStride,
                                      data_ptr_[0], kStride));
268
269
  }

270
  IntraPredYFunc pred_fn_;
271
  static uint8_t* data_array_;
272
273
  static MACROBLOCKD * mb_;
  static MODE_INFO *mi_;
274
275
};

276
277
MACROBLOCKD* IntraPredYTest::mb_ = NULL;
MODE_INFO* IntraPredYTest::mi_ = NULL;
278
279
uint8_t* IntraPredYTest::data_array_ = NULL;

280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
TEST_P(IntraPredYTest, IntraPredTests) {
  RunTest();
}

INSTANTIATE_TEST_CASE_P(C, IntraPredYTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mby_s_c));
#if HAVE_SSE2
INSTANTIATE_TEST_CASE_P(SSE2, IntraPredYTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mby_s_sse2));
#endif
#if HAVE_SSSE3
INSTANTIATE_TEST_CASE_P(SSSE3, IntraPredYTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mby_s_ssse3));
#endif
297
298
299
300
301
#if HAVE_NEON
INSTANTIATE_TEST_CASE_P(NEON, IntraPredYTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mby_s_neon));
#endif
302

303
304
305
306
307
308
309
310
311
typedef void (*IntraPredUvFunc)(MACROBLOCKD *x,
                                uint8_t *uabove_row,
                                uint8_t *vabove_row,
                                uint8_t *uleft,
                                uint8_t *vleft,
                                int left_stride,
                                uint8_t *upred_ptr,
                                uint8_t *vpred_ptr,
                                int pred_stride);
312

James Zern's avatar
James Zern committed
313
314
class IntraPredUVTest
    : public IntraPredBase,
315
      public ::testing::TestWithParam<IntraPredUvFunc> {
316
317
 public:
  static void SetUpTestCase() {
318
319
320
321
    mb_ = reinterpret_cast<MACROBLOCKD*>(
        vpx_memalign(32, sizeof(MACROBLOCKD)));
    mi_ = reinterpret_cast<MODE_INFO*>(
        vpx_memalign(32, sizeof(MODE_INFO)));
322
323
324
325
326
327
    data_array_ = reinterpret_cast<uint8_t*>(
        vpx_memalign(kDataAlignment, kDataBufferSize));
  }

  static void TearDownTestCase() {
    vpx_free(data_array_);
328
329
    vpx_free(mi_);
    vpx_free(mb_);
330
331
332
    data_array_ = NULL;
  }

333
334
 protected:
  static const int kBlockSize = 8;
335
  static const int kDataAlignment = 8;
336
  static const int kStride = kBlockSize * 3;
337
338
339
340
341
342
343
  // We use 24 so that the data pointer of the first pixel in each row of
  // each macroblock is 8-byte aligned, and this gives us access to the
  // top-left and top-right corner pixels belonging to the top-left/right
  // macroblocks.
  // We use 9 lines so we have one line above us for top-prediction.
  // [0] = U, [1] = V
  static const int kDataBufferSize = 2 * kStride * (kBlockSize + 1);
344
345
346

  virtual void SetUp() {
    pred_fn_ = GetParam();
347
    SetupMacroblock(mb_, mi_, data_array_, kBlockSize, kStride, 2);
348
349
350
  }

  virtual void Predict(MB_PREDICTION_MODE mode) {
351
352
    mbptr_->mode_info_context->mbmi.uv_mode = mode;
    pred_fn_(mbptr_, data_ptr_[0] - kStride, data_ptr_[1] - kStride,
353
354
355
356
             data_ptr_[0] - 1, data_ptr_[1] - 1, kStride,
             data_ptr_[0], data_ptr_[1], kStride);
  }

357
  IntraPredUvFunc pred_fn_;
358
359
360
361
362
363
  // We use 24 so that the data pointer of the first pixel in each row of
  // each macroblock is 8-byte aligned, and this gives us access to the
  // top-left and top-right corner pixels belonging to the top-left/right
  // macroblocks.
  // We use 9 lines so we have one line above us for top-prediction.
  // [0] = U, [1] = V
364
  static uint8_t* data_array_;
365
366
  static MACROBLOCKD* mb_;
  static MODE_INFO* mi_;
367
368
};

369
370
MACROBLOCKD* IntraPredUVTest::mb_ = NULL;
MODE_INFO* IntraPredUVTest::mi_ = NULL;
371
372
uint8_t* IntraPredUVTest::data_array_ = NULL;

373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
TEST_P(IntraPredUVTest, IntraPredTests) {
  RunTest();
}

INSTANTIATE_TEST_CASE_P(C, IntraPredUVTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mbuv_s_c));
#if HAVE_SSE2
INSTANTIATE_TEST_CASE_P(SSE2, IntraPredUVTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mbuv_s_sse2));
#endif
#if HAVE_SSSE3
INSTANTIATE_TEST_CASE_P(SSSE3, IntraPredUVTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mbuv_s_ssse3));
#endif
390
391
392
393
394
#if HAVE_NEON
INSTANTIATE_TEST_CASE_P(NEON, IntraPredUVTest,
                        ::testing::Values(
                            vp8_build_intra_predictors_mbuv_s_neon));
#endif
395
396

}  // namespace