diff options
-rw-r--r-- | include/Support/SCCIterator.h | 4 | ||||
-rw-r--r-- | include/llvm/ADT/SCCIterator.h | 4 |
2 files changed, 2 insertions, 6 deletions
diff --git a/include/Support/SCCIterator.h b/include/Support/SCCIterator.h index a65994871a..42d4bcb551 100644 --- a/include/Support/SCCIterator.h +++ b/include/Support/SCCIterator.h @@ -56,8 +56,6 @@ struct SCC: public std::vector<typename GT::NodeType*> { // reverse topological order of the SCC DAG. //-------------------------------------------------------------------------- -const unsigned long MAXLONG = (1 << (8 * sizeof(unsigned long) - 1)); - namespace { Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components"); Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component"); @@ -152,7 +150,7 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t> do { CurrentSCC.push_back(SCCNodeStack.top()); SCCNodeStack.pop(); - nodeVisitNumbers[CurrentSCC.back()] = MAXLONG; + nodeVisitNumbers[CurrentSCC.back()] = ~0UL; } while (CurrentSCC.back() != visitingN); ++NumSCCs; diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h index a65994871a..42d4bcb551 100644 --- a/include/llvm/ADT/SCCIterator.h +++ b/include/llvm/ADT/SCCIterator.h @@ -56,8 +56,6 @@ struct SCC: public std::vector<typename GT::NodeType*> { // reverse topological order of the SCC DAG. //-------------------------------------------------------------------------- -const unsigned long MAXLONG = (1 << (8 * sizeof(unsigned long) - 1)); - namespace { Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components"); Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component"); @@ -152,7 +150,7 @@ class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t> do { CurrentSCC.push_back(SCCNodeStack.top()); SCCNodeStack.pop(); - nodeVisitNumbers[CurrentSCC.back()] = MAXLONG; + nodeVisitNumbers[CurrentSCC.back()] = ~0UL; } while (CurrentSCC.back() != visitingN); ++NumSCCs; |