RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

don't generate temporary scalarmaps.

Browse Source 
llvm-svn: 20749
This commit is contained in:
Chris Lattner 2005-03-22 00:04:21 +00:00
parent 1ce92ebd00
commit e1c098449c
1 changed files with 5 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
lib/Analysis/DataStructure/Steensgaard.cpp
View File

@ -127,27 +127,15 @@ bool Steens::runOnModule(Module &M) {
// Loop over the rest of the module, merging graphs for non-external functions // Loop over the rest of the module, merging graphs for non-external functions
// into this graph. // into this graph.
// //
unsigned Count = 0;
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal()) { if (!I->isExternal()) {
DSGraph::ScalarMapTy ValMap(GlobalECs); DSGraph::NodeMapTy NodeMap;
{ // Scope to free NodeMap memory ASAP ResultGraph->cloneInto(LDS.getDSGraph(*I), ResultGraph->getScalarMap(),
DSGraph::NodeMapTy NodeMap; RetValMap, NodeMap, 0);
const DSGraph &FDSG = LDS.getDSGraph(*I);
ResultGraph->cloneInto(FDSG, ValMap, RetValMap, NodeMap, 0);
}
// Incorporate the inlined Function's ScalarMap into the global
// ScalarMap...
DSGraph::ScalarMapTy &GVM = ResultGraph->getScalarMap();
for (DSGraph::ScalarMapTy::iterator I = ValMap.begin(),
E = ValMap.end(); I != E; ++I)
GVM[I->first].mergeWith(I->second);
if ((++Count & 1) == 0) // Prune nodes out every other time...
ResultGraph->removeTriviallyDeadNodes();
} }
ResultGraph->removeTriviallyDeadNodes();
// FIXME: Must recalculate and use the Incomplete markers!! // FIXME: Must recalculate and use the Incomplete markers!!
// Now that we have all of the graphs inlined, we can go about eliminating // Now that we have all of the graphs inlined, we can go about eliminating