diff options
author | Chris Lattner <sabre@nondot.org> | 2004-11-01 21:02:23 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2004-11-01 21:02:23 +0000 |
commit | fcb7d950bcf636f744c3f399a39210145889baba (patch) | |
tree | f63e707f40abfe37b0f8d85d4ebdc482de2b2db1 /lib | |
parent | 1f92301a7dc8a0670b8bb625343d0956cd3c0d8a (diff) | |
download | external_llvm-fcb7d950bcf636f744c3f399a39210145889baba.zip external_llvm-fcb7d950bcf636f744c3f399a39210145889baba.tar.gz external_llvm-fcb7d950bcf636f744c3f399a39210145889baba.tar.bz2 |
Rename FoldedGraph -> DSInfo to be consistent with other passes
delete some dead methods
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17410 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Analysis/DataStructure/EquivClassGraphs.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/Analysis/DataStructure/EquivClassGraphs.cpp b/lib/Analysis/DataStructure/EquivClassGraphs.cpp index 1d80b9c..70c8f6b 100644 --- a/lib/Analysis/DataStructure/EquivClassGraphs.cpp +++ b/lib/Analysis/DataStructure/EquivClassGraphs.cpp @@ -210,7 +210,7 @@ void PA::EquivClassGraphs::buildIndirectFunctionSets(Module &M) { for (std::set<Function*>::const_iterator EqI = EqClass.begin(), EqEnd = EqClass.end(); EqI != EqEnd; ++EqI) { Function* F = *EqI; - DSGraph*& FG = FoldedGraphsMap[F]; + DSGraph*& FG = DSInfo[F]; if (F == LF || FG == mergedG) continue; @@ -253,7 +253,7 @@ void PA::EquivClassGraphs::buildIndirectFunctionSets(Module &M) { DSGraph &PA::EquivClassGraphs::getOrCreateGraph(Function &F) { // Has the graph already been created? - DSGraph *&Graph = FoldedGraphsMap[&F]; + DSGraph *&Graph = DSInfo[&F]; if (Graph) return *Graph; DSGraph &CBUGraph = CBU->getDSGraph(F); @@ -263,11 +263,11 @@ DSGraph &PA::EquivClassGraphs::getOrCreateGraph(Function &F) { Graph->setGlobalsGraph(&getGlobalsGraph()); Graph->setPrintAuxCalls(); - // Make sure to update the FoldedGraphsMap map for all functions in the graph! + // Make sure to update the DSInfo map for all functions in the graph! for (DSGraph::ReturnNodesTy::iterator I = Graph->getReturnNodes().begin(); I != Graph->getReturnNodes().end(); ++I) if (I->first != &F) { - DSGraph*& FG = FoldedGraphsMap[I->first]; + DSGraph *&FG = DSInfo[I->first]; assert(FG == NULL || FG == &CBU->getDSGraph(*I->first) && "Merging function in SCC twice?"); FG = Graph; |