media/libyuv/unit_test/math_test.cc

Thu, 22 Jan 2015 13:21:57 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Thu, 22 Jan 2015 13:21:57 +0100
branch
TOR_BUG_9701
changeset 15
b8a032363ba2
permissions
-rw-r--r--

Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6

michael@0 1 /*
michael@0 2 * Copyright 2013 The LibYuv Project Authors. All rights reserved.
michael@0 3 *
michael@0 4 * Use of this source code is governed by a BSD-style license
michael@0 5 * that can be found in the LICENSE file in the root of the source
michael@0 6 * tree. An additional intellectual property rights grant can be found
michael@0 7 * in the file PATENTS. All contributing project authors may
michael@0 8 * be found in the AUTHORS file in the root of the source tree.
michael@0 9 */
michael@0 10
michael@0 11 #include <stdlib.h>
michael@0 12 #include <string.h>
michael@0 13
michael@0 14 #include "libyuv/basic_types.h"
michael@0 15 #include "libyuv/cpu_id.h"
michael@0 16 #include "libyuv/row.h"
michael@0 17 #include "libyuv/scale.h"
michael@0 18 #include "libyuv/scale_row.h"
michael@0 19 #include "../unit_test/unit_test.h"
michael@0 20
michael@0 21 namespace libyuv {
michael@0 22
michael@0 23 TEST_F(libyuvTest, TestFixedDiv) {
michael@0 24 int num[1280];
michael@0 25 int div[1280];
michael@0 26 int result_opt[1280];
michael@0 27 int result_c[1280];
michael@0 28
michael@0 29 EXPECT_EQ(0x10000, libyuv::FixedDiv(1, 1));
michael@0 30 EXPECT_EQ(0x7fff0000, libyuv::FixedDiv(0x7fff, 1));
michael@0 31 // TODO(fbarchard): Avoid the following that throw exceptions.
michael@0 32 // EXPECT_EQ(0x100000000, libyuv::FixedDiv(0x10000, 1));
michael@0 33 // EXPECT_EQ(0x80000000, libyuv::FixedDiv(0x8000, 1));
michael@0 34
michael@0 35 EXPECT_EQ(0x20000, libyuv::FixedDiv(640 * 2, 640));
michael@0 36 EXPECT_EQ(0x30000, libyuv::FixedDiv(640 * 3, 640));
michael@0 37 EXPECT_EQ(0x40000, libyuv::FixedDiv(640 * 4, 640));
michael@0 38 EXPECT_EQ(0x50000, libyuv::FixedDiv(640 * 5, 640));
michael@0 39 EXPECT_EQ(0x60000, libyuv::FixedDiv(640 * 6, 640));
michael@0 40 EXPECT_EQ(0x70000, libyuv::FixedDiv(640 * 7, 640));
michael@0 41 EXPECT_EQ(0x80000, libyuv::FixedDiv(640 * 8, 640));
michael@0 42 EXPECT_EQ(0xa0000, libyuv::FixedDiv(640 * 10, 640));
michael@0 43 EXPECT_EQ(0x20000, libyuv::FixedDiv(960 * 2, 960));
michael@0 44 EXPECT_EQ(0x08000, libyuv::FixedDiv(640 / 2, 640));
michael@0 45 EXPECT_EQ(0x04000, libyuv::FixedDiv(640 / 4, 640));
michael@0 46 EXPECT_EQ(0x20000, libyuv::FixedDiv(1080 * 2, 1080));
michael@0 47 EXPECT_EQ(0x20000, libyuv::FixedDiv(200000, 100000));
michael@0 48 EXPECT_EQ(0x18000, libyuv::FixedDiv(150000, 100000));
michael@0 49 EXPECT_EQ(0x20000, libyuv::FixedDiv(40000, 20000));
michael@0 50 EXPECT_EQ(0x20000, libyuv::FixedDiv(-40000, -20000));
michael@0 51 EXPECT_EQ(-0x20000, libyuv::FixedDiv(40000, -20000));
michael@0 52 EXPECT_EQ(-0x20000, libyuv::FixedDiv(-40000, 20000));
michael@0 53 EXPECT_EQ(0x10000, libyuv::FixedDiv(4095, 4095));
michael@0 54 EXPECT_EQ(0x10000, libyuv::FixedDiv(4096, 4096));
michael@0 55 EXPECT_EQ(0x10000, libyuv::FixedDiv(4097, 4097));
michael@0 56 EXPECT_EQ(123 * 65536, libyuv::FixedDiv(123, 1));
michael@0 57
michael@0 58 for (int i = 1; i < 4100; ++i) {
michael@0 59 EXPECT_EQ(0x10000, libyuv::FixedDiv(i, i));
michael@0 60 EXPECT_EQ(0x20000, libyuv::FixedDiv(i * 2, i));
michael@0 61 EXPECT_EQ(0x30000, libyuv::FixedDiv(i * 3, i));
michael@0 62 EXPECT_EQ(0x40000, libyuv::FixedDiv(i * 4, i));
michael@0 63 EXPECT_EQ(0x08000, libyuv::FixedDiv(i, i * 2));
michael@0 64 EXPECT_NEAR(16384 * 65536 / i, libyuv::FixedDiv(16384, i), 1);
michael@0 65 }
michael@0 66 EXPECT_EQ(123 * 65536, libyuv::FixedDiv(123, 1));
michael@0 67
michael@0 68 srandom(time(NULL));
michael@0 69 MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
michael@0 70 MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
michael@0 71 for (int j = 0; j < 1280; ++j) {
michael@0 72 if (div[j] == 0) {
michael@0 73 div[j] = 1280;
michael@0 74 }
michael@0 75 num[j] &= 0xffff; // Clamp to avoid divide overflow.
michael@0 76 }
michael@0 77 for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
michael@0 78 for (int j = 0; j < 1280; ++j) {
michael@0 79 result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
michael@0 80 }
michael@0 81 }
michael@0 82 for (int j = 0; j < 1280; ++j) {
michael@0 83 result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
michael@0 84 EXPECT_NEAR(result_c[j], result_opt[j], 1);
michael@0 85 }
michael@0 86 }
michael@0 87
michael@0 88 TEST_F(libyuvTest, TestFixedDiv_Opt) {
michael@0 89 int num[1280];
michael@0 90 int div[1280];
michael@0 91 int result_opt[1280];
michael@0 92 int result_c[1280];
michael@0 93
michael@0 94 srandom(time(NULL));
michael@0 95 MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
michael@0 96 MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
michael@0 97 for (int j = 0; j < 1280; ++j) {
michael@0 98 num[j] &= 4095; // Make numerator smaller.
michael@0 99 div[j] &= 4095; // Make divisor smaller.
michael@0 100 if (div[j] == 0) {
michael@0 101 div[j] = 1280;
michael@0 102 }
michael@0 103 }
michael@0 104
michael@0 105 int has_x86 = TestCpuFlag(kCpuHasX86);
michael@0 106 for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
michael@0 107 if (has_x86) {
michael@0 108 for (int j = 0; j < 1280; ++j) {
michael@0 109 result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
michael@0 110 }
michael@0 111 } else {
michael@0 112 for (int j = 0; j < 1280; ++j) {
michael@0 113 result_opt[j] = libyuv::FixedDiv_C(num[j], div[j]);
michael@0 114 }
michael@0 115 }
michael@0 116 }
michael@0 117 for (int j = 0; j < 1280; ++j) {
michael@0 118 result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
michael@0 119 EXPECT_NEAR(result_c[j], result_opt[j], 1);
michael@0 120 }
michael@0 121 }
michael@0 122
michael@0 123 TEST_F(libyuvTest, TestFixedDiv1_Opt) {
michael@0 124 int num[1280];
michael@0 125 int div[1280];
michael@0 126 int result_opt[1280];
michael@0 127 int result_c[1280];
michael@0 128
michael@0 129 srandom(time(NULL));
michael@0 130 MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
michael@0 131 MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
michael@0 132 for (int j = 0; j < 1280; ++j) {
michael@0 133 num[j] &= 4095; // Make numerator smaller.
michael@0 134 div[j] &= 4095; // Make divisor smaller.
michael@0 135 if (div[j] <= 1) {
michael@0 136 div[j] = 1280;
michael@0 137 }
michael@0 138 }
michael@0 139
michael@0 140 int has_x86 = TestCpuFlag(kCpuHasX86);
michael@0 141 for (int i = 0; i < benchmark_pixels_div1280_; ++i) {
michael@0 142 if (has_x86) {
michael@0 143 for (int j = 0; j < 1280; ++j) {
michael@0 144 result_opt[j] = libyuv::FixedDiv1(num[j], div[j]);
michael@0 145 }
michael@0 146 } else {
michael@0 147 for (int j = 0; j < 1280; ++j) {
michael@0 148 result_opt[j] = libyuv::FixedDiv1_C(num[j], div[j]);
michael@0 149 }
michael@0 150 }
michael@0 151 }
michael@0 152 for (int j = 0; j < 1280; ++j) {
michael@0 153 result_c[j] = libyuv::FixedDiv1_C(num[j], div[j]);
michael@0 154 EXPECT_NEAR(result_c[j], result_opt[j], 1);
michael@0 155 }
michael@0 156 }
michael@0 157
michael@0 158 } // namespace libyuv

mercurial