coffee/libyuv
1
0
Fork 0
mirror of https://chromium.googlesource.com/libyuv/libyuv synced 2025-12-08 01:36:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

compare_common visual c port

Browse Source 
BUG=303
TESTED=cl /c /TC /Iinclude source/compare_common.cc
R=tpsiaki@google.com

Review URL: https://webrtc-codereview.appspot.com/6839004

git-svn-id: http://libyuv.googlecode.com/svn/trunk@958 16f28f9a-4ce2-e073-06de-1de4eb20be90
This commit is contained in:
fbarchard@google.com 2014-01-09 19:11:09 +00:00
parent 167d5d1c2f
commit 9124ac893a
4 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.chromium
View File

@ -1,6 +1,6 @@
Name: libyuv
URL: http://code.google.com/p/libyuv/
Version: 956
Version: 957
License: BSD
License File: LICENSE

6
include/libyuv/row.h
View File

@ -1685,10 +1685,10 @@ void ARGBPolynomialRow_AVX2(const uint8* src_argb,
int width);
void ARGBLumaColorTableRow_C(const uint8* src_argb, uint8* dst_argb, int width,
const uint8* luma, const uint32 lumacoeff);
const uint8* luma, uint32 lumacoeff);
void ARGBLumaColorTableRow_SSSE3(const uint8* src_argb, uint8* dst_argb,
int width, const uint8* luma,
const uint32 lumacoeff);
int width,
const uint8* luma, uint32 lumacoeff);
#ifdef __cplusplus
} // extern "C"

2
include/libyuv/version.h
View File

@ -11,6 +11,6 @@
#ifndef INCLUDE_LIBYUV_VERSION_H_ // NOLINT
#define INCLUDE_LIBYUV_VERSION_H_
#define LIBYUV_VERSION 956
#define LIBYUV_VERSION 957
#endif // INCLUDE_LIBYUV_VERSION_H_ NOLINT

6
source/compare_common.cc
View File

@ -17,7 +17,8 @@ extern "C" {
uint32 SumSquareError_C(const uint8* src_a, const uint8* src_b, int count) {
uint32 sse = 0u;
for (int i = 0; i < count; ++i) {
int i;
for (i = 0; i < count; ++i) {
int diff = src_a[i] - src_b[i];
sse += (uint32)(diff * diff);
}
@ -28,7 +29,8 @@ uint32 SumSquareError_C(const uint8* src_a, const uint8* src_b, int count) {
// Internal C version of HashDjb2 with int sized count for efficiency.
uint32 HashDjb2_C(const uint8* src, int count, uint32 seed) {
uint32 hash = seed;
for (int i = 0; i < count; ++i) {
int i;
for (i = 0; i < count; ++i) {
hash += (hash << 5) + src[i];
}
return hash;