Remove trivially dead nodes was not removing nodes that were dead due to forwarding!

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8634 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp
index 0a6fa57aa07e4b145c00babf2ae5c4a45b52806a..bdf8d810fb667127098fbbdd3171d545e172eac4 100644 (file)
--- a/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1228,6 +1228,20 @@ void DSGraph::removeTriviallyDeadNodes() {
   removeIdenticalCalls(FunctionCalls);
   removeIdenticalCalls(AuxFunctionCalls);
 
+  // Loop over all of the nodes in the graph, calling getNode on each field.
+  // This will cause all nodes to update their forwarding edges, causing
+  // forwarded nodes to be delete-able.
+  for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
+    DSNode *N = Nodes[i];
+    for (unsigned l = 0, e = N->getNumLinks(); l != e; ++l)
+      N->getLink(l*N->getPointerSize()).getNode();
+  }
+
+  // Likewise, forward any edges from the scalar nodes...
+  for (ScalarMapTy::iterator I = ScalarMap.begin(), E = ScalarMap.end();
+       I != E; ++I)
+    I->second.getNode();
+
   bool isGlobalsGraph = !GlobalsGraph;
 
   for (unsigned i = 0; i != Nodes.size(); ++i) {