Including statistics into an anonymous namespace that gets #included into

every file is a bad idea.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7489 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/Support/SCCIterator.h b/include/Support/SCCIterator.h
index 4de80f4a849e2b0c766c52604197c66be64a20f0..5fad4ddc47a552953a3e41190d439272d261e0c9 100644 (file)
--- a/include/Support/SCCIterator.h
+++ b/include/Support/SCCIterator.h
@@ -16,7 +16,7 @@
 #define SUPPORT_TARJANSCCITERATOR_H
 
 #include "Support/GraphTraits.h"
-#include "Support/Statistic.h"
+#include "Support/Debug.h"
 #include "Support/iterator"
 #include <vector>
 #include <stack>
@@ -56,11 +56,6 @@ struct SCC: public std::vector<typename GT::NodeType*> {
 // reverse topological order of the SCC DAG.
 //--------------------------------------------------------------------------
 
-namespace {
-  Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
-  Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
-}
-
 template<class GraphT, class GT = GraphTraits<GraphT> >
 class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
 {
@@ -152,10 +147,6 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
               SCCNodeStack.pop();
               nodeVisitNumbers[CurrentSCC.back()] = ~0UL; 
             } while (CurrentSCC.back() != visitingN);
-
-            ++NumSCCs;
-            if (CurrentSCC.size() > MaxSCCSize) MaxSCCSize = CurrentSCC.size();
-            
             return;
           }
       }

diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h
index 4de80f4a849e2b0c766c52604197c66be64a20f0..5fad4ddc47a552953a3e41190d439272d261e0c9 100644 (file)
--- a/include/llvm/ADT/SCCIterator.h
+++ b/include/llvm/ADT/SCCIterator.h
@@ -16,7 +16,7 @@
 #define SUPPORT_TARJANSCCITERATOR_H
 
 #include "Support/GraphTraits.h"
-#include "Support/Statistic.h"
+#include "Support/Debug.h"
 #include "Support/iterator"
 #include <vector>
 #include <stack>
@@ -56,11 +56,6 @@ struct SCC: public std::vector<typename GT::NodeType*> {
 // reverse topological order of the SCC DAG.
 //--------------------------------------------------------------------------
 
-namespace {
-  Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
-  Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
-}
-
 template<class GraphT, class GT = GraphTraits<GraphT> >
 class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
 {
@@ -152,10 +147,6 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t>
               SCCNodeStack.pop();
               nodeVisitNumbers[CurrentSCC.back()] = ~0UL; 
             } while (CurrentSCC.back() != visitingN);
-
-            ++NumSCCs;
-            if (CurrentSCC.size() > MaxSCCSize) MaxSCCSize = CurrentSCC.size();
-            
             return;
           }
       }