add fix_isnan_scope.patch

1 files changed, 46 insertions, 0 deletions

diff --git a/fix_isnan_scope.patch b/fix_isnan_scope.patch
new file mode 100644
index 000000000000..b475d09c5665
--- /dev/null
+++ b/fix_isnan_scope.patch
@@ -0,0 +1,46 @@
+--- kcollectd-0.9.orig/kcollectd/graph.cc	2010-01-31 21:40:10.000000000 +0300
++++ kcollectd-0.9/kcollectd/graph.cc	2016-07-11 13:10:40.602522957 +0300
+@@ -564,9 +564,9 @@
+       paint.setPen(Qt::NoPen);
+       paint.setBrush(QBrush(color_minmax[color_nr++ % 8]));
+       for(int i=0; i<size; ++i) {
+-	while (i<size && (isnan(min_data[i]) || isnan(max_data[i]))) ++i;
++	while (i<size && (std::isnan(min_data[i]) || std::isnan(max_data[i]))) ++i;
+ 	int l = i;
+-	while (i<size && !isnan(min_data[i]) && !isnan(max_data[i])) ++i;
++	while (i<size && !std::isnan(min_data[i]) && !std::isnan(max_data[i])) ++i;
+ 	const int asize = i-l;
+ 	points.resize(asize*2);
+ 	int k;
+@@ -597,9 +597,9 @@
+     if (!avg_data.empty()) {
+       paint.setPen(color_line[color_nr++ % 8]);
+       for(int i=0; i<size; ++i) {
+-	while (i<size && isnan(avg_data[i])) ++i;
++	while (i<size && std::isnan(avg_data[i])) ++i;
+ 	int l = i;
+-	while (i<size && !isnan(avg_data[i])) ++i;
++	while (i<size && !std::isnan(avg_data[i])) ++i;
+ 	const int asize = i-l;
+ 	points.resize(asize);
+ 	for(int k=0; k<asize; ++k, ++l) {
+--- kcollectd-0.9.orig/misc.cc	2009-05-10 17:42:08.000000000 +0400
++++ kcollectd-0.9/kcollectd/misc.cc	2016-07-11 13:10:59.955079187 +0300
+@@ -119,7 +119,7 @@
+   // process avg_data
+   if (!avg_data.empty()) {
+     for(std::size_t i=0; i<size; ++i) {
+-      if (isnan(avg_data[i])) continue;
++      if (std::isnan(avg_data[i])) continue;
+       valid = true;
+       if (min > avg_data[i]) min = avg_data[i];
+       if (max < avg_data[i]) max = avg_data[i];
+@@ -129,7 +129,7 @@
+   // process min/max-data
+   if (!min_data.empty() && !max_data.empty()) {  
+     for(std::size_t i=0; i<size; ++i) {
+-      if (isnan(min_data[i]) || isnan(max_data[i])) continue;
++      if (std::isnan(min_data[i]) || std::isnan(max_data[i])) continue;
+       valid = true;
+       if (min > min_data[i]) min = min_data[i];
+       if (max < min_data[i]) max = min_data[i];