mirror of
https://chromium.googlesource.com/libyuv/libyuv
synced 2025-12-07 01:06:46 +08:00
cda9d38a4e
clangcl use compare_win for 32 bit, allowing fallback and enabling avx2 code for clang. move defines/protos to compare_row.h fix issue with odd width ARGBCopyAlpha functions by copying destination to temp buffer, then doing alpha copy, then copy back to destination. R=harryjin@google.com TBR=harryjin@google.com BUG=libyuv:484 Review URL: https://webrtc-codereview.appspot.com/59379004.
45 lines
1.1 KiB
C++
45 lines
1.1 KiB
C++
/*
|
|
* Copyright 2012 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 "libyuv/basic_types.h"
|
|
|
|
#include "libyuv/compare_row.h"
|
|
|
|
#ifdef __cplusplus
|
|
namespace libyuv {
|
|
extern "C" {
|
|
#endif
|
|
|
|
uint32 SumSquareError_C(const uint8* src_a, const uint8* src_b, int count) {
|
|
uint32 sse = 0u;
|
|
int i;
|
|
for (i = 0; i < count; ++i) {
|
|
int diff = src_a[i] - src_b[i];
|
|
sse += (uint32)(diff * diff);
|
|
}
|
|
return sse;
|
|
}
|
|
|
|
// hash seed of 5381 recommended.
|
|
// Internal C version of HashDjb2 with int sized count for efficiency.
|
|
uint32 HashDjb2_C(const uint8* src, int count, uint32 seed) {
|
|
uint32 hash = seed;
|
|
int i;
|
|
for (i = 0; i < count; ++i) {
|
|
hash += (hash << 5) + src[i];
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
} // extern "C"
|
|
} // namespace libyuv
|
|
#endif
|