| /external/eigen/bench/btl/libs/mtl4/ |
| D | mtl4_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/eigen/bench/btl/libs/gmm/ |
| D | gmm_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/eigen/bench/btl/libs/blitz/ |
| D | blitz_LU_solve_interface.hh | 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
90 ASSERT( LU.rows()==LU.cols() ) ; in LU_factor()
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ; in LU_factor()
111 theSum = LU( i, j ) ; in LU_factor()
112 theSum -= matrix_matrix_product_sliced(LU, i, 0, i-1, LU, 0, j) ; in LU_factor()
114 LU( i, j ) = theSum ; in LU_factor()
120 theSum = LU( i, j ) ; in LU_factor()
121 theSum -= matrix_matrix_product_sliced(LU, i, 0, j-1, LU, 0, j) ; in LU_factor()
123 LU( i, j ) = theSum ; in LU_factor()
133 dum = LU( index_max, k ) ; in LU_factor()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 994 const LSRUse &LU, const Formula &F);
998 const LSRUse &LU, const Formula &F,
1044 const LSRUse &LU,
1300 const LSRUse &LU, in RateFormula() argument
1332 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(TTI, LU, F))); in RateFormula()
1336 C.ScaleCost += getScalingFactorCost(TTI, LU, F, *L); in RateFormula()
1339 for (const LSRFixup &Fixup : LU.Fixups) { in RateFormula()
1350 if (LU.Kind == LSRUse::Address && Offset != 0 && in RateFormula()
1351 !isAMCompletelyFolded(TTI, LSRUse::Address, LU.AccessTy, F.BaseGV, in RateFormula()
1384 if (LU.Kind == LSRUse::ICmpZero && !F.hasZeroEnd() && !TTI.canMacroFuseCmp()) in RateFormula()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 838 const LSRUse &LU, const Formula &F);
841 const LSRUse &LU, const Formula &F);
888 const LSRUse &LU,
980 const LSRUse &LU, in RateFormula() argument
1009 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(TTI, LU, F))); in RateFormula()
1013 ScaleCost += getScalingFactorCost(TTI, LU, F); in RateFormula()
1468 const LSRUse &LU, const Formula &F) { in isAMCompletelyFolded() argument
1469 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1470 LU.AccessTy, F.BaseGV, F.BaseOffset, F.HasBaseReg, in isAMCompletelyFolded()
1475 const LSRUse &LU, const Formula &F) { in getScalingFactorCost() argument
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 1381 bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1388 void DeleteUse(LSRUse &LU, size_t LUIdx);
1393 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1394 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1396 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
1400 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
1402 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
1403 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1404 void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
1405 void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base);
[all …]
|
| /external/eigen/Eigen/ |
| D | LU | 15 /** \defgroup LU_Module LU module
16 …* This module includes %LU decomposition and related notions such as matrix inversion and determin…
22 * #include <Eigen/LU>
28 #include "src/LU/FullPivLU.h"
29 #include "src/LU/PartialPivLU.h"
32 #include "src/LU/PartialPivLU_LAPACKE.h"
34 #include "src/LU/Determinant.h"
35 #include "src/LU/InverseImpl.h"
40 #include "src/LU/arch/Inverse_SSE.h"
|
| D | SuperLUSupport | 43 * - class SuperLU: a supernodal sequential LU factorization.
44 …* - class SuperILU: a supernodal sequential incomplete LU factorization (to be used as a precondit…
|
| D | Dense | 2 #include "LU"
|
| /external/eigen/bench/btl/actions/ |
| D | action_lu_solve.hh | 65 typename Interface::gene_matrix LU; in calculate() local
70 Interface::matrix_from_stl(LU,A_stl); in calculate()
88 Interface::copy_matrix(A,LU,size); in calculate()
89 Interface::LU_factor(LU,pivot,size); in calculate()
93 Interface::LU_solve(LU,pivot,B,X,size); in calculate()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Lu.pbtxt | 31 summary: "Computes the LU decomposition of one or more square matrices."
38 The output consists of two tensors LU and P containing the LU decomposition
39 of all input submatrices `[..., :, :]`. LU encodes the lower triangular and
44 triangular part of LU. U is a upper triangular matrix of shape `[M, M]` whose
45 entries correspond to the upper triangular part, including the diagonal, of LU.
|
| D | api_def_LogMatrixDeterminant.pbtxt | 30 The log_abs_determinant is computed as det(P)*sum(log(diag(LU))) where LU
31 is the LU decomposition of the input and P is the corresponding
|
| D | api_def_MatrixInverse.pbtxt | 27 The op uses LU decomposition with partial pivoting to compute the inverses.
|
| /external/eigen/bench/btl/data/ |
| D | action_settings.txt | 12 complete_lu_decomp ; "{/*1.5 Complete LU decomposition}" ; "matrix size" ; 4:5000
13 partial_lu_decomp ; "{/*1.5 Partial LU decomposition}" ; "matrix size" ; 4:5000
|
| /external/llvm/tools/verify-uselistorder/ |
| D | verify-uselistorder.cpp | 314 auto LU = L->use_begin(), LE = L->use_end(); in matches() local
316 skipUnmappedUsers(LU, LE, LM); in matches()
319 while (LU != LE) { in matches()
324 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) { in matches()
328 if (LU->getOperandNo() != RU->getOperandNo()) { in matches()
332 skipUnmappedUsers(++LU, LE, LM); in matches()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/verify-uselistorder/ |
| D | verify-uselistorder.cpp | 313 auto LU = L->use_begin(), LE = L->use_end(); in matches() local
315 skipUnmappedUsers(LU, LE, LM); in matches()
318 while (LU != LE) { in matches()
323 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) { in matches()
327 if (LU->getOperandNo() != RU->getOperandNo()) { in matches()
331 skipUnmappedUsers(++LU, LE, LM); in matches()
|
| /external/honggfuzz/examples/apache-httpd/corpus_http2/ |
| D | d22fda3dd9be202eeac3d4fc1d56438b.00004d7d.honggfuzz.cov | 5 …```````````````````````````````````````````(�1@�Fl����B �6%|~�*� ����ϙ+ۀF�LU�R�!�rN��cĶ5>�>TԽ��t…
8 …```````````````````````````````````````````(�1@�Fl����B �6%|~�*� ����ϙ+ۀF�LU�R�!�rN��cĶ5>�>TԽ��t…
11 …```````````````````````````````````````````(�1@�Fl����B �6%|~�*� ����ϙ+ۀF�LU�R�!�rN��cĶ5>�>TԽ��t…
|
| /external/eigen/doc/ |
| D | InplaceDecomposition.dox | 5 Starting from %Eigen 3.3, the LU, Cholesky, and QR decompositions can operate \em inplace, that is,…
8 …th the input matrix as argument. As an example, let us consider an inplace LU decomposition with p…
22 No surprise here! Then, let's declare our inplace LU object \c lu, and check the content of the mat…
|
| D | SparseLinearSystems.dox | 26 <tr><td>SparseLU \n <tt>\#include<Eigen/\link SparseLU_Module SparseLU\endlink></tt></td> <td>LU fa…
64 …link PaStiXSupport_Module PaStiXSupport \endlink</td><td>Direct LLt, LDLt, LU factorizations</td><…
70 <tr><td>UmfPackLU</td><td>\link UmfPackSupport_Module UmfPackSupport \endlink</td><td>Direct LU fac…
73 <tr><td>SuperLU</td><td>\link SuperLUSupport_Module SuperLUSupport \endlink</td><td>Direct LU facto…
79 …nk PardisoSupport_Module PardisoSupport \endlink</td><td>Direct LLt, LDLt, LU factorizations</td><…
145 …rized: LLT for self-adjoint matrices, LDLT for general hermitian matrices, LU for non hermitian ma…
193 …<TR><TH>Matrix <TH> N <TH> NNZ <TH> <TH > UMFPACK <TH > SUPERLU <TH > PASTIX LU <TH >BiCGSTAB <TH…
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
| D | LegacyPassManager.cpp | 607 for (auto LU : LastUser) { in setLastUser() local
608 if (LU.second == AP) in setLastUser()
611 LastUser[LU.first] = P; in setLastUser()
624 SmallPtrSet<Pass *, 8> &LU = DMI->second; in collectLastUses() local
625 for (Pass *LUP : LU) { in collectLastUses()
861 for (auto LU : LastUser) { in initializeAllAnalysisInfo() local
862 SmallPtrSet<Pass *, 8> &L = InversedLastUser[LU.second]; in initializeAllAnalysisInfo()
863 L.insert(LU.first); in initializeAllAnalysisInfo()
1738 SmallVector<Pass *, 1> LU; in addLowerLevelRequiredPass() local
1739 LU.push_back(FoundPass); in addLowerLevelRequiredPass()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 298 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
301 if (LU == IndexType::None) in computeInitialLiveRanges()
302 LU = IndexType::Exit; in computeInitialLiveRanges()
303 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
|
| /external/icu/icu4c/source/data/locales/ |
| D | es_US.txt | 424 one{"dentro de {0} LU"}
425 other{"dentro de {0} LU"}
428 one{"hace {0} LU"}
429 other{"hace {0} LU"}
|
| D | es_MX.txt | 523 one{"dentro de {0} LU"}
524 other{"dentro de {0} LU"}
527 one{"hace {0} LU"}
528 other{"hace {0} LU"}
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 305 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
308 if (LU == IndexType::None) in computeInitialLiveRanges()
309 LU = IndexType::Exit; in computeInitialLiveRanges()
310 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
|
| /external/icu/icu4c/source/data/region/ |
| D | sw_CD.txt | 17 LU{"Lasembagi"}
|