| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 19 template<typename Lhs, typename Rhs, typename ResultType>
20 static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance)
22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
24 typedef typename remove_all<Lhs>::type::Scalar Scalar;
25 typedef typename remove_all<Lhs>::type::StorageIndex StorageIndex;
28 Index rows = lhs.innerSize();
30 //Index size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
42 evaluator<Lhs> lhsEval(lhs)
[all...] |
| SparseProduct.h | 37 template<typename Lhs, typename Rhs, int ProductType>
38 struct generic_product_impl<Lhs, Rhs, SparseShape, SparseShape, ProductType>
41 static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs)
43 evalTo(dst, lhs, rhs, typename evaluator_traits<Dest>::Shape());
48 static void addTo(Dest& dst, const ActualLhs& lhs, const Rhs& rhs, typename enable_if<is_same<typename evaluator_traits<Dest>::Shape,DenseShape>::value,int*>::type* = 0)
52 LhsNested lhsNested(lhs);
60 static void subTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, typename enable_if<is_same<typename evaluator_traits<Dest>::Shape,DenseShape>::value,int*>::type* = 0)
62 addTo(dst, -lhs, rhs)
[all...] |
| ConservativeSparseSparseProduct.h | 17 template<typename Lhs, typename Rhs, typename ResultType>
18 static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, bool sortedInsertion = false)
20 typedef typename remove_all<Lhs>::type::Scalar Scalar;
23 Index rows = lhs.innerSize();
25 eigen_assert(lhs.outerSize() == rhs.innerSize());
33 evaluator<Lhs> lhsEval(lhs);
38 // of the lhs differs in average of one non zeros, thus the number of non zeros for
39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zer
[all...] |
| SparseDiagonalProduct.h | 37 template<typename Lhs, typename Rhs, int ProductTag>
38 struct product_evaluator<Product<Lhs, Rhs, DefaultProduct>, ProductTag, DiagonalShape, SparseShape>
39 : public sparse_diagonal_product_evaluator<Rhs, typename Lhs::DiagonalVectorType, Rhs::Flags&RowMajorBit?SDP_AsScalarProduct:SDP_AsCwiseProduct>
41 typedef Product<Lhs, Rhs, DefaultProduct> XprType;
44 typedef sparse_diagonal_product_evaluator<Rhs, typename Lhs::DiagonalVectorType, Rhs::Flags&RowMajorBit?SDP_AsScalarProduct:SDP_AsCwiseProduct> Base;
45 explicit product_evaluator(const XprType& xpr) : Base(xpr.rhs(), xpr.lhs().diagonal()) {}
48 template<typename Lhs, typename Rhs, int ProductTag>
49 struct product_evaluator<Product<Lhs, Rhs, DefaultProduct>, ProductTag, SparseShape, DiagonalShape>
50 : public sparse_diagonal_product_evaluator<Lhs, Transpose<const typename Rhs::DiagonalVectorType>, Lhs::Flags&RowMajorBit?SDP_AsCwiseProduct:SDP_AsScalarProduct
[all...] |
| SparseDenseProduct.h | 29 typedef typename internal::remove_all<SparseLhsType>::type Lhs;
32 typedef typename evaluator<Lhs>::InnerIterator LhsInnerIterator;
33 typedef evaluator<Lhs> LhsEval;
34 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha)
36 LhsEval lhsEval(lhs);
38 Index n = lhs.outerSize();
88 typedef typename internal::remove_all<SparseLhsType>::type Lhs;
91 typedef typename evaluator<Lhs>::InnerIterator LhsInnerIterator;
92 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha)
94 evaluator<Lhs> lhsEval(lhs)
[all...] |
| TriangularSolver.h | 17 template<typename Lhs, typename Rhs, int Mode,
23 int StorageOrder = int(traits<Lhs>::Flags) & RowMajorBit>
27 template<typename Lhs, typename Rhs, int Mode>
28 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,RowMajor>
31 typedef evaluator<Lhs> LhsEval;
32 typedef typename evaluator<Lhs>::InnerIterator LhsIterator;
33 static void run(const Lhs& lhs, Rhs& other)
35 LhsEval lhsEval(lhs);
38 for(Index i=0; i<lhs.rows(); ++i
[all...] |
| SparseCwiseBinaryOp.h | 35 template<typename BinaryOp, typename Lhs, typename Rhs>
36 class CwiseBinaryOpImpl<BinaryOp, Lhs, Rhs, Sparse>
37 : public SparseMatrixBase<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
40 typedef CwiseBinaryOp<BinaryOp, Lhs, Rhs> Derived;
46 (!internal::is_same<typename internal::traits<Lhs>::StorageKind,
48 || ((internal::evaluator<Lhs>::Flags&RowMajorBit) == (internal::evaluator<Rhs>::Flags&RowMajorBit))),
59 template<typename BinaryOp, typename Lhs, typename Rhs>
60 struct binary_evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs>, IteratorBased, IteratorBased>
61 : evaluator_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
64 typedef typename evaluator<Lhs>::InnerIterator LhsIterator
[all...] |
| SparsePermutation.h | 92 // typename traits<permutation_sparse_matrix_product<Rhs,Lhs,OnTheRight,false> >::ReturnType
95 template<typename Lhs, typename Rhs, int ProductTag>
96 struct product_evaluator<Product<Lhs, Rhs, AliasFreeProduct>, ProductTag, PermutationShape, SparseShape>
99 typedef Product<Lhs, Rhs, AliasFreeProduct> XprType;
111 generic_product_impl<Lhs, Rhs, PermutationShape, SparseShape, ProductTag>::evalTo(m_result, xpr.lhs(), xpr.rhs());
118 template<typename Lhs, typename Rhs, int ProductTag>
119 struct product_evaluator<Product<Lhs, Rhs, AliasFreeProduct>, ProductTag, SparseShape, PermutationShape >
120 : public evaluator<typename permutation_matrix_product<Lhs,OnTheRight,false,SparseShape>::ReturnType>
122 typedef Product<Lhs, Rhs, AliasFreeProduct> XprType
[all...] |
| SparseUtil.h | 58 template<typename Lhs, typename Rhs> class SparseDiagonalProduct;
61 template<typename Lhs, typename Rhs> class SparseSparseProduct;
62 template<typename Lhs, typename Rhs> class SparseTimeDenseProduct;
63 template<typename Lhs, typename Rhs> class DenseTimeSparseProduct;
64 template<typename Lhs, typename Rhs, bool Transpose> class SparseDenseOuterProduct;
66 template<typename Lhs, typename Rhs> struct SparseSparseProductReturnType;
67 template<typename Lhs, typename Rhs,
68 int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct DenseSparseProductReturnType;
70 template<typename Lhs, typename Rhs,
71 int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct SparseDenseProductReturnType
[all...] |
| /external/eigen/Eigen/src/Core/ |
| ProductEvaluators.h | 28 template<typename Lhs, typename Rhs, int Options>
29 struct evaluator<Product<Lhs, Rhs, Options> >
30 : public product_evaluator<Product<Lhs, Rhs, Options> >
32 typedef Product<Lhs, Rhs, Options> XprType;
40 template<typename Lhs, typename Rhs, typename Scalar1, typename Scalar2, typename Plain1>
43 const Product<Lhs, Rhs, DefaultProduct> > >
47 template<typename Lhs, typename Rhs, typename Scalar1, typename Scalar2, typename Plain1>
50 const Product<Lhs, Rhs, DefaultProduct> > >
51 : public evaluator<Product<EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(Scalar1,Lhs,product), Rhs, DefaultProduct> >
55 const Product<Lhs, Rhs, DefaultProduct> > XprType
[all...] |
| Product.h | 15 template<typename Lhs, typename Rhs, int Option, typename StorageKind> class ProductImpl;
19 template<typename Lhs, typename Rhs, int Option>
20 struct traits<Product<Lhs, Rhs, Option> >
22 typedef typename remove_all<Lhs>::type LhsCleaned;
32 internal::product_type<Lhs,Rhs>::ret>::ret StorageKind;
78 typedef _Lhs Lhs;
82 Lhs, Rhs, Option,
83 typename internal::product_promote_storage_type<typename internal::traits<Lhs>::StorageKind,
85 internal::product_type<Lhs,Rhs>::ret>::ret>::Base Base;
88 typedef typename internal::ref_selector<Lhs>::type LhsNested
103 EIGEN_DEVICE_FUNC const LhsNestedCleaned& lhs() const { return m_lhs; } function in class:Eigen::Product
[all...] |
| SolveTriangular.h | 26 template<typename Lhs, typename Rhs, int Side>
41 template<typename Lhs, typename Rhs,
44 int Unrolling = trsolve_traits<Lhs,Rhs,Side>::Unrolling,
45 int RhsVectors = trsolve_traits<Lhs,Rhs,Side>::RhsVectors
49 template<typename Lhs, typename Rhs, int Side, int Mode>
50 struct triangular_solver_selector<Lhs,Rhs,Side,Mode,NoUnrolling,1>
52 typedef typename Lhs::Scalar LhsScalar;
54 typedef blas_traits<Lhs> LhsProductTraits;
57 static void run(const Lhs& lhs, Rhs& rhs
[all...] |
| CwiseBinaryOp.h | 17 template<typename BinaryOp, typename Lhs, typename Rhs>
18 struct traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
20 // we must not inherit from traits<Lhs> since it has
22 typedef typename remove_all<Lhs>::type Ancestor;
31 // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor),
35 const typename Lhs::Scalar&,
39 typedef typename cwise_promote_storage_type<typename traits<Lhs>::StorageKind,
42 typedef typename promote_index_type<typename traits<Lhs>::StorageIndex,
44 typedef typename Lhs::Nested LhsNested;
49 Flags = cwise_promote_storage_order<typename traits<Lhs>::StorageKind,typename traits<Rhs>::StorageKind,_LhsNested::Flags & RowMajorBit,_RhsNested::Flags (…)
132 const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::CwiseBinaryOp
[all...] |
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 32 typedef typename Traits::Lhs Lhs;
37 KroneckerProductBase(const Lhs& A, const Rhs& B)
65 typename Lhs::Nested m_A;
78 * \tparam Lhs Type of the left-hand side, a matrix expression.
81 template<typename Lhs, typename Rhs>
82 class KroneckerProduct : public KroneckerProductBase<KroneckerProduct<Lhs,Rhs> >
91 KroneckerProduct(const Lhs& A, const Rhs& B)
111 * \tparam Lhs Type of the left-hand side, a matrix expression.
114 template<typename Lhs, typename Rhs
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 15 template<typename Lhs, typename Rhs, int ProductMode>
17 typedef const typename internal::nested_eval<Lhs, Rhs::RowsAtCompileTime>::type LhsNested;
18 typedef const typename internal::nested_eval<Rhs, Lhs::RowsAtCompileTime>::type RhsNested;
75 template<typename Lhs, typename Rhs>
76 EIGEN_STRONG_INLINE SkylineProduct(const Lhs& lhs, const Rhs& rhs)
77 : m_lhs(lhs), m_rhs(rhs) {
78 eigen_assert(lhs.cols() == rhs.rows());
105 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { function in class:Eigen::internal::SkylineProduct
121 template<typename Lhs, typename Rhs, typename Dest
[all...] |
| SkylineUtil.h | 22 template<typename Lhs, typename Rhs, int ProductMode> class SkylineProduct;
71 template<typename Lhs, typename Rhs> struct skyline_product_mode;
72 template<typename Lhs, typename Rhs, int ProductMode = skyline_product_mode<Lhs,Rhs>::value> struct SkylineProductReturnType;
|
| /external/gemmlowp/internal/ |
| kernel_reference.h | 39 "reference(Lhs: %d cells %dx%d %s, Rhs: %d cells %dx%d %s)",
40 Format::Lhs::kCells, Format::Lhs::Cell::kWidth,
41 Format::Lhs::Cell::kDepth,
42 CellOrderName(Format::Lhs::Cell::kOrder), Format::Rhs::kCells,
59 // The next two loops are over cells of the Lhs (stacked vertically),
61 for (int rc = 0; rc < Format::Lhs::kCells; rc++) {
63 lhs_ptr + (dc * Format::Lhs::kCells + rc) *
64 Format::Lhs::Cell::kWidth * Format::kDepth;
70 // Now we are inside one cell of the Lhs and inside one cel
[all...] |
| simd_wrappers.h | 40 inline void MulAdd(std::int32_t lhs, std::int32_t rhs, std::int32_t* acc) {
41 *acc += lhs * rhs;
77 static RegisterBlockType Run(const RegisterBlockType& lhs,
81 result.buf.reg[i] = Add(lhs.buf.reg[i], rhs.buf.reg[i]);
88 RegisterBlockType RegisterBlockAdd(const RegisterBlockType& lhs,
90 return RegisterBlockAddImpl<RegisterBlockType>::Run(lhs, rhs);
106 static const FlippedLhsType& FlippedLhs(const LhsType& lhs,
108 return lhs;
110 static const FlippedRhsType& FlippedRhs(const LhsType& lhs,
120 static const FlippedLhsType& FlippedLhs(const LhsType& lhs,
[all...] |
| kernel.h | 29 // LHS = "left-hand side"
31 // Sometimes when referring to either LHS or RHS, we just say a "Side".
35 // of the result (and of the LHS), and N is the number of columns
38 // In each of the LHS and RHS matrices, we call 'width' the
39 // other dimension, besides the depth. So in the LHS, 'width'
43 // So in the LHS MxK matrix, the depth is K and the width in M.
55 // LHS width | |H | | Result |
64 // Kernels operate on small LHS and RHS blocks that fit in registers.
71 // storage orders. In the LHS, width-major means row-major,
76 // We aim to treat both sides, LHS and RHS, on an equal footing
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 55 template<typename MatrixType,typename Lhs> struct homogeneous_left_product_impl;
88 template<typename Lhs> friend
89 EIGEN_DEVICE_FUNC inline const Product<Lhs,Homogeneous>
90 operator* (const MatrixBase<Lhs>& lhs, const Homogeneous& rhs)
93 return Product<Lhs,Homogeneous>(lhs.derived(),rhs);
98 operator* (const Transform<Scalar,Dim,Mode,Options>& lhs, const Homogeneous& rhs)
101 return Product<Transform<Scalar,Dim,Mode,Options>, Homogeneous>(lhs,rhs);
238 template<typename MatrixType,typename Lhs>
[all...] |
| /external/libchrome/base/numerics/ |
| safe_conversions_impl.h | 447 template <typename Lhs,
450 (MaxExponent<Lhs>::value > MaxExponent<Rhs>::value)
455 template <typename Lhs, typename Rhs>
456 struct MaxExponentPromotion<Lhs, Rhs, LEFT_PROMOTION> {
457 using type = Lhs;
460 template <typename Lhs, typename Rhs>
461 struct MaxExponentPromotion<Lhs, Rhs, RIGHT_PROMOTION> {
466 template <typename Lhs,
469 std::is_signed<Lhs>::value
471 ? (MaxExponent<Lhs>::value > MaxExponent<Rhs>::valu
[all...] |
| /external/pdfium/third_party/base/numerics/ |
| safe_conversions_impl.h | 391 template <typename Lhs,
394 (MaxExponent<Lhs>::value > MaxExponent<Rhs>::value)
399 template <typename Lhs, typename Rhs>
400 struct MaxExponentPromotion<Lhs, Rhs, LEFT_PROMOTION> {
401 using type = Lhs;
404 template <typename Lhs, typename Rhs>
405 struct MaxExponentPromotion<Lhs, Rhs, RIGHT_PROMOTION> {
410 template <typename Lhs,
413 std::is_signed<Lhs>::value
415 ? (MaxExponent<Lhs>::value > MaxExponent<Rhs>::valu
[all...] |
| /external/v8/src/base/ |
| logging.h | 67 #define CHECK_OP(name, op, lhs, rhs) \
70 typename ::v8::base::pass_value_or_ref<decltype(lhs)>::type, \
72 (lhs), (rhs), #lhs " " #op " " #rhs)) { \
78 #define DCHECK_OP(name, op, lhs, rhs) \
81 typename ::v8::base::pass_value_or_ref<decltype(lhs)>::type, \
83 (lhs), (rhs), #lhs " " #op " " #rhs)) { \
94 #define CHECK_OP(name, op, lhs, rhs) \
97 typename ::v8::base::pass_value_or_ref<decltype(lhs)>::type,
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| ImportedFunctionsInliningStatistics.cpp | 195 [&](const SortedNodesTy::value_type &Lhs,
197 if (Lhs->second->NumberOfInlines != Rhs->second->NumberOfInlines)
198 return Lhs->second->NumberOfInlines > Rhs->second->NumberOfInlines;
199 if (Lhs->second->NumberOfRealInlines !=
201 return Lhs->second->NumberOfRealInlines >
203 return Lhs->first() < Rhs->first();
|
| /external/eigen/bench/ |
| product_threshold.cpp | 38 template<int Mode, typename Lhs, typename Rhs, typename Res>
39 EIGEN_DONT_INLINE void prod(const Lhs& a, const Rhs& b, Res& c)
41 c.noalias() += typename ProductReturnType<Lhs,Rhs,Mode>::Type(a,b);
47 typedef Matrix<Scalar,M,K> Lhs; Lhs a; a.setRandom();
|
