| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLUImpl.h | 24 typedef Matrix<Index,Dynamic,1> IndexVector; typedef
28 typedef LU_GlobalLU_t<IndexVector, ScalarVector> GlobalLU_t;
37 …id heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& desce…
38 …void relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descenda…
39 …(const Index jcol, const Index kcol,const MatrixType& mat, IndexVector& xprune, IndexVector& mark…
41 …pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iper…
43 void dfs_kernel(const Index jj, IndexVector& perm_r,
44 Index& nseg, IndexVector& panel_lsub, IndexVector& segrep,
45 … Ref<IndexVector> repfnz_col, IndexVector& xprune, Ref<IndexVector> marker, IndexVector& parent,
46 … IndexVector& xplore, GlobalLU_t& glu, Index& nextl_col, Index krow, Traits& traits);
[all …]
|
| D | SparseLU_panel_dfs.h | 37 template<typename IndexVector>
40 typedef typename IndexVector::Scalar Index;
53 void mem_expand(IndexVector& /*glu.lsub*/, Index /*nextl*/, Index /*chmark*/) {} in mem_expand()
62 void SparseLUImpl<Scalar,Index>::dfs_kernel(const Index jj, IndexVector& perm_r, in dfs_kernel()
63 Index& nseg, IndexVector& panel_lsub, IndexVector& segrep, in dfs_kernel()
64 … Ref<IndexVector> repfnz_col, IndexVector& xprune, Ref<IndexVector> marker, IndexVector& parent, in dfs_kernel()
65 IndexVector& xplore, GlobalLU_t& glu, in dfs_kernel()
219 …IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segre… in panel_dfs()
224 VectorBlock<IndexVector> marker1(marker, m, m); in panel_dfs()
227 panel_dfs_traits<IndexVector> traits(jcol, marker1.data()); in panel_dfs()
[all …]
|
| D | SparseLU_Structs.h | 76 template <typename IndexVector, typename ScalarVector>
78 typedef typename IndexVector::Scalar Index;
79 …IndexVector xsup; //First supernode column ... xsup(s) points to the beginning of the s-th superno…
80 IndexVector supno; // Supernode number corresponding to this column (column to supernode mapping)
82 IndexVector lsub; // Compressed row indices of L rectangular supernodes.
83 IndexVector xlusup; // pointers to the beginning of each column in lusup
84 IndexVector xlsub; // pointers to the beginning of each column in lsub
88 IndexVector usub; // row indices of U columns in ucol
89 IndexVector xusub; // Pointers to the beginning of each column of U in ucol
|
| D | SparseLU_column_dfs.h | 38 template<typename IndexVector, typename ScalarVector>
42 typedef typename IndexVector::Scalar Index;
50 void mem_expand(IndexVector& lsub, Index& nextl, Index chmark) in mem_expand()
93 …IndexVector& perm_r, Index maxsuper, Index& nseg, BlockIndexVector lsub_col, IndexVector& segrep,… in column_dfs()
98 VectorBlock<IndexVector> marker2(marker, 2*m, m); in column_dfs()
101 column_dfs_traits<IndexVector, ScalarVector> traits(jcol, jsuper, glu, *this); in column_dfs()
|
| D | SparseLU_heap_relax_snode.h | 46 …>::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& desce… in heap_relax_snode()
50 IndexVector post; in heap_relax_snode()
52 IndexVector inv_post(n+1); in heap_relax_snode()
57 IndexVector iwork(n); in heap_relax_snode()
58 IndexVector et_save(n+1); in heap_relax_snode()
|
| D | SparseLU_SupernodalMatrix.h | 38 typedef Matrix<Index,Dynamic,1> IndexVector; typedef
45 …SuperNodalMatrix(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& r… in MappedSuperNodalMatrix()
46 IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col ) in MappedSuperNodalMatrix()
61 …void setInfos(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowin… in setInfos()
62 IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col ) in setInfos()
|
| D | SparseLU_kernel_bmod.h | 33 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
35 … const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros);
39 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
41 … const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) in run()
94 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
96 … const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros);
100 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index>
102 … const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros)
|
| D | SparseLU.h | 84 typedef Matrix<Index,Dynamic,1> IndexVector; typedef
384 IndexVector m_etree; // Column elimination tree
445 IndexVector firstRowElt; in analyzePattern()
450 IndexVector post, iwork; in analyzePattern()
504 typedef typename IndexVector::Scalar Index; in factorize()
550 IndexVector segrep(m); segrep.setZero(); in factorize()
551 IndexVector parent(m); parent.setZero(); in factorize()
552 IndexVector xplore(m); xplore.setZero(); in factorize()
553 IndexVector repfnz(maxpanel); in factorize()
554 IndexVector panel_lsub(maxpanel); in factorize()
[all …]
|
| D | SparseLU_relax_snode.h | 47 …Index>::relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& desce… in relax_snode()
|
| D | SparseLU_panel_bmod.h | 58 … IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu) in panel_bmod()
91 …VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each … in panel_bmod()
112 …VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each … in panel_bmod()
159 …VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each … in panel_bmod()
194 …VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each … in panel_bmod()
|
| D | SparseLU_copy_to_ucol.h | 50 …opy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,Inde… in copy_to_ucol()
79 mem = memXpand<IndexVector>(glu.usub, glu.nzumax, nextu, USUB, glu.num_expansions); in copy_to_ucol()
|
| D | SparseLU_pruneL.h | 53 …ex jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segre… in pruneL()
|
| D | SparseLU_pivotL.h | 60 …pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iper… in pivotL()
|
| D | SparseLU_Memory.h | 183 || (expand<IndexVector> (glu.lsub, glu.nzlmax, 0, 0, num_expansions)<0) in memInit()
184 || (expand<IndexVector> (glu.usub, glu.nzumax, 0, 1, num_expansions)<0) ) in memInit()
|
| D | SparseLU_Utils.h | 52 void SparseLUImpl<Scalar,Index>::fixupL(const Index n, const IndexVector& perm_r, GlobalLU_t& glu) in fixupL()
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseColEtree.h | 39 template<typename Index, typename IndexVector>
40 Index etree_find (Index i, IndexVector& pp) in etree_find()
60 template <typename MatrixType, typename IndexVector>
61 int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowElt, typename MatrixT…
67 IndexVector root(nc); // root of subtree of etree
69 IndexVector pp(nc); // disjoint sets
130 template <typename Index, typename IndexVector>
131 void nr_etdfs (Index n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVe… in nr_etdfs()
177 template <typename Index, typename IndexVector>
178 void treePostorder(Index n, IndexVector& parent, IndexVector& post) in treePostorder()
[all …]
|
| /external/eigen/Eigen/src/MetisSupport/ |
| D | MetisSupport.h | 26 typedef Matrix<Index,Dynamic,1> IndexVector; typedef
37 IndexVector visited(m); in get_symmetrized_graph()
106 IndexVector perm(m),iperm(m); in operator()
132 IndexVector m_indexPtr; // Pointer to the adjacenccy list of each row/column
133 IndexVector m_innerIndices; // Adjacency list
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 74 typedef Matrix<Index, Dynamic, 1> IndexVector;
262 IndexVector m_etree; // Column elimination tree
263 IndexVector m_firstRowElt; // First element in each row
332 IndexVector mark((std::max)(m,n)); mark.setConstant(-1); // Record the visited nodes
333 …IndexVector Ridx(n), Qidx(m); // Store temporarily the row indexes for…
355 IndexVector originalOuterIndicesCpy;
359 originalOuterIndicesCpy = IndexVector::Map(m_pmat.outerIndexPtr(),n+1);
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| D | Ordering.h | 119 typedef Matrix<Index, Dynamic, 1> IndexVector; typedef
139 IndexVector p(n+1), A(Alen); in operator()
|
| /external/llvm/lib/Analysis/ |
| D | LoopAccessAnalysis.cpp | 1284 auto &IndexVector = Accesses.find(Access)->second; in getInstructionsForAccess() local
1287 std::transform(IndexVector.begin(), IndexVector.end(), in getInstructionsForAccess()
|