608 lines
19 KiB
C++
608 lines
19 KiB
C++
/*M///////////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
|
//
|
|
// By downloading, copying, installing or using the software you agree to this license.
|
|
// If you do not agree to this license, do not download, install,
|
|
// copy or use the software.
|
|
//
|
|
//
|
|
// License Agreement
|
|
// For Open Source Computer Vision Library
|
|
//
|
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
|
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
|
|
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
|
|
// Copyright (C) 2015, Itseez Inc., all rights reserved.
|
|
// Third party copyrights are property of their respective owners.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification,
|
|
// are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistribution's of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
//
|
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
//
|
|
// * The name of the copyright holders may not be used to endorse or promote products
|
|
// derived from this software without specific prior written permission.
|
|
//
|
|
// This software is provided by the copyright holders and contributors "as is" and
|
|
// any express or implied warranties, including, but not limited to, the implied
|
|
// warranties of merchantability and fitness for a particular purpose are disclaimed.
|
|
// In no event shall the Intel Corporation or contributors be liable for any direct,
|
|
// indirect, incidental, special, exemplary, or consequential damages
|
|
// (including, but not limited to, procurement of substitute goods or services;
|
|
// loss of use, data, or profits; or business interruption) however caused
|
|
// and on any theory of liability, whether in contract, strict liability,
|
|
// or tort (including negligence or otherwise) arising in any way out of
|
|
// the use of this software, even if advised of the possibility of such damage.
|
|
//
|
|
//M*/
|
|
|
|
#ifndef __OPENCV_ARITHM_CORE_HPP__
|
|
#define __OPENCV_ARITHM_CORE_HPP__
|
|
|
|
#include "arithm_simd.hpp"
|
|
|
|
namespace cv {
|
|
|
|
template<typename T1, typename T2=T1, typename T3=T1> struct OpAdd
|
|
{
|
|
typedef T1 type1;
|
|
typedef T2 type2;
|
|
typedef T3 rtype;
|
|
T3 operator ()(const T1 a, const T2 b) const { return saturate_cast<T3>(a + b); }
|
|
};
|
|
|
|
template<typename T1, typename T2=T1, typename T3=T1> struct OpSub
|
|
{
|
|
typedef T1 type1;
|
|
typedef T2 type2;
|
|
typedef T3 rtype;
|
|
T3 operator ()(const T1 a, const T2 b) const { return saturate_cast<T3>(a - b); }
|
|
};
|
|
|
|
template<typename T1, typename T2=T1, typename T3=T1> struct OpRSub
|
|
{
|
|
typedef T1 type1;
|
|
typedef T2 type2;
|
|
typedef T3 rtype;
|
|
T3 operator ()(const T1 a, const T2 b) const { return saturate_cast<T3>(b - a); }
|
|
};
|
|
|
|
template<typename T> struct OpMin
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator ()(const T a, const T b) const { return std::min(a, b); }
|
|
};
|
|
|
|
template<typename T> struct OpMax
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator ()(const T a, const T b) const { return std::max(a, b); }
|
|
};
|
|
|
|
template<typename T> struct OpAbsDiff
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator()(T a, T b) const { return a > b ? a - b : b - a; }
|
|
};
|
|
|
|
template<typename T> struct OpAnd
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator()( T a, T b ) const { return a & b; }
|
|
};
|
|
|
|
template<typename T> struct OpOr
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator()( T a, T b ) const { return a | b; }
|
|
};
|
|
|
|
template<typename T> struct OpXor
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator()( T a, T b ) const { return a ^ b; }
|
|
};
|
|
|
|
template<typename T> struct OpNot
|
|
{
|
|
typedef T type1;
|
|
typedef T type2;
|
|
typedef T rtype;
|
|
T operator()( T a, T ) const { return ~a; }
|
|
};
|
|
|
|
//=============================================================================
|
|
|
|
template<typename T, class Op, class VOp>
|
|
void vBinOp(const T* src1, size_t step1, const T* src2, size_t step2, T* dst, size_t step, int width, int height)
|
|
{
|
|
#if CV_SSE2 || CV_NEON
|
|
VOp vop;
|
|
#endif
|
|
Op op;
|
|
|
|
for( ; height--; src1 = (const T *)((const uchar *)src1 + step1),
|
|
src2 = (const T *)((const uchar *)src2 + step2),
|
|
dst = (T *)((uchar *)dst + step) )
|
|
{
|
|
int x = 0;
|
|
|
|
#if CV_NEON || CV_SSE2
|
|
#if CV_AVX2
|
|
if( USE_AVX2 )
|
|
{
|
|
for( ; x <= width - 32/(int)sizeof(T); x += 32/sizeof(T) )
|
|
{
|
|
typename VLoadStore256<T>::reg_type r0 = VLoadStore256<T>::load(src1 + x);
|
|
r0 = vop(r0, VLoadStore256<T>::load(src2 + x));
|
|
VLoadStore256<T>::store(dst + x, r0);
|
|
}
|
|
}
|
|
#else
|
|
#if CV_SSE2
|
|
if( USE_SSE2 )
|
|
{
|
|
#endif // CV_SSE2
|
|
for( ; x <= width - 32/(int)sizeof(T); x += 32/sizeof(T) )
|
|
{
|
|
typename VLoadStore128<T>::reg_type r0 = VLoadStore128<T>::load(src1 + x );
|
|
typename VLoadStore128<T>::reg_type r1 = VLoadStore128<T>::load(src1 + x + 16/sizeof(T));
|
|
r0 = vop(r0, VLoadStore128<T>::load(src2 + x ));
|
|
r1 = vop(r1, VLoadStore128<T>::load(src2 + x + 16/sizeof(T)));
|
|
VLoadStore128<T>::store(dst + x , r0);
|
|
VLoadStore128<T>::store(dst + x + 16/sizeof(T), r1);
|
|
}
|
|
#if CV_SSE2
|
|
}
|
|
#endif // CV_SSE2
|
|
#endif // CV_AVX2
|
|
#endif // CV_NEON || CV_SSE2
|
|
|
|
#if CV_AVX2
|
|
// nothing
|
|
#elif CV_SSE2
|
|
if( USE_SSE2 )
|
|
{
|
|
for( ; x <= width - 8/(int)sizeof(T); x += 8/sizeof(T) )
|
|
{
|
|
typename VLoadStore64<T>::reg_type r = VLoadStore64<T>::load(src1 + x);
|
|
r = vop(r, VLoadStore64<T>::load(src2 + x));
|
|
VLoadStore64<T>::store(dst + x, r);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
#if CV_ENABLE_UNROLLED
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
T v0 = op(src1[x], src2[x]);
|
|
T v1 = op(src1[x+1], src2[x+1]);
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
}
|
|
#endif
|
|
|
|
for( ; x < width; x++ )
|
|
dst[x] = op(src1[x], src2[x]);
|
|
}
|
|
}
|
|
|
|
template<typename T, class Op, class Op32>
|
|
void vBinOp32(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height)
|
|
{
|
|
#if CV_SSE2 || CV_NEON
|
|
Op32 op32;
|
|
#endif
|
|
Op op;
|
|
|
|
for( ; height--; src1 = (const T *)((const uchar *)src1 + step1),
|
|
src2 = (const T *)((const uchar *)src2 + step2),
|
|
dst = (T *)((uchar *)dst + step) )
|
|
{
|
|
int x = 0;
|
|
|
|
#if CV_AVX2
|
|
if( USE_AVX2 )
|
|
{
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&31) == 0 )
|
|
{
|
|
for( ; x <= width - 8; x += 8 )
|
|
{
|
|
typename VLoadStore256Aligned<T>::reg_type r0 = VLoadStore256Aligned<T>::load(src1 + x);
|
|
r0 = op32(r0, VLoadStore256Aligned<T>::load(src2 + x));
|
|
VLoadStore256Aligned<T>::store(dst + x, r0);
|
|
}
|
|
}
|
|
}
|
|
#elif CV_SSE2
|
|
if( USE_SSE2 )
|
|
{
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&15) == 0 )
|
|
{
|
|
for( ; x <= width - 8; x += 8 )
|
|
{
|
|
typename VLoadStore128Aligned<T>::reg_type r0 = VLoadStore128Aligned<T>::load(src1 + x );
|
|
typename VLoadStore128Aligned<T>::reg_type r1 = VLoadStore128Aligned<T>::load(src1 + x + 4);
|
|
r0 = op32(r0, VLoadStore128Aligned<T>::load(src2 + x ));
|
|
r1 = op32(r1, VLoadStore128Aligned<T>::load(src2 + x + 4));
|
|
VLoadStore128Aligned<T>::store(dst + x , r0);
|
|
VLoadStore128Aligned<T>::store(dst + x + 4, r1);
|
|
}
|
|
}
|
|
}
|
|
#endif // CV_AVX2
|
|
|
|
#if CV_NEON || CV_SSE2
|
|
#if CV_AVX2
|
|
if( USE_AVX2 )
|
|
{
|
|
for( ; x <= width - 8; x += 8 )
|
|
{
|
|
typename VLoadStore256<T>::reg_type r0 = VLoadStore256<T>::load(src1 + x);
|
|
r0 = op32(r0, VLoadStore256<T>::load(src2 + x));
|
|
VLoadStore256<T>::store(dst + x, r0);
|
|
}
|
|
}
|
|
#else
|
|
#if CV_SSE2
|
|
if( USE_SSE2 )
|
|
{
|
|
#endif // CV_SSE2
|
|
for( ; x <= width - 8; x += 8 )
|
|
{
|
|
typename VLoadStore128<T>::reg_type r0 = VLoadStore128<T>::load(src1 + x );
|
|
typename VLoadStore128<T>::reg_type r1 = VLoadStore128<T>::load(src1 + x + 4);
|
|
r0 = op32(r0, VLoadStore128<T>::load(src2 + x ));
|
|
r1 = op32(r1, VLoadStore128<T>::load(src2 + x + 4));
|
|
VLoadStore128<T>::store(dst + x , r0);
|
|
VLoadStore128<T>::store(dst + x + 4, r1);
|
|
}
|
|
#if CV_SSE2
|
|
}
|
|
#endif // CV_SSE2
|
|
#endif // CV_AVX2
|
|
#endif // CV_NEON || CV_SSE2
|
|
|
|
#if CV_ENABLE_UNROLLED
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
T v0 = op(src1[x], src2[x]);
|
|
T v1 = op(src1[x+1], src2[x+1]);
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
}
|
|
#endif
|
|
|
|
for( ; x < width; x++ )
|
|
dst[x] = op(src1[x], src2[x]);
|
|
}
|
|
}
|
|
|
|
|
|
template<typename T, class Op, class Op64>
|
|
void vBinOp64(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height)
|
|
{
|
|
#if CV_SSE2
|
|
Op64 op64;
|
|
#endif
|
|
Op op;
|
|
|
|
for( ; height--; src1 = (const T *)((const uchar *)src1 + step1),
|
|
src2 = (const T *)((const uchar *)src2 + step2),
|
|
dst = (T *)((uchar *)dst + step) )
|
|
{
|
|
int x = 0;
|
|
|
|
#if CV_AVX2
|
|
if( USE_AVX2 )
|
|
{
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&31) == 0 )
|
|
{
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
typename VLoadStore256Aligned<T>::reg_type r0 = VLoadStore256Aligned<T>::load(src1 + x);
|
|
r0 = op64(r0, VLoadStore256Aligned<T>::load(src2 + x));
|
|
VLoadStore256Aligned<T>::store(dst + x, r0);
|
|
}
|
|
}
|
|
}
|
|
#elif CV_SSE2
|
|
if( USE_SSE2 )
|
|
{
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&15) == 0 )
|
|
{
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
typename VLoadStore128Aligned<T>::reg_type r0 = VLoadStore128Aligned<T>::load(src1 + x );
|
|
typename VLoadStore128Aligned<T>::reg_type r1 = VLoadStore128Aligned<T>::load(src1 + x + 2);
|
|
r0 = op64(r0, VLoadStore128Aligned<T>::load(src2 + x ));
|
|
r1 = op64(r1, VLoadStore128Aligned<T>::load(src2 + x + 2));
|
|
VLoadStore128Aligned<T>::store(dst + x , r0);
|
|
VLoadStore128Aligned<T>::store(dst + x + 2, r1);
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
T v0 = op(src1[x], src2[x]);
|
|
T v1 = op(src1[x+1], src2[x+1]);
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
}
|
|
|
|
for( ; x < width; x++ )
|
|
dst[x] = op(src1[x], src2[x]);
|
|
}
|
|
}
|
|
|
|
template<typename T> static void
|
|
cmp_(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
uchar* dst, size_t step, int width, int height, int code)
|
|
{
|
|
step1 /= sizeof(src1[0]);
|
|
step2 /= sizeof(src2[0]);
|
|
if( code == CMP_GE || code == CMP_LT )
|
|
{
|
|
std::swap(src1, src2);
|
|
std::swap(step1, step2);
|
|
code = code == CMP_GE ? CMP_LE : CMP_GT;
|
|
}
|
|
|
|
Cmp_SIMD<T> vop(code);
|
|
|
|
if( code == CMP_GT || code == CMP_LE )
|
|
{
|
|
int m = code == CMP_GT ? 0 : 255;
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int x = vop(src1, src2, dst, width);
|
|
#if CV_ENABLE_UNROLLED
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
int t0, t1;
|
|
t0 = -(src1[x] > src2[x]) ^ m;
|
|
t1 = -(src1[x+1] > src2[x+1]) ^ m;
|
|
dst[x] = (uchar)t0; dst[x+1] = (uchar)t1;
|
|
t0 = -(src1[x+2] > src2[x+2]) ^ m;
|
|
t1 = -(src1[x+3] > src2[x+3]) ^ m;
|
|
dst[x+2] = (uchar)t0; dst[x+3] = (uchar)t1;
|
|
}
|
|
#endif
|
|
for( ; x < width; x++ )
|
|
dst[x] = (uchar)(-(src1[x] > src2[x]) ^ m);
|
|
}
|
|
}
|
|
else if( code == CMP_EQ || code == CMP_NE )
|
|
{
|
|
int m = code == CMP_EQ ? 0 : 255;
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int x = 0;
|
|
#if CV_ENABLE_UNROLLED
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
int t0, t1;
|
|
t0 = -(src1[x] == src2[x]) ^ m;
|
|
t1 = -(src1[x+1] == src2[x+1]) ^ m;
|
|
dst[x] = (uchar)t0; dst[x+1] = (uchar)t1;
|
|
t0 = -(src1[x+2] == src2[x+2]) ^ m;
|
|
t1 = -(src1[x+3] == src2[x+3]) ^ m;
|
|
dst[x+2] = (uchar)t0; dst[x+3] = (uchar)t1;
|
|
}
|
|
#endif
|
|
for( ; x < width; x++ )
|
|
dst[x] = (uchar)(-(src1[x] == src2[x]) ^ m);
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename T, typename WT> static void
|
|
mul_( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, WT scale )
|
|
{
|
|
step1 /= sizeof(src1[0]);
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
Mul_SIMD<T, WT> vop;
|
|
|
|
if( scale == (WT)1. )
|
|
{
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src1, src2, dst, width, scale);
|
|
#if CV_ENABLE_UNROLLED
|
|
for(; i <= width - 4; i += 4 )
|
|
{
|
|
T t0;
|
|
T t1;
|
|
t0 = saturate_cast<T>(src1[i ] * src2[i ]);
|
|
t1 = saturate_cast<T>(src1[i+1] * src2[i+1]);
|
|
dst[i ] = t0;
|
|
dst[i+1] = t1;
|
|
|
|
t0 = saturate_cast<T>(src1[i+2] * src2[i+2]);
|
|
t1 = saturate_cast<T>(src1[i+3] * src2[i+3]);
|
|
dst[i+2] = t0;
|
|
dst[i+3] = t1;
|
|
}
|
|
#endif
|
|
for( ; i < width; i++ )
|
|
dst[i] = saturate_cast<T>(src1[i] * src2[i]);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src1, src2, dst, width, scale);
|
|
#if CV_ENABLE_UNROLLED
|
|
for(; i <= width - 4; i += 4 )
|
|
{
|
|
T t0 = saturate_cast<T>(scale*(WT)src1[i]*src2[i]);
|
|
T t1 = saturate_cast<T>(scale*(WT)src1[i+1]*src2[i+1]);
|
|
dst[i] = t0; dst[i+1] = t1;
|
|
|
|
t0 = saturate_cast<T>(scale*(WT)src1[i+2]*src2[i+2]);
|
|
t1 = saturate_cast<T>(scale*(WT)src1[i+3]*src2[i+3]);
|
|
dst[i+2] = t0; dst[i+3] = t1;
|
|
}
|
|
#endif
|
|
for( ; i < width; i++ )
|
|
dst[i] = saturate_cast<T>(scale*(WT)src1[i]*src2[i]);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
template<typename T> static void
|
|
div_i( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, double scale )
|
|
{
|
|
step1 /= sizeof(src1[0]);
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
Div_SIMD<T> vop;
|
|
float scale_f = (float)scale;
|
|
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src1, src2, dst, width, scale);
|
|
for( ; i < width; i++ )
|
|
{
|
|
T num = src1[i], denom = src2[i];
|
|
dst[i] = denom != 0 ? saturate_cast<T>(num*scale_f/denom) : (T)0;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename T> static void
|
|
div_f( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, double scale )
|
|
{
|
|
T scale_f = (T)scale;
|
|
step1 /= sizeof(src1[0]);
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
Div_SIMD<T> vop;
|
|
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src1, src2, dst, width, scale);
|
|
for( ; i < width; i++ )
|
|
{
|
|
T num = src1[i], denom = src2[i];
|
|
dst[i] = denom != 0 ? saturate_cast<T>(num*scale_f/denom) : (T)0;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename T> static void
|
|
recip_i( const T*, size_t, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, double scale )
|
|
{
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
Recip_SIMD<T> vop;
|
|
float scale_f = (float)scale;
|
|
|
|
for( ; height--; src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src2, dst, width, scale);
|
|
for( ; i < width; i++ )
|
|
{
|
|
T denom = src2[i];
|
|
dst[i] = denom != 0 ? saturate_cast<T>(scale_f/denom) : (T)0;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename T> static void
|
|
recip_f( const T*, size_t, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, double scale )
|
|
{
|
|
T scale_f = (T)scale;
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
Recip_SIMD<T> vop;
|
|
|
|
for( ; height--; src2 += step2, dst += step )
|
|
{
|
|
int i = vop(src2, dst, width, scale);
|
|
for( ; i < width; i++ )
|
|
{
|
|
T denom = src2[i];
|
|
dst[i] = denom != 0 ? saturate_cast<T>(scale_f/denom) : (T)0;
|
|
}
|
|
}
|
|
}
|
|
|
|
template<typename T, typename WT> static void
|
|
addWeighted_( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
T* dst, size_t step, int width, int height, void* _scalars )
|
|
{
|
|
const double* scalars = (const double*)_scalars;
|
|
WT alpha = (WT)scalars[0], beta = (WT)scalars[1], gamma = (WT)scalars[2];
|
|
step1 /= sizeof(src1[0]);
|
|
step2 /= sizeof(src2[0]);
|
|
step /= sizeof(dst[0]);
|
|
|
|
AddWeighted_SIMD<T, WT> vop;
|
|
|
|
for( ; height--; src1 += step1, src2 += step2, dst += step )
|
|
{
|
|
int x = vop(src1, src2, dst, width, alpha, beta, gamma);
|
|
#if CV_ENABLE_UNROLLED
|
|
for( ; x <= width - 4; x += 4 )
|
|
{
|
|
T t0 = saturate_cast<T>(src1[x]*alpha + src2[x]*beta + gamma);
|
|
T t1 = saturate_cast<T>(src1[x+1]*alpha + src2[x+1]*beta + gamma);
|
|
dst[x] = t0; dst[x+1] = t1;
|
|
|
|
t0 = saturate_cast<T>(src1[x+2]*alpha + src2[x+2]*beta + gamma);
|
|
t1 = saturate_cast<T>(src1[x+3]*alpha + src2[x+3]*beta + gamma);
|
|
dst[x+2] = t0; dst[x+3] = t1;
|
|
}
|
|
#endif
|
|
for( ; x < width; x++ )
|
|
dst[x] = saturate_cast<T>(src1[x]*alpha + src2[x]*beta + gamma);
|
|
}
|
|
}
|
|
|
|
} // cv::
|
|
|
|
|
|
#endif // __OPENCV_ARITHM_CORE_HPP__
|