/external/llvm/include/llvm/CodeGen/PBQP/ |
D | Math.h | 116 Matrix(unsigned rows, unsigned cols) : in Matrix() argument 117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix() 122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : in Matrix() argument 123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix() 124 std::fill(data, data + (rows * cols), initVal); in Matrix() 129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols]) { in Matrix() 130 std::copy(m.data, m.data + (rows * cols), data); in Matrix() 139 rows = m.rows; cols = m.cols; 140 data = new PBQPNum[rows * cols]; 141 std::copy(m.data, m.data + (rows * cols), data); [all …]
|
/external/valgrind/main/drd/tests/ |
D | omp_matinv.c | 44 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument 47 assert(cols > 0); in new_matrix() 48 return malloc(rows * cols * sizeof(elem_t)); in new_matrix() 58 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument 65 a[i * cols + j] = 1.0 / (1 + abs(i-j)); in init_matrix() 72 const elem_t* const a, const int rows, const int cols) in print_matrix() argument 78 for (j = 0; j < cols; j++) in print_matrix() 80 printf("%g ", a[i * cols + j]); in print_matrix() 158 static void gj(elem_t* const a, const int rows, const int cols) in gj() argument 169 if (a[k * cols + i] > a[j * cols + i]) in gj() [all …]
|
D | matinv.c | 36 int cols; member 56 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument 59 assert(cols > 0); in new_matrix() 60 return malloc(rows * cols * sizeof(elem_t)); in new_matrix() 70 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument 77 a[i * cols + j] = 1.0 / (1 + abs(i-j)); in init_matrix() 84 const elem_t* const a, const int rows, const int cols) in print_matrix() argument 90 for (j = 0; j < cols; j++) in print_matrix() 92 printf("%g ", a[i * cols + j]); in print_matrix() 175 const int cols = p->cols; in gj_threadfunc() local [all …]
|
/external/wpa_supplicant_6/wpa_supplicant/wpa_gui/ |
D | scanresults.ui.h | 60 QStringList cols = QStringList::split(QChar('\t'), *it, true); in updateResults() local 62 bssid = cols.count() > 0 ? cols[0] : ""; in updateResults() 63 freq = cols.count() > 1 ? cols[1] : ""; in updateResults() 64 signal = cols.count() > 2 ? cols[2] : ""; in updateResults() 65 flags = cols.count() > 3 ? cols[3] : ""; in updateResults() 66 ssid = cols.count() > 4 ? cols[4] : ""; in updateResults()
|
/external/skia/src/utils/ |
D | SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) { in init() argument 22 if (rows < 2 || cols < 2) { in init() 34 fTexCount = rows * cols; in init() 36 cols -= 1; in init() 37 fIndexCount = rows * cols * 6; in init() 53 for (int y = 0; y < cols; y++) { in init() 73 const SkScalar dy = SkIntToScalar(texH) / cols; in init() 74 for (int y = 0; y <= cols; y++) { in init() 89 int rows, int cols, const SkPoint verts[], in Draw() argument 93 if (idx.init(bitmap.width(), bitmap.height(), rows, cols)) { in Draw() [all …]
|
/external/opencv/cv/src/ |
D | cvtemplmatch.cpp | 103 if( img->cols < templ->cols || img->rows < templ->rows ) in icvCrossCorr() 108 corr->cols > img->cols + templ->cols - 1 ) in icvCrossCorr() 112 blocksize.width = cvRound(templ->cols*block_scale); in icvCrossCorr() 113 blocksize.width = MAX( blocksize.width, min_block_size - templ->cols + 1 ); in icvCrossCorr() 114 blocksize.width = MIN( blocksize.width, corr->cols ); in icvCrossCorr() 119 dftsize.width = cvGetOptimalDFTSize(blocksize.width + templ->cols - 1); in icvCrossCorr() 127 blocksize.width = dftsize.width - templ->cols + 1; in icvCrossCorr() 128 blocksize.width = MIN( blocksize.width, corr->cols ); in icvCrossCorr() 140 buf_size = templ->cols*templ->rows*CV_ELEM_SIZE(templ_depth); in icvCrossCorr() 143 buf_size = MAX( buf_size, (blocksize.width + templ->cols - 1)* in icvCrossCorr() [all …]
|
D | cvkdtree.cpp | 90 assert(d->cols == tr->dims()); in find_nn() 93 assert(results->cols == k); in find_nn() 94 assert(dist->cols == k); in find_nn() 120 int rn = results->rows * results->cols; in find_ortho_range() 146 (&tmp[0], &tmp[0] + tmp.size(), mat->cols, in CvFeatureTree() 174 assert(bounds_min->rows * bounds_min->cols == dims()); in find_ortho_range() 175 assert(bounds_max->rows * bounds_max->cols == dims()); in find_ortho_range() 216 if (desc->cols != dims) in cvFindFeatures() 218 if (results->rows != desc->rows && results->cols != k) in cvFindFeatures() 220 if (dist->rows != desc->rows && dist->cols != k) in cvFindFeatures() [all …]
|
D | cvundistort.cpp | 150 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 || in cvUndistort2() 154 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) || in cvUndistort2() 155 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 && in cvUndistort2() 156 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) || in cvUndistort2() 163 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols, in cvUndistort2() 213 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 || in cvInitUndistortMap() 217 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) || in cvInitUndistortMap() 218 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 && in cvInitUndistortMap() 219 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) || in cvInitUndistortMap() 226 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols, in cvInitUndistortMap() [all …]
|
D | cvcalibration.cpp | 295 CV_ASSERT( A->cols == B->rows ); in cvCalcMatMulDeriv() 298 L = A->cols; in cvCalcMatMulDeriv() 299 N = B->cols; in cvCalcMatMulDeriv() 305 dABdA->rows == A->rows*B->cols && dABdA->cols == A->rows*A->cols ); in cvCalcMatMulDeriv() 311 dABdB->rows == A->rows*B->cols && dABdB->cols == B->rows*B->cols ); in cvCalcMatMulDeriv() 401 CV_ASSERT( _rvec1->rows == 3 && _rvec1->cols == 1 && CV_ARE_SIZES_EQ(_rvec1, _rvec2) ); in cvComposeRT() 524 if( (jacobian->rows != 9 || jacobian->cols != 3) && in cvRodrigues2() 525 (jacobian->rows != 3 || jacobian->cols != 9)) in cvRodrigues2() 529 if( src->cols == 1 || src->rows == 1 ) in cvRodrigues2() 534 if( src->rows + src->cols*CV_MAT_CN(src->type) - 1 != 3 ) in cvRodrigues2() [all …]
|
/external/qemu/distrib/sdl-1.2.12/src/video/ |
D | SDL_yuv_mmx.c | 83 int rows, int cols, int mod ) in ColorRGBDitherYV12MMX1X() argument 88 unsigned char* y = lum +cols*rows; // Pointer to the end in ColorRGBDitherYV12MMX1X() 91 row2 = (Uint32 *)out+cols+mod; // start of second row in ColorRGBDitherYV12MMX1X() 92 mod = (mod+cols+mod)*4; // increment for row1 in byte in ColorRGBDitherYV12MMX1X() 234 "r"(row1),"r"(cols),"r"(row2),"m"(x),"m"(y),"m"(mod), in ColorRGBDitherYV12MMX1X() 244 int rows, int cols, int mod ) in Color565DitherYV12MMX1X() argument 249 unsigned char* y = lum +cols*rows; /* Pointer to the end */ in Color565DitherYV12MMX1X() 252 row2 = (Uint16 *)out+cols+mod; /* start of second row */ in Color565DitherYV12MMX1X() 253 mod = (mod+cols+mod)*2; /* increment for row1 in byte */ in Color565DitherYV12MMX1X() 418 "r"(row1),"r"(cols),"r"(row2),"m"(x),"m"(y),"m"(mod), in Color565DitherYV12MMX1X()
|
D | SDL_yuv_sw.c | 110 int rows, int cols, int mod ); 114 int rows, int cols, int mod ); 128 int rows, int cols, int mod ); 132 int rows, int cols, int mod ); 138 int rows, int cols, int mod ) in Color16DitherYV12Mod1X() argument 147 int cols_2 = cols / 2; in Color16DitherYV12Mod1X() 150 row2 = row1 + cols + mod; in Color16DitherYV12Mod1X() 151 lum2 = lum + cols; in Color16DitherYV12Mod1X() 153 mod += cols + mod; in Color16DitherYV12Mod1X() 198 lum += cols; in Color16DitherYV12Mod1X() [all …]
|
/external/libvpx/vp8/common/ |
D | debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) in vp8_print_modes_and_motion_vectors() argument 30 for (mb_col = 0; mb_col < cols; mb_col++) in vp8_print_modes_and_motion_vectors() 49 for (mb_col = 0; mb_col < cols; mb_col++) in vp8_print_modes_and_motion_vectors() 69 for (mb_col = 0; mb_col < cols; mb_col++) in vp8_print_modes_and_motion_vectors() 94 for (b_col = 0; b_col < 4 * cols; b_col++) in vp8_print_modes_and_motion_vectors() 96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); in vp8_print_modes_and_motion_vectors() 117 for (mb_col = 0; mb_col < cols; mb_col++) in vp8_print_modes_and_motion_vectors() 142 for (b_col = 0; b_col < 4 * cols; b_col++) in vp8_print_modes_and_motion_vectors() 144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); in vp8_print_modes_and_motion_vectors()
|
/external/opencv/ml/src/ |
D | mlann_mlp.cpp | 180 for( i = 1; i < layer_sizes->cols; i++ ) in init_weights() 198 if( i < layer_sizes->cols - 1 ) in init_weights() 223 _layer_sizes->cols != 1 && _layer_sizes->rows != 1 || in create() 230 l_count = _layer_sizes->rows + _layer_sizes->cols - 1; in create() 286 if( _inputs->cols != layer_sizes->data.i[0] ) in predict() 290 if( _outputs->cols != layer_sizes->data.i[layer_sizes->cols - 1] ) in predict() 305 l_count = layer_sizes->cols; in predict() 313 cvInitMatHeader( layer_out, dn, layer_in->cols, CV_64F, buf ); in predict() 321 int cols = layer_sizes->data.i[j]; in predict() local 323 cvInitMatHeader( layer_out, dn, cols, CV_64F, data ); in predict() [all …]
|
D | ml_inner_functions.cpp | 160 int dim = sample->cols; in cvRandMVNormal() 220 int dim = sample->cols; in cvRandGaussMixture() 277 int dim = data ? data->cols : 0; in icvGenerateRandomClusterCenters() 345 CV_ASSERT (center->cols == desired_matrix->cols); in cvRandRoundUni() 347 dim = desired_matrix->cols; in cvRandRoundUni() 377 int rows, cols; in cvCompleteSymm() local 385 cols = matrix->cols; in cvCompleteSymm() 405 for( j = i+1; j < cols; j++, src += step ) in cvCompleteSymm() 425 for( j = i+1; j < cols; j++, src += step ) in cvCompleteSymm() 475 if( idx_arr->rows != 1 && idx_arr->cols != 1 ) in cvPreprocessIndexArray() [all …]
|
/external/linux-tools-perf/util/ui/ |
D | progress.c | 15 int cols; in ui_progress__new() local 19 newtGetScreenSize(&cols, NULL); in ui_progress__new() 20 cols -= 4; in ui_progress__new() 21 newtCenteredWindow(cols, 1, title); in ui_progress__new() 25 self->scale = newtScale(0, 0, cols, total); in ui_progress__new()
|
/external/opencv/cxcore/include/ |
D | cxcore.hpp | 214 CvMatrix( int rows, int cols, int type ) in CvMatrix() argument 215 { matrix = cvCreateMat( rows, cols, type ); } in CvMatrix() 217 CvMatrix( int rows, int cols, int type, CvMat* hdr, in CvMatrix() argument 219 { matrix = cvInitMatHeader( hdr, rows, cols, type, data, step ); } in CvMatrix() 221 CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data=true ); 223 CvMatrix( int rows, int cols, int type, void* data, int step=CV_AUTOSTEP ) in CvMatrix() argument 224 { matrix = cvCreateMatHeader( rows, cols, type ); in CvMatrix() 260 void create( int rows, int cols, int type ) in create() argument 263 matrix->rows != rows || matrix->cols != cols || in create() 265 set( cvCreateMat( rows, cols, type ), false ); in create() [all …]
|
/external/opencv/cvaux/src/ |
D | cvtrifocal.cpp | 109 for(j=0;j<matrix->cols;j++) in fprintMatrix() 138 numPoints = points->cols; in icvNormalizePoints() 139 if( numPoints <= 0 || numPoints != normPoints->cols ) in icvNormalizePoints() 149 if(cameraMatr->rows != 3 || cameraMatr->cols != 3) in icvNormalizePoints() 202 …if( (points1->cols != points2->cols) || (points1->cols != points3->cols) || (points1->cols != 6) /… in icvComputeProjectMatrices6Points() 212 if( projMatr1->cols != 4 || projMatr2->cols != 4 || projMatr3->cols != 4 || in icvComputeProjectMatrices6Points() 477 srcSize = srcMatr->cols; in icvSelectColsByNumbers() 524 numPoints = points4D->cols; in icvProject4DPoints() 530 if( numPoints != projPoints->cols ) in icvProject4DPoints() 545 if( projMatr->cols != 4 || projMatr->rows != 3 ) in icvProject4DPoints() [all …]
|
D | cvbgfg_codebook.cpp | 105 roi.width = image->cols; in cvBGCodeBookUpdate() 109 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols && in cvBGCodeBookUpdate() 112 roi.x + roi.width <= image->cols && in cvBGCodeBookUpdate() 115 if( image->cols != model->size.width || image->rows != model->size.height ) in cvBGCodeBookUpdate() 120 int bufSz = image->cols*image->rows*sizeof(model->cbmap[0]); in cvBGCodeBookUpdate() 123 model->size = cvSize(image->cols, image->rows); in cvBGCodeBookUpdate() 142 CvBGCodeBookElem** cb = model->cbmap + image->cols*(y + roi.y) + roi.x; in cvBGCodeBookUpdate() 241 image->cols == model->size.width && image->rows == model->size.height && in cvBGCodeBookDiff() 246 roi.width = image->cols; in cvBGCodeBookDiff() 250 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols && in cvBGCodeBookDiff() [all …]
|
D | cvcorrimages.cpp | 90 needNumPoints = points->cols; in icvCreateFeaturePoints() 109 if( status->cols != needNumPoints ) in icvCreateFeaturePoints() 243 numPoints = points1->cols; in icvFindCorrForGivenPoints() 250 … if( points2->cols != numPoints || pntStatus1->cols != numPoints || pntStatus2->cols != numPoints ) in icvFindCorrForGivenPoints() 471 oldNum = (*oldPoints)->cols; in icvGrowPointsAndStatus() 484 addNum = addPoints->cols; in icvGrowPointsAndStatus() 485 if( addStatus->cols != addNum ) in icvGrowPointsAndStatus() 585 oldNumPoints = oldPoints->cols; in icvRemoveDoublePoins() 591 if( oldStatus->cols != oldNumPoints ) in icvRemoveDoublePoins() 597 newNumPoints = newPoints->cols; in icvRemoveDoublePoins() [all …]
|
/external/skia/src/images/ |
D | bmpdecoderhelper.cpp | 41 int cols = 0; in DecodeImage() local 56 cols = GetInt(); in DecodeImage() 78 if (cols < 0 || cols > 256) { in DecodeImage() 82 if (cols == 0 && bpp_ <= 8) { in DecodeImage() 83 cols = 1 << bpp_; in DecodeImage() 85 if (bpp_ <= 8 || cols > 0) { in DecodeImage() 90 if (cols > 0) { in DecodeImage() 91 if (pos_ + (cols * colLen) > len_) { in DecodeImage() 94 for (int i = 0; i < cols; ++i) { in DecodeImage()
|
/external/webkit/Source/WebCore/rendering/ |
D | RenderFrameSet.cpp | 138 int cols = frameSet()->totalCols(); in paint() local 144 for (int c = 0; c < cols; c++) { in paint() 419 int cols = frameSet()->totalCols(); in computeEdgeInfo() local 421 for (int c = 0; c < cols; ++c) { in computeEdgeInfo() 440 int cols = frameSet()->totalCols(); in edgeInfo() local 441 if (rows && cols) { in edgeInfo() 444 result.setPreventResize(RightFrameEdge, m_cols.m_preventResize[cols]); in edgeInfo() 445 result.setAllowBorder(RightFrameEdge, m_cols.m_allowBorder[cols]); in edgeInfo() 473 size_t cols = frameSet()->totalCols(); in layout() local 476 if (m_rows.m_sizes.size() != rows || m_cols.m_sizes.size() != cols) { in layout() [all …]
|
/external/skia/include/utils/ |
D | SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) { in init() argument 24 return this->init(NULL, NULL, texW, texH, rows, cols); in init() 28 int texW, int texH, int rows, int cols); 45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
/external/opencv/cxcore/src/ |
D | cxutils.cpp | 78 if( (labels->rows != 1 && (labels->cols != 1 || !CV_IS_MAT_CONT(labels->type))) || in cvKMeans2() 79 labels->rows + labels->cols - 1 != samples->rows ) in cvKMeans2() 91 dims = samples->cols*CV_MAT_CN(samples->type); in cvKMeans2() 102 counters->cols = cluster_count; // cut down counters in cvKMeans2() 289 coeff_count = coeffs->rows + coeffs->cols - 1; in cvSolveCubic() 291 if( (coeffs->rows != 1 && coeffs->cols != 1) || (coeff_count != 3 && coeff_count != 4) ) in cvSolveCubic() 295 if( (roots->rows != 1 && roots->cols != 1) || in cvSolveCubic() 296 roots->rows + roots->cols - 1 != 3 ) in cvSolveCubic() 657 m = a->rows * a->cols; in cvSolvePoly() 658 n = r->rows * r->cols; in cvSolvePoly() [all …]
|
/external/libvpx/vp8/common/ppc/ |
D | systemdependent.c | 29 int cols, 33 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit); 34 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit); 35 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int fli… 36 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flim… 45 int cols,
|
/external/libvpx/examples/ |
D | vp8_set_maps.txt | 36 roi.cols = cfg.g_w/16; 54 roi.roi_map = malloc(roi.rows * roi.cols); 55 for(i=0;i<roi.rows*roi.cols;i++) 67 active.cols = cfg.g_w/16; 70 active.active_map = malloc(active.rows * active.cols); 71 for(i=0;i<active.rows*active.cols;i++) 82 active.cols = cfg.g_w/16;
|