| /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...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| 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/swiftshader/third_party/llvm-subzero/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...] |
| /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/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 829 /// folded in \p LU at isel time.
831 /// This function returns true if \p LU can accommodate what \p F
838 const LSRUse &LU, const Formula &F);
839 // Get the cost of the scaling factor used in F for LU.
841 const LSRUse &LU, const Formula &F);
888 const LSRUse &LU,
[all...] |
| /device/google/marlin/camera/QCamera2/stack/mm-camera-test/inc/ |
| mm_qcamera_socket.h | 38 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] |= (1LU<<((fd) & 31)))
42 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] &= ~(1LU<<((fd) & 31)))
46 ((((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] & (1LU<<((fd) & 31))) != 0)
|
| /hardware/qcom/camera/msm8998/QCamera2/stack/mm-camera-test/inc/ |
| mm_qcamera_socket.h | 38 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] |= (1LU<<((fd) & 31)))
42 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] &= ~(1LU<<((fd) & 31)))
46 ((((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] & (1LU<<((fd) & 31))) != 0)
|
| /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);
|
| /device/huawei/angler/camera/QCamera2/stack/mm-camera-test/inc/ |
| mm_qcamera_socket.h | 54 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] |= (1LU<<((fd) & 31)))
58 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] &= ~(1LU<<((fd) & 31)))
62 ((((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] & (1LU<<((fd) & 31))) != 0)
|
| /device/lge/bullhead/camera/QCamera2/stack/mm-camera-test/inc/ |
| mm_qcamera_socket.h | 54 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] |= (1LU<<((fd) & 31)))
58 (((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] &= ~(1LU<<((fd) & 31)))
62 ((((fd_set *)(fdsetp))->fds_bits[(fd) >> 5] & (1LU<<((fd) & 31))) != 0)
|
| /build/kati/ |
| strutil_test.cc | 38 assert(ss.size() == 4LU);
191 assert(ss.size() == 2LU);
|
| /device/google/contexthub/firmware/os/algos/common/math/ |
| mat.h | 134 // Decomposes the given matrix LU inplace, such that:
135 // LU = P' * L * U.
139 // L and U are stored compactly in the returned LU matrix such that:
142 // e.g. if the returned LU matrix is:
143 // LU = [A11 A12 A13 A14
158 void mat44DecomposeLup(struct Mat44 *LU, struct Size4 *pivot);
160 // Solves the linear system A x = b for x, where A is a compact LU decomposition
161 // (i.e. the LU matrix from mat44DecomposeLup) and pivot is the corresponding
|
| mat.c | 455 void mat44DecomposeLup(struct Mat44 *LU, struct Size4 *pivot) {
456 ASSERT_NOT_NULL(LU);
463 float max = fabsf(LU->elem[k][k]);
465 if (max < fabsf(LU->elem[j][k])) {
466 max = fabsf(LU->elem[j][k]);
472 mat44SwapRows(LU, k, pivot->elem[k]);
475 if (fabsf(LU->elem[k][k]) < EPSILON) {
480 LU->elem[k][j] /= LU->elem[k][k];
485 LU->elem[i][j] -= LU->elem[i][k] * LU->elem[k][j]
[all...] |
| /frameworks/av/media/libaudioprocessing/include/media/ |
| AudioResampler.h | 91 static const uint32_t kPhaseMask = (1LU<<kNumPhaseBits)-1;
|
| /hardware/libhardware/modules/gralloc/ |
| gralloc.cpp | 130 if (bufferMask >= ((1LU<<numBuffers)-1)) {
142 if ((bufferMask & (1LU<<i)) == 0) {
143 m->bufferMask |= (1LU<<i);
|
| /external/llvm/tools/verify-uselistorder/ |
| verify-uselistorder.cpp | 314 auto LU = L->use_begin(), LE = L->use_end();
316 skipUnmappedUsers(LU, LE, LM);
319 while (LU != LE) {
324 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) {
328 if (LU->getOperandNo() != RU->getOperandNo()) {
332 skipUnmappedUsers(++LU, LE, LM);
|
| /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...] |
| /external/eigen/test/ |
| determinant.cpp | 12 #include <Eigen/LU>
|
