Lines Matching refs:cn
196 int cn = CV_MAT_CN(state->get_src_type());
199 width = (width - 1)*cn; ksize *= cn;
201 for( k = 0; k < cn; k++, src++, dst++ )
204 for( i = 0; i < ksize; i += cn )
207 for( i = 0; i < width; i += cn )
210 dst[i+cn] = s;
222 int cn = CV_MAT_CN(state->get_src_type());
225 width = (width - 1)*cn; ksize *= cn;
227 for( k = 0; k < cn; k++, src++, dst++ )
230 for( i = 0; i < ksize; i += cn )
233 for( i = 0; i < width; i += cn )
236 dst[i+cn] = s;
250 int cn = CV_MAT_CN(state->get_src_type());
257 width *= cn;
311 int cn = CV_MAT_CN(state->get_src_type());
317 width *= cn;
387 int cn = CV_MAT_CN(state->get_src_type());
393 width *= cn;
445 int cn = CV_MAT_CN(state->get_src_type());
453 width *= cn;
650 CvSize size, int kernel_size, int cn, int pad_left, int pad_right )
670 h_coarse = (ushort*) cvAlloc( 1 * 16 * n * cn * sizeof(ushort) );
671 h_fine = (ushort*) cvAlloc( 16 * 16 * n * cn * sizeof(ushort) );
672 memset( h_coarse, 0, 1 * 16 * n * cn * sizeof(ushort) );
673 memset( h_fine, 0, 16 * 16 * n * cn * sizeof(ushort) );
677 for ( c = 0; c < cn; ++c ) {
678 COP( c, j, src[cn*j+c], += r+1 );
683 for ( c = 0; c < cn; ++c ) {
684 COP( c, j, src[src_step*i+cn*j+c], ++ );
693 q = p + cn * n;
695 for ( c = 0; c < cn; ++c, ++p ) {
701 q = p + cn * n;
703 for ( c = 0; c < cn; ++c, ++p ) {
709 memset( H, 0, cn*sizeof(H[0]) );
710 memset( luc, 0, cn*sizeof(luc[0]) );
712 for ( c = 0; c < cn; ++c ) {
717 for ( c = 0; c < cn; ++c ) {
721 for ( c = 0; c < cn; ++c ) {
728 for ( c = 0; c < cn; ++c ) {
769 dst[dst_step*i+cn*j+c] = (uchar)(16*k + b);
798 CvSize size, int m, int cn )
807 uchar* src_right = src + size.width*cn;
809 #define UPDATE_ACC01( pix, cn, op ) \
812 zone1[cn][p] op; \
813 zone0[cn][p >> 4] op; \
821 size.width *= cn;
833 for( x = 0; x < 2*cn; x++ )
835 int x0 = x < cn ? x : size.width - 3*cn + x;
836 int x2 = x < cn ? x + cn : size.width - 2*cn + x;
837 int x1 = x < cn ? x0 : x2, t;
856 for( x = cn; x < size.width - cn; x++ )
858 int p0 = src0[x-cn], p1 = src0[x], p2 = src0[x+cn];
859 int p3 = src1[x-cn], p4 = src1[x], p5 = src1[x+cn];
860 int p6 = src2[x-cn], p7 = src2[x], p8 = src2[x+cn];
881 for( x = 0; x < size.width; x++, dst += cn )
902 x0 = x < m/2 ? 0 : (nx-1)*cn;
905 memset( zone0, 0, sizeof(zone0[0])*cn );
906 memset( zone1, 0, sizeof(zone1[0])*cn );
910 for( c = 0; c < cn; c++ )
916 for( k = 0; k < nx*cn; k += cn )
923 for( k = 0; k < nx*cn; k += cn )
936 for( c = 0; c < cn; c++ )
958 if( cn == 1 )
970 else if( cn == 3 )
985 assert( cn == 4 );
1002 for( c = 0; c < cn; c++ )
1018 src += cn;
1019 if( src + nx*cn > src_right ) nx--;
1046 int cn = CV_MAT_CN(src->type);
1071 CV_CALL( color_weight = (float*)cvAlloc(cn*256*sizeof(color_weight[0])));
1076 for( i = 0; i < 256*cn; i++ )
1087 space_ofs[maxk++] = i*temp->step + j*cn;
1092 const uchar* sptr = temp->data.ptr + (i+radius)*temp->step + radius*cn;
1095 if( cn == 1 )
1114 assert( cn == 3 );
1160 int cn = CV_MAT_CN(src->type);
1204 len = (float)(maxValSrc - minValSrc) * cn;
1205 kExpNumBins = kExpNumBinsPerChannel * cn;
1230 space_ofs[maxk++] = i*temp_step + j*cn;
1235 const float* sptr = temp->data.fl + (i+radius)*temp_step + radius*cn;
1238 if( cn == 1 )
1259 assert( cn == 3 );
1328 int src_type, dst_type, depth, cn;
1341 cn = CV_MAT_CN(src_type);
1440 if( depth != CV_8U || (cn != 1 && cn != 3 && cn != 4) )
1449 dst->data.ptr, dst->step, size, param1, cn ));
1454 const int CACHE_SIZE = (int) ( 0.95 * 256 * 1024 / cn ); // assume a 256 kB cache size
1468 IPPI_CALL( icvMedianBlur_8u_CnR_O1( src->data.ptr + cn*i, src->step,
1469 dst->data.ptr + cn*i, dst->step, cvSize(stripe, size.height),
1470 param1, cn, i == 0, stripe == size.width - i ));
