mirror of
https://chromium.googlesource.com/libyuv/libyuv
synced 2025-12-06 16:56:55 +08:00
f2f9dbb644
BUG=none TEST=FixedDiv* R=johannkoenig@google.com Review URL: https://webrtc-codereview.appspot.com/1668004 git-svn-id: http://libyuv.googlecode.com/svn/trunk@727 16f28f9a-4ce2-e073-06de-1de4eb20be90
93 lines
2.8 KiB
C++
93 lines
2.8 KiB
C++
/*
|
|
* 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>
|
|
|
|
#include "libyuv/basic_types.h"
|
|
#include "libyuv/cpu_id.h"
|
|
#include "libyuv/version.h"
|
|
#include "../source/fixed_math.h"
|
|
#include "../unit_test/unit_test.h"
|
|
|
|
namespace libyuv {
|
|
|
|
// Divide num by div and return value as 16.16 fixed point.
|
|
static int FixedDiv_C(int num, int div) {
|
|
return static_cast<int>((static_cast<int64>(num) << 16) / div);
|
|
}
|
|
|
|
TEST_F(libyuvTest, TestFixedDiv) {
|
|
int num[256];
|
|
int div[256];
|
|
int result_opt[256];
|
|
int result_c[256];
|
|
|
|
srandom(time(NULL));
|
|
MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
|
|
MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
|
|
for (int j = 0; j < 256; ++j) {
|
|
if (div[j] == 0) {
|
|
div[j] = 1280;
|
|
}
|
|
}
|
|
for (int i = 0; i < benchmark_pixels_div256_; ++i) {
|
|
for (int j = 0; j < 256; ++j) {
|
|
result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
|
|
}
|
|
}
|
|
for (int j = 0; j < 256; ++j) {
|
|
result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
|
|
EXPECT_NEAR(result_c[j], result_opt[j], 3);
|
|
}
|
|
}
|
|
|
|
TEST_F(libyuvTest, TestFixedDiv_Opt) {
|
|
int num[256];
|
|
int div[256];
|
|
int result_opt[256];
|
|
int result_c[256];
|
|
|
|
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));
|
|
|
|
srandom(time(NULL));
|
|
MemRandomize(reinterpret_cast<uint8*>(&num[0]), sizeof(num));
|
|
MemRandomize(reinterpret_cast<uint8*>(&div[0]), sizeof(div));
|
|
for (int j = 0; j < 256; ++j) {
|
|
num[j] &= 4095; // Make numerator smaller.
|
|
div[j] &= 4095; // Make divisor smaller.
|
|
if (div[j] == 0) {
|
|
div[j] = 1280;
|
|
}
|
|
}
|
|
for (int i = 0; i < benchmark_pixels_div256_; ++i) {
|
|
for (int j = 0; j < 256; ++j) {
|
|
result_opt[j] = libyuv::FixedDiv(num[j], div[j]);
|
|
}
|
|
}
|
|
for (int j = 0; j < 256; ++j) {
|
|
result_c[j] = libyuv::FixedDiv_C(num[j], div[j]);
|
|
EXPECT_NEAR(result_c[j], result_opt[j], 3);
|
|
}
|
|
}
|
|
|
|
} // namespace libyuv
|