diff options
author | Chris Lattner <sabre@nondot.org> | 2005-03-22 00:36:51 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-03-22 00:36:51 +0000 |
commit | fcae88f280bfca7377eb627eb4496e680df239cd (patch) | |
tree | 0567ed4bb7324e7fd6096c6a2c3b3a087c11f043 /llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp | |
parent | 8016c975c9ddb15a3b47238555be46caafebd62e (diff) | |
download | llvm-fcae88f280bfca7377eb627eb4496e680df239cd.zip llvm-fcae88f280bfca7377eb627eb4496e680df239cd.tar.gz llvm-fcae88f280bfca7377eb627eb4496e680df239cd.tar.bz2 |
Now that the dead ctor is gone, nothing uses the old node mapping exported by
cloneInto: make it an internally used mapping.
llvm-svn: 20760
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp')
-rw-r--r-- | llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp | 9 |
1 files changed, 3 insertions, 6 deletions
diff --git a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp index acb4b30..0a9994c 100644 --- a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp @@ -267,10 +267,8 @@ unsigned BUDataStructures::calculateGraphs(Function *F, E = SCCGraphs.end(); I != E; ++I) { DSGraph &G = **I; if (&G != SCCGraph) { - { - DSGraph::NodeMapTy NodeMap; - SCCGraph->cloneInto(G, NodeMap); - } + SCCGraph->cloneInto(G); + // Update the DSInfo map and delete the old graph... for (DSGraph::retnodes_iterator I = G.retnodes_begin(), E = G.retnodes_end(); I != E; ++I) @@ -412,8 +410,7 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { // If the graph already contains the nodes for the function, don't // bother merging it in again. if (!GI->containsFunction(*I)) { - DSGraph::NodeMapTy NodeMap; - GI->cloneInto(getDSGraph(**I), NodeMap); + GI->cloneInto(getDSGraph(**I)); ++NumBUInlines; } |