Searched refs:LU (Results 1 - 25 of 57) sorted by relevance

123

/external/llvm/lib/Support/
H A Dregex2.h75 #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 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/eigen/doc/examples/
H A DTutorial_PartialLU_solve.cpp2 #include <Eigen/LU>
/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/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp841 /// 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...]
/external/jemalloc/include/jemalloc/internal/
H A Dbitmap.h85 return (!(g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK))));
100 assert(g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK)));
101 g ^= 1LU << (bit & BITMAP_GROUP_NBITS_MASK);
112 assert(g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK)));
113 g ^= 1LU << (bit & BITMAP_GROUP_NBITS_MASK);
158 assert((g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK))) == 0);
159 g ^= 1LU << (bit & BITMAP_GROUP_NBITS_MASK);
171 assert((g & (1LU << (bit & BITMAP_GROUP_NBITS_MASK)))
173 g ^= 1LU << (bit & BITMAP_GROUP_NBITS_MASK);
/external/eigen/test/eigen2/
H A Deigen2_lu.cpp11 #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 Deigen2_inverse.cpp12 #include <Eigen/LU>
H A Deigen2_alignedbox.cpp12 #include <Eigen/LU>
H A Deigen2_determinant.cpp12 #include <Eigen/LU>
H A Deigen2_parametrizedline.cpp13 #include <Eigen/LU>
H A Deigen2_prec_inverse_4x4.cpp11 #include <Eigen/LU>
H A Deigen2_cholesky.cpp13 #include <Eigen/LU>
H A Dsparse.h27 #include <Eigen/LU>
/external/oprofile/daemon/
H A Dopd_trans.h75 return kernel_pointer_size == 4 ? code == ~0LU : code == ~0LLU;
/external/eigen/test/
H A Dprec_inverse_4x4.cpp11 #include <Eigen/LU>
H A Ddeterminant.cpp12 #include <Eigen/LU>
H A Dinverse.cpp12 #include <Eigen/LU>
/external/eigen/unsupported/test/
H A Dmpreal_support.cpp3 #include <Eigen/LU>
41 // partial LU
/external/eigen/bench/
H A Dsparse_lu.cpp43 #include <Eigen/LU>
/external/eigen/bench/spbench/
H A Dsp_solver.cpp10 #include <Eigen/LU>
/external/eigen/lapack/
H A Dlu.cpp11 #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

Completed in 204 milliseconds

123