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

remove use of compat_iterator.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20643 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-03-16 22:42:19 +00:00
parent df6001380a
commit 84b80a214a
3 changed files with 15 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -1091,7 +1091,7 @@ DSGraph::~DSGraph() {
// Drop all intra-node references, so that assertions don't fail...
for (node_iterator NI = node_begin(), E = node_end(); NI != E; ++NI)
(*NI)->dropAllReferences();
NI->dropAllReferences();
// Free all of the nodes.
Nodes.clear();
@ -1180,12 +1180,12 @@ void DSGraph::cloneInto(const DSGraph &G, DSScalarMap &OldValMap,
| ((CloneFlags & StripIncompleteBit)? DSNode::Incomplete : 0);
BitsToClear |= DSNode::DEAD; // Clear dead flag...
for (node_iterator I = G.node_begin(), E = G.node_end(); I != E; ++I) {
assert(!(*I)->isForwarding() &&
for (node_const_iterator I = G.node_begin(), E = G.node_end(); I != E; ++I) {
assert(!I->isForwarding() &&
"Forward nodes shouldn't be in node list!");
DSNode *New = new DSNode(**I, this);
DSNode *New = new DSNode(*I, this);
New->maskNodeTypes(~BitsToClear);
OldNodeMap[*I] = New;
OldNodeMap[I] = New;
}
#ifndef NDEBUG
@ -1668,9 +1668,9 @@ void DSGraph::removeTriviallyDeadNodes() {
// forwarded nodes to be delete-able.
{ TIME_REGION(X, "removeTriviallyDeadNodes:node_iterate");
for (node_iterator NI = node_begin(), E = node_end(); NI != E; ++NI) {
DSNode *N = *NI;
for (unsigned l = 0, e = N->getNumLinks(); l != e; ++l)
N->getLink(l*N->getPointerSize()).getNode();
DSNode &N = *NI;
for (unsigned l = 0, e = N.getNumLinks(); l != e; ++l)
N.getLink(l*N.getPointerSize()).getNode();
}
}
@ -2016,8 +2016,8 @@ void DSGraph::AssertAuxCallNodesInGraph() const {
}
void DSGraph::AssertGraphOK() const {
for (node_iterator NI = node_begin(), E = node_end(); NI != E; ++NI)
(*NI)->assertOK();
for (node_const_iterator NI = node_begin(), E = node_end(); NI != E; ++NI)
NI->assertOK();
for (ScalarMapTy::const_iterator I = ScalarMap.begin(),
E = ScalarMap.end(); I != E; ++I) {

7
lib/Analysis/DataStructure/GraphChecker.cpp
View File

@ -116,10 +116,11 @@ bool DSGC::runOnFunction(Function &F) {
void DSGC::verify(const DSGraph &G) {
// Loop over all of the nodes, checking to see if any are collapsed...
if (AbortIfAnyCollapsed) {
for (DSGraph::node_iterator I = G.node_begin(), E = G.node_end(); I!=E; ++I)
if ((*I)->isNodeCompletelyFolded()) {
for (DSGraph::node_const_iterator I = G.node_begin(), E = G.node_end();
I != E; ++I)
if (I->isNodeCompletelyFolded()) {
std::cerr << "Node is collapsed: ";
(*I)->print(std::cerr, &G);
I->print(std::cerr, &G);
abort();
}
}

2
lib/Analysis/DataStructure/Printer.cpp
View File

@ -292,7 +292,7 @@ static void printCollection(const Collection &C, std::ostream &O,
for (DSGraph::node_iterator NI = Gr.node_begin(), E = Gr.node_end();
NI != E; ++NI)
if ((*NI)->isNodeCompletelyFolded())
if (NI->isNodeCompletelyFolded())
++NumFoldedNodes;
}