From d8a947e233a616b2f7d053e912bdb3f20e2c09a6 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Fri, 15 Nov 2002 18:04:16 +0000 Subject: [PATCH] Fix warning git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4708 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/Support/SCCIterator.h | 4 +--- 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 a65994871ad..42d4bcb551c 100644 --- a/include/Support/SCCIterator.h +++ b/include/Support/SCCIterator.h @@ -56,8 +56,6 @@ struct SCC: public std::vector { // 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, 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 a65994871ad..42d4bcb551c 100644 --- a/include/llvm/ADT/SCCIterator.h +++ b/include/llvm/ADT/SCCIterator.h @@ -56,8 +56,6 @@ struct SCC: public std::vector { // 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, ptrdiff_t> do { CurrentSCC.push_back(SCCNodeStack.top()); SCCNodeStack.pop(); - nodeVisitNumbers[CurrentSCC.back()] = MAXLONG; + nodeVisitNumbers[CurrentSCC.back()] = ~0UL; } while (CurrentSCC.back() != visitingN); ++NumSCCs; -- 2.34.1