vp9_boolcoder_test.cc 2.68 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/*
 *  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 "third_party/googletest/src/include/gtest/gtest.h"

Daniel Kang's avatar
Daniel Kang committed
17
extern "C" {
18 19
#include "vp9/encoder/vp9_boolhuff.h"
#include "vp9/decoder/vp9_dboolhuff.h"
Daniel Kang's avatar
Daniel Kang committed
20
}
21

Daniel Kang's avatar
Daniel Kang committed
22 23
#include "acm_random.h"
#include "vpx/vpx_integer.h"
24

Daniel Kang's avatar
Daniel Kang committed
25
using libvpx_test::ACMRandom;
26

Daniel Kang's avatar
Daniel Kang committed
27 28
namespace {
const int num_tests = 10;
29 30
}  // namespace

James Zern's avatar
James Zern committed
31
TEST(VP9, TestBitIO) {
32 33 34 35 36 37 38 39 40
  ACMRandom rnd(ACMRandom::DeterministicSeed());
  for (int n = 0; n < num_tests; ++n) {
    for (int method = 0; method <= 7; ++method) {   // we generate various proba
      const int bits_to_test = 1000;
      uint8_t probas[bits_to_test];

      for (int i = 0; i < bits_to_test; ++i) {
        const int parity = i & 1;
        probas[i] =
John Koleszar's avatar
John Koleszar committed
41 42 43 44
          (method == 0) ? 0 : (method == 1) ? 255 :
          (method == 2) ? 128 :
          (method == 3) ? rnd.Rand8() :
          (method == 4) ? (parity ? 0 : 255) :
45 46 47
            // alternate between low and high proba:
            (method == 5) ? (parity ? rnd(128) : 255 - rnd(128)) :
            (method == 6) ?
John Koleszar's avatar
John Koleszar committed
48 49
            (parity ? rnd(64) : 255 - rnd(64)) :
            (parity ? rnd(32) : 255 - rnd(32));
50 51 52 53 54 55 56
      }
      for (int bit_method = 0; bit_method <= 3; ++bit_method) {
        const int random_seed = 6432;
        const int buffer_size = 10000;
        ACMRandom bit_rnd(random_seed);
        BOOL_CODER bw;
        uint8_t bw_buffer[buffer_size];
James Zern's avatar
James Zern committed
57
        vp9_start_encode(&bw, bw_buffer);
58 59 60 61 62 63 64 65

        int bit = (bit_method == 0) ? 0 : (bit_method == 1) ? 1 : 0;
        for (int i = 0; i < bits_to_test; ++i) {
          if (bit_method == 2) {
            bit = (i & 1);
          } else if (bit_method == 3) {
            bit = bit_rnd(2);
          }
James Zern's avatar
James Zern committed
66
          encode_bool(&bw, bit, static_cast<int>(probas[i]));
67 68
        }

James Zern's avatar
James Zern committed
69
        vp9_stop_encode(&bw);
70 71

        BOOL_DECODER br;
James Zern's avatar
James Zern committed
72
        vp9_start_decode(&br, bw_buffer, buffer_size);
73 74 75 76 77 78 79
        bit_rnd.Reset(random_seed);
        for (int i = 0; i < bits_to_test; ++i) {
          if (bit_method == 2) {
            bit = (i & 1);
          } else if (bit_method == 3) {
            bit = bit_rnd(2);
          }
80
          GTEST_ASSERT_EQ(vp9_read(&br, probas[i]), bit)
John Koleszar's avatar
John Koleszar committed
81
              << "pos: " << i << " / " << bits_to_test
82 83 84 85 86 87 88
              << " bit_method: " << bit_method
              << " method: " << method;
        }
      }
    }
  }
}