/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/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/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 666 Operator *LU = dyn_cast<Operator>(L); local 667 if (!LU) 669 unsigned Opcode = LU->getOpcode(); 678 Value *LL = LU->getOperand(0); 679 Value *LR = LU->getOperand(1);
|
H A D | ScalarEvolution.cpp | 485 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); local 490 const Value *LV = LU->getValue(), *RV = RU->getValue();
|
/external/llvm/lib/IR/ |
H A D | LegacyPassManager.cpp | 575 SmallPtrSet<Pass *, 8> &LU = DMI->second; 576 for (SmallPtrSet<Pass *, 8>::iterator I = LU.begin(), 577 E = LU.end(); I != E; ++I) { 1691 SmallVector<Pass *, 1> LU; local 1692 LU.push_back(FoundPass); 1693 FPP->setLastUser(LU, P);
|
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/ |
H A D | RegionDataConstants.java | 686 LU(new String[]{ enum constant in enum:RegionDataConstants.RegionDataEnum
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 841 /// folded in \p LU at isel time. 843 /// This function returns true if \p LU can accommodate what \p F 850 const LSRUse &LU, const Formula &F); 851 // Get the cost of the scaling factor used in F for LU. 853 const LSRUse &LU, const Formula &F); 900 const LSRUse &LU, 992 const LSRUse &LU, 1023 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(TTI, LU, F))); 1027 ScaleCost += getScalingFactorCost(TTI, LU, F); 1496 const LSRUse &LU, cons 985 RateFormula(const TargetTransformInfo &TTI, const Formula &F, SmallPtrSet<const SCEV *, 16> &Regs, const DenseSet<const SCEV *> &VisitedRegs, const Loop *L, const SmallVectorImpl<int64_t> &Offsets, ScalarEvolution &SE, DominatorTree &DT, const LSRUse &LU, SmallPtrSet<const SCEV *, 16> *LoserRegs) argument 1495 isAMCompletelyFolded(const TargetTransformInfo &TTI, const LSRUse &LU, const Formula &F) argument 1502 getScalingFactorCost(const TargetTransformInfo &TTI, const LSRUse &LU, const Formula &F) argument 2245 reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg, LSRUse::KindType Kind, Type *AccessTy) argument 2306 LSRUse &LU = Uses[LUIdx]; local 2316 LSRUse &LU = Uses[LUIdx]; local 2329 DeleteUse(LSRUse &LU, size_t LUIdx) argument 2345 LSRUse &LU = Uses[LUIdx]; local 3047 LSRUse &LU = Uses[LF.LUIdx]; local 3068 InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) argument 3082 InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) argument 3103 InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) argument 3186 LSRUse &LU = Uses[LF.LUIdx]; local 3263 GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx, const Formula &Base, unsigned Depth, size_t Idx, bool IsScaledReg) argument 3347 GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base, unsigned Depth) argument 3364 GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3399 GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx, const Formula &Base, size_t Idx, bool IsScaledReg) argument 3418 GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3431 GenerateConstantOffsetsImpl( LSRUse &LU, unsigned LUIdx, const Formula &Base, const SmallVectorImpl<int64_t> &Worklist, size_t Idx, bool IsScaledReg) argument 3476 GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3494 GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3583 GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3646 GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) argument 3793 LSRUse &LU = Uses[LUIdx]; local 3884 LSRUse &LU = Uses[LUIdx]; local 3891 LSRUse &LU = Uses[LUIdx]; local 3902 LSRUse &LU = Uses[LUIdx]; local 3931 LSRUse &LU = Uses[LUIdx]; local 4053 LSRUse &LU = Uses[LUIdx]; local 4118 LSRUse &LU = Uses[LUIdx]; local 4244 LSRUse &LU = Uses[LUIdx]; local 4298 const LSRUse &LU = Uses[Workspace.size()]; local 4458 AdjustInsertPositionForExpand(BasicBlock::iterator LowestIP, const LSRFixup &LF, const LSRUse &LU, SCEVExpander &Rewriter) const argument 4528 const LSRUse &LU = Uses[LF.LUIdx]; local 4955 const LSRUse &LU = *I; local 5004 const LSRUse &LU = *I; local [all...] |