[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp DataStructure.cpp
Chris Lattner
lattner at cs.uiuc.edu
Thu Oct 3 16:56:01 PDT 2002
Changes in directory llvm/lib/Analysis/DataStructure:
BottomUpClosure.cpp updated: 1.13 -> 1.14
DataStructure.cpp updated: 1.21 -> 1.22
---
Log message:
Prune function nodes that are no longer referenced due to inlining
---
Diffs of the changes:
Index: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.13 llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.14
--- llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.13 Thu Oct 3 15:38:41 2002
+++ llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp Thu Oct 3 16:55:28 2002
@@ -253,6 +253,7 @@
Graph->maskIncompleteMarkers();
Graph->markIncompleteNodes();
+ Graph->removeTriviallyDeadNodes(false);
Graph->removeDeadNodes(/*KeepAllGlobals*/ true, /*KeepCalls*/ true);
DEBUG(std::cerr << " [BU] Done inlining: " << F.getName() << " ["
Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.21 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.22
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.21 Thu Oct 3 16:06:38 2002
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp Thu Oct 3 16:55:28 2002
@@ -578,7 +578,7 @@
N->getSize() == 0 &&
N->getReferrers().size() == N->getGlobals().size()) {
- // Remove the globals from the valuemap, so that the referrer count will go
+ // Remove the globals from the ValueMap, so that the referrer count will go
// down to zero.
removeRefsToGlobal(N, ValueMap);
assert(N->getReferrers().empty() && "Referrers should all be gone now!");
@@ -608,7 +608,7 @@
//
void DSGraph::removeTriviallyDeadNodes(bool KeepAllGlobals) {
for (unsigned i = 0; i != Nodes.size(); ++i)
- if (! KeepAllGlobals || ! (Nodes[i]->NodeType & DSNode::GlobalNode))
+ if (!KeepAllGlobals || !(Nodes[i]->NodeType & DSNode::GlobalNode))
if (isNodeDead(Nodes[i])) { // This node is dead!
delete Nodes[i]; // Free memory...
Nodes.erase(Nodes.begin()+i--); // Remove from node list...
More information about the llvm-commits
mailing list