math_test.cc 5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
/*
 *  Copyright 2013 The LibYuv 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 <stdlib.h>
#include <string.h>
13
#include <time.h>
14

Frank Barchard's avatar
Frank Barchard committed
15
#include "../unit_test/unit_test.h"
16
#include "libyuv/basic_types.h"
17
#include "libyuv/cpu_id.h"
18 19
#include "libyuv/scale.h"
#include "libyuv/scale_row.h"
20 21 22

namespace libyuv {

23
TEST_F(LibYUVBaseTest, TestFixedDiv) {
24 25 26 27 28 29 30 31
  int num[1280];
  int div[1280];
  int result_opt[1280];
  int result_c[1280];

  EXPECT_EQ(0x10000, libyuv::FixedDiv(1, 1));
  EXPECT_EQ(0x7fff0000, libyuv::FixedDiv(0x7fff, 1));
  // TODO(fbarchard): Avoid the following that throw exceptions.
32
  // EXPECT_EQ(0x100000000, libyuv::FixedDiv(0x10000, 1));
33
  // EXPECT_EQ(0x80000000, libyuv::FixedDiv(0x8000, 1));
34

35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
  EXPECT_EQ(0x20000, libyuv::FixedDiv(640 * 2, 640));
  EXPECT_EQ(0x30000, libyuv::FixedDiv(640 * 3, 640));
  EXPECT_EQ(0x40000, libyuv::FixedDiv(640 * 4, 640));
  EXPECT_EQ(0x50000, libyuv::FixedDiv(640 * 5, 640));
  EXPECT_EQ(0x60000, libyuv::FixedDiv(640 * 6, 640));
  EXPECT_EQ(0x70000, libyuv::FixedDiv(640 * 7, 640));
  EXPECT_EQ(0x80000, libyuv::FixedDiv(640 * 8, 640));
  EXPECT_EQ(0xa0000, libyuv::FixedDiv(640 * 10, 640));
  EXPECT_EQ(0x20000, libyuv::FixedDiv(960 * 2, 960));
  EXPECT_EQ(0x08000, libyuv::FixedDiv(640 / 2, 640));
  EXPECT_EQ(0x04000, libyuv::FixedDiv(640 / 4, 640));
  EXPECT_EQ(0x20000, libyuv::FixedDiv(1080 * 2, 1080));
  EXPECT_EQ(0x20000, libyuv::FixedDiv(200000, 100000));
  EXPECT_EQ(0x18000, libyuv::FixedDiv(150000, 100000));
  EXPECT_EQ(0x20000, libyuv::FixedDiv(40000, 20000));
  EXPECT_EQ(0x20000, libyuv::FixedDiv(-40000, -20000));
  EXPECT_EQ(-0x20000, libyuv::FixedDiv(40000, -20000));
  EXPECT_EQ(-0x20000, libyuv::FixedDiv(-40000, 20000));
53
  EXPECT_EQ(0x10000, libyuv::FixedDiv(4095, 4095));
54 55
  EXPECT_EQ(0x10000, libyuv::FixedDiv(4096, 4096));
  EXPECT_EQ(0x10000, libyuv::FixedDiv(4097, 4097));
56
  EXPECT_EQ(123 * 65536, libyuv::FixedDiv(123, 1));
57

58 59 60 61 62 63 64 65 66 67
  for (int i = 1; i < 4100; ++i) {
    EXPECT_EQ(0x10000, libyuv::FixedDiv(i, i));
    EXPECT_EQ(0x20000, libyuv::FixedDiv(i * 2, i));
    EXPECT_EQ(0x30000, libyuv::FixedDiv(i * 3, i));
    EXPECT_EQ(0x40000, libyuv::FixedDiv(i * 4, i));
    EXPECT_EQ(0x08000, libyuv::FixedDiv(i, i * 2));
    EXPECT_NEAR(16384 * 65536 / i, libyuv::FixedDiv(16384, i), 1);
  }
  EXPECT_EQ(123 * 65536, libyuv::FixedDiv(123, 1));

68 69
  MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
  MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
70
  for (int j = 0; j < 1280; ++j) {
71 72 73
    if (div[j] == 0) {
      div[j] = 1280;
    }
74
    num[j] &= 0xffff;  // Clamp to avoid divide overflow.
75
  }
76 77
  for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
    for (int j = 0; j < 1280; ++j) {
78 79 80
      result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
    }
  }
81
  for (int j = 0; j < 1280; ++j) {
82
    result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
83
    EXPECT_NEAR(result_c[j], result_opt[j], 1);
84 85 86
  }
}

87
TEST_F(LibYUVBaseTest, TestFixedDiv_Opt) {
88 89 90 91
  int num[1280];
  int div[1280];
  int result_opt[1280];
  int result_c[1280];
92 93 94

  MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
  MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
95
  for (int j = 0; j < 1280; ++j) {
96 97 98 99 100 101
    num[j] &= 4095;  // Make numerator smaller.
    div[j] &= 4095;  // Make divisor smaller.
    if (div[j] == 0) {
      div[j] = 1280;
    }
  }
102 103

  int has_x86 = TestCpuFlag(kCpuHasX86);
104
  for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
105
    if (has_x86) {
106
      for (int j = 0; j < 1280; ++j) {
107 108 109
        result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
      }
    } else {
110
      for (int j = 0; j < 1280; ++j) {
111 112
        result_opt[j] = libyuv::FixedDiv_C(num[j], div[j]);
      }
113 114
    }
  }
115
  for (int j = 0; j < 1280; ++j) {
116
    result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
117
    EXPECT_NEAR(result_c[j], result_opt[j], 1);
118 119 120
  }
}

121
TEST_F(LibYUVBaseTest, TestFixedDiv1_Opt) {
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
  int num[1280];
  int div[1280];
  int result_opt[1280];
  int result_c[1280];

  MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
  MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
  for (int j = 0; j < 1280; ++j) {
    num[j] &= 4095;  // Make numerator smaller.
    div[j] &= 4095;  // Make divisor smaller.
    if (div[j] <= 1) {
      div[j] = 1280;
    }
  }

  int has_x86 = TestCpuFlag(kCpuHasX86);
  for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
    if (has_x86) {
      for (int j = 0; j < 1280; ++j) {
        result_opt[j] = libyuv::FixedDiv1(num[j], div[j]);
      }
    } else {
      for (int j = 0; j < 1280; ++j) {
        result_opt[j] = libyuv::FixedDiv1_C(num[j], div[j]);
      }
    }
  }
  for (int j = 0; j < 1280; ++j) {
    result_c[j] = libyuv::FixedDiv1_C(num[j], div[j]);
    EXPECT_NEAR(result_c[j], result_opt[j], 1);
  }
}

155
}  // namespace libyuv