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) ==
625 // Remove this analysis
626 AvailableAnalysis.erase(Info);
629 // Check inherited analysis also. If P is not preserving analysis
630 // provided by parent manager then remove it here.
631 for (unsigned Index = 0; Index < PMT_Last; ++Index) {
633 if (!InheritedAnalysis[Index])
636 for (std::map<AnalysisID, Pass*>::iterator
637 I = InheritedAnalysis[Index]->begin(),
638 E = InheritedAnalysis[Index]->end(); I != E; ) {
639 std::map<AnalysisID, Pass *>::iterator Info = I++;
640 if (!dynamic_cast<ImmutablePass*>(Info->second) &&
641 std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
643 // Remove this analysis
644 InheritedAnalysis[Index]->erase(Info);
650 /// Remove analysis passes that are not used any longer
651 void PMDataManager::removeDeadPasses(Pass *P, const char *Msg,
652 enum PassDebuggingString DBG_STR) {
654 SmallVector<Pass *, 12> DeadPasses;
656 // If this is a on the fly manager then it does not have TPM.
660 TPM->collectLastUses(DeadPasses, P);
662 for (SmallVector<Pass *, 12>::iterator I = DeadPasses.begin(),
663 E = DeadPasses.end(); I != E; ++I) {
665 dumpPassInfo(*I, FREEING_MSG, DBG_STR, Msg);
667 if (TheTimeInfo) TheTimeInfo->passStarted(*I);
668 (*I)->releaseMemory();
669 if (TheTimeInfo) TheTimeInfo->passEnded(*I);
671 std::map<AnalysisID, Pass*>::iterator Pos =
672 AvailableAnalysis.find((*I)->getPassInfo());
674 // It is possible that pass is already removed from the AvailableAnalysis
675 if (Pos != AvailableAnalysis.end())
676 AvailableAnalysis.erase(Pos);
680 /// Add pass P into the PassVector. Update
681 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
682 void PMDataManager::add(Pass *P,
683 bool ProcessAnalysis) {
685 // This manager is going to manage pass P. Set up analysis resolver
687 AnalysisResolver *AR = new AnalysisResolver(*this);
690 // If a FunctionPass F is the last user of ModulePass info M
691 // then the F's manager, not F, records itself as a last user of M.
692 SmallVector<Pass *, 12> TransferLastUses;
694 if (ProcessAnalysis) {
696 // At the moment, this pass is the last user of all required passes.
697 SmallVector<Pass *, 12> LastUses;
698 SmallVector<Pass *, 8> RequiredPasses;
699 SmallVector<AnalysisID, 8> ReqAnalysisNotAvailable;
701 unsigned PDepth = this->getDepth();
703 collectRequiredAnalysis(RequiredPasses,
704 ReqAnalysisNotAvailable, P);
705 for (SmallVector<Pass *, 8>::iterator I = RequiredPasses.begin(),
706 E = RequiredPasses.end(); I != E; ++I) {
707 Pass *PRequired = *I;
710 PMDataManager &DM = PRequired->getResolver()->getPMDataManager();
711 RDepth = DM.getDepth();
713 if (PDepth == RDepth)
714 LastUses.push_back(PRequired);
715 else if (PDepth > RDepth) {
716 // Let the parent claim responsibility of last use
717 TransferLastUses.push_back(PRequired);
718 // Keep track of higher level analysis used by this manager.
719 HigherLevelAnalysis.push_back(PRequired);
721 assert (0 && "Unable to accomodate Required Pass");
724 // Set P as P's last user until someone starts using P.
725 // However, if P is a Pass Manager then it does not need
726 // to record its last user.
727 if (!dynamic_cast<PMDataManager *>(P))
728 LastUses.push_back(P);
729 TPM->setLastUser(LastUses, P);
731 if (!TransferLastUses.empty()) {
732 Pass *My_PM = dynamic_cast<Pass *>(this);
733 TPM->setLastUser(TransferLastUses, My_PM);
734 TransferLastUses.clear();
737 // Now, take care of required analysises that are not available.
738 for (SmallVector<AnalysisID, 8>::iterator
739 I = ReqAnalysisNotAvailable.begin(),
740 E = ReqAnalysisNotAvailable.end() ;I != E; ++I) {
741 Pass *AnalysisPass = (*I)->createPass();
742 this->addLowerLevelRequiredPass(P, AnalysisPass);
745 // Take a note of analysis required and made available by this pass.
746 // Remove the analysis not preserved by this pass
747 removeNotPreservedAnalysis(P);
748 recordAvailableAnalysis(P);
752 PassVector.push_back(P);
756 /// Populate RP with analysis pass that are required by
757 /// pass P and are available. Populate RP_NotAvail with analysis
758 /// pass that are required by pass P but are not available.
759 void PMDataManager::collectRequiredAnalysis(SmallVector<Pass *, 8>&RP,
760 SmallVector<AnalysisID, 8> &RP_NotAvail,
762 AnalysisUsage AnUsage;
763 P->getAnalysisUsage(AnUsage);
764 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
765 for (std::vector<AnalysisID>::const_iterator
766 I = RequiredSet.begin(), E = RequiredSet.end();
769 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
770 RP.push_back(AnalysisPass);
772 RP_NotAvail.push_back(AID);
775 const std::vector<AnalysisID> &IDs = AnUsage.getRequiredTransitiveSet();
776 for (std::vector<AnalysisID>::const_iterator I = IDs.begin(),
777 E = IDs.end(); I != E; ++I) {
779 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
780 RP.push_back(AnalysisPass);
782 RP_NotAvail.push_back(AID);
786 // All Required analyses should be available to the pass as it runs! Here
787 // we fill in the AnalysisImpls member of the pass so that it can
788 // successfully use the getAnalysis() method to retrieve the
789 // implementations it needs.
791 void PMDataManager::initializeAnalysisImpl(Pass *P) {
792 AnalysisUsage AnUsage;
793 P->getAnalysisUsage(AnUsage);
795 for (std::vector<const PassInfo *>::const_iterator
796 I = AnUsage.getRequiredSet().begin(),
797 E = AnUsage.getRequiredSet().end(); I != E; ++I) {
798 Pass *Impl = findAnalysisPass(*I, true);
800 // This may be analysis pass that is initialized on the fly.
801 // If that is not the case then it will raise an assert when it is used.
803 AnalysisResolver *AR = P->getResolver();
804 AR->addAnalysisImplsPair(*I, Impl);
808 /// Find the pass that implements Analysis AID. If desired pass is not found
809 /// then return NULL.
810 Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
812 // Check if AvailableAnalysis map has one entry.
813 std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
815 if (I != AvailableAnalysis.end())
818 // Search Parents through TopLevelManager
820 return TPM->findAnalysisPass(AID);
825 // Print list of passes that are last used by P.
826 void PMDataManager::dumpLastUses(Pass *P, unsigned Offset) const{
828 SmallVector<Pass *, 12> LUses;
830 // If this is a on the fly manager then it does not have TPM.
834 TPM->collectLastUses(LUses, P);
836 for (SmallVector<Pass *, 12>::iterator I = LUses.begin(),
837 E = LUses.end(); I != E; ++I) {
838 llvm::cerr << "--" << std::string(Offset*2, ' ');
839 (*I)->dumpPassStructure(0);
843 void PMDataManager::dumpPassArguments() const {
844 for(std::vector<Pass *>::const_iterator I = PassVector.begin(),
845 E = PassVector.end(); I != E; ++I) {
846 if (PMDataManager *PMD = dynamic_cast<PMDataManager *>(*I))
847 PMD->dumpPassArguments();
849 if (const PassInfo *PI = (*I)->getPassInfo())
850 if (!PI->isAnalysisGroup())
851 cerr << " -" << PI->getPassArgument();
855 void PMDataManager::dumpPassInfo(Pass *P, enum PassDebuggingString S1,
856 enum PassDebuggingString S2,
858 if (PassDebugging < Executions)
860 cerr << (void*)this << std::string(getDepth()*2+1, ' ');
863 cerr << "Executing Pass '" << P->getPassName();
865 case MODIFICATION_MSG:
866 cerr << "Made Modification '" << P->getPassName();
869 cerr << " Freeing Pass '" << P->getPassName();
875 case ON_BASICBLOCK_MSG:
876 cerr << "' on BasicBlock '" << Msg << "'...\n";
878 case ON_FUNCTION_MSG:
879 cerr << "' on Function '" << Msg << "'...\n";
882 cerr << "' on Module '" << Msg << "'...\n";
885 cerr << "' on Loop " << Msg << "'...\n";
888 cerr << "' on Call Graph " << Msg << "'...\n";
895 void PMDataManager::dumpAnalysisSetInfo(const char *Msg, Pass *P,
896 const std::vector<AnalysisID> &Set)
898 if (PassDebugging >= Details && !Set.empty()) {
899 cerr << (void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:";
900 for (unsigned i = 0; i != Set.size(); ++i) {
902 cerr << " " << Set[i]->getPassName();
908 /// Add RequiredPass into list of lower level passes required by pass P.
909 /// RequiredPass is run on the fly by Pass Manager when P requests it
910 /// through getAnalysis interface.
911 /// This should be handled by specific pass manager.
912 void PMDataManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
914 TPM->dumpArguments();
918 // Module Level pass may required Function Level analysis info
919 // (e.g. dominator info). Pass manager uses on the fly function pass manager
920 // to provide this on demand. In that case, in Pass manager terminology,
921 // module level pass is requiring lower level analysis info managed by
922 // lower level pass manager.
924 // When Pass manager is not able to order required analysis info, Pass manager
925 // checks whether any lower level manager will be able to provide this
926 // analysis info on demand or not.
927 assert (0 && "Unable to handle Pass that requires lower level Analysis pass");
931 PMDataManager::~PMDataManager() {
933 for (std::vector<Pass *>::iterator I = PassVector.begin(),
934 E = PassVector.end(); I != E; ++I)
939 //===----------------------------------------------------------------------===//
940 // NOTE: Is this the right place to define this method ?
941 // getAnalysisToUpdate - Return an analysis result or null if it doesn't exist
942 Pass *AnalysisResolver::getAnalysisToUpdate(AnalysisID ID, bool dir) const {
943 return PM.findAnalysisPass(ID, dir);
946 Pass *AnalysisResolver::findImplPass(Pass *P, const PassInfo *AnalysisPI,
948 return PM.getOnTheFlyPass(P, AnalysisPI, F);
951 //===----------------------------------------------------------------------===//
952 // BBPassManager implementation
954 /// Execute all of the passes scheduled for execution by invoking
955 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
956 /// the function, and if so, return true.
958 BBPassManager::runOnFunction(Function &F) {
960 if (F.isDeclaration())
963 bool Changed = doInitialization(F);
965 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
966 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
967 BasicBlockPass *BP = getContainedPass(Index);
968 AnalysisUsage AnUsage;
969 BP->getAnalysisUsage(AnUsage);
971 dumpPassInfo(BP, EXECUTION_MSG, ON_BASICBLOCK_MSG, I->getNameStart());
972 dumpAnalysisSetInfo("Required", BP, AnUsage.getRequiredSet());
974 initializeAnalysisImpl(BP);
976 if (TheTimeInfo) TheTimeInfo->passStarted(BP);
977 Changed |= BP->runOnBasicBlock(*I);
978 if (TheTimeInfo) TheTimeInfo->passEnded(BP);
981 dumpPassInfo(BP, MODIFICATION_MSG, ON_BASICBLOCK_MSG,
983 dumpAnalysisSetInfo("Preserved", BP, AnUsage.getPreservedSet());
985 verifyPreservedAnalysis(BP);
986 removeNotPreservedAnalysis(BP);
987 recordAvailableAnalysis(BP);
988 removeDeadPasses(BP, I->getNameStart(), ON_BASICBLOCK_MSG);
991 return Changed |= doFinalization(F);
994 // Implement doInitialization and doFinalization
995 inline bool BBPassManager::doInitialization(Module &M) {
996 bool Changed = false;
998 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
999 BasicBlockPass *BP = getContainedPass(Index);
1000 Changed |= BP->doInitialization(M);
1006 inline bool BBPassManager::doFinalization(Module &M) {
1007 bool Changed = false;
1009 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1010 BasicBlockPass *BP = getContainedPass(Index);
1011 Changed |= BP->doFinalization(M);
1017 inline bool BBPassManager::doInitialization(Function &F) {
1018 bool Changed = false;
1020 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1021 BasicBlockPass *BP = getContainedPass(Index);
1022 Changed |= BP->doInitialization(F);
1028 inline bool BBPassManager::doFinalization(Function &F) {
1029 bool Changed = false;
1031 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1032 BasicBlockPass *BP = getContainedPass(Index);
1033 Changed |= BP->doFinalization(F);
1040 //===----------------------------------------------------------------------===//
1041 // FunctionPassManager implementation
1043 /// Create new Function pass manager
1044 FunctionPassManager::FunctionPassManager(ModuleProvider *P) {
1045 FPM = new FunctionPassManagerImpl(0);
1046 // FPM is the top level manager.
1047 FPM->setTopLevelManager(FPM);
1049 AnalysisResolver *AR = new AnalysisResolver(*FPM);
1050 FPM->setResolver(AR);
1055 FunctionPassManager::~FunctionPassManager() {
1059 /// add - Add a pass to the queue of passes to run. This passes
1060 /// ownership of the Pass to the PassManager. When the
1061 /// PassManager_X is destroyed, the pass will be destroyed as well, so
1062 /// there is no need to delete the pass. (TODO delete passes.)
1063 /// This implies that all passes MUST be allocated with 'new'.
1064 void FunctionPassManager::add(Pass *P) {
1068 /// run - Execute all of the passes scheduled for execution. Keep
1069 /// track of whether any of the passes modifies the function, and if
1070 /// so, return true.
1072 bool FunctionPassManager::run(Function &F) {
1074 if (MP->materializeFunction(&F, &errstr)) {
1075 cerr << "Error reading bitcode file: " << errstr << "\n";
1082 /// doInitialization - Run all of the initializers for the function passes.
1084 bool FunctionPassManager::doInitialization() {
1085 return FPM->doInitialization(*MP->getModule());
1088 /// doFinalization - Run all of the finalizers for the function passes.
1090 bool FunctionPassManager::doFinalization() {
1091 return FPM->doFinalization(*MP->getModule());
1094 //===----------------------------------------------------------------------===//
1095 // FunctionPassManagerImpl implementation
1097 inline bool FunctionPassManagerImpl::doInitialization(Module &M) {
1098 bool Changed = false;
1100 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1101 FPPassManager *FP = getContainedManager(Index);
1102 Changed |= FP->doInitialization(M);
1108 inline bool FunctionPassManagerImpl::doFinalization(Module &M) {
1109 bool Changed = false;
1111 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1112 FPPassManager *FP = getContainedManager(Index);
1113 Changed |= FP->doFinalization(M);
1119 // Execute all the passes managed by this top level manager.
1120 // Return true if any function is modified by a pass.
1121 bool FunctionPassManagerImpl::run(Function &F) {
1123 bool Changed = false;
1125 TimingInfo::createTheTimeInfo();
1130 initializeAllAnalysisInfo();
1131 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1132 FPPassManager *FP = getContainedManager(Index);
1133 Changed |= FP->runOnFunction(F);
1138 //===----------------------------------------------------------------------===//
1139 // FPPassManager implementation
1141 char FPPassManager::ID = 0;
1142 /// Print passes managed by this manager
1143 void FPPassManager::dumpPassStructure(unsigned Offset) {
1144 llvm::cerr << std::string(Offset*2, ' ') << "FunctionPass Manager\n";
1145 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1146 FunctionPass *FP = getContainedPass(Index);
1147 FP->dumpPassStructure(Offset + 1);
1148 dumpLastUses(FP, Offset+1);
1153 /// Execute all of the passes scheduled for execution by invoking
1154 /// runOnFunction method. Keep track of whether any of the passes modifies
1155 /// the function, and if so, return true.
1156 bool FPPassManager::runOnFunction(Function &F) {
1158 bool Changed = false;
1160 if (F.isDeclaration())
1163 // Collect inherited analysis from Module level pass manager.
1164 populateInheritedAnalysis(TPM->activeStack);
1166 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1167 FunctionPass *FP = getContainedPass(Index);
1169 AnalysisUsage AnUsage;
1170 FP->getAnalysisUsage(AnUsage);
1172 dumpPassInfo(FP, EXECUTION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1173 dumpAnalysisSetInfo("Required", FP, AnUsage.getRequiredSet());
1175 initializeAnalysisImpl(FP);
1177 if (TheTimeInfo) TheTimeInfo->passStarted(FP);
1178 Changed |= FP->runOnFunction(F);
1179 if (TheTimeInfo) TheTimeInfo->passEnded(FP);
1182 dumpPassInfo(FP, MODIFICATION_MSG, ON_FUNCTION_MSG, F.getNameStart());
1183 dumpAnalysisSetInfo("Preserved", FP, AnUsage.getPreservedSet());
1185 verifyPreservedAnalysis(FP);
1186 removeNotPreservedAnalysis(FP);
1187 recordAvailableAnalysis(FP);
1188 removeDeadPasses(FP, F.getNameStart(), ON_FUNCTION_MSG);
1193 bool FPPassManager::runOnModule(Module &M) {
1195 bool Changed = doInitialization(M);
1197 for(Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1198 this->runOnFunction(*I);
1200 return Changed |= doFinalization(M);
1203 inline bool FPPassManager::doInitialization(Module &M) {
1204 bool Changed = false;
1206 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1207 FunctionPass *FP = getContainedPass(Index);
1208 Changed |= FP->doInitialization(M);
1214 inline bool FPPassManager::doFinalization(Module &M) {
1215 bool Changed = false;
1217 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1218 FunctionPass *FP = getContainedPass(Index);
1219 Changed |= FP->doFinalization(M);
1225 //===----------------------------------------------------------------------===//
1226 // MPPassManager implementation
1228 /// Execute all of the passes scheduled for execution by invoking
1229 /// runOnModule method. Keep track of whether any of the passes modifies
1230 /// the module, and if so, return true.
1232 MPPassManager::runOnModule(Module &M) {
1233 bool Changed = false;
1235 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1236 ModulePass *MP = getContainedPass(Index);
1238 AnalysisUsage AnUsage;
1239 MP->getAnalysisUsage(AnUsage);
1241 dumpPassInfo(MP, EXECUTION_MSG, ON_MODULE_MSG,
1242 M.getModuleIdentifier().c_str());
1243 dumpAnalysisSetInfo("Required", MP, AnUsage.getRequiredSet());
1245 initializeAnalysisImpl(MP);
1247 if (TheTimeInfo) TheTimeInfo->passStarted(MP);
1248 Changed |= MP->runOnModule(M);
1249 if (TheTimeInfo) TheTimeInfo->passEnded(MP);
1252 dumpPassInfo(MP, MODIFICATION_MSG, ON_MODULE_MSG,
1253 M.getModuleIdentifier().c_str());
1254 dumpAnalysisSetInfo("Preserved", MP, AnUsage.getPreservedSet());
1256 verifyPreservedAnalysis(MP);
1257 removeNotPreservedAnalysis(MP);
1258 recordAvailableAnalysis(MP);
1259 removeDeadPasses(MP, M.getModuleIdentifier().c_str(), ON_MODULE_MSG);
1264 /// Add RequiredPass into list of lower level passes required by pass P.
1265 /// RequiredPass is run on the fly by Pass Manager when P requests it
1266 /// through getAnalysis interface.
1267 void MPPassManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
1269 assert (P->getPotentialPassManagerType() == PMT_ModulePassManager
1270 && "Unable to handle Pass that requires lower level Analysis pass");
1271 assert ((P->getPotentialPassManagerType() <
1272 RequiredPass->getPotentialPassManagerType())
1273 && "Unable to handle Pass that requires lower level Analysis pass");
1275 FunctionPassManagerImpl *FPP = OnTheFlyManagers[P];
1277 FPP = new FunctionPassManagerImpl(0);
1278 // FPP is the top level manager.
1279 FPP->setTopLevelManager(FPP);
1281 OnTheFlyManagers[P] = FPP;
1283 FPP->add(RequiredPass);
1285 // Register P as the last user of RequiredPass.
1286 SmallVector<Pass *, 12> LU;
1287 LU.push_back(RequiredPass);
1288 FPP->setLastUser(LU, P);
1291 /// Return function pass corresponding to PassInfo PI, that is
1292 /// required by module pass MP. Instantiate analysis pass, by using
1293 /// its runOnFunction() for function F.
1294 Pass* MPPassManager::getOnTheFlyPass(Pass *MP, const PassInfo *PI,
1296 AnalysisID AID = PI;
1297 FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP];
1298 assert (FPP && "Unable to find on the fly pass");
1301 return (dynamic_cast<PMTopLevelManager *>(FPP))->findAnalysisPass(AID);
1305 //===----------------------------------------------------------------------===//
1306 // PassManagerImpl implementation
1308 /// run - Execute all of the passes scheduled for execution. Keep track of
1309 /// whether any of the passes modifies the module, and if so, return true.
1310 bool PassManagerImpl::run(Module &M) {
1312 bool Changed = false;
1314 TimingInfo::createTheTimeInfo();
1319 initializeAllAnalysisInfo();
1320 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1321 MPPassManager *MP = getContainedManager(Index);
1322 Changed |= MP->runOnModule(M);
1327 //===----------------------------------------------------------------------===//
1328 // PassManager implementation
1330 /// Create new pass manager
1331 PassManager::PassManager() {
1332 PM = new PassManagerImpl(0);
1333 // PM is the top level manager
1334 PM->setTopLevelManager(PM);
1337 PassManager::~PassManager() {
1341 /// add - Add a pass to the queue of passes to run. This passes ownership of
1342 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
1343 /// will be destroyed as well, so there is no need to delete the pass. This
1344 /// implies that all passes MUST be allocated with 'new'.
1346 PassManager::add(Pass *P) {
1350 /// run - Execute all of the passes scheduled for execution. Keep track of
1351 /// whether any of the passes modifies the module, and if so, return true.
1353 PassManager::run(Module &M) {
1357 //===----------------------------------------------------------------------===//
1358 // TimingInfo Class - This class is used to calculate information about the
1359 // amount of time each pass takes to execute. This only happens with
1360 // -time-passes is enabled on the command line.
1362 bool llvm::TimePassesIsEnabled = false;
1363 static cl::opt<bool,true>
1364 EnableTiming("time-passes", cl::location(TimePassesIsEnabled),
1365 cl::desc("Time each pass, printing elapsed time for each on exit"));
1367 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer to
1368 // a non null value (if the -time-passes option is enabled) or it leaves it
1369 // null. It may be called multiple times.
1370 void TimingInfo::createTheTimeInfo() {
1371 if (!TimePassesIsEnabled || TheTimeInfo) return;
1373 // Constructed the first time this is called, iff -time-passes is enabled.
1374 // This guarantees that the object will be constructed before static globals,
1375 // thus it will be destroyed before them.
1376 static ManagedStatic<TimingInfo> TTI;
1377 TheTimeInfo = &*TTI;
1380 /// If TimingInfo is enabled then start pass timer.
1381 void StartPassTimer(Pass *P) {
1383 TheTimeInfo->passStarted(P);
1386 /// If TimingInfo is enabled then stop pass timer.
1387 void StopPassTimer(Pass *P) {
1389 TheTimeInfo->passEnded(P);
1392 //===----------------------------------------------------------------------===//
1393 // PMStack implementation
1396 // Pop Pass Manager from the stack and clear its analysis info.
1397 void PMStack::pop() {
1399 PMDataManager *Top = this->top();
1400 Top->initializeAnalysisInfo();
1405 // Push PM on the stack and set its top level manager.
1406 void PMStack::push(PMDataManager *PM) {
1408 PMDataManager *Top = NULL;
1409 assert (PM && "Unable to push. Pass Manager expected");
1411 if (this->empty()) {
1416 PMTopLevelManager *TPM = Top->getTopLevelManager();
1418 assert (TPM && "Unable to find top level manager");
1419 TPM->addIndirectPassManager(PM);
1420 PM->setTopLevelManager(TPM);
1426 // Dump content of the pass manager stack.
1427 void PMStack::dump() {
1428 for(std::deque<PMDataManager *>::iterator I = S.begin(),
1429 E = S.end(); I != E; ++I) {
1430 Pass *P = dynamic_cast<Pass *>(*I);
1431 printf("%s ", P->getPassName());
1437 /// Find appropriate Module Pass Manager in the PM Stack and
1438 /// add self into that manager.
1439 void ModulePass::assignPassManager(PMStack &PMS,
1440 PassManagerType PreferredType) {
1442 // Find Module Pass Manager
1443 while(!PMS.empty()) {
1444 PassManagerType TopPMType = PMS.top()->getPassManagerType();
1445 if (TopPMType == PreferredType)
1446 break; // We found desired pass manager
1447 else if (TopPMType > PMT_ModulePassManager)
1448 PMS.pop(); // Pop children pass managers
1453 PMS.top()->add(this);
1456 /// Find appropriate Function Pass Manager or Call Graph Pass Manager
1457 /// in the PM Stack and add self into that manager.
1458 void FunctionPass::assignPassManager(PMStack &PMS,
1459 PassManagerType PreferredType) {
1461 // Find Module Pass Manager (TODO : Or Call Graph Pass Manager)
1462 while(!PMS.empty()) {
1463 if (PMS.top()->getPassManagerType() > PMT_FunctionPassManager)
1468 FPPassManager *FPP = dynamic_cast<FPPassManager *>(PMS.top());
1470 // Create new Function Pass Manager
1472 assert(!PMS.empty() && "Unable to create Function Pass Manager");
1473 PMDataManager *PMD = PMS.top();
1475 // [1] Create new Function Pass Manager
1476 FPP = new FPPassManager(PMD->getDepth() + 1);
1477 FPP->populateInheritedAnalysis(PMS);
1479 // [2] Set up new manager's top level manager
1480 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1481 TPM->addIndirectPassManager(FPP);
1483 // [3] Assign manager to manage this new manager. This may create
1484 // and push new managers into PMS
1486 // If Call Graph Pass Manager is active then use it to manage
1487 // this new Function Pass manager.
1488 if (PMD->getPassManagerType() == PMT_CallGraphPassManager)
1489 FPP->assignPassManager(PMS, PMT_CallGraphPassManager);
1491 FPP->assignPassManager(PMS);
1493 // [4] Push new manager into PMS
1497 // Assign FPP as the manager of this pass.
1501 /// Find appropriate Basic Pass Manager or Call Graph Pass Manager
1502 /// in the PM Stack and add self into that manager.
1503 void BasicBlockPass::assignPassManager(PMStack &PMS,
1504 PassManagerType PreferredType) {
1506 BBPassManager *BBP = NULL;
1508 // Basic Pass Manager is a leaf pass manager. It does not handle
1509 // any other pass manager.
1511 BBP = dynamic_cast<BBPassManager *>(PMS.top());
1513 // If leaf manager is not Basic Block Pass manager then create new
1514 // basic Block Pass manager.
1517 assert(!PMS.empty() && "Unable to create BasicBlock Pass Manager");
1518 PMDataManager *PMD = PMS.top();
1520 // [1] Create new Basic Block Manager
1521 BBP = new BBPassManager(PMD->getDepth() + 1);
1523 // [2] Set up new manager's top level manager
1524 // Basic Block Pass Manager does not live by itself
1525 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1526 TPM->addIndirectPassManager(BBP);
1528 // [3] Assign manager to manage this new manager. This may create
1529 // and push new managers into PMS
1530 BBP->assignPassManager(PMS);
1532 // [4] Push new manager into PMS
1536 // Assign BBP as the manager of this pass.
1540 PassManagerBase::~PassManagerBase() {}
1542 /*===-- C Bindings --------------------------------------------------------===*/
1544 LLVMPassManagerRef LLVMCreatePassManager() {
1545 return wrap(new PassManager());
1548 LLVMPassManagerRef LLVMCreateFunctionPassManager(LLVMModuleProviderRef P) {
1549 return wrap(new FunctionPassManager(unwrap(P)));
1552 int LLVMRunPassManager(LLVMPassManagerRef PM, LLVMModuleRef M) {
1553 return unwrap<PassManager>(PM)->run(*unwrap(M));
1556 int LLVMInitializeFunctionPassManager(LLVMPassManagerRef FPM) {
1557 return unwrap<FunctionPassManager>(FPM)->doInitialization();
1560 int LLVMRunFunctionPassManager(LLVMPassManagerRef FPM, LLVMValueRef F) {
1561 return unwrap<FunctionPassManager>(FPM)->run(*unwrap<Function>(F));
1564 int LLVMFinalizeFunctionPassManager(LLVMPassManagerRef FPM) {
1565 return unwrap<FunctionPassManager>(FPM)->doFinalization();
1568 void LLVMDisposePassManager(LLVMPassManagerRef PM) {