convolve_test.cc 18.3 KB
Newer Older
John Koleszar's avatar
John Koleszar committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14
/*
 *  Copyright (c) 2010 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.
 */


extern "C" {
#include "./vpx_config.h"
#include "./vp9_rtcd.h"
15
#include "vpx_mem/vpx_mem.h"
John Koleszar's avatar
John Koleszar committed
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 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 107 108 109 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
}
#include "third_party/googletest/src/include/gtest/gtest.h"
#include "test/acm_random.h"
#include "test/register_state_check.h"
#include "test/util.h"

namespace {
typedef void (*convolve_fn_t)(const uint8_t *src, int src_stride,
                              uint8_t *dst, int dst_stride,
                              const int16_t *filter_x, int filter_x_stride,
                              const int16_t *filter_y, int filter_y_stride,
                              int w, int h);

struct ConvolveFunctions {
  ConvolveFunctions(convolve_fn_t h8, convolve_fn_t h8_avg,
                    convolve_fn_t v8, convolve_fn_t v8_avg,
                    convolve_fn_t hv8, convolve_fn_t hv8_avg)
      : h8_(h8), v8_(v8), hv8_(hv8), h8_avg_(h8_avg), v8_avg_(v8_avg),
        hv8_avg_(hv8_avg) {}

  convolve_fn_t h8_;
  convolve_fn_t v8_;
  convolve_fn_t hv8_;
  convolve_fn_t h8_avg_;
  convolve_fn_t v8_avg_;
  convolve_fn_t hv8_avg_;
};

// Reference 8-tap subpixel filter, slightly modified to fit into this test.
#define VP9_FILTER_WEIGHT 128
#define VP9_FILTER_SHIFT 7
static uint8_t clip_pixel(int x) {
  return x < 0 ? 0 :
         x > 255 ? 255 :
         x;
}

static void filter_block2d_8_c(const uint8_t *src_ptr,
                               const unsigned int src_stride,
                               const int16_t *HFilter,
                               const int16_t *VFilter,
                               uint8_t *dst_ptr,
                               unsigned int dst_stride,
                               unsigned int output_width,
                               unsigned int output_height) {
  // Between passes, we use an intermediate buffer whose height is extended to
  // have enough horizontally filtered values as input for the vertical pass.
  // This buffer is allocated to be big enough for the largest block type we
  // support.
  const int kInterp_Extend = 4;
  const unsigned int intermediate_height =
    (kInterp_Extend - 1) +     output_height + kInterp_Extend;

  /* Size of intermediate_buffer is max_intermediate_height * filter_max_width,
   * where max_intermediate_height = (kInterp_Extend - 1) + filter_max_height
   *                                 + kInterp_Extend
   *                               = 3 + 16 + 4
   *                               = 23
   * and filter_max_width = 16
   */
  uint8_t intermediate_buffer[23 * 16];
  const int intermediate_next_stride = 1 - intermediate_height * output_width;

  // Horizontal pass (src -> transposed intermediate).
  {
    uint8_t *output_ptr = intermediate_buffer;
    const int src_next_row_stride = src_stride - output_width;
    unsigned int i, j;
    src_ptr -= (kInterp_Extend - 1) * src_stride + (kInterp_Extend - 1);
    for (i = 0; i < intermediate_height; ++i) {
      for (j = 0; j < output_width; ++j) {
        // Apply filter...
        int temp = ((int)src_ptr[0] * HFilter[0]) +
                   ((int)src_ptr[1] * HFilter[1]) +
                   ((int)src_ptr[2] * HFilter[2]) +
                   ((int)src_ptr[3] * HFilter[3]) +
                   ((int)src_ptr[4] * HFilter[4]) +
                   ((int)src_ptr[5] * HFilter[5]) +
                   ((int)src_ptr[6] * HFilter[6]) +
                   ((int)src_ptr[7] * HFilter[7]) +
                   (VP9_FILTER_WEIGHT >> 1);  // Rounding

        // Normalize back to 0-255...
        *output_ptr = clip_pixel(temp >> VP9_FILTER_SHIFT);
        ++src_ptr;
        output_ptr += intermediate_height;
      }
      src_ptr += src_next_row_stride;
      output_ptr += intermediate_next_stride;
    }
  }

  // Vertical pass (transposed intermediate -> dst).
  {
    uint8_t *src_ptr = intermediate_buffer;
    const int dst_next_row_stride = dst_stride - output_width;
    unsigned int i, j;
    for (i = 0; i < output_height; ++i) {
      for (j = 0; j < output_width; ++j) {
        // Apply filter...
        int temp = ((int)src_ptr[0] * VFilter[0]) +
                   ((int)src_ptr[1] * VFilter[1]) +
                   ((int)src_ptr[2] * VFilter[2]) +
                   ((int)src_ptr[3] * VFilter[3]) +
                   ((int)src_ptr[4] * VFilter[4]) +
                   ((int)src_ptr[5] * VFilter[5]) +
                   ((int)src_ptr[6] * VFilter[6]) +
                   ((int)src_ptr[7] * VFilter[7]) +
                   (VP9_FILTER_WEIGHT >> 1);  // Rounding

        // Normalize back to 0-255...
        *dst_ptr++ = clip_pixel(temp >> VP9_FILTER_SHIFT);
        src_ptr += intermediate_height;
      }
      src_ptr += intermediate_next_stride;
      dst_ptr += dst_next_row_stride;
    }
  }
}

static void block2d_average_c(uint8_t *src,
                              unsigned int src_stride,
                              uint8_t *output_ptr,
                              unsigned int output_stride,
                              unsigned int output_width,
                              unsigned int output_height) {
  unsigned int i, j;
  for (i = 0; i < output_height; ++i) {
    for (j = 0; j < output_width; ++j) {
      output_ptr[j] = (output_ptr[j] + src[i * src_stride + j] + 1) >> 1;
    }
    output_ptr += output_stride;
  }
}

static void filter_average_block2d_8_c(const uint8_t *src_ptr,
                                       const unsigned int src_stride,
                                       const int16_t *HFilter,
                                       const int16_t *VFilter,
                                       uint8_t *dst_ptr,
                                       unsigned int dst_stride,
                                       unsigned int output_width,
                                       unsigned int output_height) {
  uint8_t tmp[16*16];

  assert(output_width <= 16);
  assert(output_height <= 16);
  filter_block2d_8_c(src_ptr, src_stride, HFilter, VFilter, tmp, 16,
                     output_width, output_height);
  block2d_average_c(tmp, 16, dst_ptr, dst_stride,
                    output_width, output_height);
}

class ConvolveTest : public PARAMS(int, int, const ConvolveFunctions*) {
170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
 public:
  static void SetUpTestCase() {
    // Force input_ to be unaligned, output to be 16 byte aligned.
    input_ = reinterpret_cast<uint8_t*>(
        vpx_memalign(kDataAlignment, kOuterBlockSize * kOuterBlockSize + 1))
        + 1;
    output_ = reinterpret_cast<uint8_t*>(
        vpx_memalign(kDataAlignment, kOuterBlockSize * kOuterBlockSize));
  }

  static void TearDownTestCase() {
    vpx_free(input_ - 1);
    input_ = NULL;
    vpx_free(output_);
    output_ = NULL;
  }

John Koleszar's avatar
John Koleszar committed
187
  protected:
188
    static const int kDataAlignment = 16;
John Koleszar's avatar
John Koleszar committed
189 190 191 192 193 194 195
    static const int kOuterBlockSize = 32;
    static const int kInputStride = kOuterBlockSize;
    static const int kOutputStride = kOuterBlockSize;
    static const int kMaxDimension = 16;

    int Width() const { return GET_PARAM(0); }
    int Height() const { return GET_PARAM(1); }
196 197 198 199
    int BorderLeft() const {
      const int center = (kOuterBlockSize - Width()) / 2;
      return (center + (kDataAlignment - 1)) & ~(kDataAlignment - 1);
    }
John Koleszar's avatar
John Koleszar committed
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
    int BorderTop() const { return (kOuterBlockSize - Height()) / 2; }

    bool IsIndexInBorder(int i) {
      return (i < BorderTop() * kOuterBlockSize ||
              i >= (BorderTop() + Height()) * kOuterBlockSize ||
              i % kOuterBlockSize < BorderLeft() ||
              i % kOuterBlockSize >= (BorderLeft() + Width()));
    }

    virtual void SetUp() {
      UUT_ = GET_PARAM(2);
      memset(input_, 0, sizeof(input_));
      /* Set up guard blocks for an inner block cetered in the outer block */
      for (int i = 0; i < kOuterBlockSize * kOuterBlockSize; ++i) {
        if (IsIndexInBorder(i))
          output_[i] = 255;
        else
          output_[i] = 0;
      }

      ::libvpx_test::ACMRandom prng;
      for (int i = 0; i < kOuterBlockSize * kOuterBlockSize; ++i)
        input_[i] = prng.Rand8();
    }

    void CheckGuardBlocks() {
      for (int i = 0; i < kOuterBlockSize * kOuterBlockSize; ++i) {
        if (IsIndexInBorder(i))
          EXPECT_EQ(255, output_[i]);
      }
    }

    uint8_t* input() {
      return input_ + BorderTop() * kOuterBlockSize + BorderLeft();
    }

    uint8_t* output() {
      return output_ + BorderTop() * kOuterBlockSize + BorderLeft();
    }

    const ConvolveFunctions* UUT_;
241 242
    static uint8_t* input_;
    static uint8_t* output_;
John Koleszar's avatar
John Koleszar committed
243
};
244 245
uint8_t* ConvolveTest::input_ = NULL;
uint8_t* ConvolveTest::output_ = NULL;
John Koleszar's avatar
John Koleszar committed
246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508

TEST_P(ConvolveTest, GuardBlocks) {
  CheckGuardBlocks();
}

TEST_P(ConvolveTest, CopyHoriz) {
  uint8_t* const in = input();
  uint8_t* const out = output();
  const int16_t filter8[8] = {0, 0, 0, 128, 0, 0, 0, 0};

  REGISTER_STATE_CHECK(
      UUT_->h8_(in, kInputStride, out, kOutputStride, filter8, 16, filter8, 16,
                Width(), Height()));

  CheckGuardBlocks();

  for (int y = 0; y < Height(); ++y)
    for (int x = 0; x < Width(); ++x)
      ASSERT_EQ(out[y * kOutputStride + x], in[y * kInputStride + x])
          << "(" << x << "," << y << ")";
}

TEST_P(ConvolveTest, CopyVert) {
  uint8_t* const in = input();
  uint8_t* const out = output();
  const int16_t filter8[8] = {0, 0, 0, 128, 0, 0, 0, 0};

  REGISTER_STATE_CHECK(
      UUT_->v8_(in, kInputStride, out, kOutputStride, filter8, 16, filter8, 16,
                Width(), Height()));

  CheckGuardBlocks();

  for (int y = 0; y < Height(); ++y)
    for (int x = 0; x < Width(); ++x)
      ASSERT_EQ(out[y * kOutputStride + x], in[y * kInputStride + x])
          << "(" << x << "," << y << ")";
}

TEST_P(ConvolveTest, Copy2D) {
  uint8_t* const in = input();
  uint8_t* const out = output();
  const int16_t filter8[8] = {0, 0, 0, 128, 0, 0, 0, 0};

  REGISTER_STATE_CHECK(
      UUT_->hv8_(in, kInputStride, out, kOutputStride, filter8, 16, filter8, 16,
                 Width(), Height()));

  CheckGuardBlocks();

  for (int y = 0; y < Height(); ++y)
    for (int x = 0; x < Width(); ++x)
      ASSERT_EQ(out[y * kOutputStride + x], in[y * kInputStride + x])
          << "(" << x << "," << y << ")";
}

TEST_P(ConvolveTest, MatchesReferenceSubpixelFilter) {
  uint8_t* const in = input();
  uint8_t* const out = output();
  uint8_t ref[kOutputStride * kMaxDimension];

  const int16_t filters[][8] = {
    { 0,   0,   0, 128,   0,   0,   0,  0},
    { 0,   1,  -5, 126,   8,  -3,   1,  0},
    { -1,   3, -10, 122,  18,  -6,   2,  0},
    { -1,   4, -13, 118,  27,  -9,   3, -1},
    { -1,   4, -16, 112,  37, -11,   4, -1},
    { -1,   5, -18, 105,  48, -14,   4, -1},
    { -1,   5, -19,  97,  58, -16,   5, -1},
    { -1,   6, -19,  88,  68, -18,   5, -1},
    { -1,   6, -19,  78,  78, -19,   6, -1},
    { -1,   5, -18,  68,  88, -19,   6, -1},
    { -1,   5, -16,  58,  97, -19,   5, -1},
    { -1,   4, -14,  48, 105, -18,   5, -1},
    { -1,   4, -11,  37, 112, -16,   4, -1},
    { -1,   3,  -9,  27, 118, -13,   4, -1},
    { 0,   2,  -6,  18, 122, -10,   3, -1},
    { 0,   1,  -3,   8, 126,  -5,   1,  0}
  };

  const int kNumFilters = sizeof(filters) / sizeof(filters[0]);

  for (int filter_x = 0; filter_x < kNumFilters; ++filter_x) {
    for (int filter_y = 0; filter_y < kNumFilters; ++filter_y) {
      filter_block2d_8_c(in, kInputStride,
                         filters[filter_x], filters[filter_y],
                         ref, kOutputStride,
                         Width(), Height());

      if (filter_x && filter_y)
        REGISTER_STATE_CHECK(
            UUT_->hv8_(in, kInputStride, out, kOutputStride,
                       filters[filter_x], 16, filters[filter_y], 16,
                       Width(), Height()));
      else if (filter_y)
        REGISTER_STATE_CHECK(
            UUT_->v8_(in, kInputStride, out, kOutputStride,
                      filters[filter_x], 16, filters[filter_y], 16,
                      Width(), Height()));
      else
        REGISTER_STATE_CHECK(
            UUT_->h8_(in, kInputStride, out, kOutputStride,
                      filters[filter_x], 16, filters[filter_y], 16,
                      Width(), Height()));

      CheckGuardBlocks();

      for (int y = 0; y < Height(); ++y)
        for (int x = 0; x < Width(); ++x)
          ASSERT_EQ(ref[y * kOutputStride + x], out[y * kOutputStride + x])
              << "mismatch at (" << x << "," << y << "), "
              << "filters (" << filter_x << "," << filter_y << ")";
    }
  }
}

TEST_P(ConvolveTest, MatchesReferenceAveragingSubpixelFilter) {
  uint8_t* const in = input();
  uint8_t* const out = output();
  uint8_t ref[kOutputStride * kMaxDimension];

  // Populate ref and out with some random data
  ::libvpx_test::ACMRandom prng;
  for (int y = 0; y < Height(); ++y) {
    for (int x = 0; x < Width(); ++x) {
      const uint8_t r = prng.Rand8();

      out[y * kOutputStride + x] = r;
      ref[y * kOutputStride + x] = r;
    }
  }

  const int16_t filters[][8] = {
    { 0,   0,   0, 128,   0,   0,   0,  0},
    { 0,   1,  -5, 126,   8,  -3,   1,  0},
    { -1,   3, -10, 122,  18,  -6,   2,  0},
    { -1,   4, -13, 118,  27,  -9,   3, -1},
    { -1,   4, -16, 112,  37, -11,   4, -1},
    { -1,   5, -18, 105,  48, -14,   4, -1},
    { -1,   5, -19,  97,  58, -16,   5, -1},
    { -1,   6, -19,  88,  68, -18,   5, -1},
    { -1,   6, -19,  78,  78, -19,   6, -1},
    { -1,   5, -18,  68,  88, -19,   6, -1},
    { -1,   5, -16,  58,  97, -19,   5, -1},
    { -1,   4, -14,  48, 105, -18,   5, -1},
    { -1,   4, -11,  37, 112, -16,   4, -1},
    { -1,   3,  -9,  27, 118, -13,   4, -1},
    { 0,   2,  -6,  18, 122, -10,   3, -1},
    { 0,   1,  -3,   8, 126,  -5,   1,  0}
  };

  const int kNumFilters = sizeof(filters) / sizeof(filters[0]);

  for (int filter_x = 0; filter_x < kNumFilters; ++filter_x) {
    for (int filter_y = 0; filter_y < kNumFilters; ++filter_y) {
      filter_average_block2d_8_c(in, kInputStride,
                                 filters[filter_x], filters[filter_y],
                                 ref, kOutputStride,
                                 Width(), Height());

      if (filter_x && filter_y)
        REGISTER_STATE_CHECK(
            UUT_->hv8_avg_(in, kInputStride, out, kOutputStride,
                           filters[filter_x], 16, filters[filter_y], 16,
                           Width(), Height()));
      else if (filter_y)
        REGISTER_STATE_CHECK(
            UUT_->v8_avg_(in, kInputStride, out, kOutputStride,
                          filters[filter_x], 16, filters[filter_y], 16,
                          Width(), Height()));
      else
        REGISTER_STATE_CHECK(
            UUT_->h8_avg_(in, kInputStride, out, kOutputStride,
                          filters[filter_x], 16, filters[filter_y], 16,
                          Width(), Height()));

      CheckGuardBlocks();

      for (int y = 0; y < Height(); ++y)
        for (int x = 0; x < Width(); ++x)
          ASSERT_EQ(ref[y * kOutputStride + x], out[y * kOutputStride + x])
              << "mismatch at (" << x << "," << y << "), "
              << "filters (" << filter_x << "," << filter_y << ")";
    }
  }
}

TEST_P(ConvolveTest, ChangeFilterWorks) {
  uint8_t* const in = input();
  uint8_t* const out = output();

  const int16_t filters[][8] = {
    { 0,   0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0, 128},
    { 0,   0,   0, 128},
    { 0,   0, 128},
    { 0, 128},
    { 128},
    { 0,   0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0, 128},
    { 0,   0,   0, 128},
    { 0,   0, 128},
    { 0, 128},
    { 128},
    { 0,   0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0,   0, 128},
    { 0,   0,   0,   0, 128},
    { 0,   0,   0, 128},
    { 0,   0, 128},
    { 0, 128},
    { 128},
  };

  REGISTER_STATE_CHECK(UUT_->h8_(in, kInputStride, out, kOutputStride,
                                 filters[0], 17, filters[4], 16,
                                 Width(), Height()));

  for (int x = 0; x < (Width() > 4 ? 8 : 4); ++x) {
    ASSERT_EQ(in[4], out[x]) << "x == " << x;
  }

  REGISTER_STATE_CHECK(UUT_->v8_(in, kInputStride, out, kOutputStride,
                                 filters[4], 16, filters[0], 17,
                                 Width(), Height()));

  for (int y = 0; y < (Height() > 4 ? 8 : 4); ++y) {
    ASSERT_EQ(in[4 * kInputStride], out[y * kOutputStride]) << "y == " << y;
  }

  REGISTER_STATE_CHECK(UUT_->hv8_(in, kInputStride, out, kOutputStride,
                                  filters[0], 17, filters[0], 17,
                                  Width(), Height()));

  for (int y = 0; y < (Height() > 4 ? 8 : 4); ++y) {
    for (int x = 0; x < (Width() > 4 ? 8 : 4); ++x) {
      ASSERT_EQ(in[4 * kInputStride + 4], out[y * kOutputStride + x])
          << "x == " << x << ", y == " << y;
    }
  }
}


using std::tr1::make_tuple;

const ConvolveFunctions convolve8_2d_only_c(
    vp9_convolve8_c, vp9_convolve8_avg_c,
    vp9_convolve8_c, vp9_convolve8_avg_c,
    vp9_convolve8_c, vp9_convolve8_avg_c);

const ConvolveFunctions convolve8_c(
    vp9_convolve8_horiz_c, vp9_convolve8_avg_horiz_c,
    vp9_convolve8_vert_c, vp9_convolve8_avg_vert_c,
    vp9_convolve8_c, vp9_convolve8_avg_c);

INSTANTIATE_TEST_CASE_P(C, ConvolveTest, ::testing::Values(
    make_tuple(4, 4, &convolve8_2d_only_c),
    make_tuple(8, 4, &convolve8_2d_only_c),
    make_tuple(8, 8, &convolve8_2d_only_c),
509
    make_tuple(16, 8, &convolve8_2d_only_c),
John Koleszar's avatar
John Koleszar committed
510 511 512 513
    make_tuple(16, 16, &convolve8_2d_only_c),
    make_tuple(4, 4, &convolve8_c),
    make_tuple(8, 4, &convolve8_c),
    make_tuple(8, 8, &convolve8_c),
514
    make_tuple(16, 8, &convolve8_c),
John Koleszar's avatar
John Koleszar committed
515 516
    make_tuple(16, 16, &convolve8_c)));
}
517 518 519 520 521 522 523 524 525 526 527

#if HAVE_SSSE3
const ConvolveFunctions convolve8_ssse3(
    vp9_convolve8_horiz_ssse3, vp9_convolve8_avg_horiz_c,
    vp9_convolve8_vert_ssse3, vp9_convolve8_avg_vert_c,
    vp9_convolve8_ssse3, vp9_convolve8_avg_c);

INSTANTIATE_TEST_CASE_P(SSSE3, ConvolveTest, ::testing::Values(
    make_tuple(4, 4, &convolve8_ssse3),
    make_tuple(8, 4, &convolve8_ssse3),
    make_tuple(8, 8, &convolve8_ssse3),
528
    make_tuple(16, 8, &convolve8_ssse3),
529 530
    make_tuple(16, 16, &convolve8_ssse3)));
#endif