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 | a2197139b5894a4225452b9ffc8417c5d05a157b (patch) | |
tree | 5fa4e0fb41ebd258547b622683d295adef6a8572 /lib/Analysis/DataStructure/BottomUpClosure.cpp | |
parent | 5805c426dcc2b330565d247677cb12acf7002f15 (diff) |
Now that the dead ctor is gone, nothing uses the old node mapping exported by
cloneInto: make it an internally used mapping.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20760 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/BottomUpClosure.cpp')
-rw-r--r-- | lib/Analysis/DataStructure/BottomUpClosure.cpp | 9 |
1 files changed, 3 insertions, 6 deletions
diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp index acb4b300f9..0a9994c411 100644 --- a/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/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; } |