diff options
| author | Chris Lattner <sabre@nondot.org> | 2002-11-15 18:04:16 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2002-11-15 18:04:16 +0000 |
| commit | fb1855921c19247efaae264b976336e3092dd3cf (patch) | |
| tree | 8711e86b34ba309f506a693af4e30238cd78aa5e | |
| parent | e74543584add1ee225b1dcd48a45188380745710 (diff) | |
| download | bcm5719-llvm-fb1855921c19247efaae264b976336e3092dd3cf.tar.gz bcm5719-llvm-fb1855921c19247efaae264b976336e3092dd3cf.zip | |
Fix warning
llvm-svn: 4708
| -rw-r--r-- | llvm/include/Support/SCCIterator.h | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/llvm/include/Support/SCCIterator.h b/llvm/include/Support/SCCIterator.h index a65994871ad..42d4bcb551c 100644 --- a/llvm/include/Support/SCCIterator.h +++ b/llvm/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; |

