From d65145bd3d5cf7ca5f318b0ec8f8f42d34a39d35 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Tue, 22 Mar 2005 00:29:44 +0000 Subject: now that the second argument is always this->ReturnNodes, don't bother passing it. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20758 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Analysis/DataStructure/EquivClassGraphs.cpp | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) (limited to 'lib/Analysis/DataStructure/EquivClassGraphs.cpp') diff --git a/lib/Analysis/DataStructure/EquivClassGraphs.cpp b/lib/Analysis/DataStructure/EquivClassGraphs.cpp index 83b9d9a3f8..a778d94c58 100644 --- a/lib/Analysis/DataStructure/EquivClassGraphs.cpp +++ b/lib/Analysis/DataStructure/EquivClassGraphs.cpp @@ -271,7 +271,7 @@ void EquivClassGraphs::buildIndirectFunctionSets(Module &M) { // Clone this member of the equivalence class into MergedG. DSGraph::NodeMapTy NodeMap; - MergedG.cloneInto(CBUGraph, MergedG.getReturnNodes(), NodeMap, 0); + MergedG.cloneInto(CBUGraph, NodeMap); } // Merge the return nodes of all functions together. @@ -362,8 +362,10 @@ processSCC(DSGraph &FG, std::vector &Stack, unsigned &NextID, // If the SCC found is not the same as those found in CBU, make sure to // merge the graphs as appropriate. - DSGraph::NodeMapTy NodeMap; - FG.cloneInto(*NG, FG.getReturnNodes(), NodeMap); + { + DSGraph::NodeMapTy NodeMap; + FG.cloneInto(*NG, NodeMap); + } // Update the DSInfo map and delete the old graph... for (DSGraph::retnodes_iterator I = NG->retnodes_begin(); -- cgit v1.2.3-70-g09d2