Home
last modified time | relevance | path

Searched refs:m_shift (Results 1 – 3 of 3) sorted by relevance

/external/eigen/Eigen/src/Householder/
DHouseholderSequence.h84 Index start = k+1+h.m_shift;
97 Index start = k+1+h.m_shift;
156 m_shift(0)
166 m_shift(other.m_shift)
214 .setShift(m_shift);
248 Index cornerSize = rows() - k - m_shift;
268 Index cornerSize = rows() - k - m_shift;
294 dst.rightCols(rows()-m_shift-actual_k)
314 dst.bottomRows(rows()-m_shift-actual_k)
365 m_shift = shift;
[all …]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteCholesky.h43 IncompleteCholesky() : m_shift(1),m_factorizationIsOk(false) {} in IncompleteCholesky()
44 IncompleteCholesky(const MatrixType& matrix) : m_shift(1),m_factorizationIsOk(false) in IncompleteCholesky()
68 void setShift( Scalar shift) { m_shift = shift; } in setShift()
118 Scalar m_shift; //The initial shift parameter variable
172 if(mindiag < Scalar(0.)) m_shift = m_shift - mindiag; in factorize()
175 vals[colPtr[j]] += m_shift; in factorize()
/external/v8/src/compiler/arm64/
Dinstruction-selector-arm64.cc362 Matcher m_shift(right_node); in VisitBinop() local
364 inputs[input_count++] = g.UseRegister(m_shift.left().node()); in VisitBinop()
365 inputs[input_count++] = g.UseImmediate(m_shift.right().node()); in VisitBinop()
369 Matcher m_shift(left_node); in VisitBinop() local
371 inputs[input_count++] = g.UseRegister(m_shift.left().node()); in VisitBinop()
372 inputs[input_count++] = g.UseImmediate(m_shift.right().node()); in VisitBinop()