From bab8c28924d42e982c2fde0bbb95eda95b19143b Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sat, 20 Sep 2003 21:34:07 +0000 Subject: 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 --- lib/Analysis/DataStructure/DataStructure.cpp | 14 ++++++++++++++ 1 file changed, 14 insertions(+) (limited to 'lib/Analysis/DataStructure') diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index 0a6fa57aa0..bdf8d810fb 100644 --- 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) { -- cgit v1.2.3-18-g5258