| /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/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/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/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 | Dense | 2 #include "LU"
|
| 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 | UmfPackSupport | 24 * - class UmfPackLU: a multifrontal sequential LU factorization.
|
| D | Eigenvalues | 18 #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/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/vulkan-validation-layers/demos/ |
| D | lunarg.ppm | 21 T]S^S]R\R\Q[RZQZOXOWNVMVLVLU
47 …dn bn bm al _k_i]h]h[fZdZcXcXbV`U`T_T^R\R\Q[OYNXNWMWLVLUKTKTJSIRHQFOFN…
57 …eo!do cm am `k _j^h]h\gZeZcYcXbV`U`T_T^S]R\Q[PZNXNWMWLVLUKTKTJSIRHQGPFN…
68 …fp"dp dn bm al `j ^i^h\g[fZdYcYbWaU`T_T^S]S]Q[PZOYNWMWLVLUKTKTJSIRHQGPGO…
79 …gq#ep!do cn am ak _i ^i]g[f[eYdYbXaVaT_T^S]S]R\PZOYOXMWLVLUKTKTJSIRHQGPGO…
90 …hr%fq"eo!co bm al `j _i ]h\f[eZeYcXaVaU`T^S]S]R\Q[OYOXMWLVLUKTKTJSIRHQGPGO…
101 …is&gr$fp#ep!bn bl `k `j ^h \g\eZeYcXbWaU`U_S]S]R\Q[OYOXNXLVLUKTKTJSIRHQGPGO…
112 …jt'hs%gq$ep#do!bm ak `k _i ]g\f[eZdXbWbV`U_T^S]R\Q[PZOXNXMWLUKTKTJSIRHQGPGO…
123 …ku(it&hr%fq$dp#dn!bl ak _j ^h ]g[f[dYcXcV`V`T^S]R\Q[PZPYNXMWLUKTKTJSIRHQGPGO…
145 …kv)jt'hs&fq%eo$dn#cm!ak _i ^h ]g \fZcYcWbV`U_T^S]Q[PZPYOYMWMVLUKTJSIRHQGPGOFO…
[all …]
|
| /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/icu/icu4c/source/data/misc/ |
| D | metadata.txt | 1414 LU-D{
1416 replacement{"LU-CL LU-DI LU-RD LU-VD LU-WI"}
1418 LU-G{
1420 replacement{"LU-EC LU-GR LU-RM"}
1422 LU-L{
1424 replacement{"LU-CA LU-ES LU-LU LU-ME"}
2050 replacement{"LU"}
3350 replacement{"LU"}
|
| /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/region/ |
| D | sw_KE.txt | 14 LU{"Lasembagi"}
|
| D | sw_CD.txt | 17 LU{"Lasembagi"}
|
| D | ckb.txt | 110 LU{"لوکسەمبورگ"}
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/de-DE/ |
| D | de-DE_klex.pkb | 207 #!AD8F,4U<LU dergleichen /!AD8"FL>-* derjenigenC
323 …eidungsfähigkeit)+.NU!4>A51T"E/0-K>Uentscheidungsgewalt)+.NU!4>A51TF,"Z<LUentscheidungsgremien…
375 festzuhalten~!E.TUWX"G<LU* festzulegen4festzuschreiben4��������������������������������������…
833 …LUsodass&^O!A<Tsoeben #^O!+D@*sofern &^O!E.8Nsofort #^O!E28U soforthilfe)^P!E28UG0LE, softwa…
834 5!^2LU,TUsolltet 5!^2LU,Usomit#^O!M0Usondern %!^2NA&Nsong)!T21songs)!T21T sonntags
1072 …L-*welcher|!Z.L-&welches |!Z.L-,Twelcome )!5.L#"K'Mweltanschauung)!Z.LU"+<N4?51 weltweiter"…
|
| /external/llvm/lib/Bitcode/Writer/ |
| D | ValueEnumerator.cpp | 157 const Use *LU = L.first; in predictValueUseListOrderImpl() local
159 if (LU == RU) in predictValueUseListOrderImpl()
162 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
192 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
193 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
|
| /external/icu/icu4c/source/data/locales/ |
| D | es.txt | 526 "LU",
564 "LU",
1277 "-1"{"el LU pasado"}
1278 "0"{"este LU"}
1279 "1"{"el próximo LU"}
1283 one{"dentro de {0} LU"}
1284 other{"dentro de {0} LU"}
1287 one{"hace {0} LU"}
1288 other{"hace {0} LU"}
|
| /external/eigen/bench/spbench/ |
| D | spbench.dtd | 4 <!ELEMENT TYPE (#PCDATA)> <!-- One of LU, LLT, LDLT, ITER -->
|