[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/DataStructure.cpp
Chris Lattner
lattner at cs.uiuc.edu
Sat Feb 1 00:42:01 PST 2003
Changes in directory llvm/lib/Analysis/DataStructure:
DataStructure.cpp updated: 1.80 -> 1.81
---
Log message:
Delete nodes more efficiently
---
Diffs of the changes:
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.80 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.81
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.80 Sat Feb 1 00:23:33 2003
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Sat Feb 1 00:41:15 2003
@@ -1090,19 +1090,17 @@
ScalarMap.erase(GlobalNodes[i].first);
// Loop over all unreachable nodes, dropping their references...
- std::vector<DSNode*> DeadNodes;
- DeadNodes.reserve(Nodes.size()); // Only one allocation is allowed.
for (unsigned i = 0; i != Nodes.size(); ++i)
if (!Alive.count(Nodes[i])) {
DSNode *N = Nodes[i];
std::swap(Nodes[i--], Nodes.back()); // move node to end of vector
Nodes.pop_back(); // Erase node from alive list.
- DeadNodes.push_back(N); // Add node to our list of dead nodes
N->dropAllReferences(); // Drop all outgoing edges
+
+ while (!N->getReferrers().empty())
+ N->getReferrers().back()->setNode(0);
+ delete N;
}
-
- // Delete all dead nodes...
- std::for_each(DeadNodes.begin(), DeadNodes.end(), deleter<DSNode>);
}
#if 0
More information about the llvm-commits
mailing list