/external/llvm/lib/Support/ |
H A D | regex2.h | 75 #define OEND (1LU<<OPSHIFT) /* endmarker - */ 76 #define OCHAR (2LU<<OPSHIFT) /* character unsigned char */ 77 #define OBOL (3LU<<OPSHIFT) /* left anchor - */ 78 #define OEOL (4LU<<OPSHIFT) /* right anchor - */ 79 #define OANY (5LU<<OPSHIFT) /* . - */ 80 #define OANYOF (6LU<<OPSHIFT) /* [...] set number */ 81 #define OBACK_ (7LU<<OPSHIFT) /* begin \d paren number */ 82 #define O_BACK (8LU<<OPSHIFT) /* end \d paren number */ 83 #define OPLUS_ (9LU<<OPSHIFT) /* + prefix fwd to suffix */ 84 #define O_PLUS (10LU<<OPSHIF [all...] |
/external/eigen/bench/btl/libs/blitz/ |
H A D | blitz_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 90 ASSERT( LU.rows()==LU.cols() ) ; 100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; 111 theSum = LU( i, j ) ; 112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; 113 // theSum -= sum( LU( i, Range( fromStart, i-1 ) )*LU( Rang 150 LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument [all...] |
/external/eigen/bench/btl/libs/gmm/ |
H A D | gmm_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 90 ASSERT( LU.rows()==LU.cols() ) ; 100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; 111 theSum = LU( i, j ) ; 112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; 113 // theSum -= sum( LU( i, Range( fromStart, i-1 ) )*LU( Rang 150 LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument [all...] |
/external/eigen/bench/btl/libs/mtl4/ |
H A D | mtl4_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 90 ASSERT( LU.rows()==LU.cols() ) ; 100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; 111 theSum = LU( i, j ) ; 112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; 113 // theSum -= sum( LU( i, Range( fromStart, i-1 ) )*LU( Rang 150 LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument [all...] |
/external/eigen/doc/examples/ |
H A D | Tutorial_PartialLU_solve.cpp | 2 #include <Eigen/LU>
|
/external/eigen/bench/btl/actions/ |
H A D | action_lu_solve.hh | 65 typename Interface::gene_matrix LU; local 70 Interface::matrix_from_stl(LU,A_stl); 87 // LU factorization 88 Interface::copy_matrix(A,LU,size); 89 Interface::LU_factor(LU,pivot,size); 91 // LU solve 93 Interface::LU_solve(LU,pivot,B,X,size);
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | LU.h | 16 class LU : public FullPivLU<MatrixType> class in namespace:Eigen 49 explicit LU(const T& t) : Base(t), m_originalMatrix(t) {} function in class:Eigen::LU 89 * \return the partial-pivoting LU decomposition of \c *this. 94 inline const LU<typename MatrixBase<Derived>::PlainObject> 97 return LU<PlainObject>(eval()); 106 * \return the partial-pivoting LU decomposition of \c *this. 111 inline const LU<typename MatrixBase<Derived>::PlainObject> 114 return LU<PlainObject>(eval());
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 845 /// folded in \p LU at isel time. 847 /// This function returns true if \p LU can accommodate what \p F 854 const LSRUse &LU, const Formula &F); 855 // Get the cost of the scaling factor used in F for LU. 857 const LSRUse &LU, const Formula &F); 904 const LSRUse &LU, 996 const LSRUse &LU, 1025 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(TTI, LU, F))); 1029 ScaleCost += getScalingFactorCost(TTI, LU, F); 1484 const LSRUse &LU, cons 989 RateFormula(const TargetTransformInfo &TTI, const Formula &F, SmallPtrSetImpl<const SCEV *> &Regs, const DenseSet<const SCEV *> &VisitedRegs, const Loop *L, const SmallVectorImpl<int64_t> &Offsets, ScalarEvolution &SE, DominatorTree &DT, const LSRUse &LU, SmallPtrSetImpl<const SCEV *> *LoserRegs) argument 1483 isAMCompletelyFolded(const TargetTransformInfo &TTI, const LSRUse &LU, const Formula &F) argument 1490 getScalingFactorCost(const TargetTransformInfo &TTI, const LSRUse &LU, const Formula &F) argument 2222 reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg, LSRUse::KindType Kind, MemAccessTy AccessTy) argument 2286 LSRUse &LU = Uses[LUIdx]; local 2296 LSRUse &LU = Uses[LUIdx]; local 2309 DeleteUse(LSRUse &LU, size_t LUIdx) argument 2325 LSRUse &LU = Uses[LUIdx]; local 3016 LSRUse &LU = Uses[LF.LUIdx]; local 3036 InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) argument 3050 InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) argument 3069 InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) argument 3159 LSRUse &LU = Uses[LF.LUIdx]; local 3235 GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx, const Formula &Base, unsigned Depth, size_t Idx, bool IsScaledReg) argument 3318 GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base, unsigned Depth) argument 3335 GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3368 GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx, const Formula &Base, size_t Idx, bool IsScaledReg) argument 3387 GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3400 GenerateConstantOffsetsImpl( LSRUse &LU, unsigned LUIdx, const Formula &Base, const SmallVectorImpl<int64_t> &Worklist, size_t Idx, bool IsScaledReg) argument 3443 GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3461 GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3547 GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3607 GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3742 LSRUse &LU = Uses[LUIdx]; local 3830 LSRUse &LU = Uses[LUIdx]; local 3837 LSRUse &LU = Uses[LUIdx]; local 3848 LSRUse &LU = Uses[LUIdx]; local 3877 LSRUse &LU = Uses[LUIdx]; local 3994 LSRUse &LU = Uses[LUIdx]; local 4058 LSRUse &LU = Uses[LUIdx]; local 4177 LSRUse &LU = Uses[LUIdx]; local 4231 const LSRUse &LU = Uses[Workspace.size()]; local 4381 AdjustInsertPositionForExpand(BasicBlock::iterator LowestIP, const LSRFixup &LF, const LSRUse &LU, SCEVExpander &Rewriter) const argument 4450 const LSRUse &LU = Uses[LF.LUIdx]; local [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_lu.cpp | 11 #include <Eigen/LU> 38 LU.h 52 LU<MatrixType> lu(m1); 53 typename LU<MatrixType>::KernelResultType m1kernel = lu.kernel(); 54 typename LU<MatrixType>::ImageResultType m1image = lu.image(); 80 LU.h 95 LU<MatrixType> lu(m1);
|
H A D | eigen2_inverse.cpp | 12 #include <Eigen/LU>
|
H A D | eigen2_alignedbox.cpp | 12 #include <Eigen/LU>
|
H A D | eigen2_determinant.cpp | 12 #include <Eigen/LU>
|
H A D | eigen2_parametrizedline.cpp | 13 #include <Eigen/LU>
|
H A D | eigen2_prec_inverse_4x4.cpp | 11 #include <Eigen/LU>
|
H A D | eigen2_cholesky.cpp | 13 #include <Eigen/LU>
|
H A D | sparse.h | 27 #include <Eigen/LU>
|
/external/eigen/test/ |
H A D | prec_inverse_4x4.cpp | 11 #include <Eigen/LU>
|
H A D | determinant.cpp | 12 #include <Eigen/LU>
|
H A D | inverse.cpp | 12 #include <Eigen/LU>
|
H A D | eigensolver_complex.cpp | 14 #include <Eigen/LU>
|
/external/eigen/unsupported/test/ |
H A D | mpreal_support.cpp | 3 #include <Eigen/LU> 41 // partial LU
|
/external/llvm/tools/verify-uselistorder/ |
H A D | verify-uselistorder.cpp | 310 auto LU = L->use_begin(), LE = L->use_end(); local 312 skipUnmappedUsers(LU, LE, LM); 315 while (LU != LE) { 320 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) { 324 if (LU->getOperandNo() != RU->getOperandNo()) { 328 skipUnmappedUsers(++LU, LE, LM);
|
/external/eigen/bench/ |
H A D | sparse_lu.cpp | 43 #include <Eigen/LU>
|
/external/eigen/bench/spbench/ |
H A D | sp_solver.cpp | 10 #include <Eigen/LU>
|
/external/eigen/lapack/ |
H A D | lu.cpp | 11 #include <Eigen/LU> 13 // computes an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges 45 // with a general N-by-N matrix A using the LU factorization computed by GETRF
|