aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/TopDownClosure.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2003-02-03 22:51:28 +0000
committerChris Lattner <sabre@nondot.org>2003-02-03 22:51:28 +0000
commit4923d1be916826cd90bf092d9aafdb6df80e97b2 (patch)
tree0553b010495b32980f539232683c866d07a9b34d /lib/Analysis/DataStructure/TopDownClosure.cpp
parent8105cfbed0b4e51b6d7d62ad3e84885e27451cf3 (diff)
Hack to work around deficiency in pass infrastructure
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5485 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/TopDownClosure.cpp')
-rw-r--r--lib/Analysis/DataStructure/TopDownClosure.cpp12
1 files changed, 9 insertions, 3 deletions
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index 367f6a1d27..49b3a5482e 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -13,8 +13,10 @@
#include "llvm/DerivedTypes.h"
#include "Support/Statistic.h"
-static RegisterAnalysis<TDDataStructures>
-Y("tddatastructure", "Top-down Data Structure Analysis Closure");
+namespace {
+ RegisterAnalysis<TDDataStructures> // Register the pass
+ Y("tddatastructure", "Top-down Data Structure Analysis Closure");
+}
// run - Calculate the top down data structure graphs for each function in the
// program.
@@ -39,7 +41,10 @@ bool TDDataStructures::run(Module &M) {
// releaseMemory - If the pass pipeline is done with this pass, we can release
// our memory... here...
//
-void TDDataStructures::releaseMemory() {
+// FIXME: This should be releaseMemory and will work fine, except that LoadVN
+// has no way to extend the lifetime of the pass, which screws up ds-aa.
+//
+void TDDataStructures::releaseMyMemory() {
for (hash_map<const Function*, DSGraph*>::iterator I = DSInfo.begin(),
E = DSInfo.end(); I != E; ++I)
delete I->second;
@@ -206,3 +211,4 @@ void TDDataStructures::calculateGraph(Function &F) {
calculateGraph(*I->first);
}
}
+