| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixVector_MKL.h | 46 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs>
48 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn> {};
51 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> \
52 struct selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Specialized> { \
57 IsColMajor = StorageOrder==ColMajor \
60 selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,BuiltIn>::run( \
63 selfadjoint_matrix_vector_product_symv<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs>::run( \
75 template<typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs> \
76 struct selfadjoint_matrix_vector_product_symv<EIGTYPE,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs> \
85 IsRowMajor = StorageOrder==RowMajor ? 1 : 0,
[all...] |
| GeneralMatrixMatrix.h | 237 template<int StorageOrder, typename LhsScalar, typename RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor=1,
270 template<int StorageOrder, typename _LhsScalar, typename _RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor>
271 class gemm_blocking_space<StorageOrder,_LhsScalar,_RhsScalar,MaxRows, MaxCols, MaxDepth, KcFactor, true>
273 typename conditional<StorageOrder==RowMajor,_RhsScalar,_LhsScalar>::type,
274 typename conditional<StorageOrder==RowMajor,_LhsScalar,_RhsScalar>::type>
277 Transpose = StorageOrder==RowMajor,
312 template<int StorageOrder, typename _LhsScalar, typename _RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor>
313 class gemm_blocking_space<StorageOrder,_LhsScalar,_RhsScalar,MaxRows, MaxCols, MaxDepth, KcFactor, false>
315 typename conditional<StorageOrder==RowMajor,_RhsScalar,_LhsScalar>::type,
316 typename conditional<StorageOrder==RowMajor,_LhsScalar,_RhsScalar>::type
[all...] |
| SelfadjointProduct.h | 21 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs>
67 StorageOrder = (internal::traits<MatrixType>::Flags&RowMajorBit) ? RowMajor : ColMajor,
78 selfadjoint_rank1_update<Scalar,Index,StorageOrder,UpLo,
|
| TriangularSolverVector.h | 17 template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate, int StorageOrder>
18 struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheRight, Mode, Conjugate, StorageOrder>
24 Conjugate,StorageOrder==RowMajor?ColMajor:RowMajor
|
| SelfadjointMatrixMatrix.h | 18 template<typename Scalar, typename Index, int Pack1, int Pack2, int StorageOrder>
22 void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count)
48 const_blas_data_mapper<Scalar,Index,StorageOrder> lhs(_lhs,lhsStride);
76 template<typename Scalar, typename Index, int nr, int StorageOrder>
84 const_blas_data_mapper<Scalar,Index,StorageOrder> rhs(_rhs,rhsStride);
|
| SelfadjointMatrixVector.h | 23 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version=Specialized>
26 template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version>
42 IsRowMajor = StorageOrder==RowMajor ? 1 : 0,
|
| TriangularMatrixVector_MKL.h | 46 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder>
48 triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,StorageOrder,BuiltIn> {};
|
| TriangularMatrixVector.h | 17 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder, int Version=Specialized>
161 template<int StorageOrder>
|
| CoeffBasedProduct.h | 34 template<int StorageOrder, int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode>
|
| GeneralBlockPanelKernel.h | [all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU_MKL.h | 45 template<int StorageOrder> \
46 struct partial_lu_impl<EIGTYPE, StorageOrder, lapack_int> \
56 matrix_order = StorageOrder==RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \
|
| PartialPivLU.h | 215 template<typename Scalar, int StorageOrder, typename PivIndex>
223 typedef Map<Matrix<Scalar, Dynamic, Dynamic, StorageOrder> > MapLU;
300 MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols);
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 52 lapack_int size, lda, info, StorageOrder; \
57 StorageOrder = MatrixType::Flags&RowMajorBit?RowMajor:ColMajor; \
58 matrix_order = StorageOrder==RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \
|
| /external/eigen/Eigen/src/Core/ |
| DiagonalProduct.h | 69 StorageOrder = Flags & RowMajorBit ? RowMajor : ColMajor
74 ((int(StorageOrder) == RowMajor && int(ProductOrder) == OnTheLeft)
75 ||(int(StorageOrder) == ColMajor && int(ProductOrder) == OnTheRight)), internal::true_type, internal::false_type>::type());
|
| GeneralProduct.h | 225 template<int StorageOrder> struct outer_product_selector;
299 template<int Side, int StorageOrder, bool BlasCompatible>
334 template<int StorageOrder, bool BlasCompatible>
335 struct gemv_selector<OnTheLeft,StorageOrder,BlasCompatible>
341 enum { OtherStorageOrder = StorageOrder == RowMajor ? ColMajor : RowMajor };
|
| SolveTriangular.h | 19 template<typename LhsScalar, typename RhsScalar, typename Index, int Side, int Mode, bool Conjugate, int StorageOrder>
|
| /external/eigen/Eigen/src/Core/util/ |
| BlasUtil.h | 24 template<typename Scalar, typename Index, int nr, int StorageOrder, bool Conjugate = false, bool PanelMode=false>
27 template<typename Scalar, typename Index, int Pack1, int Pack2, int StorageOrder, bool Conjugate = false, bool PanelMode = false>
122 template<typename Scalar, typename Index, int StorageOrder>
128 { return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; }
135 template<typename Scalar, typename Index, int StorageOrder>
141 { return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; }
|
| /external/eigen/blas/ |
| BandTriangularSolver.h | 18 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, int StorageOrder>
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 379 template<int StorageOrder,typename RealScalar, typename Scalar, typename Index>
736 template<int StorageOrder,typename RealScalar, typename Scalar, typename Index>
778 // FIXME if StorageOrder == RowMajor this operation is not very efficient
779 Map<Matrix<Scalar,Dynamic,Dynamic,StorageOrder> > q(matrixQ,n,n);
|
| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 23 int StorageOrder = int(traits<Lhs>::Flags) & RowMajorBit>
203 int StorageOrder = int(Lhs::Flags) & (RowMajorBit)>
|
| SparseSelfAdjointView.h | 100 template<typename DestScalar,int StorageOrder> void evalTo(SparseMatrix<DestScalar,StorageOrder,Index>& _dest) const
|
