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-c/Core.h"
28 // See PassManagers.h for Pass Manager infrastructure overview.
32 //===----------------------------------------------------------------------===//
33 // Pass debugging information. Often it is useful to find out what pass is
34 // running when a crash occurs in a utility. When this library is compiled with
35 // debugging on, a command line option (--debug-pass) is enabled that causes the
36 // pass name to be printed before it executes.
39 // Different debug levels that can be enabled...
41 None, Arguments, Structure, Executions, Details
44 static cl::opt<enum PassDebugLevel>
45 PassDebugging("debug-pass", cl::Hidden,
46 cl::desc("Print PassManager debugging information"),
48 clEnumVal(None , "disable debug output"),
49 clEnumVal(Arguments , "print pass arguments to pass to 'opt'"),
50 clEnumVal(Structure , "print pass structure before run()"),
51 clEnumVal(Executions, "print pass name before it is executed"),
52 clEnumVal(Details , "print pass details when it is executed"),
54 } // End of llvm namespace
58 //===----------------------------------------------------------------------===//
61 /// BBPassManager manages BasicBlockPass. It batches all the
62 /// pass together and sequence them to process one basic block before
63 /// processing next basic block.
64 class VISIBILITY_HIDDEN BBPassManager : public PMDataManager,
69 explicit BBPassManager(int Depth)
70 : PMDataManager(Depth), FunctionPass((intptr_t)&ID) {}
72 /// Execute all of the passes scheduled for execution. Keep track of
73 /// whether any of the passes modifies the function, and if so, return true.
74 bool runOnFunction(Function &F);
76 /// Pass Manager itself does not invalidate any analysis info.
77 void getAnalysisUsage(AnalysisUsage &Info) const {
78 Info.setPreservesAll();
81 bool doInitialization(Module &M);
82 bool doInitialization(Function &F);
83 bool doFinalization(Module &M);
84 bool doFinalization(Function &F);
86 virtual const char *getPassName() const {
87 return "BasicBlock Pass Manager";
90 // Print passes managed by this manager
91 void dumpPassStructure(unsigned Offset) {
92 llvm::cerr << std::string(Offset*2, ' ') << "BasicBlockPass Manager\n";
93 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
94 BasicBlockPass *BP = getContainedPass(Index);
95 BP->dumpPassStructure(Offset + 1);
96 dumpLastUses(BP, Offset+1);
100 BasicBlockPass *getContainedPass(unsigned N) {
101 assert ( N < PassVector.size() && "Pass number out of range!");
102 BasicBlockPass *BP = static_cast<BasicBlockPass *>(PassVector[N]);
106 virtual PassManagerType getPassManagerType() const {
107 return PMT_BasicBlockPassManager;
111 char BBPassManager::ID = 0;
116 //===----------------------------------------------------------------------===//
117 // FunctionPassManagerImpl
119 /// FunctionPassManagerImpl manages FPPassManagers
120 class FunctionPassManagerImpl : public Pass,
121 public PMDataManager,
122 public PMTopLevelManager {
125 explicit FunctionPassManagerImpl(int Depth) :
126 Pass((intptr_t)&ID), PMDataManager(Depth),
127 PMTopLevelManager(TLM_Function) { }
129 /// add - Add a pass to the queue of passes to run. This passes ownership of
130 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
131 /// will be destroyed as well, so there is no need to delete the pass. This
132 /// implies that all passes MUST be allocated with 'new'.
137 /// run - Execute all of the passes scheduled for execution. Keep track of
138 /// whether any of the passes modifies the module, and if so, return true.
139 bool run(Function &F);
141 /// doInitialization - Run all of the initializers for the function passes.
143 bool doInitialization(Module &M);
145 /// doFinalization - Run all of the finalizers for the function passes.
147 bool doFinalization(Module &M);
149 /// Pass Manager itself does not invalidate any analysis info.
150 void getAnalysisUsage(AnalysisUsage &Info) const {
151 Info.setPreservesAll();
154 inline void addTopLevelPass(Pass *P) {
156 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
158 // P is a immutable pass and it will be managed by this
159 // top level manager. Set up analysis resolver to connect them.
160 AnalysisResolver *AR = new AnalysisResolver(*this);
162 initializeAnalysisImpl(P);
163 addImmutablePass(IP);
164 recordAvailableAnalysis(IP);
166 P->assignPassManager(activeStack);
171 FPPassManager *getContainedManager(unsigned N) {
172 assert ( N < PassManagers.size() && "Pass number out of range!");
173 FPPassManager *FP = static_cast<FPPassManager *>(PassManagers[N]);
178 char FunctionPassManagerImpl::ID = 0;
179 //===----------------------------------------------------------------------===//
182 /// MPPassManager manages ModulePasses and function pass managers.
183 /// It batches all Module passes and function pass managers together and
184 /// sequences them to process one module.
185 class MPPassManager : public Pass, public PMDataManager {
189 explicit MPPassManager(int Depth) :
190 Pass((intptr_t)&ID), PMDataManager(Depth) { }
192 // Delete on the fly managers.
193 virtual ~MPPassManager() {
194 for (std::map<Pass *, FunctionPassManagerImpl *>::iterator
195 I = OnTheFlyManagers.begin(), E = OnTheFlyManagers.end();
197 FunctionPassManagerImpl *FPP = I->second;
202 /// run - Execute all of the passes scheduled for execution. Keep track of
203 /// whether any of the passes modifies the module, and if so, return true.
204 bool runOnModule(Module &M);
206 /// Pass Manager itself does not invalidate any analysis info.
207 void getAnalysisUsage(AnalysisUsage &Info) const {
208 Info.setPreservesAll();
211 /// Add RequiredPass into list of lower level passes required by pass P.
212 /// RequiredPass is run on the fly by Pass Manager when P requests it
213 /// through getAnalysis interface.
214 virtual void addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass);
216 /// Return function pass corresponding to PassInfo PI, that is
217 /// required by module pass MP. Instantiate analysis pass, by using
218 /// its runOnFunction() for function F.
219 virtual Pass* getOnTheFlyPass(Pass *MP, const PassInfo *PI, Function &F);
221 virtual const char *getPassName() const {
222 return "Module Pass Manager";
225 // Print passes managed by this manager
226 void dumpPassStructure(unsigned Offset) {
227 llvm::cerr << std::string(Offset*2, ' ') << "ModulePass Manager\n";
228 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
229 ModulePass *MP = getContainedPass(Index);
230 MP->dumpPassStructure(Offset + 1);
231 if (FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP])
232 FPP->dumpPassStructure(Offset + 2);
233 dumpLastUses(MP, Offset+1);
237 ModulePass *getContainedPass(unsigned N) {
238 assert ( N < PassVector.size() && "Pass number out of range!");
239 ModulePass *MP = static_cast<ModulePass *>(PassVector[N]);
243 virtual PassManagerType getPassManagerType() const {
244 return PMT_ModulePassManager;
248 /// Collection of on the fly FPPassManagers. These managers manage
249 /// function passes that are required by module passes.
250 std::map<Pass *, FunctionPassManagerImpl *> OnTheFlyManagers;
253 char MPPassManager::ID = 0;
254 //===----------------------------------------------------------------------===//
258 /// PassManagerImpl manages MPPassManagers
259 class PassManagerImpl : public Pass,
260 public PMDataManager,
261 public PMTopLevelManager {
265 explicit PassManagerImpl(int Depth) :
266 Pass((intptr_t)&ID), PMDataManager(Depth),
267 PMTopLevelManager(TLM_Pass) { }
269 /// add - Add a pass to the queue of passes to run. This passes ownership of
270 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
271 /// will be destroyed as well, so there is no need to delete the pass. This
272 /// implies that all passes MUST be allocated with 'new'.
277 /// run - Execute all of the passes scheduled for execution. Keep track of
278 /// whether any of the passes modifies the module, and if so, return true.
281 /// Pass Manager itself does not invalidate any analysis info.
282 void getAnalysisUsage(AnalysisUsage &Info) const {
283 Info.setPreservesAll();
286 inline void addTopLevelPass(Pass *P) {
288 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
290 // P is a immutable pass and it will be managed by this
291 // top level manager. Set up analysis resolver to connect them.
292 AnalysisResolver *AR = new AnalysisResolver(*this);
294 initializeAnalysisImpl(P);
295 addImmutablePass(IP);
296 recordAvailableAnalysis(IP);
298 P->assignPassManager(activeStack);
303 MPPassManager *getContainedManager(unsigned N) {
304 assert ( N < PassManagers.size() && "Pass number out of range!");
305 MPPassManager *MP = static_cast<MPPassManager *>(PassManagers[N]);
311 char PassManagerImpl::ID = 0;
312 } // End of llvm namespace
316 //===----------------------------------------------------------------------===//
317 // TimingInfo Class - This class is used to calculate information about the
318 // amount of time each pass takes to execute. This only happens when
319 // -time-passes is enabled on the command line.
322 class VISIBILITY_HIDDEN TimingInfo {
323 std::map<Pass*, Timer> TimingData;
327 // Use 'create' member to get this.
328 TimingInfo() : TG("... Pass execution timing report ...") {}
330 // TimingDtor - Print out information about timing information
332 // Delete all of the timers...
334 // TimerGroup is deleted next, printing the report.
337 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer
338 // to a non null value (if the -time-passes option is enabled) or it leaves it
339 // null. It may be called multiple times.
340 static void createTheTimeInfo();
342 void passStarted(Pass *P) {
344 if (dynamic_cast<PMDataManager *>(P))
347 std::map<Pass*, Timer>::iterator I = TimingData.find(P);
348 if (I == TimingData.end())
349 I=TimingData.insert(std::make_pair(P, Timer(P->getPassName(), TG))).first;
350 I->second.startTimer();
352 void passEnded(Pass *P) {
354 if (dynamic_cast<PMDataManager *>(P))
357 std::map<Pass*, Timer>::iterator I = TimingData.find(P);
358 assert (I != TimingData.end() && "passStarted/passEnded not nested right!");
359 I->second.stopTimer();
363 } // End of anon namespace
365 static TimingInfo *TheTimeInfo;
367 //===----------------------------------------------------------------------===//
368 // PMTopLevelManager implementation
370 /// Initialize top level manager. Create first pass manager.
371 PMTopLevelManager::PMTopLevelManager (enum TopLevelManagerType t) {
374 MPPassManager *MPP = new MPPassManager(1);
375 MPP->setTopLevelManager(this);
377 activeStack.push(MPP);
379 else if (t == TLM_Function) {
380 FPPassManager *FPP = new FPPassManager(1);
381 FPP->setTopLevelManager(this);
383 activeStack.push(FPP);
387 /// Set pass P as the last user of the given analysis passes.
388 void PMTopLevelManager::setLastUser(SmallVector<Pass *, 12> &AnalysisPasses,
391 for (SmallVector<Pass *, 12>::iterator I = AnalysisPasses.begin(),
392 E = AnalysisPasses.end(); I != E; ++I) {
399 // If AP is the last user of other passes then make P last user of
401 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
402 LUE = LastUser.end(); LUI != LUE; ++LUI) {
403 if (LUI->second == AP)
404 LastUser[LUI->first] = P;
409 /// Collect passes whose last user is P
410 void PMTopLevelManager::collectLastUses(SmallVector<Pass *, 12> &LastUses,
412 for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
413 LUE = LastUser.end(); LUI != LUE; ++LUI)
414 if (LUI->second == P)
415 LastUses.push_back(LUI->first);
418 /// Schedule pass P for execution. Make sure that passes required by
419 /// P are run before P is run. Update analysis info maintained by
420 /// the manager. Remove dead passes. This is a recursive function.
421 void PMTopLevelManager::schedulePass(Pass *P) {
423 // TODO : Allocate function manager for this pass, other wise required set
424 // may be inserted into previous function manager
426 // Give pass a chance to prepare the stage.
427 P->preparePassManager(activeStack);
429 // If P is an analysis pass and it is available then do not
430 // generate the analysis again. Stale analysis info should not be
431 // available at this point.
432 if (P->getPassInfo() &&
433 P->getPassInfo()->isAnalysis() && findAnalysisPass(P->getPassInfo()))
436 AnalysisUsage AnUsage;
437 P->getAnalysisUsage(AnUsage);
438 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
439 for (std::vector<AnalysisID>::const_iterator I = RequiredSet.begin(),
440 E = RequiredSet.end(); I != E; ++I) {
442 Pass *AnalysisPass = findAnalysisPass(*I);
444 AnalysisPass = (*I)->createPass();
445 // Schedule this analysis run first only if it is not a lower level
446 // analysis pass. Lower level analsyis passes are run on the fly.
447 if (P->getPotentialPassManagerType () >=
448 AnalysisPass->getPotentialPassManagerType())
449 schedulePass(AnalysisPass);
455 // Now all required passes are available.
459 /// Find the pass that implements Analysis AID. Search immutable
460 /// passes and all pass managers. If desired pass is not found
461 /// then return NULL.
462 Pass *PMTopLevelManager::findAnalysisPass(AnalysisID AID) {
465 // Check pass managers
466 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
467 E = PassManagers.end(); P == NULL && I != E; ++I) {
468 PMDataManager *PMD = *I;
469 P = PMD->findAnalysisPass(AID, false);
472 // Check other pass managers
473 for (std::vector<PMDataManager *>::iterator I = IndirectPassManagers.begin(),
474 E = IndirectPassManagers.end(); P == NULL && I != E; ++I)
475 P = (*I)->findAnalysisPass(AID, false);
477 for (std::vector<ImmutablePass *>::iterator I = ImmutablePasses.begin(),
478 E = ImmutablePasses.end(); P == NULL && I != E; ++I) {
479 const PassInfo *PI = (*I)->getPassInfo();
483 // If Pass not found then check the interfaces implemented by Immutable Pass
485 const std::vector<const PassInfo*> &ImmPI =
486 PI->getInterfacesImplemented();
487 if (std::find(ImmPI.begin(), ImmPI.end(), AID) != ImmPI.end())
495 // Print passes managed by this top level manager.
496 void PMTopLevelManager::dumpPasses() const {
498 if (PassDebugging < Structure)
501 // Print out the immutable passes
502 for (unsigned i = 0, e = ImmutablePasses.size(); i != e; ++i) {
503 ImmutablePasses[i]->dumpPassStructure(0);
506 // Every class that derives from PMDataManager also derives from Pass
507 // (sometimes indirectly), but there's no inheritance relationship
508 // between PMDataManager and Pass, so we have to dynamic_cast to get
509 // from a PMDataManager* to a Pass*.
510 for (std::vector<PMDataManager *>::const_iterator I = PassManagers.begin(),
511 E = PassManagers.end(); I != E; ++I)
512 dynamic_cast<Pass *>(*I)->dumpPassStructure(1);
515 void PMTopLevelManager::dumpArguments() const {
517 if (PassDebugging < Arguments)
520 cerr << "Pass Arguments: ";
521 for (std::vector<PMDataManager *>::const_iterator I = PassManagers.begin(),
522 E = PassManagers.end(); I != E; ++I) {
523 PMDataManager *PMD = *I;
524 PMD->dumpPassArguments();
529 void PMTopLevelManager::initializeAllAnalysisInfo() {
531 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
532 E = PassManagers.end(); I != E; ++I) {
533 PMDataManager *PMD = *I;
534 PMD->initializeAnalysisInfo();
537 // Initailize other pass managers
538 for (std::vector<PMDataManager *>::iterator I = IndirectPassManagers.begin(),
539 E = IndirectPassManagers.end(); I != E; ++I)
540 (*I)->initializeAnalysisInfo();
544 PMTopLevelManager::~PMTopLevelManager() {
545 for (std::vector<PMDataManager *>::iterator I = PassManagers.begin(),
546 E = PassManagers.end(); I != E; ++I)
549 for (std::vector<ImmutablePass *>::iterator
550 I = ImmutablePasses.begin(), E = ImmutablePasses.end(); I != E; ++I)
554 //===----------------------------------------------------------------------===//
555 // PMDataManager implementation
557 /// Augement AvailableAnalysis by adding analysis made available by pass P.
558 void PMDataManager::recordAvailableAnalysis(Pass *P) {
560 if (const PassInfo *PI = P->getPassInfo()) {
561 AvailableAnalysis[PI] = P;
563 //This pass is the current implementation of all of the interfaces it
564 //implements as well.
565 const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
566 for (unsigned i = 0, e = II.size(); i != e; ++i)
567 AvailableAnalysis[II[i]] = P;
571 // Return true if P preserves high level analysis used by other
572 // passes managed by this manager
573 bool PMDataManager::preserveHigherLevelAnalysis(Pass *P) {
575 AnalysisUsage AnUsage;
576 P->getAnalysisUsage(AnUsage);
578 if (AnUsage.getPreservesAll())
581 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
582 for (std::vector<Pass *>::iterator I = HigherLevelAnalysis.begin(),
583 E = HigherLevelAnalysis.end(); I != E; ++I) {
585 if (!dynamic_cast<ImmutablePass*>(P1) &&
586 std::find(PreservedSet.begin(), PreservedSet.end(),
587 P1->getPassInfo()) ==
595 /// verifyPreservedAnalysis -- Verify analysis presreved by pass P.
596 void PMDataManager::verifyPreservedAnalysis(Pass *P) {
597 AnalysisUsage AnUsage;
598 P->getAnalysisUsage(AnUsage);
599 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
601 // Verify preserved analysis
602 for (std::vector<AnalysisID>::const_iterator I = PreservedSet.begin(),
603 E = PreservedSet.end(); I != E; ++I) {
605 Pass *AP = findAnalysisPass(AID, true);
607 AP->verifyAnalysis();
611 /// Remove Analyss not preserved by Pass P
612 void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
613 AnalysisUsage AnUsage;
614 P->getAnalysisUsage(AnUsage);
615 if (AnUsage.getPreservesAll())
618 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
619 for (std::map<AnalysisID, Pass*>::iterator I = AvailableAnalysis.begin(),
620 E = AvailableAnalysis.end(); I != E; ) {
621 std::map<AnalysisID, Pass*>::iterator Info = I++;
622 if (!dynamic_cast<ImmutablePass*>(Info->second)
623 && std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
624 PreservedSet.end()) {
625 // Remove this analysis
626 AvailableAnalysis.erase(Info);
627 if (PassDebugging >= Details) {
628 Pass *S = Info->second;
629 cerr << " -- " << P->getPassName() << " is not preserving ";
630 cerr << S->getPassName() << "\n";
635 // Check inherited analysis also. If P is not preserving analysis
636 // provided by parent manager then remove it here.
637 for (unsigned Index = 0; Index < PMT_Last; ++Index) {
639 if (!InheritedAnalysis[Index])
642 for (std::map<AnalysisID, Pass*>::iterator
643 I = InheritedAnalysis[Index]->begin(),
644 E = InheritedAnalysis[Index]->end(); I != E; ) {
645 std::map<AnalysisID, Pass *>::iterator Info = I++;
646 if (!dynamic_cast<ImmutablePass*>(Info->second) &&
647 std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
649 // Remove this analysis
650 InheritedAnalysis[Index]->erase(Info);
656 /// Remove analysis passes that are not used any longer
657 void PMDataManager::removeDeadPasses(Pass *P, const char *Msg,
658 enum PassDebuggingString DBG_STR) {
660 SmallVector<Pass *, 12> DeadPasses;
662 // If this is a on the fly manager then it does not have TPM.
666 TPM->collectLastUses(DeadPasses, P);
668 if (PassDebugging >= Details && !DeadPasses.empty()) {
669 cerr << " -*- " << P->getPassName();
670 cerr << " is the last user of following pass instances.";
671 cerr << " Free these instances\n";
674 for (SmallVector<Pass *, 12>::iterator I = DeadPasses.begin(),
675 E = DeadPasses.end(); I != E; ++I) {
677 dumpPassInfo(*I, FREEING_MSG, DBG_STR, Msg);
679 if (TheTimeInfo) TheTimeInfo->passStarted(*I);
680 (*I)->releaseMemory();
681 if (TheTimeInfo) TheTimeInfo->passEnded(*I);
683 std::map<AnalysisID, Pass*>::iterator Pos =
684 AvailableAnalysis.find((*I)->getPassInfo());
686 // It is possible that pass is already removed from the AvailableAnalysis
687 if (Pos != AvailableAnalysis.end())
688 AvailableAnalysis.erase(Pos);
692 /// Add pass P into the PassVector. Update
693 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
694 void PMDataManager::add(Pass *P,
695 bool ProcessAnalysis) {
697 // This manager is going to manage pass P. Set up analysis resolver
699 AnalysisResolver *AR = new AnalysisResolver(*this);
702 // If a FunctionPass F is the last user of ModulePass info M
703 // then the F's manager, not F, records itself as a last user of M.
704 SmallVector<Pass *, 12> TransferLastUses;
706 if (ProcessAnalysis) {
708 // At the moment, this pass is the last user of all required passes.
709 SmallVector<Pass *, 12> LastUses;
710 SmallVector<Pass *, 8> RequiredPasses;
711 SmallVector<AnalysisID, 8> ReqAnalysisNotAvailable;
713 unsigned PDepth = this->getDepth();
715 collectRequiredAnalysis(RequiredPasses,
716 ReqAnalysisNotAvailable, P);
717 for (SmallVector<Pass *, 8>::iterator I = RequiredPasses.begin(),
718 E = RequiredPasses.end(); I != E; ++I) {
719 Pass *PRequired = *I;
722 PMDataManager &DM = PRequired->getResolver()->getPMDataManager();
723 RDepth = DM.getDepth();
725 if (PDepth == RDepth)
726 LastUses.push_back(PRequired);
727 else if (PDepth > RDepth) {
728 // Let the parent claim responsibility of last use
729 TransferLastUses.push_back(PRequired);
730 // Keep track of higher level analysis used by this manager.
731 HigherLevelAnalysis.push_back(PRequired);
733 assert (0 && "Unable to accomodate Required Pass");
736 // Set P as P's last user until someone starts using P.
737 // However, if P is a Pass Manager then it does not need
738 // to record its last user.
739 if (!dynamic_cast<PMDataManager *>(P))
740 LastUses.push_back(P);
741 TPM->setLastUser(LastUses, P);
743 if (!TransferLastUses.empty()) {
744 Pass *My_PM = dynamic_cast<Pass *>(this);
745 TPM->setLastUser(TransferLastUses, My_PM);
746 TransferLastUses.clear();
749 // Now, take care of required analysises that are not available.
750 for (SmallVector<AnalysisID, 8>::iterator
751 I = ReqAnalysisNotAvailable.begin(),
752 E = ReqAnalysisNotAvailable.end() ;I != E; ++I) {
753 Pass *AnalysisPass = (*I)->createPass();
754 this->addLowerLevelRequiredPass(P, AnalysisPass);
757 // Take a note of analysis required and made available by this pass.
758 // Remove the analysis not preserved by this pass
759 removeNotPreservedAnalysis(P);
760 recordAvailableAnalysis(P);
764 PassVector.push_back(P);
768 /// Populate RP with analysis pass that are required by
769 /// pass P and are available. Populate RP_NotAvail with analysis
770 /// pass that are required by pass P but are not available.
771 void PMDataManager::collectRequiredAnalysis(SmallVector<Pass *, 8>&RP,
772 SmallVector<AnalysisID, 8> &RP_NotAvail,
774 AnalysisUsage AnUsage;
775 P->getAnalysisUsage(AnUsage);
776 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
777 for (std::vector<AnalysisID>::const_iterator
778 I = RequiredSet.begin(), E = RequiredSet.end();
781 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
782 RP.push_back(AnalysisPass);
784 RP_NotAvail.push_back(AID);
787 const std::vector<AnalysisID> &IDs = AnUsage.getRequiredTransitiveSet();
788 for (std::vector<AnalysisID>::const_iterator I = IDs.begin(),
789 E = IDs.end(); I != E; ++I) {
791 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
792 RP.push_back(AnalysisPass);
794 RP_NotAvail.push_back(AID);
798 // All Required analyses should be available to the pass as it runs! Here
799 // we fill in the AnalysisImpls member of the pass so that it can
800 // successfully use the getAnalysis() method to retrieve the
801 // implementations it needs.
803 void PMDataManager::initializeAnalysisImpl(Pass *P) {
804 AnalysisUsage AnUsage;
805 P->getAnalysisUsage(AnUsage);
807 for (std::vector<const PassInfo *>::const_iterator
808 I = AnUsage.getRequiredSet().begin(),
809 E = AnUsage.getRequiredSet().end(); I != E; ++I) {
810 Pass *Impl = findAnalysisPass(*I, true);
812 // This may be analysis pass that is initialized on the fly.
813 // If that is not the case then it will raise an assert when it is used.
815 AnalysisResolver *AR = P->getResolver();
816 AR->addAnalysisImplsPair(*I, Impl);
820 /// Find the pass that implements Analysis AID. If desired pass is not found
821 /// then return NULL.
822 Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
824 // Check if AvailableAnalysis map has one entry.
825 std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
827 if (I != AvailableAnalysis.end())
830 // Search Parents through TopLevelManager
832 return TPM->findAnalysisPass(AID);
837 // Print list of passes that are last used by P.
838 void PMDataManager::dumpLastUses(Pass *P, unsigned Offset) const{
840 SmallVector<Pass *, 12> LUses;
842 // If this is a on the fly manager then it does not have TPM.
846 TPM->collectLastUses(LUses, P);
848 for (SmallVector<Pass *, 12>::iterator I = LUses.begin(),
849 E = LUses.end(); I != E; ++I) {
850 llvm::cerr << "--" << std::string(Offset*2, ' ');
851 (*I)->dumpPassStructure(0);
855 void PMDataManager::dumpPassArguments() const {
856 for(std::vector<Pass *>::const_iterator I = PassVector.begin(),
857 E = PassVector.end(); I != E; ++I) {
858 if (PMDataManager *PMD = dynamic_cast<PMDataManager *>(*I))
859 PMD->dumpPassArguments();
861 if (const PassInfo *PI = (*I)->getPassInfo())
862 if (!PI->isAnalysisGroup())
863 cerr << " -" << PI->getPassArgument();
867 void PMDataManager::dumpPassInfo(Pass *P, enum PassDebuggingString S1,
868 enum PassDebuggingString S2,
870 if (PassDebugging < Executions)
872 cerr << (void*)this << std::string(getDepth()*2+1, ' ');
875 cerr << "Executing Pass '" << P->getPassName();
877 case MODIFICATION_MSG:
878 cerr << "Made Modification '" << P->getPassName();
881 cerr << " Freeing Pass '" << P->getPassName();
887 case ON_BASICBLOCK_MSG:
888 cerr << "' on BasicBlock '" << Msg << "'...\n";
890 case ON_FUNCTION_MSG:
891 cerr << "' on Function '" << Msg << "'...\n";
894 cerr << "' on Module '" << Msg << "'...\n";
897 cerr << "' on Loop " << Msg << "'...\n";
900 cerr << "' on Call Graph " << Msg << "'...\n";
907 void PMDataManager::dumpAnalysisSetInfo(const char *Msg, Pass *P,
908 const std::vector<AnalysisID> &Set)
910 if (PassDebugging >= Details && !Set.empty()) {
911 cerr << (void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:";
912 for (unsigned i = 0; i != Set.size(); ++i) {
914 cerr << " " << Set[i]->getPassName();
920 /// Add RequiredPass into list of lower level passes required by pass P.
921 /// RequiredPass is run on the fly by Pass Manager when P requests it
922 /// through getAnalysis interface.
923 /// This should be handled by specific pass manager.
924 void PMDataManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
926 TPM->dumpArguments();
930 // Module Level pass may required Function Level analysis info
931 // (e.g. dominator info). Pass manager uses on the fly function pass manager
932 // to provide this on demand. In that case, in Pass manager terminology,
933 // module level pass is requiring lower level analysis info managed by
934 // lower level pass manager.
936 // When Pass manager is not able to order required analysis info, Pass manager
937 // checks whether any lower level manager will be able to provide this
938 // analysis info on demand or not.
940 cerr << "Unable to schedule " << RequiredPass->getPassName();
941 cerr << " required by " << P->getPassName() << "\n";
943 assert (0 && "Unable to schedule pass");
947 PMDataManager::~PMDataManager() {
949 for (std::vector<Pass *>::iterator I = PassVector.begin(),
950 E = PassVector.end(); I != E; ++I)
955 //===----------------------------------------------------------------------===//
956 // NOTE: Is this the right place to define this method ?
957 // getAnalysisToUpdate - Return an analysis result or null if it doesn't exist
958 Pass *AnalysisResolver::getAnalysisToUpdate(AnalysisID ID, bool dir) const {
959 return PM.findAnalysisPass(ID, dir);
962 Pass *AnalysisResolver::findImplPass(Pass *P, const PassInfo *AnalysisPI,
964 return PM.getOnTheFlyPass(P, AnalysisPI, F);
967 //===----------------------------------------------------------------------===//
968 // BBPassManager implementation
970 /// Execute all of the passes scheduled for execution by invoking
971 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
972 /// the function, and if so, return true.
974 BBPassManager::runOnFunction(Function &F) {
976 if (F.isDeclaration())
979 bool Changed = doInitialization(F);
981 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
982 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
983 BasicBlockPass *BP = getContainedPass(Index);
984 AnalysisUsage AnUsage;
985 BP->getAnalysisUsage(AnUsage);
987 dumpPassInfo(BP, EXECUTION_MSG, ON_BASICBLOCK_MSG, I->getNameStart());
988 dumpAnalysisSetInfo("Required", BP, AnUsage.getRequiredSet());
990 initializeAnalysisImpl(BP);
992 if (TheTimeInfo) TheTimeInfo->passStarted(BP);
993 Changed |= BP->runOnBasicBlock(*I);
994 if (TheTimeInfo) TheTimeInfo->passEnded(BP);
997 dumpPassInfo(BP, MODIFICATION_MSG, ON_BASICBLOCK_MSG,
999 dumpAnalysisSetInfo("Preserved", BP, AnUsage.getPreservedSet());
1001 verifyPreservedAnalysis(BP);
1002 removeNotPreservedAnalysis(BP);
1003 recordAvailableAnalysis(BP);
1004 removeDeadPasses(BP, I->getNameStart(), ON_BASICBLOCK_MSG);
1007 return Changed |= doFinalization(F);
1010 // Implement doInitialization and doFinalization
1011 inline bool BBPassManager::doInitialization(Module &M) {
1012 bool Changed = false;
1014 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1015 BasicBlockPass *BP = getContainedPass(Index);
1016 Changed |= BP->doInitialization(M);
1022 inline bool BBPassManager::doFinalization(Module &M) {
1023 bool Changed = false;
1025 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1026 BasicBlockPass *BP = getContainedPass(Index);
1027 Changed |= BP->doFinalization(M);
1033 inline bool BBPassManager::doInitialization(Function &F) {
1034 bool Changed = false;
1036 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1037 BasicBlockPass *BP = getContainedPass(Index);
1038 Changed |= BP->doInitialization(F);
1044 inline bool BBPassManager::doFinalization(Function &F) {
1045 bool Changed = false;
1047 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1048 BasicBlockPass *BP = getContainedPass(Index);
1049 Changed |= BP->doFinalization(F);
1056 //===----------------------------------------------------------------------===//
1057 // FunctionPassManager implementation
1059 /// Create new Function pass manager
1060 FunctionPassManager::FunctionPassManager(ModuleProvider *P) {
1061 FPM = new FunctionPassManagerImpl(0);
1062 // FPM is the top level manager.
1063 FPM->setTopLevelManager(FPM);
1065 AnalysisResolver *AR = new AnalysisResolver(*FPM);
1066 FPM->setResolver(AR);
1071 FunctionPassManager::~FunctionPassManager() {
1075 /// add - Add a pass to the queue of passes to run. This passes
1076 /// ownership of the Pass to the PassManager. When the
1077 /// PassManager_X is destroyed, the pass will be destroyed as well, so
1078 /// there is no need to delete the pass. (TODO delete passes.)
1079 /// This implies that all passes MUST be allocated with 'new'.
1080 void FunctionPassManager::add(Pass *P) {
1084 /// run - Execute all of the passes scheduled for execution. Keep
1085 /// track of whether any of the passes modifies the function, and if
1086 /// so, return true.
1088 bool FunctionPassManager::run(Function &F) {
1090 if (MP->materializeFunction(&F, &errstr)) {
1091 cerr << "Error reading bitcode file: " << errstr << "\n";
1098 /// doInitialization - Run all of the initializers for the function passes.
1100 bool FunctionPassManager::doInitialization() {
1101 return FPM->doInitialization(*MP->getModule());
1104 /// doFinalization - Run all of the finalizers for the function passes.
1106 bool FunctionPassManager::doFinalization() {
1107 return FPM->doFinalization(*MP->getModule());
1110 //===----------------------------------------------------------------------===//
1111 // FunctionPassManagerImpl implementation
1113 inline bool FunctionPassManagerImpl::doInitialization(Module &M) {
1114 bool Changed = false;
1116 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1117 FPPassManager *FP = getContainedManager(Index);
1118 Changed |= FP->doInitialization(M);
1124 inline bool FunctionPassManagerImpl::doFinalization(Module &M) {
1125 bool Changed = false;
1127 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1128 FPPassManager *FP = getContainedManager(Index);
1129 Changed |= FP->doFinalization(M);
1135 // Execute all the passes managed by this top level manager.
1136 // Return true if any function is modified by a pass.
1137 bool FunctionPassManagerImpl::run(Function &F) {
1139 bool Changed = false;
1141 TimingInfo::createTheTimeInfo();
1146 initializeAllAnalysisInfo();
1147 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1148 FPPassManager *FP = getContainedManager(Index);
1149 Changed |= FP->runOnFunction(F);
1154 //===----------------------------------------------------------------------===//
1155 // FPPassManager implementation
1157 char FPPassManager::ID = 0;
1158 /// Print passes managed by this manager
1159 void FPPassManager::dumpPassStructure(unsigned Offset) {
1160 llvm::cerr << std::string(Offset*2, ' ') << "FunctionPass Manager\n";
1161 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1162 FunctionPass *FP = getContainedPass(Index);
1163 FP->dumpPassStructure(Offset + 1);
1164 dumpLastUses(FP, Offset+1);
1169 /// Execute all of the passes scheduled for execution by invoking
1170 /// runOnFunction method. Keep track of whether any of the passes modifies
1171 /// the function, and if so, return true.
1172 bool FPPassManager::runOnFunction(Function &F) {
1174 bool Changed = false;
1176 if (F.isDeclaration())
1179 // Collect inherited analysis from Module level pass manager.
1180 populateInheritedAnalysis(TPM->activeStack);
1182 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1183 FunctionPass *FP = getContainedPass(Index);
1185 AnalysisUsage AnUsage;
1186 FP->getAnalysisUsage(AnUsage);
1188 dumpPassInfo(FP, EXECUTION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1189 dumpAnalysisSetInfo("Required", FP, AnUsage.getRequiredSet());
1191 initializeAnalysisImpl(FP);
1193 if (TheTimeInfo) TheTimeInfo->passStarted(FP);
1194 Changed |= FP->runOnFunction(F);
1195 if (TheTimeInfo) TheTimeInfo->passEnded(FP);
1198 dumpPassInfo(FP, MODIFICATION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1199 dumpAnalysisSetInfo("Preserved", FP, AnUsage.getPreservedSet());
1201 verifyPreservedAnalysis(FP);
1202 removeNotPreservedAnalysis(FP);
1203 recordAvailableAnalysis(FP);
1204 removeDeadPasses(FP, F.getNameStart(), ON_FUNCTION_MSG);
1209 bool FPPassManager::runOnModule(Module &M) {
1211 bool Changed = doInitialization(M);
1213 for(Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1214 this->runOnFunction(*I);
1216 return Changed |= doFinalization(M);
1219 inline bool FPPassManager::doInitialization(Module &M) {
1220 bool Changed = false;
1222 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1223 FunctionPass *FP = getContainedPass(Index);
1224 Changed |= FP->doInitialization(M);
1230 inline bool FPPassManager::doFinalization(Module &M) {
1231 bool Changed = false;
1233 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1234 FunctionPass *FP = getContainedPass(Index);
1235 Changed |= FP->doFinalization(M);
1241 //===----------------------------------------------------------------------===//
1242 // MPPassManager implementation
1244 /// Execute all of the passes scheduled for execution by invoking
1245 /// runOnModule method. Keep track of whether any of the passes modifies
1246 /// the module, and if so, return true.
1248 MPPassManager::runOnModule(Module &M) {
1249 bool Changed = false;
1251 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1252 ModulePass *MP = getContainedPass(Index);
1254 AnalysisUsage AnUsage;
1255 MP->getAnalysisUsage(AnUsage);
1257 dumpPassInfo(MP, EXECUTION_MSG, ON_MODULE_MSG,
1258 M.getModuleIdentifier().c_str());
1259 dumpAnalysisSetInfo("Required", MP, AnUsage.getRequiredSet());
1261 initializeAnalysisImpl(MP);
1263 if (TheTimeInfo) TheTimeInfo->passStarted(MP);
1264 Changed |= MP->runOnModule(M);
1265 if (TheTimeInfo) TheTimeInfo->passEnded(MP);
1268 dumpPassInfo(MP, MODIFICATION_MSG, ON_MODULE_MSG,
1269 M.getModuleIdentifier().c_str());
1270 dumpAnalysisSetInfo("Preserved", MP, AnUsage.getPreservedSet());
1272 verifyPreservedAnalysis(MP);
1273 removeNotPreservedAnalysis(MP);
1274 recordAvailableAnalysis(MP);
1275 removeDeadPasses(MP, M.getModuleIdentifier().c_str(), ON_MODULE_MSG);
1280 /// Add RequiredPass into list of lower level passes required by pass P.
1281 /// RequiredPass is run on the fly by Pass Manager when P requests it
1282 /// through getAnalysis interface.
1283 void MPPassManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
1285 assert (P->getPotentialPassManagerType() == PMT_ModulePassManager
1286 && "Unable to handle Pass that requires lower level Analysis pass");
1287 assert ((P->getPotentialPassManagerType() <
1288 RequiredPass->getPotentialPassManagerType())
1289 && "Unable to handle Pass that requires lower level Analysis pass");
1291 FunctionPassManagerImpl *FPP = OnTheFlyManagers[P];
1293 FPP = new FunctionPassManagerImpl(0);
1294 // FPP is the top level manager.
1295 FPP->setTopLevelManager(FPP);
1297 OnTheFlyManagers[P] = FPP;
1299 FPP->add(RequiredPass);
1301 // Register P as the last user of RequiredPass.
1302 SmallVector<Pass *, 12> LU;
1303 LU.push_back(RequiredPass);
1304 FPP->setLastUser(LU, P);
1307 /// Return function pass corresponding to PassInfo PI, that is
1308 /// required by module pass MP. Instantiate analysis pass, by using
1309 /// its runOnFunction() for function F.
1310 Pass* MPPassManager::getOnTheFlyPass(Pass *MP, const PassInfo *PI,
1312 AnalysisID AID = PI;
1313 FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP];
1314 assert (FPP && "Unable to find on the fly pass");
1317 return (dynamic_cast<PMTopLevelManager *>(FPP))->findAnalysisPass(AID);
1321 //===----------------------------------------------------------------------===//
1322 // PassManagerImpl implementation
1324 /// run - Execute all of the passes scheduled for execution. Keep track of
1325 /// whether any of the passes modifies the module, and if so, return true.
1326 bool PassManagerImpl::run(Module &M) {
1328 bool Changed = false;
1330 TimingInfo::createTheTimeInfo();
1335 initializeAllAnalysisInfo();
1336 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1337 MPPassManager *MP = getContainedManager(Index);
1338 Changed |= MP->runOnModule(M);
1343 //===----------------------------------------------------------------------===//
1344 // PassManager implementation
1346 /// Create new pass manager
1347 PassManager::PassManager() {
1348 PM = new PassManagerImpl(0);
1349 // PM is the top level manager
1350 PM->setTopLevelManager(PM);
1353 PassManager::~PassManager() {
1357 /// add - Add a pass to the queue of passes to run. This passes ownership of
1358 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
1359 /// will be destroyed as well, so there is no need to delete the pass. This
1360 /// implies that all passes MUST be allocated with 'new'.
1362 PassManager::add(Pass *P) {
1366 /// run - Execute all of the passes scheduled for execution. Keep track of
1367 /// whether any of the passes modifies the module, and if so, return true.
1369 PassManager::run(Module &M) {
1373 //===----------------------------------------------------------------------===//
1374 // TimingInfo Class - This class is used to calculate information about the
1375 // amount of time each pass takes to execute. This only happens with
1376 // -time-passes is enabled on the command line.
1378 bool llvm::TimePassesIsEnabled = false;
1379 static cl::opt<bool,true>
1380 EnableTiming("time-passes", cl::location(TimePassesIsEnabled),
1381 cl::desc("Time each pass, printing elapsed time for each on exit"));
1383 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer to
1384 // a non null value (if the -time-passes option is enabled) or it leaves it
1385 // null. It may be called multiple times.
1386 void TimingInfo::createTheTimeInfo() {
1387 if (!TimePassesIsEnabled || TheTimeInfo) return;
1389 // Constructed the first time this is called, iff -time-passes is enabled.
1390 // This guarantees that the object will be constructed before static globals,
1391 // thus it will be destroyed before them.
1392 static ManagedStatic<TimingInfo> TTI;
1393 TheTimeInfo = &*TTI;
1396 /// If TimingInfo is enabled then start pass timer.
1397 void StartPassTimer(Pass *P) {
1399 TheTimeInfo->passStarted(P);
1402 /// If TimingInfo is enabled then stop pass timer.
1403 void StopPassTimer(Pass *P) {
1405 TheTimeInfo->passEnded(P);
1408 //===----------------------------------------------------------------------===//
1409 // PMStack implementation
1412 // Pop Pass Manager from the stack and clear its analysis info.
1413 void PMStack::pop() {
1415 PMDataManager *Top = this->top();
1416 Top->initializeAnalysisInfo();
1421 // Push PM on the stack and set its top level manager.
1422 void PMStack::push(PMDataManager *PM) {
1424 PMDataManager *Top = NULL;
1425 assert (PM && "Unable to push. Pass Manager expected");
1427 if (this->empty()) {
1432 PMTopLevelManager *TPM = Top->getTopLevelManager();
1434 assert (TPM && "Unable to find top level manager");
1435 TPM->addIndirectPassManager(PM);
1436 PM->setTopLevelManager(TPM);
1442 // Dump content of the pass manager stack.
1443 void PMStack::dump() {
1444 for(std::deque<PMDataManager *>::iterator I = S.begin(),
1445 E = S.end(); I != E; ++I) {
1446 Pass *P = dynamic_cast<Pass *>(*I);
1447 printf("%s ", P->getPassName());
1453 /// Find appropriate Module Pass Manager in the PM Stack and
1454 /// add self into that manager.
1455 void ModulePass::assignPassManager(PMStack &PMS,
1456 PassManagerType PreferredType) {
1458 // Find Module Pass Manager
1459 while(!PMS.empty()) {
1460 PassManagerType TopPMType = PMS.top()->getPassManagerType();
1461 if (TopPMType == PreferredType)
1462 break; // We found desired pass manager
1463 else if (TopPMType > PMT_ModulePassManager)
1464 PMS.pop(); // Pop children pass managers
1469 PMS.top()->add(this);
1472 /// Find appropriate Function Pass Manager or Call Graph Pass Manager
1473 /// in the PM Stack and add self into that manager.
1474 void FunctionPass::assignPassManager(PMStack &PMS,
1475 PassManagerType PreferredType) {
1477 // Find Module Pass Manager (TODO : Or Call Graph Pass Manager)
1478 while(!PMS.empty()) {
1479 if (PMS.top()->getPassManagerType() > PMT_FunctionPassManager)
1484 FPPassManager *FPP = dynamic_cast<FPPassManager *>(PMS.top());
1486 // Create new Function Pass Manager
1488 assert(!PMS.empty() && "Unable to create Function Pass Manager");
1489 PMDataManager *PMD = PMS.top();
1491 // [1] Create new Function Pass Manager
1492 FPP = new FPPassManager(PMD->getDepth() + 1);
1493 FPP->populateInheritedAnalysis(PMS);
1495 // [2] Set up new manager's top level manager
1496 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1497 TPM->addIndirectPassManager(FPP);
1499 // [3] Assign manager to manage this new manager. This may create
1500 // and push new managers into PMS
1502 // If Call Graph Pass Manager is active then use it to manage
1503 // this new Function Pass manager.
1504 if (PMD->getPassManagerType() == PMT_CallGraphPassManager)
1505 FPP->assignPassManager(PMS, PMT_CallGraphPassManager);
1507 FPP->assignPassManager(PMS);
1509 // [4] Push new manager into PMS
1513 // Assign FPP as the manager of this pass.
1517 /// Find appropriate Basic Pass Manager or Call Graph Pass Manager
1518 /// in the PM Stack and add self into that manager.
1519 void BasicBlockPass::assignPassManager(PMStack &PMS,
1520 PassManagerType PreferredType) {
1522 BBPassManager *BBP = NULL;
1524 // Basic Pass Manager is a leaf pass manager. It does not handle
1525 // any other pass manager.
1527 BBP = dynamic_cast<BBPassManager *>(PMS.top());
1529 // If leaf manager is not Basic Block Pass manager then create new
1530 // basic Block Pass manager.
1533 assert(!PMS.empty() && "Unable to create BasicBlock Pass Manager");
1534 PMDataManager *PMD = PMS.top();
1536 // [1] Create new Basic Block Manager
1537 BBP = new BBPassManager(PMD->getDepth() + 1);
1539 // [2] Set up new manager's top level manager
1540 // Basic Block Pass Manager does not live by itself
1541 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1542 TPM->addIndirectPassManager(BBP);
1544 // [3] Assign manager to manage this new manager. This may create
1545 // and push new managers into PMS
1546 BBP->assignPassManager(PMS);
1548 // [4] Push new manager into PMS
1552 // Assign BBP as the manager of this pass.
1556 PassManagerBase::~PassManagerBase() {}
1558 /*===-- C Bindings --------------------------------------------------------===*/
1560 LLVMPassManagerRef LLVMCreatePassManager() {
1561 return wrap(new PassManager());
1564 LLVMPassManagerRef LLVMCreateFunctionPassManager(LLVMModuleProviderRef P) {
1565 return wrap(new FunctionPassManager(unwrap(P)));
1568 int LLVMRunPassManager(LLVMPassManagerRef PM, LLVMModuleRef M) {
1569 return unwrap<PassManager>(PM)->run(*unwrap(M));
1572 int LLVMInitializeFunctionPassManager(LLVMPassManagerRef FPM) {
1573 return unwrap<FunctionPassManager>(FPM)->doInitialization();
1576 int LLVMRunFunctionPassManager(LLVMPassManagerRef FPM, LLVMValueRef F) {
1577 return unwrap<FunctionPassManager>(FPM)->run(*unwrap<Function>(F));
1580 int LLVMFinalizeFunctionPassManager(LLVMPassManagerRef FPM) {
1581 return unwrap<FunctionPassManager>(FPM)->doFinalization();
1584 void LLVMDisposePassManager(LLVMPassManagerRef PM) {