/external/tensorflow/tensorflow/core/kernels/ |
H A D | winograd_transform.h | 36 virtual void GetFilterTransformMatrix(const int64 rows, const int64 cols, 39 virtual void GetInputTransformMatrix(const int64 rows, const int64 cols, 42 virtual void GetOutputTransformMatrix(const int64 rows, const int64 cols, 68 const int64 cols, 71 CHECK_GT(cols, 0); 72 memset(transform_matrix, 0, sizeof(T) * rows * cols); 75 transform_matrix[0 * cols + 0] = T(1.0); 77 transform_matrix[1 * cols + 0] = T(0.5); 78 transform_matrix[1 * cols + 1] = T(0.5); 79 transform_matrix[1 * cols 67 GetFilterTransformMatrix(const int64 rows, const int64 cols, T* transform_matrix) const argument 191 GetInputTransformMatrix(const int64 rows, const int64 cols, T* transform_matrix) const argument 313 GetOutputTransformMatrix(const int64 rows, const int64 cols, T* transform_matrix) const argument [all...] |
H A D | deep_conv2d_test.cc | 22 static void ComputeKroneckerProduct(const int rows, const int cols, argument 25 for (int j = 0; j < cols; ++j) { 26 const float v = matrix[i * cols + j]; 27 const int output_index_base = cols * (i * rows * cols + j); 29 for (int l = 0; l < cols; ++l) { 30 const int input_index = k * cols + l; 31 const int output_index = k * cols * cols + l; 47 const int cols local 76 const int cols = 3; local 107 const int cols = 4; local 137 const int cols = 4; local [all...] |
H A D | eigen_activations_test.cc | 32 const ptrdiff_t cols = 48; local 34 Tensor<float, 4> input(depth, rows, cols, batch); 37 Tensor<float, 4> result(depth, rows, cols, batch); 41 for (int c = 0; c < cols; ++c) { 56 const ptrdiff_t cols = 48; local 58 Tensor<float, 4> input(depth, rows, cols, batch); 61 Tensor<float, 4> result(depth, rows, cols, batch); 65 for (int c = 0; c < cols; ++c) { 80 const ptrdiff_t cols = 48; local 82 Tensor<float, 4> input(depth, rows, cols, batc [all...] |
/external/eigen/doc/snippets/ |
H A D | Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable 2 MatrixXf m(rows,cols); 4 MatrixXf::Zero(3,cols-3), 6 MatrixXf::Identity(rows-3,cols-3);
|
H A D | Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl; 6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
H A D | Matrix_resize_NoChange_int.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
H A D | Matrix_resize_int_NoChange.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
H A D | tut_matrix_assignment_resizing.cpp | 2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl; 5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
|
/external/syslinux/com32/lib/sys/ |
H A D | screensize.c | 5 int getscreensize(int fd, int *rows, int *cols) argument 15 *cols = fp->o.cols; 17 if (!*rows || !*cols) {
|
/external/eigen/test/ |
H A D | resize.cpp | 12 template<DenseIndex rows, DenseIndex cols> 15 MatrixXf A(rows, cols); 17 Matrix<double, rows, cols> C; 20 VERIFY(B.rows() == rows && B.cols() == cols); 25 VERIFY(y.rows() == 1 && y.cols() == rows); 27 y.resize(cols); 29 VERIFY(x.rows() == cols && x.cols() == 1);
|
H A D | bandmatrix.cpp | 19 Index cols = _m.cols(); local 23 MatrixType m(rows,cols,supers,subs); 25 DenseMatrixType dm1(rows,cols); 43 for (int i=0; i<cols; ++i) 48 Index d = (std::min)(rows,cols); 49 Index a = std::max<Index>(0,cols-d-supers); 52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero(); 54 if(b>0) dm1.block(d+subs,0,b,cols) 66 Index cols = internal::random<Index>(1,10); local [all...] |
H A D | ctorleak.cpp | 42 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local 43 Foo::object_limit = internal::random<Index>(0, rows*cols - 2); 49 std::cout << "\nMatrixX m(" << rows << ", " << cols << ");\n"; local 50 MatrixX m(rows, cols); 59 Foo::object_limit = (rows+1)*(cols+1); 60 MatrixX A(rows, cols); 61 VERIFY_IS_EQUAL(Foo::object_count, rows*cols); 63 VERIFY_IS_EQUAL(Foo::object_count, (rows+1)*cols); 65 VERIFY_IS_EQUAL(Foo::object_count, rows*(cols+1));
|
/external/eigen/failtest/ |
H A D | map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf> m(ptr, rows, cols);
|
H A D | map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
H A D | map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
/external/libvpx/libvpx/test/ |
H A D | pp_filter_test.cc | 26 int dst_pixels_per_line, int cols, unsigned char *flimit, int size); 29 int rows, int cols, int flimit); 32 int cols, int flimit); 172 void SetCols(unsigned char *s, int rows, int cols, int src_width) { argument 174 for (int c = 0; c < cols; c++) { 182 int rows, int cols, int src_pitch) { 184 for (int c = 0; c < cols; c++) { 192 void RunFilterLevel(unsigned char *s, int rows, int cols, int src_width, argument 195 GetParam()(s, src_width, rows, cols, filter_level)); 196 RunComparison(expected_output, s, rows, cols, src_widt 181 RunComparison(const unsigned char *expected_output, unsigned char *src_c, int rows, int cols, int src_pitch) argument 202 const int cols = 16; local 219 const int cols = 16; local 236 const int cols = 16; local 258 const int cols = 16; local 288 SetRows(unsigned char *src_c, int rows, int cols, int src_width) argument 295 RunComparison(const unsigned char *expected_output, unsigned char *src_c, int rows, int cols, int src_pitch) argument 306 RunFilterLevel(unsigned char *s, int rows, int cols, int src_width, int filter_level, const unsigned char *expected_output) argument 316 const int cols = 16; local 352 const int cols = 16; local 383 const int cols = 16; local 403 const int cols = 16; local [all...] |
/external/eigen/doc/examples/ |
H A D | class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) argument 10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols); 15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) argument 17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
/external/trappy/tests/trappy/plotter/ |
H A D | PlotLayout.py | 27 :param cols: The number of columns to draw 28 :type cols: int 35 and :math:`N_{cols}` such that: 39 N_{rows} = \\frac{N_{cols}}{N_{plots}} 42 def __init__(self, cols, num_plots, **kwargs): 44 self.cols = cols 51 if self.num_plots < self.cols: 52 self.cols = self.num_plots 53 self.rows = (self.num_plots / self.cols) [all...] |
/external/trappy/trappy/plotter/ |
H A D | PlotLayout.py | 27 :param cols: The number of columns to draw 28 :type cols: int 35 and :math:`N_{cols}` such that: 39 N_{rows} = \\frac{N_{cols}}{N_{plots}} 42 def __init__(self, cols, num_plots, **kwargs): 44 self.cols = cols 51 if self.num_plots < self.cols: 52 self.cols = self.num_plots 53 self.rows = (self.num_plots / self.cols) [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
H A D | Math.h | 116 Matrix(unsigned rows, unsigned cols) : 117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { 122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : 123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { 124 std::fill(data, data + (rows * cols), initVal); 129 rows(m.rows), cols( [all...] |
/external/libavc/common/ |
H A D | ih264_chroma_intra_pred_filters.c | 314 WORD32 rows, cols; /* loop variables*/ local 320 for(cols = 0; cols < 16; cols += 2) 322 *(pu1_dst + rows * dst_strd + cols) = *pu1_left; 324 *(pu1_dst + rows * dst_strd + cols + 1) = *(pu1_left + 1); 438 WORD32 rows, cols; /* loop variables*/ local 450 for(cols = 0; cols < 4; cols [all...] |
/external/python/cpython3/Modules/_decimal/libmpdec/ |
H A D | transpose.c | 51 std_trans(mpd_uint_t dest[], mpd_uint_t src[], mpd_size_t rows, mpd_size_t cols) argument 57 isrc = r * cols; 59 for (c = 0; c < cols; c++) { 73 swap_halfrows_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols, int dir) argument 86 assert(cols == mul_size_t(2, rows)); 98 m = cols - 1; 113 for (offset = 0; offset < cols/2; offset += b) { 115 stride = (offset + b < cols/2) ? b : cols/2-offset; 117 hp = matrix + hn*cols/ 149 squaretrans(mpd_uint_t *buf, mpd_size_t cols) argument 245 transpose_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols) argument [all...] |
H A D | transpose.h | 44 void std_trans(mpd_uint_t dest[], mpd_uint_t src[], mpd_size_t rows, mpd_size_t cols); 45 int transpose_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols); 46 void transpose_3xpow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols);
|
/external/toybox/toys/pending/ |
H A D | fmt.c | 34 int cols = 0, is_first = 1, indent_end = 0, line_length; local 41 if (cols > 0) xputc('\n'); 44 cols = 0; 57 if (!is_first && (cols + (is_first?indent_end:1) + w) >= TT.width) { 60 cols = 0; 63 cols += (is_first?indent_end:1) + w; 68 if (cols > 0) xputc('\n');
|
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 39 int cols = SIZE; local 42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols); 47 fillMatrix(density, rows, cols, sm1); 52 DenseMatrix m1(rows,cols), m3(rows,cols); 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; 81 GmmDynSparse gmmT3(rows,cols); 82 GmmSparse m1(rows,cols), m3(rows,cols); [all...] |