| /external/llvm/lib/Support/ |
| 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<<OPSHIFT) /* + suffix back to prefix *
[all...] |
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regex2.h | 72 #define OEND (1LU<<OPSHIFT) /* endmarker - */
73 #define OCHAR (2LU<<OPSHIFT) /* character unsigned char */
74 #define OBOL (3LU<<OPSHIFT) /* left anchor - */
75 #define OEOL (4LU<<OPSHIFT) /* right anchor - */
76 #define OANY (5LU<<OPSHIFT) /* . - */
77 #define OANYOF (6LU<<OPSHIFT) /* [...] set number */
78 #define OBACK_ (7LU<<OPSHIFT) /* begin \d paren number */
79 #define O_BACK (8LU<<OPSHIFT) /* end \d paren number */
80 #define OPLUS_ (9LU<<OPSHIFT) /* + prefix fwd to suffix */
81 #define O_PLUS (10LU<<OPSHIFT) /* + suffix back to prefix *
[all...] |
| /external/eigen/bench/btl/libs/blitz/ |
| blitz_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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( Range( fromStart, i-1 ), j ) )
[all...] |
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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( Range( fromStart, i-1 ), j ) )
[all...] |
| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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( Range( fromStart, i-1 ), j ) )
[all...] |
| /external/eigen/doc/examples/ |
| Tutorial_PartialLU_solve.cpp | 2 #include <Eigen/LU>
16 Vector3f x = A.lu().solve(b);
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 16 class LU : public FullPivLU<MatrixType>
49 explicit LU(const T& t) : Base(t), m_originalMatrix(t) {}
89 * \return the partial-pivoting LU decomposition of \c *this.
94 inline const LU<typename MatrixBase<Derived>::PlainObject>
95 MatrixBase<Derived>::lu() const function in class:Eigen::MatrixBase
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/ |
| 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,
[all...] |
| /external/eigen/bench/btl/actions/ |
| action_lu_solve.hh | 65 typename Interface::gene_matrix LU;
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/jemalloc/include/jemalloc/internal/ |
| bitmap.h | 85 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/ |
| 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();
56 VERIFY(rank == lu.rank());
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel())
[all...] |
| eigen2_inverse.cpp | 12 #include <Eigen/LU>
|
| eigen2_alignedbox.cpp | 12 #include <Eigen/LU>
|
| eigen2_determinant.cpp | 12 #include <Eigen/LU>
|
| eigen2_parametrizedline.cpp | 13 #include <Eigen/LU>
|
| /external/oprofile/daemon/ |
| opd_trans.h | 75 return kernel_pointer_size == 4 ? code == ~0LU : code == ~0LLU;
|
| /external/eigen/test/ |
| prec_inverse_4x4.cpp | 11 #include <Eigen/LU>
|
| determinant.cpp | 12 #include <Eigen/LU>
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 3 #include <Eigen/LU>
41 // partial LU
42 X = A.lu().solve(B);
|
| /frameworks/av/services/audioflinger/ |
| AudioResampler.h | 87 static const uint32_t kPhaseMask = (1LU<<kNumPhaseBits)-1;
|
| /hardware/libhardware/modules/gralloc/ |
| gralloc.cpp | 131 if (bufferMask >= ((1LU<<numBuffers)-1)) {
143 if ((bufferMask & (1LU<<i)) == 0) {
144 m->bufferMask |= (1LU<<i);
|
| /system/core/libpixelflinger/ |
| fixed.cpp | 32 if (ggl_unlikely(a <= 2LU)) {
50 r = (((2LU<<30) - uint32_t((uint64_t(a)*r) >> 32)) * uint64_t(r)) >> 30;
51 r = (((2LU<<30) - uint32_t((uint64_t(a)*r) >> 32)) * uint64_t(r)) >> 30;
|
| /external/eigen/bench/ |
| sparse_lu.cpp | 43 #include <Eigen/LU>
50 SparseLU<EigenSparseMatrix,Backend> lu(sm1, flags);
52 if (lu.succeeded())
62 ok = lu.solve(b,&x);
101 FullPivLU<DenseMatrix> lu(m1);
107 lu.solve(b,&x);
|
| /external/eigen/bench/spbench/ |
| sp_solver.cpp | 10 #include <Eigen/LU>
|
| /external/eigen/lapack/ |
| 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
62 MatrixType lu(a,*n,*n,*lda);
70 lu.triangularView<UnitLower>().solveInPlace(B);
71 lu.triangularView<Upper>().solveInPlace(B);
75 lu.triangularView<Upper>().transpose().solveInPlace(B);
76 lu.triangularView<UnitLower>().transpose().solveInPlace(B);
81 lu.triangularView<Upper>().adjoint().solveInPlace(B);
82 lu.triangularView<UnitLower>().adjoint().solveInPlace(B)
[all...] |
