aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorDevang Patel <dpatel@apple.com>2006-12-07 22:17:09 +0000
committerDevang Patel <dpatel@apple.com>2006-12-07 22:17:09 +0000
commit6e49d8b4bf7b5911dc953551672161b8f9a7418f (patch)
treebcc6aa2e6aff256482ca5fc680d9a5659b8d14dc
parentc88fa749eb85371f54917446b69eb89527fd12b7 (diff)
downloadexternal_llvm-6e49d8b4bf7b5911dc953551672161b8f9a7418f.zip
external_llvm-6e49d8b4bf7b5911dc953551672161b8f9a7418f.tar.gz
external_llvm-6e49d8b4bf7b5911dc953551672161b8f9a7418f.tar.bz2
PMDataManager does not maintain LastUser info.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@32332 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--lib/VMCore/PassManager.cpp26
1 files changed, 1 insertions, 25 deletions
diff --git a/lib/VMCore/PassManager.cpp b/lib/VMCore/PassManager.cpp
index 29d0ec1..d0672d1 100644
--- a/lib/VMCore/PassManager.cpp
+++ b/lib/VMCore/PassManager.cpp
@@ -244,7 +244,6 @@ public:
// Initialize available analysis information.
void initializeAnalysisInfo() {
AvailableAnalysis.clear();
- LastUser.clear();
// Include immutable passes into AvailableAnalysis vector.
std::vector<ImmutablePass *> &ImmutablePasses = TPM->getImmutablePasses();
@@ -268,11 +267,6 @@ public:
return PassVector.end();
}
- inline void setLastUser(Pass *P, Pass *LU) {
- LastUser[P] = LU;
- // TODO : Check if pass P is available.
- }
-
// Access toplevel manager
PMTopLevelManager *getTopLevelManager() { return TPM; }
void setTopLevelManager(PMTopLevelManager *T) { TPM = T; }
@@ -284,10 +278,6 @@ private:
// scheduled to run.
std::map<AnalysisID, Pass*> AvailableAnalysis;
- // Map to keep track of last user of the analysis pass.
- // LastUser->second is the last user of Lastuser->first.
- std::map<Pass *, Pass *> LastUser;
-
// Collection of pass that are managed by this manager
std::vector<Pass *> PassVector;
@@ -510,21 +500,7 @@ void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
/// Remove analysis passes that are not used any longer
void PMDataManager::removeDeadPasses(Pass *P) {
-
- for (std::map<Pass *, Pass *>::iterator I = LastUser.begin(),
- E = LastUser.end(); I !=E; ++I) {
- if (I->second == P) {
- Pass *deadPass = I->first;
- deadPass->releaseMemory();
-
- std::map<AnalysisID, Pass*>::iterator Pos =
- AvailableAnalysis.find(deadPass->getPassInfo());
-
- assert (Pos != AvailableAnalysis.end() &&
- "Pass is not available");
- AvailableAnalysis.erase(Pos);
- }
- }
+ // TODO : reimplement
}
/// Add pass P into the PassVector. Update