aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Analysis/DataStructure/TopDownClosure.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-03-22 01:50:42 +0000
committerChris Lattner <sabre@nondot.org>2005-03-22 01:50:42 +0000
commit9308a35532bb756cc03edbdc2deeea6f2d3ed1ed (patch)
treea6553de14f474d7b88be44f57313aaff0b9eb2bb /lib/Analysis/DataStructure/TopDownClosure.cpp
parent3bc703ba22e8e04b4120dad6dffdf63bb373083c (diff)
downloadexternal_llvm-9308a35532bb756cc03edbdc2deeea6f2d3ed1ed.zip
external_llvm-9308a35532bb756cc03edbdc2deeea6f2d3ed1ed.tar.gz
external_llvm-9308a35532bb756cc03edbdc2deeea6f2d3ed1ed.tar.bz2
When making a clone of a DSGraph from the BU pass, make sure to remember that
this clone is supposed to be used for *ALL* of the functions in the SCC. This fixes the memory explosion problem the TD pass was having, reducing the memory growth from 24MB -> 3.5MB on povray and 270MB ->8.3MB on perlbmk! This obviously also speeds up the TD pass *a lot*. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20763 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/TopDownClosure.cpp')
-rw-r--r--lib/Analysis/DataStructure/TopDownClosure.cpp9
1 files changed, 8 insertions, 1 deletions
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index f1aea79..45b2f2b 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -105,8 +105,8 @@ bool TDDataStructures::runOnModule(Module &M) {
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal())
getOrCreateDSGraph(*I);
+ return false;
}
-//return false;
#endif
@@ -154,6 +154,13 @@ DSGraph &TDDataStructures::getOrCreateDSGraph(Function &F) {
assert(G->getAuxFunctionCalls().empty() && "Cloned aux calls?");
G->setPrintAuxCalls();
G->setGlobalsGraph(GlobalsGraph);
+
+ // Note that this graph is the graph for ALL of the function in the SCC, not
+ // just F.
+ for (DSGraph::retnodes_iterator RI = G->retnodes_begin(),
+ E = G->retnodes_end(); RI != E; ++RI)
+ if (RI->first != &F)
+ DSInfo[RI->first] = G;
}
return *G;
}