diff options
Diffstat (limited to 'lib/Analysis/DataStructure/CompleteBottomUp.cpp')
-rw-r--r-- | lib/Analysis/DataStructure/CompleteBottomUp.cpp | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/lib/Analysis/DataStructure/CompleteBottomUp.cpp b/lib/Analysis/DataStructure/CompleteBottomUp.cpp index 1755c8574f..df700d24f8 100644 --- a/lib/Analysis/DataStructure/CompleteBottomUp.cpp +++ b/lib/Analysis/DataStructure/CompleteBottomUp.cpp @@ -168,6 +168,7 @@ unsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG, /// processGraph - Process the BU graphs for the program in bottom-up order on /// the SCC of the __ACTUAL__ call graph. This builds "complete" BU graphs. void CompleteBUDataStructures::processGraph(DSGraph &G) { + // The edges out of the current node are the call site targets... for (unsigned i = 0, e = G.getFunctionCalls().size(); i != e; ++i) { const DSCallSite &CS = G.getFunctionCalls()[i]; @@ -192,12 +193,8 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) { } } - // Re-materialize nodes from the globals graph. - // Do not ignore globals inlined from callees -- they are not up-to-date! - assert(G.getInlinedGlobals().empty()); - G.updateFromGlobalGraph(); - // Recompute the Incomplete markers + assert(G.getInlinedGlobals().empty()); G.maskIncompleteMarkers(); G.markIncompleteNodes(DSGraph::MarkFormalArgs); |