1 //===- PassManager.cpp - LLVM Pass Infrastructure Implementation ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the LLVM Pass Manager infrastructure.
12 //===----------------------------------------------------------------------===//
15 #include "llvm/PassManagers.h"
16 #include "llvm/Support/CommandLine.h"
17 #include "llvm/Support/Timer.h"
18 #include "llvm/Module.h"
19 #include "llvm/ModuleProvider.h"
20 #include "llvm/Support/Streams.h"
21 #include "llvm/Support/ManagedStatic.h"
22 #include "llvm/Analysis/Dominators.h"
23 #include "llvm-c/Core.h"
29 // See PassManagers.h for Pass Manager infrastructure overview.
33 //===----------------------------------------------------------------------===//
34 // Pass debugging information. Often it is useful to find out what pass is
35 // running when a crash occurs in a utility. When this library is compiled with
36 // debugging on, a command line option (--debug-pass) is enabled that causes the
37 // pass name to be printed before it executes.
40 // Different debug levels that can be enabled...
42 None, Arguments, Structure, Executions, Details
45 bool VerifyDomInfo = false;
46 static cl::opt<bool,true>
47 VerifyDomInfoX("verify-dom-info", cl::location(VerifyDomInfo),
48 cl::desc("Verify dominator info (time consuming)"));
50 static cl::opt<enum PassDebugLevel>
51 PassDebugging("debug-pass", cl::Hidden,
52 cl::desc("Print PassManager debugging information"),
54 clEnumVal(None , "disable debug output"),
55 clEnumVal(Arguments , "print pass arguments to pass to 'opt'"),
56 clEnumVal(Structure , "print pass structure before run()"),
57 clEnumVal(Executions, "print pass name before it is executed"),
58 clEnumVal(Details , "print pass details when it is executed"),
60 } // End of llvm namespace
64 //===----------------------------------------------------------------------===//
67 /// BBPassManager manages BasicBlockPass. It batches all the
68 /// pass together and sequence them to process one basic block before
69 /// processing next basic block.
70 class VISIBILITY_HIDDEN BBPassManager : public PMDataManager,
75 explicit BBPassManager(int Depth)
76 : PMDataManager(Depth), FunctionPass((intptr_t)&ID) {}
78 /// Execute all of the passes scheduled for execution. Keep track of
79 /// whether any of the passes modifies the function, and if so, return true.
80 bool runOnFunction(Function &F);
82 /// Pass Manager itself does not invalidate any analysis info.
83 void getAnalysisUsage(AnalysisUsage &Info) const {
84 Info.setPreservesAll();
87 bool doInitialization(Module &M);
88 bool doInitialization(Function &F);
89 bool doFinalization(Module &M);
90 bool doFinalization(Function &F);
92 virtual const char *getPassName() const {
93 return "BasicBlock Pass Manager";
96 // Print passes managed by this manager
97 void dumpPassStructure(unsigned Offset) {
98 llvm::cerr << std::string(Offset*2, ' ') << "BasicBlockPass Manager\n";
99 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
100 BasicBlockPass *BP = getContainedPass(Index);
101 BP->dumpPassStructure(Offset + 1);
102 dumpLastUses(BP, Offset+1);
106 BasicBlockPass *getContainedPass(unsigned N) {
107 assert ( N < PassVector.size() && "Pass number out of range!");
108 BasicBlockPass *BP = static_cast<BasicBlockPass *>(PassVector[N]);
112 virtual PassManagerType getPassManagerType() const {
113 return PMT_BasicBlockPassManager;
117 char BBPassManager::ID = 0;
122 //===----------------------------------------------------------------------===//
123 // FunctionPassManagerImpl
125 /// FunctionPassManagerImpl manages FPPassManagers
126 class FunctionPassManagerImpl : public Pass,
127 public PMDataManager,
128 public PMTopLevelManager {
131 explicit FunctionPassManagerImpl(int Depth) :
132 Pass((intptr_t)&ID), PMDataManager(Depth),
133 PMTopLevelManager(TLM_Function) { }
135 /// add - Add a pass to the queue of passes to run. This passes ownership of
136 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
137 /// will be destroyed as well, so there is no need to delete the pass. This
138 /// implies that all passes MUST be allocated with 'new'.
143 /// run - Execute all of the passes scheduled for execution. Keep track of
144 /// whether any of the passes modifies the module, and if so, return true.
145 bool run(Function &F);
147 /// doInitialization - Run all of the initializers for the function passes.
149 bool doInitialization(Module &M);
151 /// doFinalization - Run all of the finalizers for the function passes.
153 bool doFinalization(Module &M);
155 /// Pass Manager itself does not invalidate any analysis info.
156 void getAnalysisUsage(AnalysisUsage &Info) const {
157 Info.setPreservesAll();
160 inline void addTopLevelPass(Pass *P) {
162 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
164 // P is a immutable pass and it will be managed by this
165 // top level manager. Set up analysis resolver to connect them.
166 AnalysisResolver *AR = new AnalysisResolver(*this);
168 initializeAnalysisImpl(P);
169 addImmutablePass(IP);
170 recordAvailableAnalysis(IP);
172 P->assignPassManager(activeStack);
177 FPPassManager *getContainedManager(unsigned N) {
178 assert ( N < PassManagers.size() && "Pass number out of range!");
179 FPPassManager *FP = static_cast<FPPassManager *>(PassManagers[N]);
184 char FunctionPassManagerImpl::ID = 0;
185 //===----------------------------------------------------------------------===//
188 /// MPPassManager manages ModulePasses and function pass managers.
189 /// It batches all Module passes and function pass managers together and
190 /// sequences them to process one module.
191 class MPPassManager : public Pass, public PMDataManager {
195 explicit MPPassManager(int Depth) :
196 Pass((intptr_t)&ID), PMDataManager(Depth) { }
198 // Delete on the fly managers.
199 virtual ~MPPassManager() {
200 for (std::map<Pass *, FunctionPassManagerImpl *>::iterator
201 I = OnTheFlyManagers.begin(), E = OnTheFlyManagers.end();
203 FunctionPassManagerImpl *FPP = I->second;
208 /// run - Execute all of the passes scheduled for execution. Keep track of
209 /// whether any of the passes modifies the module, and if so, return true.
210 bool runOnModule(Module &M);
212 /// Pass Manager itself does not invalidate any analysis info.
213 void getAnalysisUsage(AnalysisUsage &Info) const {
214 Info.setPreservesAll();
217 /// Add RequiredPass into list of lower level passes required by pass P.
218 /// RequiredPass is run on the fly by Pass Manager when P requests it
219 /// through getAnalysis interface.
220 virtual void addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass);
222 /// Return function pass corresponding to PassInfo PI, that is
223 /// required by module pass MP. Instantiate analysis pass, by using
224 /// its runOnFunction() for function F.
225 virtual Pass* getOnTheFlyPass(Pass *MP, const PassInfo *PI, Function &F);
227 virtual const char *getPassName() const {
228 return "Module Pass Manager";
231 // Print passes managed by this manager
232 void dumpPassStructure(unsigned Offset) {
233 llvm::cerr << std::string(Offset*2, ' ') << "ModulePass Manager\n";
234 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
235 ModulePass *MP = getContainedPass(Index);
236 MP->dumpPassStructure(Offset + 1);
237 if (FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP])
238 FPP->dumpPassStructure(Offset + 2);
239 dumpLastUses(MP, Offset+1);
243 ModulePass *getContainedPass(unsigned N) {
244 assert ( N < PassVector.size() && "Pass number out of range!");
245 ModulePass *MP = static_cast<ModulePass *>(PassVector[N]);
249 virtual PassManagerType getPassManagerType() const {
250 return PMT_ModulePassManager;
254 /// Collection of on the fly FPPassManagers. These managers manage
255 /// function passes that are required by module passes.
256 std::map<Pass *, FunctionPassManagerImpl *> OnTheFlyManagers;
259 char MPPassManager::ID = 0;
260 //===----------------------------------------------------------------------===//
264 /// PassManagerImpl manages MPPassManagers
265 class PassManagerImpl : public Pass,
266 public PMDataManager,
267 public PMTopLevelManager {
271 explicit PassManagerImpl(int Depth) :
272 Pass((intptr_t)&ID), PMDataManager(Depth),
273 PMTopLevelManager(TLM_Pass) { }
275 /// add - Add a pass to the queue of passes to run. This passes ownership of
276 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
277 /// will be destroyed as well, so there is no need to delete the pass. This
278 /// implies that all passes MUST be allocated with 'new'.
283 /// run - Execute all of the passes scheduled for execution. Keep track of
284 /// whether any of the passes modifies the module, and if so, return true.
287 /// Pass Manager itself does not invalidate any analysis info.
288 void getAnalysisUsage(AnalysisUsage &Info) const {
289 Info.setPreservesAll();
292 inline void addTopLevelPass(Pass *P) {
294 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
296 // P is a immutable pass and it will be managed by this
297 // top level manager. Set up analysis resolver to connect them.
298 AnalysisResolver *AR = new AnalysisResolver(*this);
300 initializeAnalysisImpl(P);
301 addImmutablePass(IP);
302 recordAvailableAnalysis(IP);
304 P->assignPassManager(activeStack);
309 MPPassManager *getContainedManager(unsigned N) {
310 assert ( N < PassManagers.size() && "Pass number out of range!");
311 MPPassManager *MP = static_cast<MPPassManager *>(PassManagers[N]);
317 char PassManagerImpl::ID = 0;
318 } // End of llvm namespace
322 //===----------------------------------------------------------------------===//
323 // TimingInfo Class - This class is used to calculate information about the
324 // amount of time each pass takes to execute. This only happens when
325 // -time-passes is enabled on the command line.
328 class VISIBILITY_HIDDEN TimingInfo {
329 std::map<Pass*, Timer> TimingData;
333 // Use 'create' member to get this.
334 TimingInfo() : TG("... Pass execution timing report ...") {}
336 // TimingDtor - Print out information about timing information
338 // Delete all of the timers...
340 // TimerGroup is deleted next, printing the report.
343 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer
344 // to a non null value (if the -time-passes option is enabled) or it leaves it
345 // null. It may be called multiple times.
346 static void createTheTimeInfo();
348 void passStarted(Pass *P) {
350 if (dynamic_cast<PMDataManager *>(P))
353 std::map<Pass*, Timer>::iterator I = TimingData.find(P);
354 if (I == TimingData.end())
355 I=TimingData.insert(std::make_pair(P, Timer(P->getPassName(), TG))).first;
356 I->second.startTimer();
358 void passEnded(Pass *P) {
360 if (dynamic_cast<PMDataManager *>(P))
363 std::map<Pass*, Timer>::iterator I = TimingData.find(P);
364 assert (I != TimingData.end() && "passStarted/passEnded not nested right!");
365 I->second.stopTimer();
369 } // End of anon namespace
371 static TimingInfo *TheTimeInfo;
373 //===----------------------------------------------------------------------===//
374 // PMTopLevelManager implementation
376 /// Initialize top level manager. Create first pass manager.
377 PMTopLevelManager::PMTopLevelManager (enum TopLevelManagerType t) {
380 MPPassManager *MPP = new MPPassManager(1);
381 MPP->setTopLevelManager(this);
383 activeStack.push(MPP);
385 else if (t == TLM_Function) {
386 FPPassManager *FPP = new FPPassManager(1);
387 FPP->setTopLevelManager(this);
389 activeStack.push(FPP);
393 /// Set pass P as the last user of the given analysis passes.
394 void PMTopLevelManager::setLastUser(SmallVector<Pass *, 12> &AnalysisPasses,
397 for (SmallVector<Pass *, 12>::iterator I = AnalysisPasses.begin(),
398 E = AnalysisPasses.end(); I != E; ++I) {
405 // If AP is the last user of other passes then make P last user of
407 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
408 LUE = LastUser.end(); LUI != LUE; ++LUI) {
409 if (LUI->second == AP)
410 LastUser[LUI->first] = P;
415 /// Collect passes whose last user is P
416 void PMTopLevelManager::collectLastUses(SmallVector<Pass *, 12> &LastUses,
418 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
419 LUE = LastUser.end(); LUI != LUE; ++LUI)
420 if (LUI->second == P)
421 LastUses.push_back(LUI->first);
424 /// Schedule pass P for execution. Make sure that passes required by
425 /// P are run before P is run. Update analysis info maintained by
426 /// the manager. Remove dead passes. This is a recursive function.
427 void PMTopLevelManager::schedulePass(Pass *P) {
429 // TODO : Allocate function manager for this pass, other wise required set
430 // may be inserted into previous function manager
432 // Give pass a chance to prepare the stage.
433 P->preparePassManager(activeStack);
435 // If P is an analysis pass and it is available then do not
436 // generate the analysis again. Stale analysis info should not be
437 // available at this point.
438 if (P->getPassInfo() &&
439 P->getPassInfo()->isAnalysis() && findAnalysisPass(P->getPassInfo()))
442 AnalysisUsage AnUsage;
443 P->getAnalysisUsage(AnUsage);
444 const AnalysisUsage::VectorType &RequiredSet = AnUsage.getRequiredSet();
445 for (AnalysisUsage::VectorType::const_iterator I = RequiredSet.begin(),
446 E = RequiredSet.end(); I != E; ++I) {
448 Pass *AnalysisPass = findAnalysisPass(*I);
450 AnalysisPass = (*I)->createPass();
451 // Schedule this analysis run first only if it is not a lower level
452 // analysis pass. Lower level analsyis passes are run on the fly.
453 if (P->getPotentialPassManagerType () >=
454 AnalysisPass->getPotentialPassManagerType())
455 schedulePass(AnalysisPass);
461 // Now all required passes are available.
465 /// Find the pass that implements Analysis AID. Search immutable
466 /// passes and all pass managers. If desired pass is not found
467 /// then return NULL.
468 Pass *PMTopLevelManager::findAnalysisPass(AnalysisID AID) {
471 // Check pass managers
472 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
473 E = PassManagers.end(); P == NULL && I != E; ++I) {
474 PMDataManager *PMD = *I;
475 P = PMD->findAnalysisPass(AID, false);
478 // Check other pass managers
479 for (std::vector<PMDataManager *>::iterator I = IndirectPassManagers.begin(),
480 E = IndirectPassManagers.end(); P == NULL && I != E; ++I)
481 P = (*I)->findAnalysisPass(AID, false);
483 for (std::vector<ImmutablePass *>::iterator I = ImmutablePasses.begin(),
484 E = ImmutablePasses.end(); P == NULL && I != E; ++I) {
485 const PassInfo *PI = (*I)->getPassInfo();
489 // If Pass not found then check the interfaces implemented by Immutable Pass
491 const std::vector<const PassInfo*> &ImmPI =
492 PI->getInterfacesImplemented();
493 if (std::find(ImmPI.begin(), ImmPI.end(), AID) != ImmPI.end())
501 // Print passes managed by this top level manager.
502 void PMTopLevelManager::dumpPasses() const {
504 if (PassDebugging < Structure)
507 // Print out the immutable passes
508 for (unsigned i = 0, e = ImmutablePasses.size(); i != e; ++i) {
509 ImmutablePasses[i]->dumpPassStructure(0);
512 // Every class that derives from PMDataManager also derives from Pass
513 // (sometimes indirectly), but there's no inheritance relationship
514 // between PMDataManager and Pass, so we have to dynamic_cast to get
515 // from a PMDataManager* to a Pass*.
516 for (std::vector<PMDataManager *>::const_iterator I = PassManagers.begin(),
517 E = PassManagers.end(); I != E; ++I)
518 dynamic_cast<Pass *>(*I)->dumpPassStructure(1);
521 void PMTopLevelManager::dumpArguments() const {
523 if (PassDebugging < Arguments)
526 cerr << "Pass Arguments: ";
527 for (std::vector<PMDataManager *>::const_iterator I = PassManagers.begin(),
528 E = PassManagers.end(); I != E; ++I) {
529 PMDataManager *PMD = *I;
530 PMD->dumpPassArguments();
535 void PMTopLevelManager::initializeAllAnalysisInfo() {
537 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
538 E = PassManagers.end(); I != E; ++I) {
539 PMDataManager *PMD = *I;
540 PMD->initializeAnalysisInfo();
543 // Initailize other pass managers
544 for (std::vector<PMDataManager *>::iterator I = IndirectPassManagers.begin(),
545 E = IndirectPassManagers.end(); I != E; ++I)
546 (*I)->initializeAnalysisInfo();
550 PMTopLevelManager::~PMTopLevelManager() {
551 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
552 E = PassManagers.end(); I != E; ++I)
555 for (std::vector<ImmutablePass *>::iterator
556 I = ImmutablePasses.begin(), E = ImmutablePasses.end(); I != E; ++I)
560 //===----------------------------------------------------------------------===//
561 // PMDataManager implementation
563 /// Augement AvailableAnalysis by adding analysis made available by pass P.
564 void PMDataManager::recordAvailableAnalysis(Pass *P) {
566 if (const PassInfo *PI = P->getPassInfo()) {
567 AvailableAnalysis[PI] = P;
569 //This pass is the current implementation of all of the interfaces it
570 //implements as well.
571 const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
572 for (unsigned i = 0, e = II.size(); i != e; ++i)
573 AvailableAnalysis[II[i]] = P;
577 // Return true if P preserves high level analysis used by other
578 // passes managed by this manager
579 bool PMDataManager::preserveHigherLevelAnalysis(Pass *P) {
581 AnalysisUsage AnUsage;
582 P->getAnalysisUsage(AnUsage);
584 if (AnUsage.getPreservesAll())
587 const AnalysisUsage::VectorType &PreservedSet = AnUsage.getPreservedSet();
588 for (std::vector<Pass *>::iterator I = HigherLevelAnalysis.begin(),
589 E = HigherLevelAnalysis.end(); I != E; ++I) {
591 if (!dynamic_cast<ImmutablePass*>(P1) &&
592 std::find(PreservedSet.begin(), PreservedSet.end(),
593 P1->getPassInfo()) ==
601 /// verifyPreservedAnalysis -- Verify analysis preserved by pass P.
602 void PMDataManager::verifyPreservedAnalysis(Pass *P) {
603 // Don't do this unless assertions are enabled.
607 AnalysisUsage AnUsage;
608 P->getAnalysisUsage(AnUsage);
609 const AnalysisUsage::VectorType &PreservedSet = AnUsage.getPreservedSet();
611 // Verify preserved analysis
612 for (AnalysisUsage::VectorType::const_iterator I = PreservedSet.begin(),
613 E = PreservedSet.end(); I != E; ++I) {
615 if (Pass *AP = findAnalysisPass(AID, true))
616 AP->verifyAnalysis();
620 /// verifyDomInfo - Verify dominator information if it is available.
621 void PMDataManager::verifyDomInfo(Pass &P, Function &F) {
623 if (!VerifyDomInfo || !P.getResolver())
626 DominatorTree *DT = P.getAnalysisToUpdate<DominatorTree>();
630 DominatorTree OtherDT;
631 OtherDT.getBase().recalculate(F);
632 if (DT->compare(OtherDT)) {
633 cerr << "Dominator Information for " << F.getNameStart() << "\n";
634 cerr << "Pass '" << P.getPassName() << "'\n";
635 cerr << "----- Valid -----\n";
637 cerr << "----- Invalid -----\n";
639 assert (0 && "Invalid dominator info");
642 DominanceFrontier *DF = P.getAnalysisToUpdate<DominanceFrontier>();
646 DominanceFrontier OtherDF;
647 std::vector<BasicBlock*> DTRoots = DT->getRoots();
648 OtherDF.calculate(*DT, DT->getNode(DTRoots[0]));
649 if (DF->compare(OtherDF)) {
650 cerr << "Dominator Information for " << F.getNameStart() << "\n";
651 cerr << "Pass '" << P.getPassName() << "'\n";
652 cerr << "----- Valid -----\n";
654 cerr << "----- Invalid -----\n";
656 assert (0 && "Invalid dominator info");
660 /// Remove Analysis not preserved by Pass P
661 void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
662 AnalysisUsage AnUsage;
663 P->getAnalysisUsage(AnUsage);
664 if (AnUsage.getPreservesAll())
667 const AnalysisUsage::VectorType &PreservedSet = AnUsage.getPreservedSet();
668 for (std::map<AnalysisID, Pass*>::iterator I = AvailableAnalysis.begin(),
669 E = AvailableAnalysis.end(); I != E; ) {
670 std::map<AnalysisID, Pass*>::iterator Info = I++;
671 if (!dynamic_cast<ImmutablePass*>(Info->second)
672 && std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
673 PreservedSet.end()) {
674 // Remove this analysis
675 AvailableAnalysis.erase(Info);
676 if (PassDebugging >= Details) {
677 Pass *S = Info->second;
678 cerr << " -- '" << P->getPassName() << "' is not preserving '";
679 cerr << S->getPassName() << "'\n";
684 // Check inherited analysis also. If P is not preserving analysis
685 // provided by parent manager then remove it here.
686 for (unsigned Index = 0; Index < PMT_Last; ++Index) {
688 if (!InheritedAnalysis[Index])
691 for (std::map<AnalysisID, Pass*>::iterator
692 I = InheritedAnalysis[Index]->begin(),
693 E = InheritedAnalysis[Index]->end(); I != E; ) {
694 std::map<AnalysisID, Pass *>::iterator Info = I++;
695 if (!dynamic_cast<ImmutablePass*>(Info->second) &&
696 std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
698 // Remove this analysis
699 InheritedAnalysis[Index]->erase(Info);
704 /// Remove analysis passes that are not used any longer
705 void PMDataManager::removeDeadPasses(Pass *P, const char *Msg,
706 enum PassDebuggingString DBG_STR) {
708 SmallVector<Pass *, 12> DeadPasses;
710 // If this is a on the fly manager then it does not have TPM.
714 TPM->collectLastUses(DeadPasses, P);
716 if (PassDebugging >= Details && !DeadPasses.empty()) {
717 cerr << " -*- '" << P->getPassName();
718 cerr << "' is the last user of following pass instances.";
719 cerr << " Free these instances\n";
722 for (SmallVector<Pass *, 12>::iterator I = DeadPasses.begin(),
723 E = DeadPasses.end(); I != E; ++I) {
725 dumpPassInfo(*I, FREEING_MSG, DBG_STR, Msg);
727 if (TheTimeInfo) TheTimeInfo->passStarted(*I);
728 (*I)->releaseMemory();
729 if (TheTimeInfo) TheTimeInfo->passEnded(*I);
731 std::map<AnalysisID, Pass*>::iterator Pos =
732 AvailableAnalysis.find((*I)->getPassInfo());
734 // It is possible that pass is already removed from the AvailableAnalysis
735 if (Pos != AvailableAnalysis.end())
736 AvailableAnalysis.erase(Pos);
740 /// Add pass P into the PassVector. Update
741 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
742 void PMDataManager::add(Pass *P,
743 bool ProcessAnalysis) {
745 // This manager is going to manage pass P. Set up analysis resolver
747 AnalysisResolver *AR = new AnalysisResolver(*this);
750 // If a FunctionPass F is the last user of ModulePass info M
751 // then the F's manager, not F, records itself as a last user of M.
752 SmallVector<Pass *, 12> TransferLastUses;
754 if (ProcessAnalysis) {
756 // At the moment, this pass is the last user of all required passes.
757 SmallVector<Pass *, 12> LastUses;
758 SmallVector<Pass *, 8> RequiredPasses;
759 SmallVector<AnalysisID, 8> ReqAnalysisNotAvailable;
761 unsigned PDepth = this->getDepth();
763 collectRequiredAnalysis(RequiredPasses,
764 ReqAnalysisNotAvailable, P);
765 for (SmallVector<Pass *, 8>::iterator I = RequiredPasses.begin(),
766 E = RequiredPasses.end(); I != E; ++I) {
767 Pass *PRequired = *I;
770 assert (PRequired->getResolver() && "Analysis Resolver is not set");
771 PMDataManager &DM = PRequired->getResolver()->getPMDataManager();
772 RDepth = DM.getDepth();
774 if (PDepth == RDepth)
775 LastUses.push_back(PRequired);
776 else if (PDepth > RDepth) {
777 // Let the parent claim responsibility of last use
778 TransferLastUses.push_back(PRequired);
779 // Keep track of higher level analysis used by this manager.
780 HigherLevelAnalysis.push_back(PRequired);
782 assert (0 && "Unable to accomodate Required Pass");
785 // Set P as P's last user until someone starts using P.
786 // However, if P is a Pass Manager then it does not need
787 // to record its last user.
788 if (!dynamic_cast<PMDataManager *>(P))
789 LastUses.push_back(P);
790 TPM->setLastUser(LastUses, P);
792 if (!TransferLastUses.empty()) {
793 Pass *My_PM = dynamic_cast<Pass *>(this);
794 TPM->setLastUser(TransferLastUses, My_PM);
795 TransferLastUses.clear();
798 // Now, take care of required analysises that are not available.
799 for (SmallVector<AnalysisID, 8>::iterator
800 I = ReqAnalysisNotAvailable.begin(),
801 E = ReqAnalysisNotAvailable.end() ;I != E; ++I) {
802 Pass *AnalysisPass = (*I)->createPass();
803 this->addLowerLevelRequiredPass(P, AnalysisPass);
806 // Take a note of analysis required and made available by this pass.
807 // Remove the analysis not preserved by this pass
808 removeNotPreservedAnalysis(P);
809 recordAvailableAnalysis(P);
813 PassVector.push_back(P);
817 /// Populate RP with analysis pass that are required by
818 /// pass P and are available. Populate RP_NotAvail with analysis
819 /// pass that are required by pass P but are not available.
820 void PMDataManager::collectRequiredAnalysis(SmallVector<Pass *, 8>&RP,
821 SmallVector<AnalysisID, 8> &RP_NotAvail,
823 AnalysisUsage AnUsage;
824 P->getAnalysisUsage(AnUsage);
825 const AnalysisUsage::VectorType &RequiredSet = AnUsage.getRequiredSet();
826 for (AnalysisUsage::VectorType::const_iterator
827 I = RequiredSet.begin(), E = RequiredSet.end();
830 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
831 RP.push_back(AnalysisPass);
833 RP_NotAvail.push_back(AID);
836 const AnalysisUsage::VectorType &IDs = AnUsage.getRequiredTransitiveSet();
837 for (AnalysisUsage::VectorType::const_iterator I = IDs.begin(),
838 E = IDs.end(); I != E; ++I) {
840 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
841 RP.push_back(AnalysisPass);
843 RP_NotAvail.push_back(AID);
847 // All Required analyses should be available to the pass as it runs! Here
848 // we fill in the AnalysisImpls member of the pass so that it can
849 // successfully use the getAnalysis() method to retrieve the
850 // implementations it needs.
852 void PMDataManager::initializeAnalysisImpl(Pass *P) {
853 AnalysisUsage AnUsage;
854 P->getAnalysisUsage(AnUsage);
856 for (AnalysisUsage::VectorType::const_iterator
857 I = AnUsage.getRequiredSet().begin(),
858 E = AnUsage.getRequiredSet().end(); I != E; ++I) {
859 Pass *Impl = findAnalysisPass(*I, true);
861 // This may be analysis pass that is initialized on the fly.
862 // If that is not the case then it will raise an assert when it is used.
864 AnalysisResolver *AR = P->getResolver();
865 assert (AR && "Analysis Resolver is not set");
866 AR->addAnalysisImplsPair(*I, Impl);
870 /// Find the pass that implements Analysis AID. If desired pass is not found
871 /// then return NULL.
872 Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
874 // Check if AvailableAnalysis map has one entry.
875 std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
877 if (I != AvailableAnalysis.end())
880 // Search Parents through TopLevelManager
882 return TPM->findAnalysisPass(AID);
887 // Print list of passes that are last used by P.
888 void PMDataManager::dumpLastUses(Pass *P, unsigned Offset) const{
890 SmallVector<Pass *, 12> LUses;
892 // If this is a on the fly manager then it does not have TPM.
896 TPM->collectLastUses(LUses, P);
898 for (SmallVector<Pass *, 12>::iterator I = LUses.begin(),
899 E = LUses.end(); I != E; ++I) {
900 llvm::cerr << "--" << std::string(Offset*2, ' ');
901 (*I)->dumpPassStructure(0);
905 void PMDataManager::dumpPassArguments() const {
906 for(std::vector<Pass *>::const_iterator I = PassVector.begin(),
907 E = PassVector.end(); I != E; ++I) {
908 if (PMDataManager *PMD = dynamic_cast<PMDataManager *>(*I))
909 PMD->dumpPassArguments();
911 if (const PassInfo *PI = (*I)->getPassInfo())
912 if (!PI->isAnalysisGroup())
913 cerr << " -" << PI->getPassArgument();
917 void PMDataManager::dumpPassInfo(Pass *P, enum PassDebuggingString S1,
918 enum PassDebuggingString S2,
920 if (PassDebugging < Executions)
922 cerr << (void*)this << std::string(getDepth()*2+1, ' ');
925 cerr << "Executing Pass '" << P->getPassName();
927 case MODIFICATION_MSG:
928 cerr << "Made Modification '" << P->getPassName();
931 cerr << " Freeing Pass '" << P->getPassName();
937 case ON_BASICBLOCK_MSG:
938 cerr << "' on BasicBlock '" << Msg << "'...\n";
940 case ON_FUNCTION_MSG:
941 cerr << "' on Function '" << Msg << "'...\n";
944 cerr << "' on Module '" << Msg << "'...\n";
947 cerr << "' on Loop " << Msg << "'...\n";
950 cerr << "' on Call Graph " << Msg << "'...\n";
957 void PMDataManager::dumpRequiredSet(const Pass *P)
959 if (PassDebugging < Details)
962 AnalysisUsage analysisUsage;
963 P->getAnalysisUsage(analysisUsage);
964 dumpAnalysisUsage("Required", P, analysisUsage.getRequiredSet());
967 void PMDataManager::dumpPreservedSet(const Pass *P)
969 if (PassDebugging < Details)
972 AnalysisUsage analysisUsage;
973 P->getAnalysisUsage(analysisUsage);
974 dumpAnalysisUsage("Preserved", P, analysisUsage.getPreservedSet());
977 void PMDataManager::dumpAnalysisUsage(const char *Msg, const Pass *P,
978 const AnalysisUsage::VectorType &Set)
980 assert(PassDebugging >= Details);
983 cerr << (void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:";
984 for (unsigned i = 0; i != Set.size(); ++i) {
986 cerr << " " << Set[i]->getPassName();
991 /// Add RequiredPass into list of lower level passes required by pass P.
992 /// RequiredPass is run on the fly by Pass Manager when P requests it
993 /// through getAnalysis interface.
994 /// This should be handled by specific pass manager.
995 void PMDataManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
997 TPM->dumpArguments();
1001 // Module Level pass may required Function Level analysis info
1002 // (e.g. dominator info). Pass manager uses on the fly function pass manager
1003 // to provide this on demand. In that case, in Pass manager terminology,
1004 // module level pass is requiring lower level analysis info managed by
1005 // lower level pass manager.
1007 // When Pass manager is not able to order required analysis info, Pass manager
1008 // checks whether any lower level manager will be able to provide this
1009 // analysis info on demand or not.
1011 cerr << "Unable to schedule '" << RequiredPass->getPassName();
1012 cerr << "' required by '" << P->getPassName() << "'\n";
1014 assert (0 && "Unable to schedule pass");
1018 PMDataManager::~PMDataManager() {
1020 for (std::vector<Pass *>::iterator I = PassVector.begin(),
1021 E = PassVector.end(); I != E; ++I)
1026 //===----------------------------------------------------------------------===//
1027 // NOTE: Is this the right place to define this method ?
1028 // getAnalysisToUpdate - Return an analysis result or null if it doesn't exist
1029 Pass *AnalysisResolver::getAnalysisToUpdate(AnalysisID ID, bool dir) const {
1030 return PM.findAnalysisPass(ID, dir);
1033 Pass *AnalysisResolver::findImplPass(Pass *P, const PassInfo *AnalysisPI,
1035 return PM.getOnTheFlyPass(P, AnalysisPI, F);
1038 //===----------------------------------------------------------------------===//
1039 // BBPassManager implementation
1041 /// Execute all of the passes scheduled for execution by invoking
1042 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
1043 /// the function, and if so, return true.
1045 BBPassManager::runOnFunction(Function &F) {
1047 if (F.isDeclaration())
1050 bool Changed = doInitialization(F);
1052 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
1053 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1054 BasicBlockPass *BP = getContainedPass(Index);
1056 dumpPassInfo(BP, EXECUTION_MSG, ON_BASICBLOCK_MSG, I->getNameStart());
1057 dumpRequiredSet(BP);
1059 initializeAnalysisImpl(BP);
1061 if (TheTimeInfo) TheTimeInfo->passStarted(BP);
1062 Changed |= BP->runOnBasicBlock(*I);
1063 if (TheTimeInfo) TheTimeInfo->passEnded(BP);
1066 dumpPassInfo(BP, MODIFICATION_MSG, ON_BASICBLOCK_MSG,
1068 dumpPreservedSet(BP);
1070 verifyPreservedAnalysis(BP);
1071 removeNotPreservedAnalysis(BP);
1072 recordAvailableAnalysis(BP);
1073 removeDeadPasses(BP, I->getNameStart(), ON_BASICBLOCK_MSG);
1076 return Changed |= doFinalization(F);
1079 // Implement doInitialization and doFinalization
1080 inline bool BBPassManager::doInitialization(Module &M) {
1081 bool Changed = false;
1083 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1084 BasicBlockPass *BP = getContainedPass(Index);
1085 Changed |= BP->doInitialization(M);
1091 inline bool BBPassManager::doFinalization(Module &M) {
1092 bool Changed = false;
1094 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1095 BasicBlockPass *BP = getContainedPass(Index);
1096 Changed |= BP->doFinalization(M);
1102 inline bool BBPassManager::doInitialization(Function &F) {
1103 bool Changed = false;
1105 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1106 BasicBlockPass *BP = getContainedPass(Index);
1107 Changed |= BP->doInitialization(F);
1113 inline bool BBPassManager::doFinalization(Function &F) {
1114 bool Changed = false;
1116 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1117 BasicBlockPass *BP = getContainedPass(Index);
1118 Changed |= BP->doFinalization(F);
1125 //===----------------------------------------------------------------------===//
1126 // FunctionPassManager implementation
1128 /// Create new Function pass manager
1129 FunctionPassManager::FunctionPassManager(ModuleProvider *P) {
1130 FPM = new FunctionPassManagerImpl(0);
1131 // FPM is the top level manager.
1132 FPM->setTopLevelManager(FPM);
1134 AnalysisResolver *AR = new AnalysisResolver(*FPM);
1135 FPM->setResolver(AR);
1140 FunctionPassManager::~FunctionPassManager() {
1144 /// add - Add a pass to the queue of passes to run. This passes
1145 /// ownership of the Pass to the PassManager. When the
1146 /// PassManager_X is destroyed, the pass will be destroyed as well, so
1147 /// there is no need to delete the pass. (TODO delete passes.)
1148 /// This implies that all passes MUST be allocated with 'new'.
1149 void FunctionPassManager::add(Pass *P) {
1153 /// run - Execute all of the passes scheduled for execution. Keep
1154 /// track of whether any of the passes modifies the function, and if
1155 /// so, return true.
1157 bool FunctionPassManager::run(Function &F) {
1159 if (MP->materializeFunction(&F, &errstr)) {
1160 cerr << "Error reading bitcode file: " << errstr << "\n";
1167 /// doInitialization - Run all of the initializers for the function passes.
1169 bool FunctionPassManager::doInitialization() {
1170 return FPM->doInitialization(*MP->getModule());
1173 /// doFinalization - Run all of the finalizers for the function passes.
1175 bool FunctionPassManager::doFinalization() {
1176 return FPM->doFinalization(*MP->getModule());
1179 //===----------------------------------------------------------------------===//
1180 // FunctionPassManagerImpl implementation
1182 inline bool FunctionPassManagerImpl::doInitialization(Module &M) {
1183 bool Changed = false;
1185 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1186 FPPassManager *FP = getContainedManager(Index);
1187 Changed |= FP->doInitialization(M);
1193 inline bool FunctionPassManagerImpl::doFinalization(Module &M) {
1194 bool Changed = false;
1196 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1197 FPPassManager *FP = getContainedManager(Index);
1198 Changed |= FP->doFinalization(M);
1204 // Execute all the passes managed by this top level manager.
1205 // Return true if any function is modified by a pass.
1206 bool FunctionPassManagerImpl::run(Function &F) {
1208 bool Changed = false;
1210 TimingInfo::createTheTimeInfo();
1215 initializeAllAnalysisInfo();
1216 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1217 FPPassManager *FP = getContainedManager(Index);
1218 Changed |= FP->runOnFunction(F);
1223 //===----------------------------------------------------------------------===//
1224 // FPPassManager implementation
1226 char FPPassManager::ID = 0;
1227 /// Print passes managed by this manager
1228 void FPPassManager::dumpPassStructure(unsigned Offset) {
1229 llvm::cerr << std::string(Offset*2, ' ') << "FunctionPass Manager\n";
1230 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1231 FunctionPass *FP = getContainedPass(Index);
1232 FP->dumpPassStructure(Offset + 1);
1233 dumpLastUses(FP, Offset+1);
1238 /// Execute all of the passes scheduled for execution by invoking
1239 /// runOnFunction method. Keep track of whether any of the passes modifies
1240 /// the function, and if so, return true.
1241 bool FPPassManager::runOnFunction(Function &F) {
1243 bool Changed = false;
1245 if (F.isDeclaration())
1248 // Collect inherited analysis from Module level pass manager.
1249 populateInheritedAnalysis(TPM->activeStack);
1251 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1252 FunctionPass *FP = getContainedPass(Index);
1254 dumpPassInfo(FP, EXECUTION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1255 dumpRequiredSet(FP);
1257 initializeAnalysisImpl(FP);
1259 if (TheTimeInfo) TheTimeInfo->passStarted(FP);
1260 Changed |= FP->runOnFunction(F);
1261 if (TheTimeInfo) TheTimeInfo->passEnded(FP);
1264 dumpPassInfo(FP, MODIFICATION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1265 dumpPreservedSet(FP);
1267 verifyPreservedAnalysis(FP);
1268 removeNotPreservedAnalysis(FP);
1269 recordAvailableAnalysis(FP);
1270 removeDeadPasses(FP, F.getNameStart(), ON_FUNCTION_MSG);
1272 // If dominator information is available then verify the info if requested.
1273 verifyDomInfo(*FP, F);
1278 bool FPPassManager::runOnModule(Module &M) {
1280 bool Changed = doInitialization(M);
1282 for(Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1283 this->runOnFunction(*I);
1285 return Changed |= doFinalization(M);
1288 inline bool FPPassManager::doInitialization(Module &M) {
1289 bool Changed = false;
1291 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1292 FunctionPass *FP = getContainedPass(Index);
1293 Changed |= FP->doInitialization(M);
1299 inline bool FPPassManager::doFinalization(Module &M) {
1300 bool Changed = false;
1302 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1303 FunctionPass *FP = getContainedPass(Index);
1304 Changed |= FP->doFinalization(M);
1310 //===----------------------------------------------------------------------===//
1311 // MPPassManager implementation
1313 /// Execute all of the passes scheduled for execution by invoking
1314 /// runOnModule method. Keep track of whether any of the passes modifies
1315 /// the module, and if so, return true.
1317 MPPassManager::runOnModule(Module &M) {
1318 bool Changed = false;
1320 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1321 ModulePass *MP = getContainedPass(Index);
1323 dumpPassInfo(MP, EXECUTION_MSG, ON_MODULE_MSG,
1324 M.getModuleIdentifier().c_str());
1325 dumpRequiredSet(MP);
1327 initializeAnalysisImpl(MP);
1329 if (TheTimeInfo) TheTimeInfo->passStarted(MP);
1330 Changed |= MP->runOnModule(M);
1331 if (TheTimeInfo) TheTimeInfo->passEnded(MP);
1334 dumpPassInfo(MP, MODIFICATION_MSG, ON_MODULE_MSG,
1335 M.getModuleIdentifier().c_str());
1336 dumpPreservedSet(MP);
1338 verifyPreservedAnalysis(MP);
1339 removeNotPreservedAnalysis(MP);
1340 recordAvailableAnalysis(MP);
1341 removeDeadPasses(MP, M.getModuleIdentifier().c_str(), ON_MODULE_MSG);
1346 /// Add RequiredPass into list of lower level passes required by pass P.
1347 /// RequiredPass is run on the fly by Pass Manager when P requests it
1348 /// through getAnalysis interface.
1349 void MPPassManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
1351 assert (P->getPotentialPassManagerType() == PMT_ModulePassManager
1352 && "Unable to handle Pass that requires lower level Analysis pass");
1353 assert ((P->getPotentialPassManagerType() <
1354 RequiredPass->getPotentialPassManagerType())
1355 && "Unable to handle Pass that requires lower level Analysis pass");
1357 FunctionPassManagerImpl *FPP = OnTheFlyManagers[P];
1359 FPP = new FunctionPassManagerImpl(0);
1360 // FPP is the top level manager.
1361 FPP->setTopLevelManager(FPP);
1363 OnTheFlyManagers[P] = FPP;
1365 FPP->add(RequiredPass);
1367 // Register P as the last user of RequiredPass.
1368 SmallVector<Pass *, 12> LU;
1369 LU.push_back(RequiredPass);
1370 FPP->setLastUser(LU, P);
1373 /// Return function pass corresponding to PassInfo PI, that is
1374 /// required by module pass MP. Instantiate analysis pass, by using
1375 /// its runOnFunction() for function F.
1376 Pass* MPPassManager::getOnTheFlyPass(Pass *MP, const PassInfo *PI,
1378 AnalysisID AID = PI;
1379 FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP];
1380 assert (FPP && "Unable to find on the fly pass");
1383 return (dynamic_cast<PMTopLevelManager *>(FPP))->findAnalysisPass(AID);
1387 //===----------------------------------------------------------------------===//
1388 // PassManagerImpl implementation
1390 /// run - Execute all of the passes scheduled for execution. Keep track of
1391 /// whether any of the passes modifies the module, and if so, return true.
1392 bool PassManagerImpl::run(Module &M) {
1394 bool Changed = false;
1396 TimingInfo::createTheTimeInfo();
1401 initializeAllAnalysisInfo();
1402 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1403 MPPassManager *MP = getContainedManager(Index);
1404 Changed |= MP->runOnModule(M);
1409 //===----------------------------------------------------------------------===//
1410 // PassManager implementation
1412 /// Create new pass manager
1413 PassManager::PassManager() {
1414 PM = new PassManagerImpl(0);
1415 // PM is the top level manager
1416 PM->setTopLevelManager(PM);
1419 PassManager::~PassManager() {
1423 /// add - Add a pass to the queue of passes to run. This passes ownership of
1424 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
1425 /// will be destroyed as well, so there is no need to delete the pass. This
1426 /// implies that all passes MUST be allocated with 'new'.
1428 PassManager::add(Pass *P) {
1432 /// run - Execute all of the passes scheduled for execution. Keep track of
1433 /// whether any of the passes modifies the module, and if so, return true.
1435 PassManager::run(Module &M) {
1439 //===----------------------------------------------------------------------===//
1440 // TimingInfo Class - This class is used to calculate information about the
1441 // amount of time each pass takes to execute. This only happens with
1442 // -time-passes is enabled on the command line.
1444 bool llvm::TimePassesIsEnabled = false;
1445 static cl::opt<bool,true>
1446 EnableTiming("time-passes", cl::location(TimePassesIsEnabled),
1447 cl::desc("Time each pass, printing elapsed time for each on exit"));
1449 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer to
1450 // a non null value (if the -time-passes option is enabled) or it leaves it
1451 // null. It may be called multiple times.
1452 void TimingInfo::createTheTimeInfo() {
1453 if (!TimePassesIsEnabled || TheTimeInfo) return;
1455 // Constructed the first time this is called, iff -time-passes is enabled.
1456 // This guarantees that the object will be constructed before static globals,
1457 // thus it will be destroyed before them.
1458 static ManagedStatic<TimingInfo> TTI;
1459 TheTimeInfo = &*TTI;
1462 /// If TimingInfo is enabled then start pass timer.
1463 void StartPassTimer(Pass *P) {
1465 TheTimeInfo->passStarted(P);
1468 /// If TimingInfo is enabled then stop pass timer.
1469 void StopPassTimer(Pass *P) {
1471 TheTimeInfo->passEnded(P);
1474 //===----------------------------------------------------------------------===//
1475 // PMStack implementation
1478 // Pop Pass Manager from the stack and clear its analysis info.
1479 void PMStack::pop() {
1481 PMDataManager *Top = this->top();
1482 Top->initializeAnalysisInfo();
1487 // Push PM on the stack and set its top level manager.
1488 void PMStack::push(PMDataManager *PM) {
1490 PMDataManager *Top = NULL;
1491 assert (PM && "Unable to push. Pass Manager expected");
1493 if (this->empty()) {
1498 PMTopLevelManager *TPM = Top->getTopLevelManager();
1500 assert (TPM && "Unable to find top level manager");
1501 TPM->addIndirectPassManager(PM);
1502 PM->setTopLevelManager(TPM);
1508 // Dump content of the pass manager stack.
1509 void PMStack::dump() {
1510 for(std::deque<PMDataManager *>::iterator I = S.begin(),
1511 E = S.end(); I != E; ++I) {
1512 Pass *P = dynamic_cast<Pass *>(*I);
1513 printf("%s ", P->getPassName());
1519 /// Find appropriate Module Pass Manager in the PM Stack and
1520 /// add self into that manager.
1521 void ModulePass::assignPassManager(PMStack &PMS,
1522 PassManagerType PreferredType) {
1524 // Find Module Pass Manager
1525 while(!PMS.empty()) {
1526 PassManagerType TopPMType = PMS.top()->getPassManagerType();
1527 if (TopPMType == PreferredType)
1528 break; // We found desired pass manager
1529 else if (TopPMType > PMT_ModulePassManager)
1530 PMS.pop(); // Pop children pass managers
1535 PMS.top()->add(this);
1538 /// Find appropriate Function Pass Manager or Call Graph Pass Manager
1539 /// in the PM Stack and add self into that manager.
1540 void FunctionPass::assignPassManager(PMStack &PMS,
1541 PassManagerType PreferredType) {
1543 // Find Module Pass Manager (TODO : Or Call Graph Pass Manager)
1544 while(!PMS.empty()) {
1545 if (PMS.top()->getPassManagerType() > PMT_FunctionPassManager)
1550 FPPassManager *FPP = dynamic_cast<FPPassManager *>(PMS.top());
1552 // Create new Function Pass Manager
1554 assert(!PMS.empty() && "Unable to create Function Pass Manager");
1555 PMDataManager *PMD = PMS.top();
1557 // [1] Create new Function Pass Manager
1558 FPP = new FPPassManager(PMD->getDepth() + 1);
1559 FPP->populateInheritedAnalysis(PMS);
1561 // [2] Set up new manager's top level manager
1562 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1563 TPM->addIndirectPassManager(FPP);
1565 // [3] Assign manager to manage this new manager. This may create
1566 // and push new managers into PMS
1568 // If Call Graph Pass Manager is active then use it to manage
1569 // this new Function Pass manager.
1570 if (PMD->getPassManagerType() == PMT_CallGraphPassManager)
1571 FPP->assignPassManager(PMS, PMT_CallGraphPassManager);
1573 FPP->assignPassManager(PMS);
1575 // [4] Push new manager into PMS
1579 // Assign FPP as the manager of this pass.
1583 /// Find appropriate Basic Pass Manager or Call Graph Pass Manager
1584 /// in the PM Stack and add self into that manager.
1585 void BasicBlockPass::assignPassManager(PMStack &PMS,
1586 PassManagerType PreferredType) {
1588 BBPassManager *BBP = NULL;
1590 // Basic Pass Manager is a leaf pass manager. It does not handle
1591 // any other pass manager.
1593 BBP = dynamic_cast<BBPassManager *>(PMS.top());
1595 // If leaf manager is not Basic Block Pass manager then create new
1596 // basic Block Pass manager.
1599 assert(!PMS.empty() && "Unable to create BasicBlock Pass Manager");
1600 PMDataManager *PMD = PMS.top();
1602 // [1] Create new Basic Block Manager
1603 BBP = new BBPassManager(PMD->getDepth() + 1);
1605 // [2] Set up new manager's top level manager
1606 // Basic Block Pass Manager does not live by itself
1607 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1608 TPM->addIndirectPassManager(BBP);
1610 // [3] Assign manager to manage this new manager. This may create
1611 // and push new managers into PMS
1612 BBP->assignPassManager(PMS);
1614 // [4] Push new manager into PMS
1618 // Assign BBP as the manager of this pass.
1622 PassManagerBase::~PassManagerBase() {}
1624 /*===-- C Bindings --------------------------------------------------------===*/
1626 LLVMPassManagerRef LLVMCreatePassManager() {
1627 return wrap(new PassManager());
1630 LLVMPassManagerRef LLVMCreateFunctionPassManager(LLVMModuleProviderRef P) {
1631 return wrap(new FunctionPassManager(unwrap(P)));
1634 int LLVMRunPassManager(LLVMPassManagerRef PM, LLVMModuleRef M) {
1635 return unwrap<PassManager>(PM)->run(*unwrap(M));
1638 int LLVMInitializeFunctionPassManager(LLVMPassManagerRef FPM) {
1639 return unwrap<FunctionPassManager>(FPM)->doInitialization();
1642 int LLVMRunFunctionPassManager(LLVMPassManagerRef FPM, LLVMValueRef F) {
1643 return unwrap<FunctionPassManager>(FPM)->run(*unwrap<Function>(F));
1646 int LLVMFinalizeFunctionPassManager(LLVMPassManagerRef FPM) {
1647 return unwrap<FunctionPassManager>(FPM)->doFinalization();
1650 void LLVMDisposePassManager(LLVMPassManagerRef PM) {