/* * Copyright 2011 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 <time.h>#include "../unit_test/unit_test.h" #include "libyuv/basic_types.h" #include "libyuv/compare.h" #include "libyuv/cpu_id.h" #include "libyuv/video_common.h" #ifdef ENABLE_ROW_TESTS#include "libyuv/compare_row.h" /* For HammingDistance_C */ #endif namespace libyuv {// hash seed of 5381 recommended. static uint32_t ReferenceHashDjb2(const uint8_t* src,if (count > 0 ) {do {33 + *src++;while (--count);return hash;const int kMaxTest = benchmark_width_ * benchmark_height_;const char * fox ="The quick brown fox jumps over the lazy dog" " and feels as if he were in the seventh heaven of typography" " together with Hermann Zapf" ;reinterpret_cast <const uint8_t*>(fox), 131 , 5381 );const uint32_t kExpectedFoxHash = 2611006483 u;for (int i = 0 ; i < kMaxTest; ++i) {0 xff);0 xff);// Compare different buffers. Expect hash is different. 5381 );5381 );// Make last half same. Expect hash is different. 2 , src_b + kMaxTest / 2 , kMaxTest / 2 );5381 );5381 );// Make first half same. Expect hash is different. 2 , src_a, kMaxTest / 2 );2 , src_b, kMaxTest / 2 );2 );5381 );5381 );// Make same. Expect hash is same. 5381 );5381 );// Mask seed different. Expect hash is different. 5381 );1234 );// Make one byte different in middle. Expect hash is different. 2 ];5381 );5381 );// Make first byte different. Expect hash is different. 0 ];5381 );5381 );// Make last byte different. Expect hash is different. 1 ];5381 );5381 );// Make a zeros. Test different lengths. Expect hash is different. 0 , kMaxTest);5381 );2 , 5381 );// Make a zeros and seed of zero. Test different lengths. Expect hash is same. 0 , kMaxTest);0 );2 , 0 );const int kMaxTest = benchmark_width_ * benchmark_height_;for (int i = 0 ; i < kMaxTest; ++i) {5381 );for (int i = 0 ; i < benchmark_iterations_; ++i) {5381 );const int kMaxTest = benchmark_width_ * benchmark_height_;1 );for (int i = 0 ; i < kMaxTest; ++i) {1 ] = i;1 , kMaxTest, 5381 );for (int i = 0 ; i < benchmark_iterations_; ++i) {1 , kMaxTest, 5381 );const int kMaxTest = benchmark_width_ * benchmark_height_ * 4 ;for (int i = 0 ; i < kMaxTest; ++i) {255 ;0 ] = 0 ;4 , benchmark_width_,static_cast <uint32_t>(libyuv::FOURCC_BGRA), fourcc);0 ] = 255 ;3 ] = 0 ;4 , benchmark_width_,static_cast <uint32_t>(libyuv::FOURCC_ARGB), fourcc);3 ] = 255 ;for (int i = 0 ; i < benchmark_iterations_; ++i) {4 , benchmark_width_,0 u, fourcc);const int kMaxTest = benchmark_width_ * benchmark_height_ * 4 + 1 ;for (int i = 1 ; i < kMaxTest; ++i) {255 ;0 + 1 ] = 0 ;1 , benchmark_width_ * 4 , benchmark_width_,static_cast <uint32_t>(libyuv::FOURCC_BGRA), fourcc);0 + 1 ] = 255 ;3 + 1 ] = 0 ;1 , benchmark_width_ * 4 , benchmark_width_,static_cast <uint32_t>(libyuv::FOURCC_ARGB), fourcc);3 + 1 ] = 255 ;for (int i = 0 ; i < benchmark_iterations_; ++i) {1 , benchmark_width_ * 4 , benchmark_width_,0 u, fourcc);#ifdef ENABLE_ROW_TESTSconst int kMaxWidth = 4096 * 3 ;0 , kMaxWidth);0 , kMaxWidth);// Test known value "test0123test4567" , 16 );"tick0123tock4567" , 16 );16 );16 u, h1);// Test C vs OPT on random buffer int count =1 ) / kMaxWidth);for (int i = 0 ; i < count; ++i) {#if defined (HAS_HAMMINGDISTANCE_NEON)#elif defined (HAS_HAMMINGDISTANCE_AVX2)int has_avx2 = TestCpuFlag(kCpuHasAVX2);if (has_avx2) {else {int has_sse42 = TestCpuFlag(kCpuHasSSE42);if (has_sse42) {else {int has_ssse3 = TestCpuFlag(kCpuHasSSSE3);if (has_ssse3) {else {#elif defined (HAS_HAMMINGDISTANCE_SSE42)int has_sse42 = TestCpuFlag(kCpuHasSSE42);if (has_sse42) {else {#else #endif const int kMaxWidth = 4096 * 3 ;0 , kMaxWidth);0 , kMaxWidth);// Test known value "test0123test4567" , 16 );"tick0123tock4567" , 16 );16 );16 u, h1);// Test C vs OPT on random buffer int count =1 ) / kMaxWidth);for (int i = 0 ; i < count; ++i) {const int kMaxWidth = 4096 * 3 ;0 , kMaxWidth);0 , kMaxWidth);"test0123test4567" , 16 );"tick0123tock4567" , 16 );16 );16 u, h1);// Test C vs OPT on random buffer int count =1 ) / kMaxWidth);for (int i = 0 ; i < count; ++i) {// Tests low levels match reference C for specified size. // The opt implementations have size limitations // For NEON the counters are 16 bit so the shorts overflow after 65536 bytes. // So doing one less iteration of the loop is the maximum. #if defined (HAS_HAMMINGDISTANCE_NEON)static const int kMaxOptCount = 65536 - 32 ; // 65504 #else static const int kMaxOptCount = (1 << (32 - 3 )) - 64 ; // 536870848 #endif 0 ;const int kMaxWidth = (benchmark_width_ * benchmark_height_ + 63 ) & ~63 ;255 u, kMaxWidth);0 u, kMaxWidth);8 ULL, h0);for (int i = 0 ; i < benchmark_iterations_; ++i) {#if defined (HAS_HAMMINGDISTANCE_NEON)#elif defined (HAS_HAMMINGDISTANCE_AVX2)int has_avx2 = TestCpuFlag(kCpuHasAVX2);if (has_avx2) {else {int has_sse42 = TestCpuFlag(kCpuHasSSE42);if (has_sse42) {else {int has_ssse3 = TestCpuFlag(kCpuHasSSSE3);if (has_ssse3) {else {#elif defined (HAS_HAMMINGDISTANCE_SSE42)int has_sse42 = TestCpuFlag(kCpuHasSSE42);if (has_sse42) {else {#else #endif // A large count will cause the low level to potentially overflow so the // result can not be expected to be correct. // TODO(fbarchard): Consider expecting the low 16 bits to match. if (kMaxWidth <= kMaxOptCount) {8 U, h1);else {if (kMaxWidth * 8 ULL != static_cast <uint64_t>(h1)) {"warning - HammingDistance_Opt %u does not match %llu " "but length of %u is longer than guaranteed.\n" ,8 ULL, kMaxWidth);else {"warning - HammingDistance_Opt %u matches but length of %u " "is longer than guaranteed.\n" ,#endif // ENABLE_ROW_TESTS 255 u, benchmark_width_ * benchmark_height_);0 , benchmark_width_ * benchmark_height_);0 ;for (int i = 0 ; i < benchmark_iterations_; ++i) {8 ULL, h1);const int kMaxWidth = 4096 * 3 ;0 , kMaxWidth);0 , kMaxWidth);"test0123test4567" , 16 );"tick0123tock4567" , 16 );16 );790 u, h1);for (int i = 0 ; i < kMaxWidth; ++i) {0 , kMaxWidth);0 , kMaxWidth);int count =1 ) / kMaxWidth);for (int i = 0 ; i < count; ++i) {0 u, h1);const int kMaxWidth = 4096 * 3 ;0 , kMaxWidth);0 , kMaxWidth);0 u, err);1 , kMaxWidth);static_cast <int >(err), kMaxWidth);190 , kMaxWidth);193 , kMaxWidth);static_cast <int >(err), kMaxWidth * 3 * 3 );for (int i = 0 ; i < kMaxWidth; ++i) {0 xff);0 xff);for (int i = 0 ; i < benchmark_width_ * benchmark_height_; ++i) {double opt_time = get_time();for (int i = 0 ; i < benchmark_iterations_; ++i) {"BenchmarkPsnr_Opt - %8.2f us opt\n" , opt_time * 1 e6);0 , 0 );1 );for (int i = 0 ; i < benchmark_width_ * benchmark_height_; ++i) {1 ] = i;double opt_time = get_time();for (int i = 0 ; i < benchmark_iterations_; ++i) {1 , benchmark_width_, src_b, benchmark_width_,"BenchmarkPsnr_Opt - %8.2f us opt\n" , opt_time * 1 e6);0 , 0 );const int kSrcWidth = benchmark_width_;const int kSrcHeight = benchmark_height_;const int b = 128 ;const int kSrcPlaneSize = (kSrcWidth + b * 2 ) * (kSrcHeight + b * 2 );const int kSrcStride = 2 * b + kSrcWidth;0 , kSrcPlaneSize);0 , kSrcPlaneSize);double err;255 , kSrcPlaneSize);0 .0 );1 , kSrcPlaneSize);48 .0 );49 .0 );for (int i = 0 ; i < kSrcPlaneSize; ++i) {2 .0 );if (kSrcWidth * kSrcHeight >= 256 ) {6 .0 );0 , kSrcPlaneSize);0 , kSrcPlaneSize);for (int i = b; i < (kSrcHeight + b); ++i) {for (int j = b; j < (kSrcWidth + b); ++j) {0 xff);0 xff);double c_err, opt_err;for (int i = 0 ; i < benchmark_width_ * benchmark_height_; ++i) {double opt_time = get_time();for (int i = 0 ; i < benchmark_iterations_; ++i) {"BenchmarkSsim_Opt - %8.2f us opt\n" , opt_time * 1 e6);0 , 0 ); // Pass if we get this far. const int kSrcWidth = benchmark_width_;const int kSrcHeight = benchmark_height_;const int b = 128 ;const int kSrcPlaneSize = (kSrcWidth + b * 2 ) * (kSrcHeight + b * 2 );const int kSrcStride = 2 * b + kSrcWidth;0 , kSrcPlaneSize);0 , kSrcPlaneSize);if (kSrcWidth <= 8 || kSrcHeight <= 8 ) {"warning - Ssim size too small. Testing function executes.\n" );double err;if (kSrcWidth > 8 && kSrcHeight > 8 ) {1 .0 );255 , kSrcPlaneSize);if (kSrcWidth > 8 && kSrcHeight > 8 ) {0 .0001 );1 , kSrcPlaneSize);if (kSrcWidth > 8 && kSrcHeight > 8 ) {0 .0001 );0 .9 );for (int i = 0 ; i < kSrcPlaneSize; ++i) {if (kSrcWidth > 8 && kSrcHeight > 8 ) {0 .0 );0 .01 );for (int i = b; i < (kSrcHeight + b); ++i) {for (int j = b; j < (kSrcWidth + b); ++j) {0 xff);0 xff);double c_err, opt_err;if (kSrcWidth > 8 && kSrcHeight > 8 ) {// namespace libyuv
Messung V0.5 in Prozent C=89 H=88 G=88
¤ Dauer der Verarbeitung: 0.11 Sekunden
(vorverarbeitet am 2026-06-04)
¤ *© Formatika GbR, Deutschland
