michael@0: /* michael@0: * Copyright 2011 The LibYuv Project Authors. All rights reserved. michael@0: * michael@0: * Use of this source code is governed by a BSD-style license michael@0: * that can be found in the LICENSE file in the root of the source michael@0: * tree. An additional intellectual property rights grant can be found michael@0: * in the file PATENTS. All contributing project authors may michael@0: * be found in the AUTHORS file in the root of the source tree. michael@0: */ michael@0: michael@0: #include michael@0: #include michael@0: #include michael@0: michael@0: #include "../unit_test/unit_test.h" michael@0: #include "libyuv/basic_types.h" michael@0: #include "libyuv/compare.h" michael@0: #include "libyuv/cpu_id.h" michael@0: #include "libyuv/row.h" michael@0: michael@0: namespace libyuv { michael@0: michael@0: // hash seed of 5381 recommended. michael@0: static uint32 ReferenceHashDjb2(const uint8* src, uint64 count, uint32 seed) { michael@0: uint32 hash = seed; michael@0: if (count > 0) { michael@0: do { michael@0: hash = hash * 33 + *src++; michael@0: } while (--count); michael@0: } michael@0: return hash; michael@0: } michael@0: michael@0: TEST_F(libyuvTest, Djb2_Test) { michael@0: const int kMaxTest = benchmark_width_ * benchmark_height_; michael@0: align_buffer_64(src_a, kMaxTest); michael@0: align_buffer_64(src_b, kMaxTest); michael@0: michael@0: const char* fox = "The quick brown fox jumps over the lazy dog" michael@0: " and feels as if he were in the seventh heaven of typography" michael@0: " together with Hermann Zapf"; michael@0: uint32 foxhash = HashDjb2(reinterpret_cast(fox), 131, 5381); michael@0: const uint32 kExpectedFoxHash = 2611006483u; michael@0: EXPECT_EQ(kExpectedFoxHash, foxhash); michael@0: michael@0: for (int i = 0; i < kMaxTest; ++i) { michael@0: src_a[i] = (random() & 0xff); michael@0: src_b[i] = (random() & 0xff); michael@0: } michael@0: // Compare different buffers. Expect hash is different. michael@0: uint32 h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: uint32 h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make last half same. Expect hash is different. michael@0: memcpy(src_a + kMaxTest / 2, src_b + kMaxTest / 2, kMaxTest / 2); michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make first half same. Expect hash is different. michael@0: memcpy(src_a + kMaxTest / 2, src_a, kMaxTest / 2); michael@0: memcpy(src_b + kMaxTest / 2, src_b, kMaxTest / 2); michael@0: memcpy(src_a, src_b, kMaxTest / 2); michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make same. Expect hash is same. michael@0: memcpy(src_a, src_b, kMaxTest); michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_EQ(h1, h2); michael@0: michael@0: // Mask seed different. Expect hash is different. michael@0: memcpy(src_a, src_b, kMaxTest); michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 1234); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make one byte different in middle. Expect hash is different. michael@0: memcpy(src_a, src_b, kMaxTest); michael@0: ++src_b[kMaxTest / 2]; michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make first byte different. Expect hash is different. michael@0: memcpy(src_a, src_b, kMaxTest); michael@0: ++src_b[0]; michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make last byte different. Expect hash is different. michael@0: memcpy(src_a, src_b, kMaxTest); michael@0: ++src_b[kMaxTest - 1]; michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_b, kMaxTest, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make a zeros. Test different lengths. Expect hash is different. michael@0: memset(src_a, 0, kMaxTest); michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: h2 = HashDjb2(src_a, kMaxTest / 2, 5381); michael@0: EXPECT_NE(h1, h2); michael@0: michael@0: // Make a zeros and seed of zero. Test different lengths. Expect hash is same. michael@0: memset(src_a, 0, kMaxTest); michael@0: h1 = HashDjb2(src_a, kMaxTest, 0); michael@0: h2 = HashDjb2(src_a, kMaxTest / 2, 0); michael@0: EXPECT_EQ(h1, h2); michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, BenchmarkDjb2_Opt) { michael@0: const int kMaxTest = benchmark_width_ * benchmark_height_; michael@0: align_buffer_64(src_a, kMaxTest); michael@0: michael@0: for (int i = 0; i < kMaxTest; ++i) { michael@0: src_a[i] = i; michael@0: } michael@0: uint32 h2 = ReferenceHashDjb2(src_a, kMaxTest, 5381); michael@0: uint32 h1; michael@0: for (int i = 0; i < benchmark_iterations_; ++i) { michael@0: h1 = HashDjb2(src_a, kMaxTest, 5381); michael@0: } michael@0: EXPECT_EQ(h1, h2); michael@0: free_aligned_buffer_64(src_a); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, BenchmarkDjb2_Unaligned) { michael@0: const int kMaxTest = benchmark_width_ * benchmark_height_; michael@0: align_buffer_64(src_a, kMaxTest + 1); michael@0: for (int i = 0; i < kMaxTest; ++i) { michael@0: src_a[i + 1] = i; michael@0: } michael@0: uint32 h2 = ReferenceHashDjb2(src_a + 1, kMaxTest, 5381); michael@0: uint32 h1; michael@0: for (int i = 0; i < benchmark_iterations_; ++i) { michael@0: h1 = HashDjb2(src_a + 1, kMaxTest, 5381); michael@0: } michael@0: EXPECT_EQ(h1, h2); michael@0: free_aligned_buffer_64(src_a); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, BenchmarkSumSquareError_Opt) { michael@0: const int kMaxWidth = 4096 * 3; michael@0: align_buffer_64(src_a, kMaxWidth); michael@0: align_buffer_64(src_b, kMaxWidth); michael@0: memset(src_a, 0, kMaxWidth); michael@0: memset(src_b, 0, kMaxWidth); michael@0: michael@0: memcpy(src_a, "test0123test4567", 16); michael@0: memcpy(src_b, "tick0123tock4567", 16); michael@0: uint64 h1 = ComputeSumSquareError(src_a, src_b, 16); michael@0: EXPECT_EQ(790u, h1); michael@0: michael@0: for (int i = 0; i < kMaxWidth; ++i) { michael@0: src_a[i] = i; michael@0: src_b[i] = i; michael@0: } michael@0: memset(src_a, 0, kMaxWidth); michael@0: memset(src_b, 0, kMaxWidth); michael@0: michael@0: int count = benchmark_iterations_ * michael@0: ((benchmark_width_ * benchmark_height_ + kMaxWidth - 1) / kMaxWidth); michael@0: for (int i = 0; i < count; ++i) { michael@0: h1 = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: } michael@0: michael@0: EXPECT_EQ(0, h1); michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, SumSquareError) { michael@0: const int kMaxWidth = 4096 * 3; michael@0: align_buffer_64(src_a, kMaxWidth); michael@0: align_buffer_64(src_b, kMaxWidth); michael@0: memset(src_a, 0, kMaxWidth); michael@0: memset(src_b, 0, kMaxWidth); michael@0: michael@0: uint64 err; michael@0: err = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: michael@0: EXPECT_EQ(0, err); michael@0: michael@0: memset(src_a, 1, kMaxWidth); michael@0: err = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: michael@0: EXPECT_EQ(err, kMaxWidth); michael@0: michael@0: memset(src_a, 190, kMaxWidth); michael@0: memset(src_b, 193, kMaxWidth); michael@0: err = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: michael@0: EXPECT_EQ(kMaxWidth * 3 * 3, err); michael@0: michael@0: srandom(time(NULL)); michael@0: michael@0: for (int i = 0; i < kMaxWidth; ++i) { michael@0: src_a[i] = (random() & 0xff); michael@0: src_b[i] = (random() & 0xff); michael@0: } michael@0: michael@0: MaskCpuFlags(0); michael@0: uint64 c_err = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: michael@0: MaskCpuFlags(-1); michael@0: uint64 opt_err = ComputeSumSquareError(src_a, src_b, kMaxWidth); michael@0: michael@0: EXPECT_EQ(c_err, opt_err); michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, BenchmarkPsnr_Opt) { michael@0: align_buffer_64(src_a, benchmark_width_ * benchmark_height_); michael@0: align_buffer_64(src_b, benchmark_width_ * benchmark_height_); michael@0: for (int i = 0; i < benchmark_width_ * benchmark_height_; ++i) { michael@0: src_a[i] = i; michael@0: src_b[i] = i; michael@0: } michael@0: michael@0: MaskCpuFlags(-1); michael@0: michael@0: double opt_time = get_time(); michael@0: for (int i = 0; i < benchmark_iterations_; ++i) michael@0: CalcFramePsnr(src_a, benchmark_width_, michael@0: src_b, benchmark_width_, michael@0: benchmark_width_, benchmark_height_); michael@0: michael@0: opt_time = (get_time() - opt_time) / benchmark_iterations_; michael@0: printf("BenchmarkPsnr_Opt - %8.2f us opt\n", opt_time * 1e6); michael@0: michael@0: EXPECT_EQ(0, 0); michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, Psnr) { michael@0: const int kSrcWidth = benchmark_width_; michael@0: const int kSrcHeight = benchmark_height_; michael@0: const int b = 128; michael@0: const int kSrcPlaneSize = (kSrcWidth + b * 2) * (kSrcHeight + b * 2); michael@0: const int kSrcStride = 2 * b + kSrcWidth; michael@0: align_buffer_64(src_a, kSrcPlaneSize); michael@0: align_buffer_64(src_b, kSrcPlaneSize); michael@0: memset(src_a, 0, kSrcPlaneSize); michael@0: memset(src_b, 0, kSrcPlaneSize); michael@0: michael@0: double err; michael@0: err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: EXPECT_EQ(err, kMaxPsnr); michael@0: michael@0: memset(src_a, 255, kSrcPlaneSize); michael@0: michael@0: err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: EXPECT_EQ(err, 0.0); michael@0: michael@0: memset(src_a, 1, kSrcPlaneSize); michael@0: michael@0: err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: EXPECT_GT(err, 48.0); michael@0: EXPECT_LT(err, 49.0); michael@0: michael@0: for (int i = 0; i < kSrcPlaneSize; ++i) { michael@0: src_a[i] = i; michael@0: } michael@0: michael@0: err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: EXPECT_GT(err, 2.0); michael@0: if (kSrcWidth * kSrcHeight >= 256) { michael@0: EXPECT_LT(err, 6.0); michael@0: } michael@0: michael@0: srandom(time(NULL)); michael@0: michael@0: memset(src_a, 0, kSrcPlaneSize); michael@0: memset(src_b, 0, kSrcPlaneSize); michael@0: michael@0: for (int i = b; i < (kSrcHeight + b); ++i) { michael@0: for (int j = b; j < (kSrcWidth + b); ++j) { michael@0: src_a[(i * kSrcStride) + j] = (random() & 0xff); michael@0: src_b[(i * kSrcStride) + j] = (random() & 0xff); michael@0: } michael@0: } michael@0: michael@0: MaskCpuFlags(0); michael@0: double c_err, opt_err; michael@0: michael@0: c_err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: MaskCpuFlags(-1); michael@0: michael@0: opt_err = CalcFramePsnr(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: EXPECT_EQ(opt_err, c_err); michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, DISABLED_BenchmarkSsim_Opt) { michael@0: align_buffer_64(src_a, benchmark_width_ * benchmark_height_); michael@0: align_buffer_64(src_b, benchmark_width_ * benchmark_height_); michael@0: for (int i = 0; i < benchmark_width_ * benchmark_height_; ++i) { michael@0: src_a[i] = i; michael@0: src_b[i] = i; michael@0: } michael@0: michael@0: MaskCpuFlags(-1); michael@0: michael@0: double opt_time = get_time(); michael@0: for (int i = 0; i < benchmark_iterations_; ++i) michael@0: CalcFrameSsim(src_a, benchmark_width_, michael@0: src_b, benchmark_width_, michael@0: benchmark_width_, benchmark_height_); michael@0: michael@0: opt_time = (get_time() - opt_time) / benchmark_iterations_; michael@0: printf("BenchmarkSsim_Opt - %8.2f us opt\n", opt_time * 1e6); michael@0: michael@0: EXPECT_EQ(0, 0); // Pass if we get this far. michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: TEST_F(libyuvTest, Ssim) { michael@0: const int kSrcWidth = benchmark_width_; michael@0: const int kSrcHeight = benchmark_height_; michael@0: const int b = 128; michael@0: const int kSrcPlaneSize = (kSrcWidth + b * 2) * (kSrcHeight + b * 2); michael@0: const int kSrcStride = 2 * b + kSrcWidth; michael@0: align_buffer_64(src_a, kSrcPlaneSize); michael@0: align_buffer_64(src_b, kSrcPlaneSize); michael@0: memset(src_a, 0, kSrcPlaneSize); michael@0: memset(src_b, 0, kSrcPlaneSize); michael@0: michael@0: if (kSrcWidth <=8 || kSrcHeight <= 8) { michael@0: printf("warning - Ssim size too small. Testing function executes.\n"); michael@0: } michael@0: michael@0: double err; michael@0: err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: if (kSrcWidth > 8 && kSrcHeight > 8) { michael@0: EXPECT_EQ(err, 1.0); michael@0: } michael@0: michael@0: memset(src_a, 255, kSrcPlaneSize); michael@0: michael@0: err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: if (kSrcWidth > 8 && kSrcHeight > 8) { michael@0: EXPECT_LT(err, 0.0001); michael@0: } michael@0: michael@0: memset(src_a, 1, kSrcPlaneSize); michael@0: michael@0: err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: if (kSrcWidth > 8 && kSrcHeight > 8) { michael@0: EXPECT_GT(err, 0.0001); michael@0: EXPECT_LT(err, 0.9); michael@0: } michael@0: michael@0: for (int i = 0; i < kSrcPlaneSize; ++i) { michael@0: src_a[i] = i; michael@0: } michael@0: michael@0: err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: if (kSrcWidth > 8 && kSrcHeight > 8) { michael@0: EXPECT_GT(err, 0.0); michael@0: EXPECT_LT(err, 0.01); michael@0: } michael@0: michael@0: srandom(time(NULL)); michael@0: for (int i = b; i < (kSrcHeight + b); ++i) { michael@0: for (int j = b; j < (kSrcWidth + b); ++j) { michael@0: src_a[(i * kSrcStride) + j] = (random() & 0xff); michael@0: src_b[(i * kSrcStride) + j] = (random() & 0xff); michael@0: } michael@0: } michael@0: michael@0: MaskCpuFlags(0); michael@0: double c_err, opt_err; michael@0: michael@0: c_err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: MaskCpuFlags(-1); michael@0: michael@0: opt_err = CalcFrameSsim(src_a + kSrcStride * b + b, kSrcStride, michael@0: src_b + kSrcStride * b + b, kSrcStride, michael@0: kSrcWidth, kSrcHeight); michael@0: michael@0: if (kSrcWidth > 8 && kSrcHeight > 8) { michael@0: EXPECT_EQ(opt_err, c_err); michael@0: } michael@0: michael@0: free_aligned_buffer_64(src_a); michael@0: free_aligned_buffer_64(src_b); michael@0: } michael@0: michael@0: } // namespace libyuv