From: Chris Lattner <sabre@nondot.org>
Date: Mon, 30 Jun 2003 04:53:08 +0000 (+0000)
Subject: Do not multiply delete graphs if functions are sharing graphs
X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=3d162907e3f52560cdd75e4bedf5d37795b8d79c;p=oota-llvm.git

Do not multiply delete graphs if functions are sharing graphs


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6997 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index 85a79d1076a..7eea9226612 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -45,10 +45,12 @@ bool TDDataStructures::run(Module &M) {
 // has no way to extend the lifetime of the pass, which screws up ds-aa.
 //
 void TDDataStructures::releaseMyMemory() {
-  return;
-  for (hash_map<const Function*, DSGraph*>::iterator I = DSInfo.begin(),
-         E = DSInfo.end(); I != E; ++I)
-    delete I->second;
+  for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
+         E = DSInfo.end(); I != E; ++I) {
+    I->second->getReturnNodes().erase(I->first);
+    if (I->second->getReturnNodes().empty())
+      delete I->second;
+  }
 
   // Empty map so next time memory is released, data structures are not
   // re-deleted.