Fix warning

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

diff --git a/include/Support/SCCIterator.h b/include/Support/SCCIterator.h
index a65994871ad5cb8fcc0fafe30dbc34b5a33f70fe..42d4bcb551c90586b159e8b1f21206146cb9ddc0 100644 (file)
--- 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 a65994871ad5cb8fcc0fafe30dbc34b5a33f70fe..42d4bcb551c90586b159e8b1f21206146cb9ddc0 100644 (file)
--- 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;