eliminate build warnings

This commit is contained in:
Alexander Alekhin 2018-11-26 18:07:20 +03:00
parent 223893ea5a
commit 83c8214b38

View File

@ -74,9 +74,9 @@
namespace cv namespace cv
{ {
namespace static void
medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
{ {
typedef ushort HT; typedef ushort HT;
/** /**
@ -95,9 +95,6 @@ typedef struct
HT fine[16][16]; HT fine[16][16];
} Histogram; } Histogram;
static void
medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
{
/** /**
* HOP is short for Histogram OPeration. This macro makes an operation \a op on * HOP is short for Histogram OPeration. This macro makes an operation \a op on
* histogram \a h for pixel value \a x. It takes care of handling both levels. * histogram \a h for pixel value \a x. It takes care of handling both levels.
@ -136,7 +133,7 @@ medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
for( c = 0; c < cn; c++ ) for( c = 0; c < cn; c++ )
{ {
for( j = 0; j < n; j++ ) for( j = 0; j < n; j++ )
COP( c, j, src[cn*j+c], += (cv::HT)(r+2) ); COP( c, j, src[cn*j+c], += (HT)(r+2) );
for( i = 1; i < r; i++ ) for( i = 1; i < r; i++ )
{ {
@ -172,7 +169,7 @@ medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
v_store(H[c].fine[k] + 8, v_mul_wrap(v_load(h_fine + 16 * n*(16 * c + k) + 8), v_setall_u16((ushort)(2 * r + 1))) + v_load(H[c].fine[k] + 8)); v_store(H[c].fine[k] + 8, v_mul_wrap(v_load(h_fine + 16 * n*(16 * c + k) + 8), v_setall_u16((ushort)(2 * r + 1))) + v_load(H[c].fine[k] + 8));
#else #else
for (int ind = 0; ind < 16; ++ind) for (int ind = 0; ind < 16; ++ind)
H[c].fine[k][ind] += (2 * r + 1) * h_fine[16 * n*(16 * c + k) + ind]; H[c].fine[k][ind] = (HT)(H[c].fine[k][ind] + (2 * r + 1) * h_fine[16 * n*(16 * c + k) + ind]);
#endif #endif
} }
@ -245,7 +242,7 @@ medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
memset(&H[c].fine[k], 0, 16 * sizeof(HT)); memset(&H[c].fine[k], 0, 16 * sizeof(HT));
#endif #endif
px = h_fine + 16 * (n*(16 * c + k) + j - r); px = h_fine + 16 * (n*(16 * c + k) + j - r);
for (luc[c][k] = cv::HT(j - r); luc[c][k] < MIN(j + r + 1, n); ++luc[c][k], px += 16) for (luc[c][k] = HT(j - r); luc[c][k] < MIN(j + r + 1, n); ++luc[c][k], px += 16)
{ {
#if CV_SIMD256 #if CV_SIMD256
v_fine += v256_load(px); v_fine += v256_load(px);
@ -268,7 +265,7 @@ medianBlur_8u_O1( const Mat& _src, Mat& _dst, int ksize )
v_fineh += v_mul_wrap(v_load(px + 8), v_setall_u16((ushort)(j + r + 1 - n))); v_fineh += v_mul_wrap(v_load(px + 8), v_setall_u16((ushort)(j + r + 1 - n)));
#else #else
for (int ind = 0; ind < 16; ++ind) for (int ind = 0; ind < 16; ++ind)
H[c].fine[k][ind] += (j + r + 1 - n) * px[ind]; H[c].fine[k][ind] = (HT)(H[c].fine[k][ind] + (j + r + 1 - n) * px[ind]);
#endif #endif
luc[c][k] = (HT)(j+r+1); luc[c][k] = (HT)(j+r+1);
} }
@ -479,6 +476,8 @@ medianBlur_8u_Om( const Mat& _src, Mat& _dst, int m )
} }
namespace {
struct MinMax8u struct MinMax8u
{ {
typedef uchar value_type; typedef uchar value_type;