summaryrefslogtreecommitdiff
path: root/third_party/aom/test/log2_test.cc
diff options
context:
space:
mode:
authorMatt A. Tobin <email@mattatobin.com>2020-04-07 23:30:51 -0400
committerMatt A. Tobin <email@mattatobin.com>2020-04-07 23:30:51 -0400
commit5545a8983ff0ef1fb52e64aef8e66fa9b13c1cbb (patch)
tree45d55e3e5e73c4255c4d71258d9be5b2d004d28f /third_party/aom/test/log2_test.cc
parent50f1986697a7412e4160976fa5e11217b4ef1f44 (diff)
downloaduxp-5545a8983ff0ef1fb52e64aef8e66fa9b13c1cbb.tar.gz
Move aom source to a sub-directory under media/libaom
There is no damned reason to treat this differently than any other media lib given its license and there never was.
Diffstat (limited to 'third_party/aom/test/log2_test.cc')
-rw-r--r--third_party/aom/test/log2_test.cc50
1 files changed, 0 insertions, 50 deletions
diff --git a/third_party/aom/test/log2_test.cc b/third_party/aom/test/log2_test.cc
deleted file mode 100644
index d7840c68b2..0000000000
--- a/third_party/aom/test/log2_test.cc
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
- * Copyright (c) 2018, Alliance for Open Media. All rights reserved
- *
- * This source code is subject to the terms of the BSD 2 Clause License and
- * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
- * was not distributed with this source code in the LICENSE file, you can
- * obtain it at www.aomedia.org/license/software. If the Alliance for Open
- * Media Patent License 1.0 was not distributed with this source code in the
- * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
- */
-
-#include <math.h>
-
-#include "aom_ports/bitops.h"
-#include "av1/common/entropymode.h"
-#include "third_party/googletest/src/googletest/include/gtest/gtest.h"
-
-TEST(Log2Test, GetMsb) {
- // Test small numbers exhaustively.
- for (unsigned int n = 1; n < 10000; n++) {
- EXPECT_EQ(get_msb(n), static_cast<int>(floor(log2(n))));
- }
-
- // Test every power of 2 and the two adjacent numbers.
- for (int exponent = 2; exponent < 32; exponent++) {
- const unsigned int power_of_2 = 1U << exponent;
- EXPECT_EQ(get_msb(power_of_2 - 1), exponent - 1);
- EXPECT_EQ(get_msb(power_of_2), exponent);
- EXPECT_EQ(get_msb(power_of_2 + 1), exponent);
- }
-}
-
-TEST(Log2Test, Av1CeilLog2) {
- // Test small numbers exhaustively.
- EXPECT_EQ(av1_ceil_log2(0), 0);
- for (int n = 1; n < 10000; n++) {
- EXPECT_EQ(av1_ceil_log2(n), static_cast<int>(ceil(log2(n))));
- }
-
- // Test every power of 2 and the two adjacent numbers.
- for (int exponent = 2; exponent < 31; exponent++) {
- const int power_of_2 = 1 << exponent;
- EXPECT_EQ(av1_ceil_log2(power_of_2 - 1), exponent);
- EXPECT_EQ(av1_ceil_log2(power_of_2), exponent);
- // The current implementation of av1_ceil_log2 only works up to 2^30.
- if (exponent < 30) {
- EXPECT_EQ(av1_ceil_log2(power_of_2 + 1), exponent + 1);
- }
- }
-}