| /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);
48 typedef Matrix<Scalar,K,N> Rhs; Rhs b; b.setRandom();
|
| /external/gemmlowp/internal/ |
| kernel.h | 30 // RHS = "right-hand side"
31 // Sometimes when referring to either LHS or RHS, we just say a "Side".
36 // of the result (and of the RHS).
38 // In each of the LHS and RHS matrices, we call 'width' the
40 // is the number of rows, while in the RHS, 'width' is the number
44 // And in the RHS KxN matrix, the depth is K and the width in N.
48 // RHS width
51 // | RHS | | Depth
64 // Kernels operate on small LHS and RHS blocks that fit in registers.
72 // while in the RHS, width-major means column-major
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| PointerArithChecker.cpp | 324 const Expr *Rhs = BOp->getRHS();
327 if (Rhs->getType()->isIntegerType() && Lhs->getType()->isPointerType()) {
328 SVal RHSVal = State->getSVal(Rhs, C.getLocationContext());
334 if (Lhs->getType()->isIntegerType() && Rhs->getType()->isPointerType()) {
338 reportPointerArithMisuse(Rhs, C);
|
| /external/eigen/Eigen/src/Core/ |
| CwiseBinaryOp.h | 17 template<typename BinaryOp, typename Lhs, typename Rhs>
18 struct traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
31 // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor),
36 const typename Rhs::Scalar&
40 typename traits<Rhs>::StorageKind,
43 typename traits<Rhs>::StorageIndex>::type StorageIndex;
45 typedef typename Rhs::Nested RhsNested;
49 Flags = cwise_promote_storage_order<typename traits<Lhs>::StorageKind,typename traits<Rhs>::StorageKind,_LhsNested::Flags & RowMajorBit,_RhsNested::Flags & RowMajorBit>::value
54 template<typename BinaryOp, typename Lhs, typename Rhs, typename StorageKind>
89 typedef typename internal::remove_all<RhsType>::type Rhs;
135 const _RhsNested& rhs() const { return m_rhs; } function in class:Eigen::CwiseBinaryOp
[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> >
23 typedef typename remove_all<Rhs>::type RhsCleaned;
32 internal::product_type<Lhs,Rhs>::ret>::ret StorageKind;
79 typedef _Rhs Rhs;
82 Lhs, Rhs, Option,
84 typename internal::traits<Rhs>::StorageKind,
85 internal::product_type<Lhs,Rhs>::ret>::ret>::Base Base;
89 typedef typename internal::ref_selector<Rhs>::type RhsNested
104 EIGEN_DEVICE_FUNC const RhsNestedCleaned& rhs() const { return m_rhs; } function in class:Eigen::Product
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular.h | 45 const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride,
52 ::run(size,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking);
71 RhsMapper rhs(_rhs,rhsStride);
96 // note that the actual rhs is the transpose/adjoint of mat
97 pack_rhs(blockB, rhs.getSubMapper(k2,0), actual_kc, size);
212 typedef typename internal::remove_all<typename ProductType::RhsNested>::type Rhs;
213 typedef internal::blas_traits<Rhs> RhsBlasTraits;
216 typename internal::add_const_on_value_type<ActualRhs>::type actualRhs = RhsBlasTraits::extract(prod.rhs());
218 Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(prod.lhs().derived()) * RhsBlasTraits::extractScalarFactor(prod.rhs().derived());
234 internal::gemv_static_vector_if<Scalar,Rhs::SizeAtCompileTime,Rhs::MaxSizeAtCompileTime,!UseRhsDirectly> static_rhs
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDenseProduct.h | 30 typedef typename internal::remove_all<DenseRhsType>::type Rhs;
34 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha)
44 for(Index c=0; c<rhs.cols(); ++c)
53 processRow(lhsEval,rhs,res,alpha,i,c);
59 processRow(lhsEval,rhs,res,alpha,i,c);
64 static void processRow(const LhsEval& lhsEval, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha, Index i, Index col)
68 tmp += it.value() * rhs.coeff(it.index(),col);
89 typedef typename internal::remove_all<DenseRhsType>::type Rhs;
92 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha)
95 for(Index c=0; c<rhs.cols(); ++c
[all...] |
| SparseSelfAdjointView.h | 74 /** \returns an expression of the matrix product between a sparse self-adjoint matrix \c *this and a sparse matrix \a rhs.
81 operator*(const SparseMatrixBase<OtherDerived>& rhs) const
83 return Product<SparseSelfAdjointView, OtherDerived>(*this, rhs.derived());
86 /** \returns an expression of the matrix product between a sparse matrix \a lhs and a sparse self-adjoint matrix \a rhs.
93 operator*(const SparseMatrixBase<OtherDerived>& lhs, const SparseSelfAdjointView& rhs)
95 return Product<OtherDerived, SparseSelfAdjointView>(lhs.derived(), rhs);
101 operator*(const MatrixBase<OtherDerived>& rhs) const
103 return Product<SparseSelfAdjointView,OtherDerived>(*this, rhs.derived());
109 operator*(const MatrixBase<OtherDerived>& lhs, const SparseSelfAdjointView& rhs)
111 return Product<OtherDerived,SparseSelfAdjointView>(lhs.derived(), rhs);
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorContractionMapper.h | 18 Rhs = 0,
140 if (side == Rhs && inner_dim_contiguous) {
186 if (side == Rhs && inner_dim_contiguous) {
348 // TODO: we should also enable direct offsets for the Rhs case.
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 33 typedef typename Traits::Rhs Rhs;
37 KroneckerProductBase(const Lhs& A, const Rhs& B)
66 typename Rhs::Nested m_B;
79 * \tparam Rhs Type of the rignt-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)
112 * \tparam Rhs Type of the rignt-hand side, a matrix expression.
114 template<typename Lhs, typename Rhs>
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Transform.h | 49 typename Rhs,
52 transform_traits<Rhs>::IsProjective>
458 * The rhs diagonal matrix is interpreted as an affine scaling transformation. The
1388 Matrix<typename ResultType::Scalar, Dim+1, 1> rhs; local
[all...] |
| /external/gemmlowp/standalone/ |
| neon-gemm-kernel-benchmark.cc | 110 // RHS = "right-hand side"
111 // Sometimes when referring to either LHS or RHS, we just say a "Side".
116 // of the result (and of the RHS).
118 // In each of the LHS and RHS matrices, we call 'width' the
120 // is the number of rows, while in the RHS, 'width' is the number
124 // And in the RHS KxN matrix, the depth is K and the width in N.
128 // RHS width
131 // | RHS | | Depth
144 // Kernels operate on small LHS and RHS blocks that fit in registers.
152 // while in the RHS, width-major means column-major
3702 int8x16_t rhs[Cols]; local
3757 int16x8_t rhs[RhsCells]; local
3823 float32x4_t rhs[RhsCells]; local
3923 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j])); local
3933 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j + 4])); local
4325 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j])); local
4333 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j + 4])); local
4343 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j + 4])); local
4351 v4i32 rhs = reinterpret_cast<v4i32>(__builtin_msa_fill_w(rhs_ptr[j + 8])); local
[all...] |
| /external/clang/lib/CodeGen/ |
| CGObjC.cpp | 148 const Expr *Rhs = ALE->getElement(i);
153 llvm::Value *value = EmitScalarExpr(Rhs);
[all...] |
| /external/clang/lib/Sema/ |
| SemaChecking.cpp | [all...] |
