diff options
| -rw-r--r-- | include/Support/SCCIterator.h | 11 | ||||
| -rw-r--r-- | include/llvm/ADT/SCCIterator.h | 11 |
2 files changed, 2 insertions, 20 deletions
diff --git a/include/Support/SCCIterator.h b/include/Support/SCCIterator.h index 4de80f4a84..5fad4ddc47 100644 --- 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 4de80f4a84..5fad4ddc47 100644 --- 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; } } |