diff options
Diffstat (limited to 'lib/Analysis/DataStructure/BottomUpClosure.cpp')
| -rw-r--r-- | lib/Analysis/DataStructure/BottomUpClosure.cpp | 8 |
1 files changed, 3 insertions, 5 deletions
diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp index f207c52352..1406da7738 100644 --- a/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/lib/Analysis/DataStructure/BottomUpClosure.cpp @@ -187,8 +187,7 @@ unsigned BUDataStructures::calculateGraphs(Function *F, if (&G != SCCGraph) { DSGraph::NodeMapTy NodeMap; SCCGraph->cloneInto(G, SCCGraph->getScalarMap(), - SCCGraph->getReturnNodes(), NodeMap, - DSGraph::UpdateInlinedGlobals); + SCCGraph->getReturnNodes(), NodeMap); // Update the DSInfo map and delete the old graph... DSInfo[*I] = SCCGraph; delete &G; @@ -196,7 +195,7 @@ unsigned BUDataStructures::calculateGraphs(Function *F, } // Clean up the graph before we start inlining a bunch again... - SCCGraph->removeTriviallyDeadNodes(); + SCCGraph->removeDeadNodes(DSGraph::RemoveUnreachableGlobals); // Now that we have one big happy family, resolve all of the call sites in // the graph... @@ -283,7 +282,6 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { << Graph.getFunctionNames() << "' [" << Graph.getGraphSize() << "+" << Graph.getAuxFunctionCalls().size() << "]\n"); - // Handle self recursion by resolving the arguments and return value Graph.mergeInGraph(CS, *Callee, GI, DSGraph::KeepModRefBits | DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes); @@ -304,7 +302,7 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { // Re-materialize nodes from the globals graph. // Do not ignore globals inlined from callees -- they are not up-to-date! - Graph.getInlinedGlobals().clear(); + assert(Graph.getInlinedGlobals().empty()); Graph.updateFromGlobalGraph(); // Recompute the Incomplete markers |