| /external/webp/src/dec/ |
| vp8l.c | 549 int mb_w, int num_rows) {
552 while (num_rows-- > 0) {
611 static void ApplyInverseTransforms(VP8LDecoder* const dec, int num_rows,
614 const int cache_pixs = dec->width_ * num_rows;
616 const int end_row = start_row + num_rows;
631 static void ApplyInverseTransformsAlpha(VP8LDecoder* const dec, int num_rows,
634 const int end_row = start_row + num_rows;
648 const int num_rows = row - dec->last_row_; local
650 if (num_rows <= 0) return; // Nothing to be done.
651 ApplyInverseTransforms(dec, num_rows, rows)
1092 const int num_rows = row - dec->last_row_; local
1113 const int num_rows = row - dec->last_row_; local
[all...] |
| io.c | 190 const uint8_t** alpha, int* const num_rows) {
192 *num_rows = io->mb_h;
199 --*num_rows;
209 *num_rows = io->crop_bottom - io->crop_top - start_y;
223 int num_rows; local
224 const int start_y = GetAlphaSourceRow(io, &alpha, &num_rows);
230 for (j = 0; j < num_rows; ++j) {
242 mb_w, num_rows, buf->stride);
254 int num_rows; local
255 const int start_y = GetAlphaSourceRow(io, &alpha, &num_rows);
[all...] |
| vp8i.h | 325 int row, int num_rows);
|
| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement_test.cc | 67 num_rows_ = A_->num_rows();
83 const int num_schur_rows = blhs.num_rows();
|
| evaluator_test.cc | 134 ASSERT_EQ(expected_num_rows, jacobian->num_rows());
167 expected.num_rows,
581 ASSERT_EQ(2, jacobian->num_rows());
|
| suitesparse.cc | 54 triplet.nrow = A->num_rows();
74 triplet.ncol = A->num_rows(); // swap row and columns
95 m.ncol = A->num_rows();
|
| block_jacobi_preconditioner.cc | 45 : num_rows_(A.num_rows()),
|
| iterative_schur_complement_solver.cc | 96 reduced_linear_system_solution_.resize(schur_complement_->num_rows());
|
| cxsparse.cc | 167 At.n = A->num_rows();
180 tsm_wrapper.m = tsm->num_rows();
|
| schur_eliminator_test.cc | 140 const int schur_size = lhs.num_rows();
159 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols());
|
| conjugate_gradients_solver.cc | 76 CHECK_EQ(A->num_rows(), A->num_cols());
|
| unsymmetric_linear_solver_test.cc | 76 for (int i = 0; i < A_->num_rows(); ++i) {
|
| dogleg_strategy.cc | 179 Vector Jg(jacobian->num_rows());
694 Jb(2, jacobian->num_rows());
|
| /external/chromium_org/third_party/libwebp/dec/ |
| io.c | 190 const uint8_t** alpha, int* const num_rows) {
192 *num_rows = io->mb_h;
199 --*num_rows;
209 *num_rows = io->crop_bottom - io->crop_top - start_y;
223 int num_rows; local
224 const int start_y = GetAlphaSourceRow(io, &alpha, &num_rows);
230 for (j = 0; j < num_rows; ++j) {
242 mb_w, num_rows, buf->stride);
254 int num_rows; local
255 const int start_y = GetAlphaSourceRow(io, &alpha, &num_rows);
[all...] |
| vp8i.h | 325 int row, int num_rows);
|
| /external/jpeg/ |
| jdmerge.c | 171 JDIMENSION num_rows; /* number of rows returned to caller */ local
183 num_rows = 1;
187 num_rows = 2;
189 if (num_rows > upsample->rows_to_go)
190 num_rows = upsample->rows_to_go;
193 if (num_rows > out_rows_avail)
194 num_rows = out_rows_avail;
197 if (num_rows > 1) {
208 *out_row_ctr += num_rows;
209 upsample->rows_to_go -= num_rows;
[all...] |
| jpegint.h | 87 JDIMENSION output_row, int num_rows));
280 JSAMPARRAY output_buf, int num_rows));
288 int num_rows));
408 int num_rows, JDIMENSION num_cols));
|
| jmemmgr.c | 514 * num_rows = maxaccess. This means we can get good performance with simple
757 JDIMENSION start_row, JDIMENSION num_rows,
760 /* and extending for num_rows rows. writable is true if */
763 JDIMENSION end_row = start_row + num_rows;
767 if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess ||
842 JDIMENSION start_row, JDIMENSION num_rows,
845 /* and extending for num_rows rows. writable is true if */
848 JDIMENSION end_row = start_row + num_rows;
852 if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess ||
[all...] |
| jquant2.c | 225 JSAMPARRAY output_buf, int num_rows)
235 for (row = 0; row < num_rows; row++) {
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jdmerge.c | 171 JDIMENSION num_rows; /* number of rows returned to caller */ local
183 num_rows = 1;
187 num_rows = 2;
189 if (num_rows > upsample->rows_to_go)
190 num_rows = upsample->rows_to_go;
193 if (num_rows > out_rows_avail)
194 num_rows = out_rows_avail;
197 if (num_rows > 1) {
208 *out_row_ctr += num_rows;
209 upsample->rows_to_go -= num_rows;
[all...] |
| jpegint.h | 87 JDIMENSION output_row, int num_rows));
280 JSAMPARRAY output_buf, int num_rows));
288 int num_rows));
408 int num_rows, JDIMENSION num_cols));
|
| jmemmgr.c | 514 * num_rows = maxaccess. This means we can get good performance with simple
757 JDIMENSION start_row, JDIMENSION num_rows,
760 /* and extending for num_rows rows. writable is true if */
763 JDIMENSION end_row = start_row + num_rows;
767 if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess ||
842 JDIMENSION start_row, JDIMENSION num_rows,
845 /* and extending for num_rows rows. writable is true if */
848 JDIMENSION end_row = start_row + num_rows;
852 if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess ||
[all...] |
| jquant2.c | 225 JSAMPARRAY output_buf, int num_rows)
235 for (row = 0; row < num_rows; row++) {
[all...] |
| /external/chromium_org/media/base/ |
| video_util.cc | 176 int num_rows = height; local
216 num_rows = num_cols = height;
220 num_rows = num_cols = width;
246 for (int row = 0; row < num_rows; ++row) {
|
| /external/chromium_org/gpu/command_buffer/client/ |
| gles2_implementation.cc | 1808 GLint num_rows = size \/ padded_row_size; local
1835 GLint num_rows = ComputeNumRowsThatFitInBuffer( local
2252 GLint num_rows = ComputeNumRowsThatFitInBuffer( local
[all...] |
