Searched defs:LU (Results 1 - 10 of 10) sorted by relevance

/external/eigen/bench/btl/actions/
H A Daction_lu_solve.hh65 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 DLU.h16 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/eigen/bench/btl/libs/blitz/
H A Dblitz_LU_solve_interface.hh87 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 Dgmm_LU_solve_interface.hh87 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 Dmtl4_LU_solve_interface.hh87 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/llvm/tools/verify-uselistorder/
H A Dverify-uselistorder.cpp310 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/llvm/lib/IR/
H A DLegacyPassManager.cpp563 SmallPtrSet<Pass *, 8> &LU = DMI->second;
564 for (Pass *LUP : LU) {
1681 SmallVector<Pass *, 1> LU; local
1682 LU.push_back(FoundPass);
1683 FPP->setLastUser(LU, P);
/external/llvm/lib/Analysis/
H A DScalarEvolution.cpp480 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); local
485 const Value *LV = LU->getValue(), *RV = RU->getValue();
H A DValueTracking.cpp1404 Operator *LU = dyn_cast<Operator>(L); local
1405 if (!LU)
1407 unsigned Opcode = LU->getOpcode();
1416 Value *LL = LU->getOperand(0);
1417 Value *LR = LU->getOperand(1);
/external/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp845 /// 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...]

Completed in 168 milliseconds