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

IndCallGraphMap is now a pointer to a new'd map.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20065 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2005-02-07 16:09:15 +00:00
parent ddf5a35eed
commit bcc70bcb25
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Analysis/DataStructure/BottomUpClosure.cpp
View File

@ -40,6 +40,9 @@ bool BUDataStructures::runOnModule(Module &M) {
GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph()); GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph());
GlobalsGraph->setPrintAuxCalls(); GlobalsGraph->setPrintAuxCalls();
IndCallGraphMap = new std::map<std::vector<Function*>,
std::pair<DSGraph*, std::vector<DSNodeHandle> > >();
std::vector<Function*> Stack; std::vector<Function*> Stack;
hash_map<Function*, unsigned> ValMap; hash_map<Function*, unsigned> ValMap;
unsigned NextID = 1; unsigned NextID = 1;
@ -64,11 +67,11 @@ bool BUDataStructures::runOnModule(Module &M) {
// If we computed any temporary indcallgraphs, free them now. // If we computed any temporary indcallgraphs, free them now.
for (std::map<std::vector<Function*>, for (std::map<std::vector<Function*>,
std::pair<DSGraph*, std::vector<DSNodeHandle> > >::iterator I = std::pair<DSGraph*, std::vector<DSNodeHandle> > >::iterator I =
IndCallGraphMap.begin(), E = IndCallGraphMap.end(); I != E; ++I) { IndCallGraphMap->begin(), E = IndCallGraphMap->end(); I != E; ++I) {
I->second.second.clear(); // Drop arg refs into the graph. I->second.second.clear(); // Drop arg refs into the graph.
delete I->second.first; delete I->second.first;
} }
IndCallGraphMap.clear(); delete IndCallGraphMap;
// At the end of the bottom-up pass, the globals graph becomes complete. // At the end of the bottom-up pass, the globals graph becomes complete.
// FIXME: This is not the right way to do this, but it is sorta better than // FIXME: This is not the right way to do this, but it is sorta better than
@ -340,7 +343,7 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) {
// See if we already computed a graph for this set of callees. // See if we already computed a graph for this set of callees.
std::sort(CalledFuncs.begin(), CalledFuncs.end()); std::sort(CalledFuncs.begin(), CalledFuncs.end());
std::pair<DSGraph*, std::vector<DSNodeHandle> > &IndCallGraph = std::pair<DSGraph*, std::vector<DSNodeHandle> > &IndCallGraph =
IndCallGraphMap[CalledFuncs]; (*IndCallGraphMap)[CalledFuncs];
if (IndCallGraph.first == 0) { if (IndCallGraph.first == 0) {
std::vector<Function*>::iterator I = CalledFuncs.begin(), std::vector<Function*>::iterator I = CalledFuncs.begin(),