| /frameworks/base/tools/aapt/ |
| Images.cpp | 39 image_info() : rows(NULL), is9Patch(false),
43 if (rows && rows != allocRows) {
44 free(rows);
65 png_bytepp rows; member in struct:image_info
143 outImageInfo->rows = (png_bytepp)malloc(
146 outImageInfo->allocRows = outImageInfo->rows;
148 png_set_rows(read_ptr, read_info, outImageInfo->rows);
152 outImageInfo->rows[i] = (png_bytep)
156 png_read_image(read_ptr, outImageInfo->rows);
1286 png_bytepp rows; local
[all...] |
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 122 /** \returns the number of rows of the represented matrix.
124 inline Index rows() const { return m_pmat.rows(); } function in class:Eigen::SparseQR
195 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix");
205 y.resize((std::max<Index>)(cols(),y.rows()),y.cols());
207 y.bottomRows(y.rows()-rank).setZero();
236 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix")
607 inline Index rows() const { return m_transpose ? m_qr.rows() : m_qr.cols(); } function in struct:Eigen::SparseQR_QProduct
675 inline Index rows() const { return m_qr.rows(); } function in struct:Eigen::SparseQRMatrixQReturnType
[all...] |
| /external/ImageMagick/coders/ |
| histogram.c | 258 for (y=0; y < (ssize_t) image->rows; y++)
289 scale=(double) histogram_image->rows/maximum;
298 q=GetAuthenticPixels(histogram_image,x,0,1,histogram_image->rows,exception);
303 y=(ssize_t) ceil(histogram_image->rows-scale*histogram[x].red-0.5);
305 for ( ; y < (ssize_t) histogram_image->rows; y++)
313 y=(ssize_t) ceil(histogram_image->rows-scale*histogram[x].green-0.5);
315 for ( ; y < (ssize_t) histogram_image->rows; y++)
323 y=(ssize_t) ceil(histogram_image->rows-scale*histogram[x].blue-0.5);
325 for ( ; y < (ssize_t) histogram_image->rows; y++)
333 status=SetImageProgress(image,SaveImageTag,y,histogram_image->rows);
[all...] |
| rgf.c | 151 image->rows = (unsigned long) ReadBlobByte(image);
174 status=SetImageExtent(image,image->columns,image->rows,exception);
180 data=(unsigned char *) AcquireQuantumMemory(image->rows,image->columns*
185 for (i=0; i < (ssize_t) (image->columns * image->rows); i++)
194 for (y=0; y < (ssize_t) image->rows; y++)
215 image->rows);
350 if((image->columns > 255L) || (image->rows > 255L))
356 (void) WriteBlobByte(image,image->rows & 0xff);
363 for (y=0; y < (ssize_t) image->rows; y++)
390 image->rows);
[all...] |
| mvg.c | 161 if ((image->columns == 0) || (image->rows == 0))
183 image->rows=(size_t) floor((bounds.y2-bounds.y1)+0.5);
187 if ((image->columns == 0) || (image->rows == 0))
195 image->rows=(size_t) (draw_info->affine.sy*image->rows);
196 status=SetImageExtent(image,image->columns,image->rows,exception);
|
| flif.c | 208 image->rows=(size_t) flif_image_get_height(flifimage);
216 for (y=0; y < (ssize_t) image->rows; y++)
234 image->rows);
415 rows;
432 if ((image->columns > 0xFFFF) || (image->rows > 0xFFFF))
446 rows=image->rows;
451 flifimage=flif_create_image_HDR(image->columns,image->rows);
456 flifimage=flif_create_image(image->columns,image->rows);
475 for (y=0; y < (ssize_t) image->rows; y++
410 rows; local
[all...] |
| /external/ImageMagick/www/source/ |
| mgk.c | 160 rows;
189 count=(ssize_t) sscanf(buffer,"%lu %lu\n",&columns,&rows);
198 image->rows=rows;
215 for (y=0; y < (ssize_t) image->rows; y++)
234 (SetImageProgress(image,LoadImageTag,y,image->rows) == MagickFalse))
252 count=(ssize_t) sscanf(buffer,"%lu %lu\n",&columns,&rows);
425 image->rows);
427 for (y=0; y < (ssize_t) image->rows; y++)
442 (SetImageProgress(image,SaveImageTag,y,image->rows) == MagickFalse)
156 rows; local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| MapBase.h | 70 using Base::rows;
88 /** \copydoc DenseBase::rows() */
89 EIGEN_DEVICE_FUNC inline Index rows() const { return m_rows.value(); } function in class:Eigen::MapBase
170 inline MapBase(PointerType dataPtr, Index rows, Index cols)
171 : m_data(dataPtr), m_rows(rows), m_cols(cols)
174 || ( rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows)
191 || (cols() * rows() * innerStride() * sizeof(Scalar)) < internal::traits<Derived>::Alignment ) && "data is not aligned");
229 using Base::rows;
281 EIGEN_DEVICE_FUNC inline MapBase(PointerType dataPtr, Index rows, Index cols) : Base(dataPtr, rows, cols) {
[all...] |
| Map.h | 113 : this->rows();
144 * \param rows the number of rows of the matrix expression
149 inline Map(PointerArgType dataPtr, Index rows, Index cols, const StrideType& stride = StrideType())
150 : Base(cast_to_pointer_type(dataPtr), rows, cols), m_stride(stride)
|
| /external/eigen/debug/gdb/ |
| printers.py | 55 self.rows = val['m_storage']['m_rows']
57 self.rows = int(template_params[1])
81 def __init__ (self, rows, cols, dataPtr, rowMajor):
82 self.rows = rows
104 if self.currentRow >= self.rows:
108 if self.currentRow >= self.rows:
121 elif (self.rows == 1): #if it's a row vector
127 return self._iterator(self.rows, self.cols, self.data, self.rowMajor)
130 return "Eigen::%s<%s,%d,%d,%s> (data ptr: %s)" % (self.variety, self.innerType, self.rows, self.cols, "RowMajor" if self.rowMajor else "ColMajor", self.data
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| matrix_triangular_solve_op.cc | 71 double rows = static_cast<double>(input_matrix_shapes[0].dim_size(0)); variable
73 double cost = rows * rows * num_rhss *
88 if (matrix.rows() == 0 || rhs.cols() == 0) {
163 double rows = static_cast<double>(input_matrix_shapes[0].dim_size(0)); variable
165 double cost = rows * rows * num_rhss *
180 if (matrix.rows() == 0 || rhs.cols() == 0) {
191 uint64 rhs_elems = rhs.rows() * rhs.cols();
223 uint64 colmajor_cols = output.rows();
[all...] |
| /external/autotest/tko/ |
| frontend.py | 65 # List of rows columns (y-values)
88 rows = db_obj.select(fields, 'tko_test_view',
90 return status_data(rows, x_field, y_field, query_reasons)
141 rows = db.select('distinct machine_group', 'tko_machines',
143 groupnames = sorted([row[0] for row in rows])
188 rows = db.select(','.join(fields), 'tko_kernels', where)
189 return [klass(db, *row) for row in rows]
218 rows = db.select_sql(','.join(fields), 'tko_tests', sql, values)
219 return [klass(db, *row) for row in rows]
282 rows = db.select('tag, machine_idx', 'tko_jobs', where
[all...] |
| /external/valgrind/drd/tests/ |
| omp_matinv.c | 41 /** Allocate memory for a matrix with the specified number of rows and
44 static elem_t* new_matrix(const int rows, const int cols)
46 assert(rows > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols)
61 for (i = 0; i < rows; i++)
63 for (j = 0; j < rows; j++)
72 const elem_t* const a, const int rows, const int cols)
76 for (i = 0; i < rows; i++)
154 * has at least as many columns as rows, the result of this algorithm is tha
[all...] |
| /external/ImageMagick/MagickCore/ |
| compare.c | 159 rows;
179 rows=MagickMax(image->rows,reconstruct_image->rows);
182 geometry.height=rows;
187 highlight_image=CloneImage(image,columns,rows,MagickTrue,exception);
219 magick_threads(image,highlight_image,rows,1)
221 for (y=0; y < (ssize_t) rows; y++)
364 rows;
374 rows=MagickMax(image->rows,reconstruct_image->rows)
157 rows; local
361 rows; local
474 rows; local
578 rows; local
683 rows; local
777 rows; local
893 rows; local
1038 rows; local
1533 rows; local
1668 rows; local
[all...] |
| /external/gemmlowp/test/ |
| benchmark.cc | 50 int rows, depth, cols; member in struct:gemmlowp::gemm_t
51 gemm_t() : rows(0), depth(0), cols(0) {}
52 gemm_t(int r, int d, int c) : rows(r), depth(d), cols(c) {}
56 return a.rows < b.rows ||
57 (a.rows <= b.rows &&
69 int rows = gemm.rows; local
73 sizeof(Scalar) * (rows * depth + depth * cols + rows * cols)
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 75 EIGEN_DEVICE_FUNC inline Index rows() const { return m_matrix.rows() + (int(Direction)==Vertical ? 1 : 0); } function in class:Eigen::Homogeneous
199 Direction==Vertical ? _expression().rows()-1 : _expression().rows(),
205 Direction==Vertical ? _expression().rows()-1:0,
207 Direction==Vertical ? 1 : _expression().rows(),
209 Direction==Vertical ? _expression().rows()-1 : 1,
265 EIGEN_DEVICE_FUNC inline Index rows() const { return m_lhs.rows(); } function in struct:Eigen::internal::homogeneous_left_product_impl
274 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs
303 EIGEN_DEVICE_FUNC inline Index rows() const { return m_lhs.rows(); } function in struct:Eigen::internal::homogeneous_right_product_impl
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSolverBase.h | 30 Index size = rhs.rows();
50 Index size = rhs.rows();
91 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
104 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.cpp | 72 C_MatrixXd* MatrixXd_new(int rows, int cols)
74 return eigen_to_c(*new MatrixXd(rows,cols));
92 void MatrixXd_resize(C_MatrixXd *m, int rows, int cols)
94 c_to_eigen(m).resize(rows,cols);
137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols)
139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
|
| /external/eigen/unsupported/test/ |
| sparse_extra.cpp | 52 const Index rows = ref.rows(); local
57 double density = (std::max)(8./(rows*cols), 0.01);
62 SparseMatrixType m(rows, cols);
63 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
64 DenseVector vec1 = DenseVector::Random(rows);
117 SparseMatrixType m1(rows,cols), m2(rows,cols);
118 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...] |
| /external/gemmlowp/public/ |
| map.h | 43 MatrixMap(Scalar* data, int rows, int cols)
45 rows_(rows),
47 stride_(kOrder == MapOrder::ColMajor ? rows : cols) {}
48 MatrixMap(Scalar* data, int rows, int cols, int stride)
49 : data_(data), rows_(rows), cols_(cols), stride_(stride) {}
56 int rows() const { return rows_; } function in class:gemmlowp::MatrixMap
|
| /frameworks/base/tools/aapt2/compile/ |
| NinePatch.cpp | 136 explicit HorizontalImageLine(uint8_t** rows, int32_t xoffset, int32_t yoffset,
138 : rows_(rows), xoffset_(xoffset), yoffset_(yoffset), length_(length) {}
159 explicit VerticalImageLine(uint8_t** rows, int32_t xoffset, int32_t yoffset,
161 : rows_(rows), xoffset_(xoffset), yoffset_(yoffset), length_(length) {}
178 explicit DiagonalImageLine(uint8_t** rows, int32_t xoffset, int32_t yoffset,
180 : rows_(rows),
302 static uint32_t GetRegionColor(uint8_t** rows, const Bounds& region) {
305 NinePatch::PackRGBA(rows[region.top] + region.left * 4);
307 const uint8_t* row = rows[y];
334 // Note that the rows contain the 9-patch 1px border, and the indices in th
[all...] |
| /external/eigen/test/ |
| mapped_matrix.cpp | 57 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
73 Map<MatrixType> map1(array1, rows, cols);
74 Map<MatrixType, AlignedMax> map2(array2, rows, cols);
75 Map<MatrixType> map3(array3unaligned, rows, cols);
76 Map<MatrixType> map4(array4, rows, cols);
78 VERIFY_IS_EQUAL(map1, MatrixType::Ones(rows,cols));
79 VERIFY_IS_EQUAL(map2, MatrixType::Ones(rows,cols));
80 VERIFY_IS_EQUAL(map3, MatrixType::Ones(rows,cols))
[all...] |
| /external/pdfium/third_party/agg23/ |
| agg_rendering_buffer.h | 81 int8u** rows = m_rows; local
83 *rows++ = row_ptr;
129 int8u const* const* rows() const function in class:agg::rendering_buffer
|
| /external/skia/src/codec/ |
| SkBmpMaskCodec.cpp | 45 int rows = this->decodeRows(dstInfo, dst, dstRowBytes, opts); local
46 if (rows != dstInfo.height()) {
47 *rowsDecoded = rows;
81 // Iterate over rows of the image
|
| /external/skqp/src/codec/ |
| SkBmpMaskCodec.cpp | 45 int rows = this->decodeRows(dstInfo, dst, dstRowBytes, opts); local
46 if (rows != dstInfo.height()) {
47 *rowsDecoded = rows;
81 // Iterate over rows of the image
|
