| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix_BLAS.h | 79 m = convert_index<BlasIndex>(rows); \
80 n = convert_index<BlasIndex>(cols); \
81 k = convert_index<BlasIndex>(depth); \
84 lda = convert_index<BlasIndex>(lhsStride); \
85 ldb = convert_index<BlasIndex>(rhsStride); \
86 ldc = convert_index<BlasIndex>(resStride); \
93 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
100 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
|
| TriangularSolverMatrix_BLAS.h | 56 BlasIndex m = convert_index<BlasIndex>(size), n = convert_index<BlasIndex>(otherSize), lda, ldb; \
60 ldb = convert_index<BlasIndex>(otherStride);\
76 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
79 lda = convert_index<BlasIndex>(triStride); \
109 BlasIndex m = convert_index<BlasIndex>(otherSize), n = convert_index<BlasIndex>(size), lda, ldb; \
113 ldb = convert_index<BlasIndex>(otherStride);\
129 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
132 lda = convert_index<BlasIndex>(triStride);
[all...] |
| SelfadjointMatrixMatrix_BLAS.h | 65 m = convert_index<BlasIndex>(rows); \
66 n = convert_index<BlasIndex>(cols); \
69 lda = convert_index<BlasIndex>(lhsStride); \
70 ldb = convert_index<BlasIndex>(rhsStride); \
71 ldc = convert_index<BlasIndex>(resStride); \
81 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
112 m = convert_index<BlasIndex>(rows); \
113 n = convert_index<BlasIndex>(cols); \
116 lda = convert_index<BlasIndex>(lhsStride); \
117 ldb = convert_index<BlasIndex>(rhsStride);
[all...] |
| GeneralMatrixVector_BLAS.h | 100 BlasIndex m=convert_index<BlasIndex>(rows), n=convert_index<BlasIndex>(cols), \
101 lda=convert_index<BlasIndex>(lhsStride), incx=convert_index<BlasIndex>(rhsIncr), incy=convert_index<BlasIndex>(resIncr); \
106 m = convert_index<BlasIndex>(cols); \
107 n = convert_index<BlasIndex>(rows); \
|
| TriangularMatrixVector_BLAS.h | 113 n = convert_index<BlasIndex>(size); \
114 lda = convert_index<BlasIndex>(lhsStride); \
116 incy = convert_index<BlasIndex>(resIncr); \
135 m = convert_index<BlasIndex>(rows-size); \
136 n = convert_index<BlasIndex>(size); \
142 m = convert_index<BlasIndex>(size); \
143 n = convert_index<BlasIndex>(cols-size); \
195 n = convert_index<BlasIndex>(size); \
196 lda = convert_index<BlasIndex>(lhsStride); \
198 incy = convert_index<BlasIndex>(resIncr);
[all...] |
| GeneralMatrixMatrixTriangular_BLAS.h | 88 BlasIndex lda=convert_index<BlasIndex>(lhsStride), ldc=convert_index<BlasIndex>(resStride), n=convert_index<BlasIndex>(size), k=convert_index<BlasIndex>(depth); \
109 BlasIndex lda=convert_index<BlasIndex>(lhsStride), ldc=convert_index<BlasIndex>(resStride), n=convert_index<BlasIndex>(size), k=convert_index<BlasIndex>(depth); \
|
| TriangularMatrixMatrix_BLAS.h | 125 BlasIndex aStride = convert_index<BlasIndex>(aa_tmp.outerStride()); \
140 m = convert_index<BlasIndex>(diagSize); \
141 n = convert_index<BlasIndex>(cols); \
152 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
168 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
171 lda = convert_index<BlasIndex>(lhsStride); \
235 BlasIndex aStride = convert_index<BlasIndex>(aa_tmp.outerStride()); \
250 m = convert_index<BlasIndex>(rows); \
251 n = convert_index<BlasIndex>(diagSize); \
262 ldb = convert_index<BlasIndex>(b_tmp.outerStride());
[all...] |
| SelfadjointMatrixVector_BLAS.h | 88 BlasIndex n=convert_index<BlasIndex>(size), lda=convert_index<BlasIndex>(lhsStride), incx=1, incy=1; \
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD_LAPACKE.h | 53 lapack_int lda = internal::convert_index<lapack_int>(matrix.outerStride()), ldu, ldvt; \
60 ldu = internal::convert_index<lapack_int>(m_matrixU.outerStride()); \
64 ldvt = (m_computeFullV) ? internal::convert_index<lapack_int>(m_cols) : (m_computeThinV) ? internal::convert_index<lapack_int>(m_diagSize) : 1; \
71 LAPACKE_##LAPACKE_PREFIX##gesvd( matrix_order, jobu, jobvt, internal::convert_index<lapack_int>(m_rows), internal::convert_index<lapack_int>(m_cols), (LAPACKE_TYPE*)m_temp.data(), lda, (LAPACKE_RTYPE*)m_singularValues.data(), u, ldu, vt, ldvt, superb.data()); \
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU_LAPACKE.h | 55 lda = convert_index<lapack_int>(luStride); \
58 m = convert_index<lapack_int>(rows); \
59 n = convert_index<lapack_int>(cols); \
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur_LAPACKE.h | 47 lapack_int n = internal::convert_index<lapack_int>(matrix.cols()), sdim, info; \
53 lapack_int ldvs = internal::convert_index<lapack_int>(m_matU.outerStride()); \
55 lapack_int lda = internal::convert_index<lapack_int>(m_matT.outerStride()); \
|
| ComplexSchur_LAPACKE.h | 61 lapack_int n = internal::convert_index<lapack_int>(matrix.cols()), sdim, info; \
67 lapack_int ldvs = internal::convert_index<lapack_int>(m_matU.outerStride()); \
69 lapack_int lda = internal::convert_index<lapack_int>(m_matT.outerStride()); \
|
| SelfAdjointEigenSolver_LAPACKE.h | 50 lapack_int n = internal::convert_index<lapack_int>(matrix.cols()), lda, matrix_order, info; \
65 lda = internal::convert_index<lapack_int>(m_eivec.outerStride()); \
|
| /external/eigen/Eigen/src/SparseCore/ |
| AmbiVector.h | 42 void setBounds(Index start, Index end) { m_start = convert_index(start); m_end = convert_index(end); }
58 m_size = convert_index(size);
64 StorageIndex convert_index(Index idx) function in class:Eigen::internal::AmbiVector
66 return internal::convert_index<StorageIndex>(idx);
77 m_allocatedElements = convert_index((allocSize*sizeof(Scalar))/sizeof(ListEl));
82 m_allocatedElements = convert_index((size*sizeof(Scalar))/sizeof(ListEl));
85 m_size = convert_index(size);
202 llElements[0].index = convert_index(i);
211 el.index = convert_index(i)
[all...] |
| SparseBlock.h | 27 using Base::convert_index;
32 : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
36 : m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols))
102 using Base::convert_index;
112 : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
116 : m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols))
194 StorageIndex nnz_k = internal::convert_index<StorageIndex>(tmp.innerVector(k).nonZeros());
204 StorageIndex offset = internal::convert_index<StorageIndex>(nnz - block_size)
[all...] |
| SparseColEtree.h | 64 StorageIndex nc = convert_index<StorageIndex>(mat.cols()); // Number of columns
65 StorageIndex m = convert_index<StorageIndex>(mat.rows());
|
| SparseMatrix.h | 100 using Base::convert_index;
426 StorageIndex size = internal::convert_index<StorageIndex>(m_data.size());
563 StorageIndex newInnerSize = convert_index(IsRowMajor ? cols : rows);
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 258 using internal::convert_index;
294 ju(ii) = convert_index<StorageIndex>(ii);
296 jr(ii) = convert_index<StorageIndex>(ii);
306 ju(sizel) = convert_index<StorageIndex>(k);
308 jr(k) = convert_index<StorageIndex>(sizel);
319 ju(jpos) = convert_index<StorageIndex>(k);
321 jr(k) = convert_index<StorageIndex>(jpos);
351 jr(minrow) = convert_index<StorageIndex>(jj);
352 jr(j) = convert_index<StorageIndex>(k);
393 ju(newpos) = convert_index<StorageIndex>(j)
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR_LAPACKE.h | 66 lapack_int lda = internal::convert_index<lapack_int,Index>(m_qr.outerStride()); \
68 LAPACKE_##LAPACKE_PREFIX##geqp3( matrix_order, internal::convert_index<lapack_int,Index>(rows), internal::convert_index<lapack_int,Index>(cols), \
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_LAPACKE.h | 53 size = convert_index<lapack_int>(m.rows()); \
57 lda = convert_index<lapack_int>(m.outerStride()); \
|
| /external/eigen/Eigen/src/Core/functors/ |
| NullaryFunctors.h | 94 m_multiplier((high-low)/convert_index<Scalar>(num_steps<=1 ? 1 : num_steps-1)),
95 m_divisor(convert_index<Scalar>((high>=low?num_steps:-num_steps)+(high-low))/((numext::abs(high-low)+1)==0?1:(numext::abs(high-low)+1))),
103 if(m_use_divisor) return m_low + convert_index<Scalar>(i)/m_divisor;
104 else return m_low + convert_index<Scalar>(i)*m_multiplier;
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 186 internal::pardiso_run_selector<StorageIndex>::run(m_pt, 1, 1, m_type, -1, internal::convert_index<StorageIndex>(m_size),0, 0, 0, m_perm.data(), 0,
269 error = internal::pardiso_run_selector<StorageIndex>::run(m_pt, 1, 1, m_type, 12, internal::convert_index<StorageIndex>(m_size),
290 error = internal::pardiso_run_selector<StorageIndex>::run(m_pt, 1, 1, m_type, 11, internal::convert_index<StorageIndex>(m_size),
310 error = internal::pardiso_run_selector<StorageIndex>::run(m_pt, 1, 1, m_type, 22, internal::convert_index<StorageIndex>(m_size),
357 error = internal::pardiso_run_selector<StorageIndex>::run(m_pt, 1, 1, m_type, 33, internal::convert_index<StorageIndex>(m_size),
359 m_perm.data(), internal::convert_index<StorageIndex>(nrhs), m_iparm.data(), m_msglvl,
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 60 using Base::convert_index;
85 inline Index outerSize() const { return convert_index(m_data.size()); }
202 m_innerSize = convert_index(IsRowMajor ? cols : rows);
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 105 StorageIndex m = internal::convert_index<StorageIndex>(A.cols()); // must be StorageIndex, because it is passed by address to METIS
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 184 res.nrow = internal::convert_index<int>(mat.rows());
185 res.ncol = internal::convert_index<int>(mat.cols());
187 res.storage.lda = internal::convert_index<int>(MatrixType::IsVectorAtCompileTime ? mat.size() : mat.outerStride());
200 res.nrow = internal::convert_index<int>(mat.cols());
201 res.ncol = internal::convert_index<int>(mat.rows());
206 res.nrow = internal::convert_index<int>(mat.rows());
207 res.ncol = internal::convert_index<int>(mat.cols());
212 res.storage.nnz = internal::convert_index<int>(mat.nonZeros());
414 m_sluB.storage.lda = internal::convert_index<int>(size);
[all...] |
