/bootable/recovery/edify/ |
yydefs.h | 25 #define YYLLOC_DEFAULT(Current, Rhs, N) \ 28 (Current).start = YYRHSLOC(Rhs, 1).start; \ 29 (Current).end = YYRHSLOC(Rhs, N).end; \ 31 (Current).start = YYRHSLOC(Rhs, 0).start; \ 32 (Current).end = YYRHSLOC(Rhs, 0).end; \
|
/external/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Sema/ |
CleanupInfo.h | 39 void mergeFrom(CleanupInfo Rhs) { 40 ExprNeedsCleanups |= Rhs.ExprNeedsCleanups; 41 CleanupsHaveSideEffects |= Rhs.CleanupsHaveSideEffects;
|
/external/eigen/Eigen/src/Core/ |
SolveTriangular.h | 26 template<typename Lhs, typename Rhs, int Side> 31 RhsIsVectorAtCompileTime = (Side==OnTheLeft ? Rhs::ColsAtCompileTime : Rhs::RowsAtCompileTime)==1 35 Unrolling = (RhsIsVectorAtCompileTime && Rhs::SizeAtCompileTime != Dynamic && Rhs::SizeAtCompileTime <= 8) 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 [all...] |
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> > 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/dtc/ |
srcpos.h | 81 #define YYLLOC_DEFAULT(Current, Rhs, N) \ 84 (Current).first_line = YYRHSLOC(Rhs, 1).first_line; \ 85 (Current).first_column = YYRHSLOC(Rhs, 1).first_column; \ 86 (Current).last_line = YYRHSLOC(Rhs, N).last_line; \ 87 (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ 88 (Current).file = YYRHSLOC(Rhs, N).file; \ 91 YYRHSLOC(Rhs, 0).last_line; \ 93 YYRHSLOC(Rhs, 0).last_column; \ 94 (Current).file = YYRHSLOC (Rhs, 0).file; \
|
/external/eigen/Eigen/src/SparseCore/ |
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) 51 typedef typename nested_eval<Rhs,Dynamic>::type RhsNested; 53 RhsNested rhsNested(rhs); 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*>:: (…) [all...] |
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); 29 Index cols = rhs.outerSize(); 31 eigen_assert(lhs.outerSize() == rhs.innerSize()); 43 evaluator<Rhs> rhsEval(rhs); 46 // given a rhs column containing Y non zeros, we assume that the respective Y columns 48 // the product of a rhs column with the lhs is X+Y where X is the average number of non zer [all...] |
SparseSolverBase.h | 19 * The rhs is decomposed into small vertical panels which are solved through dense temporaries. 21 template<typename Decomposition, typename Rhs, typename Dest> 22 typename enable_if<Rhs::ColsAtCompileTime!=1 && Dest::ColsAtCompileTime!=1>::type 23 solve_sparse_through_dense_panels(const Decomposition &dec, const Rhs& rhs, Dest &dest) 27 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix. 29 Index rhsCols = rhs.cols(); 30 Index size = rhs.rows(); 38 tmp.leftCols(actualCols) = rhs.middleCols(k,actualCols); 44 // Overload for vector as 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) 24 Index cols = rhs.outerSize(); 25 eigen_assert(lhs.outerSize() == rhs.innerSize()); 34 evaluator<Rhs> rhsEval(rhs); 37 // given a rhs column containing Y non zeros, we assume that the respective Y columns 39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero 41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs [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; 42 enum { CoeffReadCost = HugeCost, Flags = Rhs::Flags&RowMajorBit, Alignment = 0 }; // FIXME CoeffReadCost & Flags 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 [all...] |
/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...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
ScopeExit.h | 33 scope_exit(scope_exit &&Rhs) : ExitFunction(std::move(Rhs.ExitFunction)) {}
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
ScopeExit.h | 33 scope_exit(scope_exit &&Rhs) : ExitFunction(std::move(Rhs.ExitFunction)) {}
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
ScopeExit.h | 33 scope_exit(scope_exit &&Rhs) : ExitFunction(std::move(Rhs.ExitFunction)) {}
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
ScopeExit.h | 33 scope_exit(scope_exit &&Rhs) : ExitFunction(std::move(Rhs.ExitFunction)) {}
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
ScopeExit.h | 33 scope_exit(scope_exit &&Rhs) : ExitFunction(std::move(Rhs.ExitFunction)) {}
|