6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-23 01:24:30 +00:00
Code Issues Projects Releases Wiki Activity

Rename FoldedGraph -> DSInfo to be consistent with other passes

Browse Source 
delete some dead methods


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17410 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2004-11-01 21:02:23 +00:00
parent 1f92301a7d
commit fcb7d950bc
2 changed files with 8 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
include/llvm/Analysis/DataStructure/EquivClassGraphs.h
View File

@ -38,8 +38,8 @@ namespace PA {
DSGraph *GlobalsGraph;
// FoldedGraphsMap, one graph for each function
hash_map<const Function*, DSGraph*> FoldedGraphsMap;
// DSInfo - one graph for each function.
hash_map<const Function*, DSGraph*> DSInfo;
/// ActualCallees - The actual functions callable from indirect call sites.
///
@ -70,9 +70,8 @@ namespace PA {
/// callees also have the same folded graph as the CBU graph.
///
DSGraph &getDSGraph(const Function &F) const {
hash_map<const Function*, DSGraph*>::const_iterator I =
FoldedGraphsMap.find(const_cast<Function*>(&F));
assert(I != FoldedGraphsMap.end() && "No folded graph for function!");
hash_map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
assert(I != DSInfo.end() && "No graph computed for that function!");
return *I->second;
}
@ -124,19 +123,6 @@ namespace PA {
void processGraph(DSGraph &FG, Function &F);
DSGraph &getOrCreateGraph(Function &F);
bool hasFoldedGraph(const Function& F) const {
hash_map<const Function*, DSGraph*>::const_iterator I =
FoldedGraphsMap.find(const_cast<Function*>(&F));
return (I != FoldedGraphsMap.end());
}
DSGraph* getOrCreateLeaderGraph(const Function& leader) {
DSGraph*& leaderGraph = FoldedGraphsMap[&leader];
if (leaderGraph == NULL)
leaderGraph = new DSGraph(CBU->getGlobalsGraph().getTargetData());
return leaderGraph;
}
};
}; // end PA namespace