RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-26 05:00:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix warning

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4708 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-11-15 18:04:16 +00:00
parent 6559bb96a9
commit d8a947e233
2 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/Support/SCCIterator.h
View File

@ -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;

4
include/llvm/ADT/SCCIterator.h
View File

@ -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;