HomeSort by relevance Sort by last modified time
    Searched refs:row_end (Results 1 - 12 of 12) sorted by null

  /external/webp/src/dsp/
lossless.c 364 int row_start, int row_end,
367 assert(row_start < row_end);
368 assert(row_end <= transform->ysize_);
371 VP8LAddGreenToBlueAndRed(out, (row_end - row_start) * width);
374 PredictorInverseTransform(transform, row_start, row_end, out);
375 if (row_end != transform->ysize_) {
378 memcpy(out - width, out + (row_end - row_start - 1) * width,
383 ColorSpaceInverseTransform(transform, row_start, row_end, out);
392 const int out_stride = (row_end - row_start) * width;
393 const int in_stride = (row_end - row_start)
    [all...]
lossless.h 55 // rows. Transform will be applied to rows [row_start, row_end[.
59 int row_start, int row_end,
  /external/opencv3/3rdparty/libwebp/dsp/
lossless.h 31 // rows. Transform will be applied to rows [row_start, row_end[.
35 int row_start, int row_end,
lossless.c     [all...]
  /external/eigen/bench/
sparse_setter.cpp 360 I row_end = Ap[i+1]; local
364 for(I jj = row_start; jj < row_end; jj++){
370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){
385 I row_end = 0; local
387 I jj = row_end;
388 row_end = Ap[i+1];
389 while( jj < row_end ){
393 while( jj < row_end && Aj[jj] == j ){
  /external/ceres-solver/internal/ceres/
incomplete_lq_factorization.cc 47 const int row_end = matrix->rows()[row + 1]; local
51 for (int i = row_begin; i < row_end; ++i) {
57 for (int i = row_begin; i < row_end; ++i) {
covariance_impl.cc 528 const int row_end = rows[r + 1]; local
529 if (row_end == row_begin) {
547 for (int idx = row_begin; idx < row_end; ++idx) {
717 const int row_end = rows[r + 1]; local
718 if (row_end == row_begin) {
739 for (int idx = row_begin; idx < row_end; ++idx) {
covariance_test.cc 334 const int row_end = FindOrDie(column_bounds_, block1).second; local
338 Matrix actual(row_end - row_begin, col_end - col_begin);
346 row_end - row_begin,
348 diff_norm /= (row_end - row_begin) * (col_end - col_begin);
352 << "rows: " << row_begin << " " << row_end << " "
356 row_end - row_begin,
compressed_row_sparse_matrix.cc 528 const int row_end = m_rows[r + 1]; local
529 for (int idx1 = row_begin; idx1 < row_end; ++idx1) {
  /external/libpng/
pngwrite.c 1527 png_uint_16p row_end; local
1690 png_bytep row_end; local
1747 png_bytep row_end = output_row + image->width * channels; local
    [all...]
  /external/pdfium/third_party/lpng_v163/
pngwrite.c 1633 png_uint_16p row_end; local
1793 png_bytep row_end; local
1848 png_bytep row_end = output_row + image->width * channels; local
    [all...]
  /external/pdfium/core/src/fxge/dib/
fx_dib_transform.cpp 197 int row_end = bXFlip ? m_Height - dest_clip.left : dest_clip.right; local
202 for (int row = row_start; row < row_end; row++) {
224 for (int row = row_start; row < row_end; row++) {
259 for (int row = row_start; row < row_end; row++) {
    [all...]

Completed in 2326 milliseconds