1 //===- PassManager.cpp - LLVM Pass Infrastructure Implementation ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Devang Patel and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the LLVM Pass Manager infrastructure.
12 //===----------------------------------------------------------------------===//
15 #include "llvm/PassManager.h"
16 #include "llvm/Module.h"
17 #include "llvm/ModuleProvider.h"
18 #include "llvm/Support/Streams.h"
23 //===----------------------------------------------------------------------===//
25 // The Pass Manager Infrastructure manages passes. It's responsibilities are:
27 // o Manage optimization pass execution order
28 // o Make required Analysis information available before pass P is run
29 // o Release memory occupied by dead passes
30 // o If Analysis information is dirtied by a pass then regenerate Analysis
31 // information before it is consumed by another pass.
33 // Pass Manager Infrastructure uses multipe pass managers. They are PassManager,
34 // FunctionPassManager, ModulePassManager, BasicBlockPassManager. This class
35 // hierarcy uses multiple inheritance but pass managers do not derive from
36 // another pass manager.
38 // PassManager and FunctionPassManager are two top level pass manager that
39 // represents the external interface of this entire pass manager infrastucture.
41 // Important classes :
43 // [o] class PMTopLevelManager;
45 // Two top level managers, PassManager and FunctionPassManager, derive from
46 // PMTopLevelManager. PMTopLevelManager manages information used by top level
47 // managers such as last user info.
49 // [o] class PMDataManager;
51 // PMDataManager manages information, e.g. list of available analysis info,
52 // used by a pass manager to manage execution order of passes. It also provides
53 // a place to implement common pass manager APIs. All pass managers derive from
56 // [o] class BasicBlockPassManager : public FunctionPass, public PMDataManager;
58 // BasicBlockPassManager manages BasicBlockPasses.
60 // [o] class FunctionPassManager;
62 // This is a external interface used by JIT to manage FunctionPasses. This
63 // interface relies on FunctionPassManagerImpl to do all the tasks.
65 // [o] class FunctionPassManagerImpl : public ModulePass, PMDataManager,
66 // public PMTopLevelManager;
68 // FunctionPassManagerImpl is a top level manager. It manages FunctionPasses
69 // and BasicBlockPassManagers.
71 // [o] class ModulePassManager : public Pass, public PMDataManager;
73 // ModulePassManager manages ModulePasses and FunctionPassManagerImpls.
75 // [o] class PassManager;
77 // This is a external interface used by various tools to manages passes. It
78 // relies on PassManagerImpl to do all the tasks.
80 // [o] class PassManagerImpl : public Pass, public PMDataManager,
81 // public PMDTopLevelManager
83 // PassManagerImpl is a top level pass manager responsible for managing
84 // ModulePassManagers.
85 //===----------------------------------------------------------------------===//
89 //===----------------------------------------------------------------------===//
92 /// PMTopLevelManager manages LastUser info and collects common APIs used by
93 /// top level pass managers.
94 class PMTopLevelManager {
98 inline std::vector<Pass *>::iterator passManagersBegin() {
99 return PassManagers.begin();
102 inline std::vector<Pass *>::iterator passManagersEnd() {
103 return PassManagers.end();
106 /// Schedule pass P for execution. Make sure that passes required by
107 /// P are run before P is run. Update analysis info maintained by
108 /// the manager. Remove dead passes. This is a recursive function.
109 void schedulePass(Pass *P);
111 /// This is implemented by top level pass manager and used by
112 /// schedulePass() to add analysis info passes that are not available.
113 virtual void addTopLevelPass(Pass *P) = 0;
115 /// Set pass P as the last user of the given analysis passes.
116 void setLastUser(std::vector<Pass *> &AnalysisPasses, Pass *P);
118 /// Collect passes whose last user is P
119 void collectLastUses(std::vector<Pass *> &LastUses, Pass *P);
121 /// Find the pass that implements Analysis AID. Search immutable
122 /// passes and all pass managers. If desired pass is not found
123 /// then return NULL.
124 Pass *findAnalysisPass(AnalysisID AID);
126 virtual ~PMTopLevelManager() {
127 PassManagers.clear();
130 /// Add immutable pass and initialize it.
131 inline void addImmutablePass(ImmutablePass *P) {
133 ImmutablePasses.push_back(P);
136 inline std::vector<ImmutablePass *>& getImmutablePasses() {
137 return ImmutablePasses;
140 void addPassManager(Pass *Manager) {
141 PassManagers.push_back(Manager);
144 // Add Manager into the list of managers that are not directly
145 // maintained by this top level pass manager
146 void addOtherPassManager(Pass *Manager) {
147 OtherPassManagers.push_back(Manager);
152 /// Collection of pass managers
153 std::vector<Pass *> PassManagers;
155 /// Collection of pass managers that are not directly maintained
156 /// by this pass manager
157 std::vector<Pass *> OtherPassManagers;
159 // Map to keep track of last user of the analysis pass.
160 // LastUser->second is the last user of Lastuser->first.
161 std::map<Pass *, Pass *> LastUser;
163 /// Immutable passes are managed by top level manager.
164 std::vector<ImmutablePass *> ImmutablePasses;
167 /// Set pass P as the last user of the given analysis passes.
168 void PMTopLevelManager::setLastUser(std::vector<Pass *> &AnalysisPasses,
171 for (std::vector<Pass *>::iterator I = AnalysisPasses.begin(),
172 E = AnalysisPasses.end(); I != E; ++I) {
175 // If AP is the last user of other passes then make P last user of
177 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
178 LUE = LastUser.end(); LUI != LUE; ++LUI) {
179 if (LUI->second == AP)
180 LastUser[LUI->first] = P;
186 /// Collect passes whose last user is P
187 void PMTopLevelManager::collectLastUses(std::vector<Pass *> &LastUses,
189 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
190 LUE = LastUser.end(); LUI != LUE; ++LUI)
191 if (LUI->second == P)
192 LastUses.push_back(LUI->first);
195 /// Schedule pass P for execution. Make sure that passes required by
196 /// P are run before P is run. Update analysis info maintained by
197 /// the manager. Remove dead passes. This is a recursive function.
198 void PMTopLevelManager::schedulePass(Pass *P) {
200 // TODO : Allocate function manager for this pass, other wise required set
201 // may be inserted into previous function manager
203 AnalysisUsage AnUsage;
204 P->getAnalysisUsage(AnUsage);
205 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
206 for (std::vector<AnalysisID>::const_iterator I = RequiredSet.begin(),
207 E = RequiredSet.end(); I != E; ++I) {
209 Pass *AnalysisPass = findAnalysisPass(*I);
211 // Schedule this analysis run first.
212 AnalysisPass = (*I)->createPass();
213 schedulePass(AnalysisPass);
217 // Now all required passes are available.
221 /// Find the pass that implements Analysis AID. Search immutable
222 /// passes and all pass managers. If desired pass is not found
223 /// then return NULL.
224 Pass *PMTopLevelManager::findAnalysisPass(AnalysisID AID) {
227 for (std::vector<ImmutablePass *>::iterator I = ImmutablePasses.begin(),
228 E = ImmutablePasses.end(); P == NULL && I != E; ++I) {
229 const PassInfo *PI = (*I)->getPassInfo();
233 // If Pass not found then check the interfaces implemented by Immutable Pass
235 const std::vector<const PassInfo*> &ImmPI =
236 PI->getInterfacesImplemented();
237 for (unsigned Index = 0, End = ImmPI.size();
238 P == NULL && Index != End; ++Index)
239 if (ImmPI[Index] == AID)
244 // Check pass managers
245 for (std::vector<Pass *>::iterator I = PassManagers.begin(),
246 E = PassManagers.end(); P == NULL && I != E; ++I)
247 P = NULL; // FIXME: (*I)->findAnalysisPass(AID, false /* Search downward */);
249 // Check other pass managers
250 for (std::vector<Pass *>::iterator I = OtherPassManagers.begin(),
251 E = OtherPassManagers.end(); P == NULL && I != E; ++I)
252 P = NULL; // FIXME: (*I)->findAnalysisPass(AID, false /* Search downward */);
257 //===----------------------------------------------------------------------===//
260 /// PMDataManager provides the common place to manage the analysis data
261 /// used by pass managers.
262 class PMDataManager {
266 PMDataManager(int D) : TPM(NULL), Depth(D) {
267 initializeAnalysisInfo();
270 /// Return true IFF pass P's required analysis set does not required new
272 bool manageablePass(Pass *P);
274 /// Augment AvailableAnalysis by adding analysis made available by pass P.
275 void recordAvailableAnalysis(Pass *P);
277 /// Remove Analysis that is not preserved by the pass
278 void removeNotPreservedAnalysis(Pass *P);
280 /// Remove dead passes
281 void removeDeadPasses(Pass *P);
283 /// Add pass P into the PassVector. Update
284 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
285 void addPassToManager (Pass *P, bool ProcessAnalysis = true);
287 /// Initialize available analysis information.
288 void initializeAnalysisInfo() {
289 ForcedLastUses.clear();
290 AvailableAnalysis.clear();
292 // Include immutable passes into AvailableAnalysis vector.
293 std::vector<ImmutablePass *> &ImmutablePasses = TPM->getImmutablePasses();
294 for (std::vector<ImmutablePass *>::iterator I = ImmutablePasses.begin(),
295 E = ImmutablePasses.end(); I != E; ++I)
296 recordAvailableAnalysis(*I);
299 /// Populate RequiredPasses with the analysis pass that are required by
301 void collectRequiredAnalysisPasses(std::vector<Pass *> &RequiredPasses,
304 /// All Required analyses should be available to the pass as it runs! Here
305 /// we fill in the AnalysisImpls member of the pass so that it can
306 /// successfully use the getAnalysis() method to retrieve the
307 /// implementations it needs.
308 void initializeAnalysisImpl(Pass *P);
310 /// Find the pass that implements Analysis AID. If desired pass is not found
311 /// then return NULL.
312 Pass *findAnalysisPass(AnalysisID AID, bool Direction);
314 inline std::vector<Pass *>::iterator passVectorBegin() {
315 return PassVector.begin();
318 inline std::vector<Pass *>::iterator passVectorEnd() {
319 return PassVector.end();
322 // Access toplevel manager
323 PMTopLevelManager *getTopLevelManager() { return TPM; }
324 void setTopLevelManager(PMTopLevelManager *T) { TPM = T; }
326 unsigned getDepth() { return Depth; }
330 // Collection of pass whose last user asked this manager to claim
331 // last use. If a FunctionPass F is the last user of ModulePass info M
332 // then the F's manager, not F, records itself as a last user of M.
333 std::vector<Pass *> ForcedLastUses;
335 // Top level manager.
336 // TODO : Make it a reference.
337 PMTopLevelManager *TPM;
340 // Set of available Analysis. This information is used while scheduling
341 // pass. If a pass requires an analysis which is not not available then
342 // equired analysis pass is scheduled to run before the pass itself is
344 std::map<AnalysisID, Pass*> AvailableAnalysis;
346 // Collection of pass that are managed by this manager
347 std::vector<Pass *> PassVector;
352 /// BasicBlockPassManager_New manages BasicBlockPass. It batches all the
353 /// pass together and sequence them to process one basic block before
354 /// processing next basic block.
355 class BasicBlockPassManager_New : public PMDataManager,
356 public FunctionPass {
359 BasicBlockPassManager_New(int D) : PMDataManager(D) { }
361 /// Add a pass into a passmanager queue.
362 bool addPass(Pass *p);
364 /// Execute all of the passes scheduled for execution. Keep track of
365 /// whether any of the passes modifies the function, and if so, return true.
366 bool runOnFunction(Function &F);
368 /// Pass Manager itself does not invalidate any analysis info.
369 void getAnalysisUsage(AnalysisUsage &Info) const {
370 Info.setPreservesAll();
373 bool doInitialization(Module &M);
374 bool doInitialization(Function &F);
375 bool doFinalization(Module &M);
376 bool doFinalization(Function &F);
380 /// FunctionPassManagerImpl_New manages FunctionPasses and BasicBlockPassManagers.
381 /// It batches all function passes and basic block pass managers together and
382 /// sequence them to process one function at a time before processing next
384 class FunctionPassManagerImpl_New : public ModulePass,
385 public PMDataManager,
386 public PMTopLevelManager {
388 FunctionPassManagerImpl_New(ModuleProvider *P, int D) :
389 PMDataManager(D) { /* TODO */ }
390 FunctionPassManagerImpl_New(int D) : PMDataManager(D) {
391 activeBBPassManager = NULL;
393 ~FunctionPassManagerImpl_New() { /* TODO */ };
395 inline void addTopLevelPass(Pass *P) {
397 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
399 // P is a immutable pass then it will be managed by this
400 // top level manager. Set up analysis resolver to connect them.
401 AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
403 addImmutablePass(IP);
409 /// add - Add a pass to the queue of passes to run. This passes
410 /// ownership of the Pass to the PassManager. When the
411 /// PassManager_X is destroyed, the pass will be destroyed as well, so
412 /// there is no need to delete the pass. (TODO delete passes.)
413 /// This implies that all passes MUST be allocated with 'new'.
418 /// Add pass into the pass manager queue.
419 bool addPass(Pass *P);
421 /// Execute all of the passes scheduled for execution. Keep
422 /// track of whether any of the passes modifies the function, and if
424 bool runOnModule(Module &M);
425 bool runOnFunction(Function &F);
426 bool run(Function &F);
428 /// doInitialization - Run all of the initializers for the function passes.
430 bool doInitialization(Module &M);
432 /// doFinalization - Run all of the initializers for the function passes.
434 bool doFinalization(Module &M);
436 /// Pass Manager itself does not invalidate any analysis info.
437 void getAnalysisUsage(AnalysisUsage &Info) const {
438 Info.setPreservesAll();
442 // Active Pass Managers
443 BasicBlockPassManager_New *activeBBPassManager;
446 /// ModulePassManager_New manages ModulePasses and function pass managers.
447 /// It batches all Module passes passes and function pass managers together and
448 /// sequence them to process one module.
449 class ModulePassManager_New : public Pass,
450 public PMDataManager {
453 ModulePassManager_New(int D) : PMDataManager(D) {
454 activeFunctionPassManager = NULL;
457 /// Add a pass into a passmanager queue.
458 bool addPass(Pass *p);
460 /// run - Execute all of the passes scheduled for execution. Keep track of
461 /// whether any of the passes modifies the module, and if so, return true.
462 bool runOnModule(Module &M);
464 /// Pass Manager itself does not invalidate any analysis info.
465 void getAnalysisUsage(AnalysisUsage &Info) const {
466 Info.setPreservesAll();
470 // Active Pass Manager
471 FunctionPassManagerImpl_New *activeFunctionPassManager;
474 /// PassManager_New manages ModulePassManagers
475 class PassManagerImpl_New : public Pass,
476 public PMDataManager,
477 public PMTopLevelManager {
481 PassManagerImpl_New(int D) : PMDataManager(D) {}
483 /// add - Add a pass to the queue of passes to run. This passes ownership of
484 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
485 /// will be destroyed as well, so there is no need to delete the pass. This
486 /// implies that all passes MUST be allocated with 'new'.
491 /// run - Execute all of the passes scheduled for execution. Keep track of
492 /// whether any of the passes modifies the module, and if so, return true.
495 /// Pass Manager itself does not invalidate any analysis info.
496 void getAnalysisUsage(AnalysisUsage &Info) const {
497 Info.setPreservesAll();
500 inline void addTopLevelPass(Pass *P) {
502 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
504 // P is a immutable pass and it will be managed by this
505 // top level manager. Set up analysis resolver to connect them.
506 AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
508 addImmutablePass(IP);
516 /// Add a pass into a passmanager queue.
517 bool addPass(Pass *p);
519 // Active Pass Manager
520 ModulePassManager_New *activeManager;
523 } // End of llvm namespace
525 //===----------------------------------------------------------------------===//
526 // PMDataManager implementation
528 /// Return true IFF pass P's required analysis set does not required new
530 bool PMDataManager::manageablePass(Pass *P) {
533 // If this pass is not preserving information that is required by a
534 // pass maintained by higher level pass manager then do not insert
535 // this pass into current manager. Use new manager. For example,
536 // For example, If FunctionPass F is not preserving ModulePass Info M1
537 // that is used by another ModulePass M2 then do not insert F in
538 // current function pass manager.
542 /// Augement AvailableAnalysis by adding analysis made available by pass P.
543 void PMDataManager::recordAvailableAnalysis(Pass *P) {
545 if (const PassInfo *PI = P->getPassInfo()) {
546 AvailableAnalysis[PI] = P;
548 //This pass is the current implementation of all of the interfaces it
549 //implements as well.
550 const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
551 for (unsigned i = 0, e = II.size(); i != e; ++i)
552 AvailableAnalysis[II[i]] = P;
556 /// Remove Analyss not preserved by Pass P
557 void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
558 AnalysisUsage AnUsage;
559 P->getAnalysisUsage(AnUsage);
561 if (AnUsage.getPreservesAll())
564 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
565 for (std::map<AnalysisID, Pass*>::iterator I = AvailableAnalysis.begin(),
566 E = AvailableAnalysis.end(); I != E; ++I ) {
567 if (std::find(PreservedSet.begin(), PreservedSet.end(), I->first) ==
568 PreservedSet.end()) {
569 // Remove this analysis
570 std::map<AnalysisID, Pass*>::iterator J = I++;
571 AvailableAnalysis.erase(J);
576 /// Remove analysis passes that are not used any longer
577 void PMDataManager::removeDeadPasses(Pass *P) {
579 std::vector<Pass *> DeadPasses;
580 TPM->collectLastUses(DeadPasses, P);
582 for (std::vector<Pass *>::iterator I = DeadPasses.begin(),
583 E = DeadPasses.end(); I != E; ++I) {
584 (*I)->releaseMemory();
586 std::map<AnalysisID, Pass*>::iterator Pos =
587 AvailableAnalysis.find((*I)->getPassInfo());
589 // It is possible that pass is already removed from the AvailableAnalysis
590 if (Pos != AvailableAnalysis.end())
591 AvailableAnalysis.erase(Pos);
595 /// Add pass P into the PassVector. Update
596 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
597 void PMDataManager::addPassToManager(Pass *P,
598 bool ProcessAnalysis) {
600 // This manager is going to manage pass P. Set up analysis resolver
602 AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
605 if (ProcessAnalysis) {
607 // At the moment, this pass is the last user of all required passes.
608 std::vector<Pass *> LastUses;
609 std::vector<Pass *> RequiredPasses;
610 unsigned PDepth = this->getDepth();
612 collectRequiredAnalysisPasses(RequiredPasses, P);
613 for (std::vector<Pass *>::iterator I = RequiredPasses.begin(),
614 E = RequiredPasses.end(); I != E; ++I) {
615 Pass *PRequired = *I;
617 //FIXME: RDepth = PRequired->getResolver()->getDepth();
618 if (PDepth == RDepth)
619 LastUses.push_back(PRequired);
620 else if (PDepth > RDepth) {
621 // Let the parent claim responsibility of last use
622 ForcedLastUses.push_back(PRequired);
624 // Note : This feature is not yet implemented
626 "Unable to handle Pass that requires lower level Analysis pass");
630 if (!LastUses.empty())
631 TPM->setLastUser(LastUses, P);
633 // Take a note of analysis required and made available by this pass.
634 // Remove the analysis not preserved by this pass
635 initializeAnalysisImpl(P);
636 removeNotPreservedAnalysis(P);
637 recordAvailableAnalysis(P);
641 PassVector.push_back(P);
644 /// Populate RequiredPasses with the analysis pass that are required by
646 void PMDataManager::collectRequiredAnalysisPasses(std::vector<Pass *> &RP,
648 AnalysisUsage AnUsage;
649 P->getAnalysisUsage(AnUsage);
650 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
651 for (std::vector<AnalysisID>::const_iterator
652 I = RequiredSet.begin(), E = RequiredSet.end();
654 Pass *AnalysisPass = findAnalysisPass(*I, true);
655 assert (AnalysisPass && "Analysis pass is not available");
656 RP.push_back(AnalysisPass);
660 // All Required analyses should be available to the pass as it runs! Here
661 // we fill in the AnalysisImpls member of the pass so that it can
662 // successfully use the getAnalysis() method to retrieve the
663 // implementations it needs.
665 void PMDataManager::initializeAnalysisImpl(Pass *P) {
666 AnalysisUsage AnUsage;
667 P->getAnalysisUsage(AnUsage);
669 for (std::vector<const PassInfo *>::const_iterator
670 I = AnUsage.getRequiredSet().begin(),
671 E = AnUsage.getRequiredSet().end(); I != E; ++I) {
672 Pass *Impl = findAnalysisPass(*I, true);
674 assert(0 && "Analysis used but not available!");
675 // TODO: P->AnalysisImpls.push_back(std::make_pair(*I, Impl));
679 /// Find the pass that implements Analysis AID. If desired pass is not found
680 /// then return NULL.
681 Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
683 // Check if AvailableAnalysis map has one entry.
684 std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
686 if (I != AvailableAnalysis.end())
689 // Search Parents through TopLevelManager
691 return TPM->findAnalysisPass(AID);
693 // FIXME : This is expensive and requires. Need to check only managers not all passes.
694 // One solution is to collect managers in advance at TPM level.
696 for(std::vector<Pass *>::iterator I = passVectorBegin(),
697 E = passVectorEnd(); P == NULL && I!= E; ++I )
698 P = NULL; // FIXME : P = (*I)->getResolver()->getAnalysisToUpdate(AID, false /* Do not search parents again */);
704 //===----------------------------------------------------------------------===//
705 // NOTE: Is this the right place to define this method ?
706 // getAnalysisToUpdate - Return an analysis result or null if it doesn't exist
707 Pass *AnalysisResolver_New::getAnalysisToUpdate(AnalysisID ID, bool dir) const {
708 return PM.findAnalysisPass(ID, dir);
711 //===----------------------------------------------------------------------===//
712 // BasicBlockPassManager_New implementation
714 /// Add pass P into PassVector and return true. If this pass is not
715 /// manageable by this manager then return false.
717 BasicBlockPassManager_New::addPass(Pass *P) {
719 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
723 // If this pass does not preserve anlysis that is used by other passes
724 // managed by this manager than it is not a suiable pass for this manager.
725 if (!manageablePass(P))
728 addPassToManager (BP);
733 /// Execute all of the passes scheduled for execution by invoking
734 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
735 /// the function, and if so, return true.
737 BasicBlockPassManager_New::runOnFunction(Function &F) {
739 bool Changed = doInitialization(F);
740 initializeAnalysisInfo();
742 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
743 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
744 e = passVectorEnd(); itr != e; ++itr) {
747 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
748 Changed |= BP->runOnBasicBlock(*I);
749 removeNotPreservedAnalysis(P);
750 recordAvailableAnalysis(P);
753 return Changed | doFinalization(F);
756 // Implement doInitialization and doFinalization
757 inline bool BasicBlockPassManager_New::doInitialization(Module &M) {
758 bool Changed = false;
760 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
761 e = passVectorEnd(); itr != e; ++itr) {
763 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
764 Changed |= BP->doInitialization(M);
770 inline bool BasicBlockPassManager_New::doFinalization(Module &M) {
771 bool Changed = false;
773 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
774 e = passVectorEnd(); itr != e; ++itr) {
776 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
777 Changed |= BP->doFinalization(M);
783 inline bool BasicBlockPassManager_New::doInitialization(Function &F) {
784 bool Changed = false;
786 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
787 e = passVectorEnd(); itr != e; ++itr) {
789 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
790 Changed |= BP->doInitialization(F);
796 inline bool BasicBlockPassManager_New::doFinalization(Function &F) {
797 bool Changed = false;
799 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
800 e = passVectorEnd(); itr != e; ++itr) {
802 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
803 Changed |= BP->doFinalization(F);
810 //===----------------------------------------------------------------------===//
811 // FunctionPassManager_New implementation
813 /// Create new Function pass manager
814 FunctionPassManager_New::FunctionPassManager_New() {
815 FPM = new FunctionPassManagerImpl_New(0);
818 FunctionPassManager_New::FunctionPassManager_New(ModuleProvider *P) {
819 FPM = new FunctionPassManagerImpl_New(0);
823 /// add - Add a pass to the queue of passes to run. This passes
824 /// ownership of the Pass to the PassManager. When the
825 /// PassManager_X is destroyed, the pass will be destroyed as well, so
826 /// there is no need to delete the pass. (TODO delete passes.)
827 /// This implies that all passes MUST be allocated with 'new'.
828 void FunctionPassManager_New::add(Pass *P) {
832 /// Execute all of the passes scheduled for execution. Keep
833 /// track of whether any of the passes modifies the function, and if
835 bool FunctionPassManager_New::runOnModule(Module &M) {
836 return FPM->runOnModule(M);
839 /// run - Execute all of the passes scheduled for execution. Keep
840 /// track of whether any of the passes modifies the function, and if
843 bool FunctionPassManager_New::run(Function &F) {
845 if (MP->materializeFunction(&F, &errstr)) {
846 cerr << "Error reading bytecode file: " << errstr << "\n";
853 /// doInitialization - Run all of the initializers for the function passes.
855 bool FunctionPassManager_New::doInitialization() {
856 return FPM->doInitialization(*MP->getModule());
859 /// doFinalization - Run all of the initializers for the function passes.
861 bool FunctionPassManager_New::doFinalization() {
862 return FPM->doFinalization(*MP->getModule());
865 //===----------------------------------------------------------------------===//
866 // FunctionPassManagerImpl_New implementation
868 /// Add pass P into the pass manager queue. If P is a BasicBlockPass then
869 /// either use it into active basic block pass manager or create new basic
870 /// block pass manager to handle pass P.
872 FunctionPassManagerImpl_New::addPass(Pass *P) {
874 // If P is a BasicBlockPass then use BasicBlockPassManager_New.
875 if (BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P)) {
877 if (!activeBBPassManager || !activeBBPassManager->addPass(BP)) {
879 // If active manager exists then clear its analysis info.
880 if (activeBBPassManager)
881 activeBBPassManager->initializeAnalysisInfo();
883 // Create and add new manager
884 activeBBPassManager =
885 new BasicBlockPassManager_New(getDepth() + 1);
886 addPassToManager(activeBBPassManager, false);
887 TPM->addOtherPassManager(activeBBPassManager);
889 // Add pass into new manager. This time it must succeed.
890 if (!activeBBPassManager->addPass(BP))
891 assert(0 && "Unable to add Pass");
894 if (!ForcedLastUses.empty())
895 TPM->setLastUser(ForcedLastUses, this);
900 FunctionPass *FP = dynamic_cast<FunctionPass *>(P);
904 // If this pass does not preserve anlysis that is used by other passes
905 // managed by this manager than it is not a suiable pass for this manager.
906 if (!manageablePass(P))
909 addPassToManager (FP);
911 // If active manager exists then clear its analysis info.
912 if (activeBBPassManager) {
913 activeBBPassManager->initializeAnalysisInfo();
914 activeBBPassManager = NULL;
920 /// Execute all of the passes scheduled for execution by invoking
921 /// runOnFunction method. Keep track of whether any of the passes modifies
922 /// the function, and if so, return true.
923 bool FunctionPassManagerImpl_New::runOnModule(Module &M) {
925 bool Changed = doInitialization(M);
926 initializeAnalysisInfo();
928 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
929 this->runOnFunction(*I);
931 return Changed | doFinalization(M);
934 /// Execute all of the passes scheduled for execution by invoking
935 /// runOnFunction method. Keep track of whether any of the passes modifies
936 /// the function, and if so, return true.
937 bool FunctionPassManagerImpl_New::runOnFunction(Function &F) {
939 bool Changed = false;
940 initializeAnalysisInfo();
942 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
943 e = passVectorEnd(); itr != e; ++itr) {
946 FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
947 Changed |= FP->runOnFunction(F);
948 removeNotPreservedAnalysis(P);
949 recordAvailableAnalysis(P);
956 inline bool FunctionPassManagerImpl_New::doInitialization(Module &M) {
957 bool Changed = false;
959 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
960 e = passVectorEnd(); itr != e; ++itr) {
963 FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
964 Changed |= FP->doInitialization(M);
970 inline bool FunctionPassManagerImpl_New::doFinalization(Module &M) {
971 bool Changed = false;
973 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
974 e = passVectorEnd(); itr != e; ++itr) {
977 FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
978 Changed |= FP->doFinalization(M);
984 // Execute all the passes managed by this top level manager.
985 // Return true if any function is modified by a pass.
986 bool FunctionPassManagerImpl_New::run(Function &F) {
988 bool Changed = false;
989 for (std::vector<Pass *>::iterator I = passManagersBegin(),
990 E = passManagersEnd(); I != E; ++I) {
991 FunctionPass *FP = dynamic_cast<FunctionPass *>(*I);
992 Changed |= FP->runOnFunction(F);
997 //===----------------------------------------------------------------------===//
998 // ModulePassManager implementation
1000 /// Add P into pass vector if it is manageble. If P is a FunctionPass
1001 /// then use FunctionPassManagerImpl_New to manage it. Return false if P
1002 /// is not manageable by this manager.
1004 ModulePassManager_New::addPass(Pass *P) {
1006 // If P is FunctionPass then use function pass maanager.
1007 if (FunctionPass *FP = dynamic_cast<FunctionPass*>(P)) {
1009 if (!activeFunctionPassManager || !activeFunctionPassManager->addPass(P)) {
1011 // If active manager exists then clear its analysis info.
1012 if (activeFunctionPassManager)
1013 activeFunctionPassManager->initializeAnalysisInfo();
1015 // Create and add new manager
1016 activeFunctionPassManager =
1017 new FunctionPassManagerImpl_New(getDepth() + 1);
1018 addPassToManager(activeFunctionPassManager, false);
1019 TPM->addOtherPassManager(activeFunctionPassManager);
1021 // Add pass into new manager. This time it must succeed.
1022 if (!activeFunctionPassManager->addPass(FP))
1023 assert(0 && "Unable to add pass");
1026 if (!ForcedLastUses.empty())
1027 TPM->setLastUser(ForcedLastUses, this);
1032 ModulePass *MP = dynamic_cast<ModulePass *>(P);
1036 // If this pass does not preserve anlysis that is used by other passes
1037 // managed by this manager than it is not a suiable pass for this manager.
1038 if (!manageablePass(P))
1041 addPassToManager(MP);
1042 // If active manager exists then clear its analysis info.
1043 if (activeFunctionPassManager) {
1044 activeFunctionPassManager->initializeAnalysisInfo();
1045 activeFunctionPassManager = NULL;
1052 /// Execute all of the passes scheduled for execution by invoking
1053 /// runOnModule method. Keep track of whether any of the passes modifies
1054 /// the module, and if so, return true.
1056 ModulePassManager_New::runOnModule(Module &M) {
1057 bool Changed = false;
1058 initializeAnalysisInfo();
1060 for (std::vector<Pass *>::iterator itr = passVectorBegin(),
1061 e = passVectorEnd(); itr != e; ++itr) {
1064 ModulePass *MP = dynamic_cast<ModulePass*>(P);
1065 Changed |= MP->runOnModule(M);
1066 removeNotPreservedAnalysis(P);
1067 recordAvailableAnalysis(P);
1068 removeDeadPasses(P);
1073 //===----------------------------------------------------------------------===//
1074 // PassManagerImpl implementation
1076 // PassManager_New implementation
1077 /// Add P into active pass manager or use new module pass manager to
1079 bool PassManagerImpl_New::addPass(Pass *P) {
1081 if (!activeManager || !activeManager->addPass(P)) {
1082 activeManager = new ModulePassManager_New(getDepth() + 1);
1084 // This top level manager is going to manage activeManager.
1085 // Set up analysis resolver to connect them.
1086 AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
1087 activeManager->setResolver(AR);
1089 addPassManager(activeManager);
1090 return activeManager->addPass(P);
1095 /// run - Execute all of the passes scheduled for execution. Keep track of
1096 /// whether any of the passes modifies the module, and if so, return true.
1097 bool PassManagerImpl_New::run(Module &M) {
1099 bool Changed = false;
1100 for (std::vector<Pass *>::iterator I = passManagersBegin(),
1101 E = passManagersEnd(); I != E; ++I) {
1102 ModulePassManager_New *MP = dynamic_cast<ModulePassManager_New *>(*I);
1103 Changed |= MP->runOnModule(M);
1108 //===----------------------------------------------------------------------===//
1109 // PassManager implementation
1111 /// Create new pass manager
1112 PassManager_New::PassManager_New() {
1113 PM = new PassManagerImpl_New(0);
1116 /// add - Add a pass to the queue of passes to run. This passes ownership of
1117 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
1118 /// will be destroyed as well, so there is no need to delete the pass. This
1119 /// implies that all passes MUST be allocated with 'new'.
1121 PassManager_New::add(Pass *P) {
1125 /// run - Execute all of the passes scheduled for execution. Keep track of
1126 /// whether any of the passes modifies the module, and if so, return true.
1128 PassManager_New::run(Module &M) {