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/ErrorHandling.h"
21 #include "llvm/Support/ManagedStatic.h"
22 #include "llvm/Support/raw_ostream.h"
23 #include "llvm/System/Mutex.h"
24 #include "llvm/System/Threading.h"
25 #include "llvm/Analysis/Dominators.h"
26 #include "llvm-c/Core.h"
32 // See PassManagers.h for Pass Manager infrastructure overview.
36 //===----------------------------------------------------------------------===//
37 // Pass debugging information. Often it is useful to find out what pass is
38 // running when a crash occurs in a utility. When this library is compiled with
39 // debugging on, a command line option (--debug-pass) is enabled that causes the
40 // pass name to be printed before it executes.
43 // Different debug levels that can be enabled...
45 None, Arguments, Structure, Executions, Details
48 // Always verify dominfo if expensive checking is enabled.
50 bool VerifyDomInfo = true;
52 bool VerifyDomInfo = false;
54 static cl::opt<bool,true>
55 VerifyDomInfoX("verify-dom-info", cl::location(VerifyDomInfo),
56 cl::desc("Verify dominator info (time consuming)"));
58 static cl::opt<enum PassDebugLevel>
59 PassDebugging("debug-pass", cl::Hidden,
60 cl::desc("Print PassManager debugging information"),
62 clEnumVal(None , "disable debug output"),
63 clEnumVal(Arguments , "print pass arguments to pass to 'opt'"),
64 clEnumVal(Structure , "print pass structure before run()"),
65 clEnumVal(Executions, "print pass name before it is executed"),
66 clEnumVal(Details , "print pass details when it is executed"),
68 } // End of llvm namespace
70 /// isPassDebuggingExecutionsOrMore - Return true if -debug-pass=Executions
71 /// or higher is specified.
72 bool PMDataManager::isPassDebuggingExecutionsOrMore() const {
73 return PassDebugging >= Executions;
79 void PassManagerPrettyStackEntry::print(raw_ostream &OS) const {
81 OS << "Releasing pass '";
83 OS << "Running pass '";
85 OS << P->getPassName() << "'";
88 OS << " on module '" << M->getModuleIdentifier() << "'.\n";
99 else if (isa<BasicBlock>(V))
105 WriteAsOperand(OS, V, /*PrintTy=*/false, M);
112 //===----------------------------------------------------------------------===//
115 /// BBPassManager manages BasicBlockPass. It batches all the
116 /// pass together and sequence them to process one basic block before
117 /// processing next basic block.
118 class VISIBILITY_HIDDEN BBPassManager : public PMDataManager,
119 public FunctionPass {
123 explicit BBPassManager(int Depth)
124 : PMDataManager(Depth), FunctionPass(&ID) {}
126 /// Execute all of the passes scheduled for execution. Keep track of
127 /// whether any of the passes modifies the function, and if so, return true.
128 bool runOnFunction(Function &F);
130 /// Pass Manager itself does not invalidate any analysis info.
131 void getAnalysisUsage(AnalysisUsage &Info) const {
132 Info.setPreservesAll();
135 bool doInitialization(Module &M);
136 bool doInitialization(Function &F);
137 bool doFinalization(Module &M);
138 bool doFinalization(Function &F);
140 virtual const char *getPassName() const {
141 return "BasicBlock Pass Manager";
144 // Print passes managed by this manager
145 void dumpPassStructure(unsigned Offset) {
146 llvm::errs() << std::string(Offset*2, ' ') << "BasicBlockPass Manager\n";
147 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
148 BasicBlockPass *BP = getContainedPass(Index);
149 BP->dumpPassStructure(Offset + 1);
150 dumpLastUses(BP, Offset+1);
154 BasicBlockPass *getContainedPass(unsigned N) {
155 assert(N < PassVector.size() && "Pass number out of range!");
156 BasicBlockPass *BP = static_cast<BasicBlockPass *>(PassVector[N]);
160 virtual PassManagerType getPassManagerType() const {
161 return PMT_BasicBlockPassManager;
165 char BBPassManager::ID = 0;
170 //===----------------------------------------------------------------------===//
171 // FunctionPassManagerImpl
173 /// FunctionPassManagerImpl manages FPPassManagers
174 class FunctionPassManagerImpl : public Pass,
175 public PMDataManager,
176 public PMTopLevelManager {
181 explicit FunctionPassManagerImpl(int Depth) :
182 Pass(&ID), PMDataManager(Depth),
183 PMTopLevelManager(TLM_Function), wasRun(false) { }
185 /// add - Add a pass to the queue of passes to run. This passes ownership of
186 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
187 /// will be destroyed as well, so there is no need to delete the pass. This
188 /// implies that all passes MUST be allocated with 'new'.
193 // Prepare for running an on the fly pass, freeing memory if needed
194 // from a previous run.
195 void releaseMemoryOnTheFly();
197 /// run - Execute all of the passes scheduled for execution. Keep track of
198 /// whether any of the passes modifies the module, and if so, return true.
199 bool run(Function &F);
201 /// doInitialization - Run all of the initializers for the function passes.
203 bool doInitialization(Module &M);
205 /// doFinalization - Run all of the finalizers for the function passes.
207 bool doFinalization(Module &M);
209 /// Pass Manager itself does not invalidate any analysis info.
210 void getAnalysisUsage(AnalysisUsage &Info) const {
211 Info.setPreservesAll();
214 inline void addTopLevelPass(Pass *P) {
216 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
218 // P is a immutable pass and it will be managed by this
219 // top level manager. Set up analysis resolver to connect them.
220 AnalysisResolver *AR = new AnalysisResolver(*this);
222 initializeAnalysisImpl(P);
223 addImmutablePass(IP);
224 recordAvailableAnalysis(IP);
226 P->assignPassManager(activeStack);
231 FPPassManager *getContainedManager(unsigned N) {
232 assert(N < PassManagers.size() && "Pass number out of range!");
233 FPPassManager *FP = static_cast<FPPassManager *>(PassManagers[N]);
238 char FunctionPassManagerImpl::ID = 0;
239 //===----------------------------------------------------------------------===//
242 /// MPPassManager manages ModulePasses and function pass managers.
243 /// It batches all Module passes and function pass managers together and
244 /// sequences them to process one module.
245 class MPPassManager : public Pass, public PMDataManager {
248 explicit MPPassManager(int Depth) :
249 Pass(&ID), PMDataManager(Depth) { }
251 // Delete on the fly managers.
252 virtual ~MPPassManager() {
253 for (std::map<Pass *, FunctionPassManagerImpl *>::iterator
254 I = OnTheFlyManagers.begin(), E = OnTheFlyManagers.end();
256 FunctionPassManagerImpl *FPP = I->second;
261 /// run - Execute all of the passes scheduled for execution. Keep track of
262 /// whether any of the passes modifies the module, and if so, return true.
263 bool runOnModule(Module &M);
265 /// Pass Manager itself does not invalidate any analysis info.
266 void getAnalysisUsage(AnalysisUsage &Info) const {
267 Info.setPreservesAll();
270 /// Add RequiredPass into list of lower level passes required by pass P.
271 /// RequiredPass is run on the fly by Pass Manager when P requests it
272 /// through getAnalysis interface.
273 virtual void addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass);
275 /// Return function pass corresponding to PassInfo PI, that is
276 /// required by module pass MP. Instantiate analysis pass, by using
277 /// its runOnFunction() for function F.
278 virtual Pass* getOnTheFlyPass(Pass *MP, const PassInfo *PI, Function &F);
280 virtual const char *getPassName() const {
281 return "Module Pass Manager";
284 // Print passes managed by this manager
285 void dumpPassStructure(unsigned Offset) {
286 llvm::errs() << std::string(Offset*2, ' ') << "ModulePass Manager\n";
287 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
288 ModulePass *MP = getContainedPass(Index);
289 MP->dumpPassStructure(Offset + 1);
290 std::map<Pass *, FunctionPassManagerImpl *>::const_iterator I =
291 OnTheFlyManagers.find(MP);
292 if (I != OnTheFlyManagers.end())
293 I->second->dumpPassStructure(Offset + 2);
294 dumpLastUses(MP, Offset+1);
298 ModulePass *getContainedPass(unsigned N) {
299 assert(N < PassVector.size() && "Pass number out of range!");
300 return static_cast<ModulePass *>(PassVector[N]);
303 virtual PassManagerType getPassManagerType() const {
304 return PMT_ModulePassManager;
308 /// Collection of on the fly FPPassManagers. These managers manage
309 /// function passes that are required by module passes.
310 std::map<Pass *, FunctionPassManagerImpl *> OnTheFlyManagers;
313 char MPPassManager::ID = 0;
314 //===----------------------------------------------------------------------===//
318 /// PassManagerImpl manages MPPassManagers
319 class PassManagerImpl : public Pass,
320 public PMDataManager,
321 public PMTopLevelManager {
325 explicit PassManagerImpl(int Depth) :
326 Pass(&ID), PMDataManager(Depth), PMTopLevelManager(TLM_Pass) { }
328 /// add - Add a pass to the queue of passes to run. This passes ownership of
329 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
330 /// will be destroyed as well, so there is no need to delete the pass. This
331 /// implies that all passes MUST be allocated with 'new'.
336 /// run - Execute all of the passes scheduled for execution. Keep track of
337 /// whether any of the passes modifies the module, and if so, return true.
340 /// Pass Manager itself does not invalidate any analysis info.
341 void getAnalysisUsage(AnalysisUsage &Info) const {
342 Info.setPreservesAll();
345 inline void addTopLevelPass(Pass *P) {
346 if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
348 // P is a immutable pass and it will be managed by this
349 // top level manager. Set up analysis resolver to connect them.
350 AnalysisResolver *AR = new AnalysisResolver(*this);
352 initializeAnalysisImpl(P);
353 addImmutablePass(IP);
354 recordAvailableAnalysis(IP);
356 P->assignPassManager(activeStack);
360 MPPassManager *getContainedManager(unsigned N) {
361 assert(N < PassManagers.size() && "Pass number out of range!");
362 MPPassManager *MP = static_cast<MPPassManager *>(PassManagers[N]);
367 char PassManagerImpl::ID = 0;
368 } // End of llvm namespace
372 //===----------------------------------------------------------------------===//
373 /// TimingInfo Class - This class is used to calculate information about the
374 /// amount of time each pass takes to execute. This only happens when
375 /// -time-passes is enabled on the command line.
378 static ManagedStatic<sys::SmartMutex<true> > TimingInfoMutex;
380 class VISIBILITY_HIDDEN TimingInfo {
381 std::map<Pass*, Timer> TimingData;
385 // Use 'create' member to get this.
386 TimingInfo() : TG("... Pass execution timing report ...") {}
388 // TimingDtor - Print out information about timing information
390 // Delete all of the timers...
392 // TimerGroup is deleted next, printing the report.
395 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer
396 // to a non null value (if the -time-passes option is enabled) or it leaves it
397 // null. It may be called multiple times.
398 static void createTheTimeInfo();
400 /// passStarted - This method creates a timer for the given pass if it doesn't
401 /// already have one, and starts the timer.
402 Timer *passStarted(Pass *P) {
403 if (dynamic_cast<PMDataManager *>(P))
406 sys::SmartScopedLock<true> Lock(*TimingInfoMutex);
407 std::map<Pass*, Timer>::iterator I = TimingData.find(P);
408 if (I == TimingData.end())
409 I=TimingData.insert(std::make_pair(P, Timer(P->getPassName(), TG))).first;
410 Timer *T = &I->second;
416 } // End of anon namespace
418 static TimingInfo *TheTimeInfo;
420 //===----------------------------------------------------------------------===//
421 // PMTopLevelManager implementation
423 /// Initialize top level manager. Create first pass manager.
424 PMTopLevelManager::PMTopLevelManager(enum TopLevelManagerType t) {
426 MPPassManager *MPP = new MPPassManager(1);
427 MPP->setTopLevelManager(this);
429 activeStack.push(MPP);
430 } else if (t == TLM_Function) {
431 FPPassManager *FPP = new FPPassManager(1);
432 FPP->setTopLevelManager(this);
434 activeStack.push(FPP);
438 /// Set pass P as the last user of the given analysis passes.
439 void PMTopLevelManager::setLastUser(SmallVector<Pass *, 12> &AnalysisPasses,
441 for (SmallVector<Pass *, 12>::iterator I = AnalysisPasses.begin(),
442 E = AnalysisPasses.end(); I != E; ++I) {
449 // If AP is the last user of other passes then make P last user of
451 for (DenseMap<Pass *, Pass *>::iterator LUI = LastUser.begin(),
452 LUE = LastUser.end(); LUI != LUE; ++LUI) {
453 if (LUI->second == AP)
454 // DenseMap iterator is not invalidated here because
455 // this is just updating exisitng entry.
456 LastUser[LUI->first] = P;
461 /// Collect passes whose last user is P
462 void PMTopLevelManager::collectLastUses(SmallVector<Pass *, 12> &LastUses,
464 DenseMap<Pass *, SmallPtrSet<Pass *, 8> >::iterator DMI =
465 InversedLastUser.find(P);
466 if (DMI == InversedLastUser.end())
469 SmallPtrSet<Pass *, 8> &LU = DMI->second;
470 for (SmallPtrSet<Pass *, 8>::iterator I = LU.begin(),
471 E = LU.end(); I != E; ++I) {
472 LastUses.push_back(*I);
477 AnalysisUsage *PMTopLevelManager::findAnalysisUsage(Pass *P) {
478 AnalysisUsage *AnUsage = NULL;
479 DenseMap<Pass *, AnalysisUsage *>::iterator DMI = AnUsageMap.find(P);
480 if (DMI != AnUsageMap.end())
481 AnUsage = DMI->second;
483 AnUsage = new AnalysisUsage();
484 P->getAnalysisUsage(*AnUsage);
485 AnUsageMap[P] = AnUsage;
490 /// Schedule pass P for execution. Make sure that passes required by
491 /// P are run before P is run. Update analysis info maintained by
492 /// the manager. Remove dead passes. This is a recursive function.
493 void PMTopLevelManager::schedulePass(Pass *P) {
495 // TODO : Allocate function manager for this pass, other wise required set
496 // may be inserted into previous function manager
498 // Give pass a chance to prepare the stage.
499 P->preparePassManager(activeStack);
501 // If P is an analysis pass and it is available then do not
502 // generate the analysis again. Stale analysis info should not be
503 // available at this point.
504 if (P->getPassInfo() &&
505 P->getPassInfo()->isAnalysis() && findAnalysisPass(P->getPassInfo())) {
510 AnalysisUsage *AnUsage = findAnalysisUsage(P);
512 bool checkAnalysis = true;
513 while (checkAnalysis) {
514 checkAnalysis = false;
516 const AnalysisUsage::VectorType &RequiredSet = AnUsage->getRequiredSet();
517 for (AnalysisUsage::VectorType::const_iterator I = RequiredSet.begin(),
518 E = RequiredSet.end(); I != E; ++I) {
520 Pass *AnalysisPass = findAnalysisPass(*I);
522 AnalysisPass = (*I)->createPass();
523 if (P->getPotentialPassManagerType () ==
524 AnalysisPass->getPotentialPassManagerType())
525 // Schedule analysis pass that is managed by the same pass manager.
526 schedulePass(AnalysisPass);
527 else if (P->getPotentialPassManagerType () >
528 AnalysisPass->getPotentialPassManagerType()) {
529 // Schedule analysis pass that is managed by a new manager.
530 schedulePass(AnalysisPass);
531 // Recheck analysis passes to ensure that required analysises that
532 // are already checked are still available.
533 checkAnalysis = true;
536 // Do not schedule this analysis. Lower level analsyis
537 // passes are run on the fly.
543 // Now all required passes are available.
547 /// Find the pass that implements Analysis AID. Search immutable
548 /// passes and all pass managers. If desired pass is not found
549 /// then return NULL.
550 Pass *PMTopLevelManager::findAnalysisPass(AnalysisID AID) {
553 // Check pass managers
554 for (SmallVector<PMDataManager *, 8>::iterator I = PassManagers.begin(),
555 E = PassManagers.end(); P == NULL && I != E; ++I) {
556 PMDataManager *PMD = *I;
557 P = PMD->findAnalysisPass(AID, false);
560 // Check other pass managers
561 for (SmallVector<PMDataManager *, 8>::iterator
562 I = IndirectPassManagers.begin(),
563 E = IndirectPassManagers.end(); P == NULL && I != E; ++I)
564 P = (*I)->findAnalysisPass(AID, false);
566 for (SmallVector<ImmutablePass *, 8>::iterator I = ImmutablePasses.begin(),
567 E = ImmutablePasses.end(); P == NULL && I != E; ++I) {
568 const PassInfo *PI = (*I)->getPassInfo();
572 // If Pass not found then check the interfaces implemented by Immutable Pass
574 const std::vector<const PassInfo*> &ImmPI =
575 PI->getInterfacesImplemented();
576 if (std::find(ImmPI.begin(), ImmPI.end(), AID) != ImmPI.end())
584 // Print passes managed by this top level manager.
585 void PMTopLevelManager::dumpPasses() const {
587 if (PassDebugging < Structure)
590 // Print out the immutable passes
591 for (unsigned i = 0, e = ImmutablePasses.size(); i != e; ++i) {
592 ImmutablePasses[i]->dumpPassStructure(0);
595 // Every class that derives from PMDataManager also derives from Pass
596 // (sometimes indirectly), but there's no inheritance relationship
597 // between PMDataManager and Pass, so we have to dynamic_cast to get
598 // from a PMDataManager* to a Pass*.
599 for (SmallVector<PMDataManager *, 8>::const_iterator I = PassManagers.begin(),
600 E = PassManagers.end(); I != E; ++I)
601 dynamic_cast<Pass *>(*I)->dumpPassStructure(1);
604 void PMTopLevelManager::dumpArguments() const {
606 if (PassDebugging < Arguments)
609 errs() << "Pass Arguments: ";
610 for (SmallVector<PMDataManager *, 8>::const_iterator I = PassManagers.begin(),
611 E = PassManagers.end(); I != E; ++I)
612 (*I)->dumpPassArguments();
616 void PMTopLevelManager::initializeAllAnalysisInfo() {
617 for (SmallVector<PMDataManager *, 8>::iterator I = PassManagers.begin(),
618 E = PassManagers.end(); I != E; ++I)
619 (*I)->initializeAnalysisInfo();
621 // Initailize other pass managers
622 for (SmallVector<PMDataManager *, 8>::iterator I = IndirectPassManagers.begin(),
623 E = IndirectPassManagers.end(); I != E; ++I)
624 (*I)->initializeAnalysisInfo();
626 for (DenseMap<Pass *, Pass *>::iterator DMI = LastUser.begin(),
627 DME = LastUser.end(); DMI != DME; ++DMI) {
628 DenseMap<Pass *, SmallPtrSet<Pass *, 8> >::iterator InvDMI =
629 InversedLastUser.find(DMI->second);
630 if (InvDMI != InversedLastUser.end()) {
631 SmallPtrSet<Pass *, 8> &L = InvDMI->second;
632 L.insert(DMI->first);
634 SmallPtrSet<Pass *, 8> L; L.insert(DMI->first);
635 InversedLastUser[DMI->second] = L;
641 PMTopLevelManager::~PMTopLevelManager() {
642 for (SmallVector<PMDataManager *, 8>::iterator I = PassManagers.begin(),
643 E = PassManagers.end(); I != E; ++I)
646 for (SmallVector<ImmutablePass *, 8>::iterator
647 I = ImmutablePasses.begin(), E = ImmutablePasses.end(); I != E; ++I)
650 for (DenseMap<Pass *, AnalysisUsage *>::iterator DMI = AnUsageMap.begin(),
651 DME = AnUsageMap.end(); DMI != DME; ++DMI)
655 //===----------------------------------------------------------------------===//
656 // PMDataManager implementation
658 /// Augement AvailableAnalysis by adding analysis made available by pass P.
659 void PMDataManager::recordAvailableAnalysis(Pass *P) {
660 const PassInfo *PI = P->getPassInfo();
663 AvailableAnalysis[PI] = P;
665 //This pass is the current implementation of all of the interfaces it
666 //implements as well.
667 const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
668 for (unsigned i = 0, e = II.size(); i != e; ++i)
669 AvailableAnalysis[II[i]] = P;
672 // Return true if P preserves high level analysis used by other
673 // passes managed by this manager
674 bool PMDataManager::preserveHigherLevelAnalysis(Pass *P) {
675 AnalysisUsage *AnUsage = TPM->findAnalysisUsage(P);
676 if (AnUsage->getPreservesAll())
679 const AnalysisUsage::VectorType &PreservedSet = AnUsage->getPreservedSet();
680 for (SmallVector<Pass *, 8>::iterator I = HigherLevelAnalysis.begin(),
681 E = HigherLevelAnalysis.end(); I != E; ++I) {
683 if (!dynamic_cast<ImmutablePass*>(P1) &&
684 std::find(PreservedSet.begin(), PreservedSet.end(),
685 P1->getPassInfo()) ==
693 /// verifyPreservedAnalysis -- Verify analysis preserved by pass P.
694 void PMDataManager::verifyPreservedAnalysis(Pass *P) {
695 // Don't do this unless assertions are enabled.
699 AnalysisUsage *AnUsage = TPM->findAnalysisUsage(P);
700 const AnalysisUsage::VectorType &PreservedSet = AnUsage->getPreservedSet();
702 // Verify preserved analysis
703 for (AnalysisUsage::VectorType::const_iterator I = PreservedSet.begin(),
704 E = PreservedSet.end(); I != E; ++I) {
706 if (Pass *AP = findAnalysisPass(AID, true))
707 AP->verifyAnalysis();
711 /// verifyDomInfo - Verify dominator information if it is available.
712 void PMDataManager::verifyDomInfo(Pass &P, Function &F) {
713 if (!VerifyDomInfo || !P.getResolver())
716 DominatorTree *DT = P.getAnalysisIfAvailable<DominatorTree>();
720 DominatorTree OtherDT;
721 OtherDT.getBase().recalculate(F);
722 if (DT->compare(OtherDT)) {
723 errs() << "Dominator Information for " << F.getName() << "\n";
724 errs() << "Pass '" << P.getPassName() << "'\n";
725 errs() << "----- Valid -----\n";
727 errs() << "----- Invalid -----\n";
729 llvm_unreachable("Invalid dominator info");
732 DominanceFrontier *DF = P.getAnalysisIfAvailable<DominanceFrontier>();
736 DominanceFrontier OtherDF;
737 std::vector<BasicBlock*> DTRoots = DT->getRoots();
738 OtherDF.calculate(*DT, DT->getNode(DTRoots[0]));
739 if (DF->compare(OtherDF)) {
740 errs() << "Dominator Information for " << F.getName() << "\n";
741 errs() << "Pass '" << P.getPassName() << "'\n";
742 errs() << "----- Valid -----\n";
744 errs() << "----- Invalid -----\n";
746 llvm_unreachable("Invalid dominator info");
750 /// Remove Analysis not preserved by Pass P
751 void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
752 AnalysisUsage *AnUsage = TPM->findAnalysisUsage(P);
753 if (AnUsage->getPreservesAll())
756 const AnalysisUsage::VectorType &PreservedSet = AnUsage->getPreservedSet();
757 for (std::map<AnalysisID, Pass*>::iterator I = AvailableAnalysis.begin(),
758 E = AvailableAnalysis.end(); I != E; ) {
759 std::map<AnalysisID, Pass*>::iterator Info = I++;
760 if (!dynamic_cast<ImmutablePass*>(Info->second)
761 && std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
762 PreservedSet.end()) {
763 // Remove this analysis
764 if (PassDebugging >= Details) {
765 Pass *S = Info->second;
766 errs() << " -- '" << P->getPassName() << "' is not preserving '";
767 errs() << S->getPassName() << "'\n";
769 AvailableAnalysis.erase(Info);
773 // Check inherited analysis also. If P is not preserving analysis
774 // provided by parent manager then remove it here.
775 for (unsigned Index = 0; Index < PMT_Last; ++Index) {
777 if (!InheritedAnalysis[Index])
780 for (std::map<AnalysisID, Pass*>::iterator
781 I = InheritedAnalysis[Index]->begin(),
782 E = InheritedAnalysis[Index]->end(); I != E; ) {
783 std::map<AnalysisID, Pass *>::iterator Info = I++;
784 if (!dynamic_cast<ImmutablePass*>(Info->second) &&
785 std::find(PreservedSet.begin(), PreservedSet.end(), Info->first) ==
787 // Remove this analysis
788 InheritedAnalysis[Index]->erase(Info);
793 /// Remove analysis passes that are not used any longer
794 void PMDataManager::removeDeadPasses(Pass *P, const StringRef &Msg,
795 enum PassDebuggingString DBG_STR) {
797 SmallVector<Pass *, 12> DeadPasses;
799 // If this is a on the fly manager then it does not have TPM.
803 TPM->collectLastUses(DeadPasses, P);
805 if (PassDebugging >= Details && !DeadPasses.empty()) {
806 errs() << " -*- '" << P->getPassName();
807 errs() << "' is the last user of following pass instances.";
808 errs() << " Free these instances\n";
811 for (SmallVector<Pass *, 12>::iterator I = DeadPasses.begin(),
812 E = DeadPasses.end(); I != E; ++I)
813 freePass(*I, Msg, DBG_STR);
816 void PMDataManager::freePass(Pass *P, const StringRef &Msg,
817 enum PassDebuggingString DBG_STR) {
818 dumpPassInfo(P, FREEING_MSG, DBG_STR, Msg);
821 // If the pass crashes releasing memory, remember this.
822 PassManagerPrettyStackEntry X(P);
824 Timer *T = StartPassTimer(P);
829 if (const PassInfo *PI = P->getPassInfo()) {
830 // Remove the pass itself (if it is not already removed).
831 AvailableAnalysis.erase(PI);
833 // Remove all interfaces this pass implements, for which it is also
834 // listed as the available implementation.
835 const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
836 for (unsigned i = 0, e = II.size(); i != e; ++i) {
837 std::map<AnalysisID, Pass*>::iterator Pos =
838 AvailableAnalysis.find(II[i]);
839 if (Pos != AvailableAnalysis.end() && Pos->second == P)
840 AvailableAnalysis.erase(Pos);
845 /// Add pass P into the PassVector. Update
846 /// AvailableAnalysis appropriately if ProcessAnalysis is true.
847 void PMDataManager::add(Pass *P, bool ProcessAnalysis) {
848 // This manager is going to manage pass P. Set up analysis resolver
850 AnalysisResolver *AR = new AnalysisResolver(*this);
853 // If a FunctionPass F is the last user of ModulePass info M
854 // then the F's manager, not F, records itself as a last user of M.
855 SmallVector<Pass *, 12> TransferLastUses;
857 if (!ProcessAnalysis) {
859 PassVector.push_back(P);
863 // At the moment, this pass is the last user of all required passes.
864 SmallVector<Pass *, 12> LastUses;
865 SmallVector<Pass *, 8> RequiredPasses;
866 SmallVector<AnalysisID, 8> ReqAnalysisNotAvailable;
868 unsigned PDepth = this->getDepth();
870 collectRequiredAnalysis(RequiredPasses,
871 ReqAnalysisNotAvailable, P);
872 for (SmallVector<Pass *, 8>::iterator I = RequiredPasses.begin(),
873 E = RequiredPasses.end(); I != E; ++I) {
874 Pass *PRequired = *I;
877 assert(PRequired->getResolver() && "Analysis Resolver is not set");
878 PMDataManager &DM = PRequired->getResolver()->getPMDataManager();
879 RDepth = DM.getDepth();
881 if (PDepth == RDepth)
882 LastUses.push_back(PRequired);
883 else if (PDepth > RDepth) {
884 // Let the parent claim responsibility of last use
885 TransferLastUses.push_back(PRequired);
886 // Keep track of higher level analysis used by this manager.
887 HigherLevelAnalysis.push_back(PRequired);
889 llvm_unreachable("Unable to accomodate Required Pass");
892 // Set P as P's last user until someone starts using P.
893 // However, if P is a Pass Manager then it does not need
894 // to record its last user.
895 if (!dynamic_cast<PMDataManager *>(P))
896 LastUses.push_back(P);
897 TPM->setLastUser(LastUses, P);
899 if (!TransferLastUses.empty()) {
900 Pass *My_PM = dynamic_cast<Pass *>(this);
901 TPM->setLastUser(TransferLastUses, My_PM);
902 TransferLastUses.clear();
905 // Now, take care of required analysises that are not available.
906 for (SmallVector<AnalysisID, 8>::iterator
907 I = ReqAnalysisNotAvailable.begin(),
908 E = ReqAnalysisNotAvailable.end() ;I != E; ++I) {
909 Pass *AnalysisPass = (*I)->createPass();
910 this->addLowerLevelRequiredPass(P, AnalysisPass);
913 // Take a note of analysis required and made available by this pass.
914 // Remove the analysis not preserved by this pass
915 removeNotPreservedAnalysis(P);
916 recordAvailableAnalysis(P);
919 PassVector.push_back(P);
923 /// Populate RP with analysis pass that are required by
924 /// pass P and are available. Populate RP_NotAvail with analysis
925 /// pass that are required by pass P but are not available.
926 void PMDataManager::collectRequiredAnalysis(SmallVector<Pass *, 8>&RP,
927 SmallVector<AnalysisID, 8> &RP_NotAvail,
929 AnalysisUsage *AnUsage = TPM->findAnalysisUsage(P);
930 const AnalysisUsage::VectorType &RequiredSet = AnUsage->getRequiredSet();
931 for (AnalysisUsage::VectorType::const_iterator
932 I = RequiredSet.begin(), E = RequiredSet.end(); I != E; ++I) {
933 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
934 RP.push_back(AnalysisPass);
936 RP_NotAvail.push_back(*I);
939 const AnalysisUsage::VectorType &IDs = AnUsage->getRequiredTransitiveSet();
940 for (AnalysisUsage::VectorType::const_iterator I = IDs.begin(),
941 E = IDs.end(); I != E; ++I) {
942 if (Pass *AnalysisPass = findAnalysisPass(*I, true))
943 RP.push_back(AnalysisPass);
945 RP_NotAvail.push_back(*I);
949 // All Required analyses should be available to the pass as it runs! Here
950 // we fill in the AnalysisImpls member of the pass so that it can
951 // successfully use the getAnalysis() method to retrieve the
952 // implementations it needs.
954 void PMDataManager::initializeAnalysisImpl(Pass *P) {
955 AnalysisUsage *AnUsage = TPM->findAnalysisUsage(P);
957 for (AnalysisUsage::VectorType::const_iterator
958 I = AnUsage->getRequiredSet().begin(),
959 E = AnUsage->getRequiredSet().end(); I != E; ++I) {
960 Pass *Impl = findAnalysisPass(*I, true);
962 // This may be analysis pass that is initialized on the fly.
963 // If that is not the case then it will raise an assert when it is used.
965 AnalysisResolver *AR = P->getResolver();
966 assert(AR && "Analysis Resolver is not set");
967 AR->addAnalysisImplsPair(*I, Impl);
971 /// Find the pass that implements Analysis AID. If desired pass is not found
972 /// then return NULL.
973 Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
975 // Check if AvailableAnalysis map has one entry.
976 std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
978 if (I != AvailableAnalysis.end())
981 // Search Parents through TopLevelManager
983 return TPM->findAnalysisPass(AID);
988 // Print list of passes that are last used by P.
989 void PMDataManager::dumpLastUses(Pass *P, unsigned Offset) const{
991 SmallVector<Pass *, 12> LUses;
993 // If this is a on the fly manager then it does not have TPM.
997 TPM->collectLastUses(LUses, P);
999 for (SmallVector<Pass *, 12>::iterator I = LUses.begin(),
1000 E = LUses.end(); I != E; ++I) {
1001 llvm::errs() << "--" << std::string(Offset*2, ' ');
1002 (*I)->dumpPassStructure(0);
1006 void PMDataManager::dumpPassArguments() const {
1007 for (SmallVector<Pass *, 8>::const_iterator I = PassVector.begin(),
1008 E = PassVector.end(); I != E; ++I) {
1009 if (PMDataManager *PMD = dynamic_cast<PMDataManager *>(*I))
1010 PMD->dumpPassArguments();
1012 if (const PassInfo *PI = (*I)->getPassInfo())
1013 if (!PI->isAnalysisGroup())
1014 errs() << " -" << PI->getPassArgument();
1018 void PMDataManager::dumpPassInfo(Pass *P, enum PassDebuggingString S1,
1019 enum PassDebuggingString S2,
1020 const StringRef &Msg) {
1021 if (PassDebugging < Executions)
1023 errs() << (void*)this << std::string(getDepth()*2+1, ' ');
1026 errs() << "Executing Pass '" << P->getPassName();
1028 case MODIFICATION_MSG:
1029 errs() << "Made Modification '" << P->getPassName();
1032 errs() << " Freeing Pass '" << P->getPassName();
1038 case ON_BASICBLOCK_MSG:
1039 errs() << "' on BasicBlock '" << Msg << "'...\n";
1041 case ON_FUNCTION_MSG:
1042 errs() << "' on Function '" << Msg << "'...\n";
1045 errs() << "' on Module '" << Msg << "'...\n";
1048 errs() << "' on Loop '" << Msg << "'...\n";
1051 errs() << "' on Call Graph Nodes '" << Msg << "'...\n";
1058 void PMDataManager::dumpRequiredSet(const Pass *P) const {
1059 if (PassDebugging < Details)
1062 AnalysisUsage analysisUsage;
1063 P->getAnalysisUsage(analysisUsage);
1064 dumpAnalysisUsage("Required", P, analysisUsage.getRequiredSet());
1067 void PMDataManager::dumpPreservedSet(const Pass *P) const {
1068 if (PassDebugging < Details)
1071 AnalysisUsage analysisUsage;
1072 P->getAnalysisUsage(analysisUsage);
1073 dumpAnalysisUsage("Preserved", P, analysisUsage.getPreservedSet());
1076 void PMDataManager::dumpAnalysisUsage(const StringRef &Msg, const Pass *P,
1077 const AnalysisUsage::VectorType &Set) const {
1078 assert(PassDebugging >= Details);
1081 errs() << (void*)P << std::string(getDepth()*2+3, ' ') << Msg << " Analyses:";
1082 for (unsigned i = 0; i != Set.size(); ++i) {
1083 if (i) errs() << ',';
1084 errs() << ' ' << Set[i]->getPassName();
1089 /// Add RequiredPass into list of lower level passes required by pass P.
1090 /// RequiredPass is run on the fly by Pass Manager when P requests it
1091 /// through getAnalysis interface.
1092 /// This should be handled by specific pass manager.
1093 void PMDataManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
1095 TPM->dumpArguments();
1099 // Module Level pass may required Function Level analysis info
1100 // (e.g. dominator info). Pass manager uses on the fly function pass manager
1101 // to provide this on demand. In that case, in Pass manager terminology,
1102 // module level pass is requiring lower level analysis info managed by
1103 // lower level pass manager.
1105 // When Pass manager is not able to order required analysis info, Pass manager
1106 // checks whether any lower level manager will be able to provide this
1107 // analysis info on demand or not.
1109 errs() << "Unable to schedule '" << RequiredPass->getPassName();
1110 errs() << "' required by '" << P->getPassName() << "'\n";
1112 llvm_unreachable("Unable to schedule pass");
1116 PMDataManager::~PMDataManager() {
1117 for (SmallVector<Pass *, 8>::iterator I = PassVector.begin(),
1118 E = PassVector.end(); I != E; ++I)
1122 //===----------------------------------------------------------------------===//
1123 // NOTE: Is this the right place to define this method ?
1124 // getAnalysisIfAvailable - Return analysis result or null if it doesn't exist.
1125 Pass *AnalysisResolver::getAnalysisIfAvailable(AnalysisID ID, bool dir) const {
1126 return PM.findAnalysisPass(ID, dir);
1129 Pass *AnalysisResolver::findImplPass(Pass *P, const PassInfo *AnalysisPI,
1131 return PM.getOnTheFlyPass(P, AnalysisPI, F);
1134 //===----------------------------------------------------------------------===//
1135 // BBPassManager implementation
1137 /// Execute all of the passes scheduled for execution by invoking
1138 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
1139 /// the function, and if so, return true.
1140 bool BBPassManager::runOnFunction(Function &F) {
1141 if (F.isDeclaration())
1144 bool Changed = doInitialization(F);
1146 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
1147 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1148 BasicBlockPass *BP = getContainedPass(Index);
1150 dumpPassInfo(BP, EXECUTION_MSG, ON_BASICBLOCK_MSG, I->getName());
1151 dumpRequiredSet(BP);
1153 initializeAnalysisImpl(BP);
1156 // If the pass crashes, remember this.
1157 PassManagerPrettyStackEntry X(BP, *I);
1159 Timer *T = StartPassTimer(BP);
1160 Changed |= BP->runOnBasicBlock(*I);
1161 StopPassTimer(BP, T);
1165 dumpPassInfo(BP, MODIFICATION_MSG, ON_BASICBLOCK_MSG,
1167 dumpPreservedSet(BP);
1169 verifyPreservedAnalysis(BP);
1170 removeNotPreservedAnalysis(BP);
1171 recordAvailableAnalysis(BP);
1172 removeDeadPasses(BP, I->getName(), ON_BASICBLOCK_MSG);
1175 return Changed |= doFinalization(F);
1178 // Implement doInitialization and doFinalization
1179 bool BBPassManager::doInitialization(Module &M) {
1180 bool Changed = false;
1182 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
1183 Changed |= getContainedPass(Index)->doInitialization(M);
1188 bool BBPassManager::doFinalization(Module &M) {
1189 bool Changed = false;
1191 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
1192 Changed |= getContainedPass(Index)->doFinalization(M);
1197 bool BBPassManager::doInitialization(Function &F) {
1198 bool Changed = false;
1200 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1201 BasicBlockPass *BP = getContainedPass(Index);
1202 Changed |= BP->doInitialization(F);
1208 bool BBPassManager::doFinalization(Function &F) {
1209 bool Changed = false;
1211 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1212 BasicBlockPass *BP = getContainedPass(Index);
1213 Changed |= BP->doFinalization(F);
1220 //===----------------------------------------------------------------------===//
1221 // FunctionPassManager implementation
1223 /// Create new Function pass manager
1224 FunctionPassManager::FunctionPassManager(ModuleProvider *P) {
1225 FPM = new FunctionPassManagerImpl(0);
1226 // FPM is the top level manager.
1227 FPM->setTopLevelManager(FPM);
1229 AnalysisResolver *AR = new AnalysisResolver(*FPM);
1230 FPM->setResolver(AR);
1235 FunctionPassManager::~FunctionPassManager() {
1239 /// add - Add a pass to the queue of passes to run. This passes
1240 /// ownership of the Pass to the PassManager. When the
1241 /// PassManager_X is destroyed, the pass will be destroyed as well, so
1242 /// there is no need to delete the pass. (TODO delete passes.)
1243 /// This implies that all passes MUST be allocated with 'new'.
1244 void FunctionPassManager::add(Pass *P) {
1248 /// run - Execute all of the passes scheduled for execution. Keep
1249 /// track of whether any of the passes modifies the function, and if
1250 /// so, return true.
1252 bool FunctionPassManager::run(Function &F) {
1254 if (MP->materializeFunction(&F, &errstr)) {
1255 llvm_report_error("Error reading bitcode file: " + errstr);
1261 /// doInitialization - Run all of the initializers for the function passes.
1263 bool FunctionPassManager::doInitialization() {
1264 return FPM->doInitialization(*MP->getModule());
1267 /// doFinalization - Run all of the finalizers for the function passes.
1269 bool FunctionPassManager::doFinalization() {
1270 return FPM->doFinalization(*MP->getModule());
1273 //===----------------------------------------------------------------------===//
1274 // FunctionPassManagerImpl implementation
1276 bool FunctionPassManagerImpl::doInitialization(Module &M) {
1277 bool Changed = false;
1279 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index)
1280 Changed |= getContainedManager(Index)->doInitialization(M);
1285 bool FunctionPassManagerImpl::doFinalization(Module &M) {
1286 bool Changed = false;
1288 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index)
1289 Changed |= getContainedManager(Index)->doFinalization(M);
1294 /// cleanup - After running all passes, clean up pass manager cache.
1295 void FPPassManager::cleanup() {
1296 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1297 FunctionPass *FP = getContainedPass(Index);
1298 AnalysisResolver *AR = FP->getResolver();
1299 assert(AR && "Analysis Resolver is not set");
1300 AR->clearAnalysisImpls();
1304 void FunctionPassManagerImpl::releaseMemoryOnTheFly() {
1307 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index) {
1308 FPPassManager *FPPM = getContainedManager(Index);
1309 for (unsigned Index = 0; Index < FPPM->getNumContainedPasses(); ++Index) {
1310 FPPM->getContainedPass(Index)->releaseMemory();
1316 // Execute all the passes managed by this top level manager.
1317 // Return true if any function is modified by a pass.
1318 bool FunctionPassManagerImpl::run(Function &F) {
1319 bool Changed = false;
1320 TimingInfo::createTheTimeInfo();
1325 initializeAllAnalysisInfo();
1326 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index)
1327 Changed |= getContainedManager(Index)->runOnFunction(F);
1329 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index)
1330 getContainedManager(Index)->cleanup();
1336 //===----------------------------------------------------------------------===//
1337 // FPPassManager implementation
1339 char FPPassManager::ID = 0;
1340 /// Print passes managed by this manager
1341 void FPPassManager::dumpPassStructure(unsigned Offset) {
1342 llvm::errs() << std::string(Offset*2, ' ') << "FunctionPass Manager\n";
1343 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1344 FunctionPass *FP = getContainedPass(Index);
1345 FP->dumpPassStructure(Offset + 1);
1346 dumpLastUses(FP, Offset+1);
1351 /// Execute all of the passes scheduled for execution by invoking
1352 /// runOnFunction method. Keep track of whether any of the passes modifies
1353 /// the function, and if so, return true.
1354 bool FPPassManager::runOnFunction(Function &F) {
1355 if (F.isDeclaration())
1358 bool Changed = false;
1360 // Collect inherited analysis from Module level pass manager.
1361 populateInheritedAnalysis(TPM->activeStack);
1363 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1364 FunctionPass *FP = getContainedPass(Index);
1366 dumpPassInfo(FP, EXECUTION_MSG, ON_FUNCTION_MSG, F.getName());
1367 dumpRequiredSet(FP);
1369 initializeAnalysisImpl(FP);
1372 PassManagerPrettyStackEntry X(FP, F);
1374 Timer *T = StartPassTimer(FP);
1375 Changed |= FP->runOnFunction(F);
1376 StopPassTimer(FP, T);
1380 dumpPassInfo(FP, MODIFICATION_MSG, ON_FUNCTION_MSG, F.getName());
1381 dumpPreservedSet(FP);
1383 verifyPreservedAnalysis(FP);
1384 removeNotPreservedAnalysis(FP);
1385 recordAvailableAnalysis(FP);
1386 removeDeadPasses(FP, F.getName(), ON_FUNCTION_MSG);
1388 // If dominator information is available then verify the info if requested.
1389 verifyDomInfo(*FP, F);
1394 bool FPPassManager::runOnModule(Module &M) {
1395 bool Changed = doInitialization(M);
1397 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
1400 return Changed |= doFinalization(M);
1403 bool FPPassManager::doInitialization(Module &M) {
1404 bool Changed = false;
1406 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
1407 Changed |= getContainedPass(Index)->doInitialization(M);
1412 bool FPPassManager::doFinalization(Module &M) {
1413 bool Changed = false;
1415 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index)
1416 Changed |= getContainedPass(Index)->doFinalization(M);
1421 //===----------------------------------------------------------------------===//
1422 // MPPassManager implementation
1424 /// Execute all of the passes scheduled for execution by invoking
1425 /// runOnModule method. Keep track of whether any of the passes modifies
1426 /// the module, and if so, return true.
1428 MPPassManager::runOnModule(Module &M) {
1429 bool Changed = false;
1431 // Initialize on-the-fly passes
1432 for (std::map<Pass *, FunctionPassManagerImpl *>::iterator
1433 I = OnTheFlyManagers.begin(), E = OnTheFlyManagers.end();
1435 FunctionPassManagerImpl *FPP = I->second;
1436 Changed |= FPP->doInitialization(M);
1439 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
1440 ModulePass *MP = getContainedPass(Index);
1442 dumpPassInfo(MP, EXECUTION_MSG, ON_MODULE_MSG,
1443 M.getModuleIdentifier().c_str());
1444 dumpRequiredSet(MP);
1446 initializeAnalysisImpl(MP);
1449 PassManagerPrettyStackEntry X(MP, M);
1450 Timer *T = StartPassTimer(MP);
1451 Changed |= MP->runOnModule(M);
1452 StopPassTimer(MP, T);
1456 dumpPassInfo(MP, MODIFICATION_MSG, ON_MODULE_MSG,
1457 M.getModuleIdentifier().c_str());
1458 dumpPreservedSet(MP);
1460 verifyPreservedAnalysis(MP);
1461 removeNotPreservedAnalysis(MP);
1462 recordAvailableAnalysis(MP);
1463 removeDeadPasses(MP, M.getModuleIdentifier().c_str(), ON_MODULE_MSG);
1466 // Finalize on-the-fly passes
1467 for (std::map<Pass *, FunctionPassManagerImpl *>::iterator
1468 I = OnTheFlyManagers.begin(), E = OnTheFlyManagers.end();
1470 FunctionPassManagerImpl *FPP = I->second;
1471 // We don't know when is the last time an on-the-fly pass is run,
1472 // so we need to releaseMemory / finalize here
1473 FPP->releaseMemoryOnTheFly();
1474 Changed |= FPP->doFinalization(M);
1479 /// Add RequiredPass into list of lower level passes required by pass P.
1480 /// RequiredPass is run on the fly by Pass Manager when P requests it
1481 /// through getAnalysis interface.
1482 void MPPassManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass) {
1483 assert(P->getPotentialPassManagerType() == PMT_ModulePassManager &&
1484 "Unable to handle Pass that requires lower level Analysis pass");
1485 assert((P->getPotentialPassManagerType() <
1486 RequiredPass->getPotentialPassManagerType()) &&
1487 "Unable to handle Pass that requires lower level Analysis pass");
1489 FunctionPassManagerImpl *FPP = OnTheFlyManagers[P];
1491 FPP = new FunctionPassManagerImpl(0);
1492 // FPP is the top level manager.
1493 FPP->setTopLevelManager(FPP);
1495 OnTheFlyManagers[P] = FPP;
1497 FPP->add(RequiredPass);
1499 // Register P as the last user of RequiredPass.
1500 SmallVector<Pass *, 12> LU;
1501 LU.push_back(RequiredPass);
1502 FPP->setLastUser(LU, P);
1505 /// Return function pass corresponding to PassInfo PI, that is
1506 /// required by module pass MP. Instantiate analysis pass, by using
1507 /// its runOnFunction() for function F.
1508 Pass* MPPassManager::getOnTheFlyPass(Pass *MP, const PassInfo *PI, Function &F){
1509 FunctionPassManagerImpl *FPP = OnTheFlyManagers[MP];
1510 assert(FPP && "Unable to find on the fly pass");
1512 FPP->releaseMemoryOnTheFly();
1514 return (dynamic_cast<PMTopLevelManager *>(FPP))->findAnalysisPass(PI);
1518 //===----------------------------------------------------------------------===//
1519 // PassManagerImpl implementation
1521 /// run - Execute all of the passes scheduled for execution. Keep track of
1522 /// whether any of the passes modifies the module, and if so, return true.
1523 bool PassManagerImpl::run(Module &M) {
1524 bool Changed = false;
1525 TimingInfo::createTheTimeInfo();
1530 initializeAllAnalysisInfo();
1531 for (unsigned Index = 0; Index < getNumContainedManagers(); ++Index)
1532 Changed |= getContainedManager(Index)->runOnModule(M);
1536 //===----------------------------------------------------------------------===//
1537 // PassManager implementation
1539 /// Create new pass manager
1540 PassManager::PassManager() {
1541 PM = new PassManagerImpl(0);
1542 // PM is the top level manager
1543 PM->setTopLevelManager(PM);
1546 PassManager::~PassManager() {
1550 /// add - Add a pass to the queue of passes to run. This passes ownership of
1551 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
1552 /// will be destroyed as well, so there is no need to delete the pass. This
1553 /// implies that all passes MUST be allocated with 'new'.
1554 void PassManager::add(Pass *P) {
1558 /// run - Execute all of the passes scheduled for execution. Keep track of
1559 /// whether any of the passes modifies the module, and if so, return true.
1560 bool PassManager::run(Module &M) {
1564 //===----------------------------------------------------------------------===//
1565 // TimingInfo Class - This class is used to calculate information about the
1566 // amount of time each pass takes to execute. This only happens with
1567 // -time-passes is enabled on the command line.
1569 bool llvm::TimePassesIsEnabled = false;
1570 static cl::opt<bool,true>
1571 EnableTiming("time-passes", cl::location(TimePassesIsEnabled),
1572 cl::desc("Time each pass, printing elapsed time for each on exit"));
1574 // createTheTimeInfo - This method either initializes the TheTimeInfo pointer to
1575 // a non null value (if the -time-passes option is enabled) or it leaves it
1576 // null. It may be called multiple times.
1577 void TimingInfo::createTheTimeInfo() {
1578 if (!TimePassesIsEnabled || TheTimeInfo) return;
1580 // Constructed the first time this is called, iff -time-passes is enabled.
1581 // This guarantees that the object will be constructed before static globals,
1582 // thus it will be destroyed before them.
1583 static ManagedStatic<TimingInfo> TTI;
1584 TheTimeInfo = &*TTI;
1587 /// If TimingInfo is enabled then start pass timer.
1588 Timer *llvm::StartPassTimer(Pass *P) {
1590 return TheTimeInfo->passStarted(P);
1594 /// If TimingInfo is enabled then stop pass timer.
1595 void llvm::StopPassTimer(Pass *P, Timer *T) {
1596 if (T) T->stopTimer();
1599 //===----------------------------------------------------------------------===//
1600 // PMStack implementation
1603 // Pop Pass Manager from the stack and clear its analysis info.
1604 void PMStack::pop() {
1606 PMDataManager *Top = this->top();
1607 Top->initializeAnalysisInfo();
1612 // Push PM on the stack and set its top level manager.
1613 void PMStack::push(PMDataManager *PM) {
1614 assert(PM && "Unable to push. Pass Manager expected");
1616 if (!this->empty()) {
1617 PMTopLevelManager *TPM = this->top()->getTopLevelManager();
1619 assert(TPM && "Unable to find top level manager");
1620 TPM->addIndirectPassManager(PM);
1621 PM->setTopLevelManager(TPM);
1627 // Dump content of the pass manager stack.
1628 void PMStack::dump() {
1629 for (std::deque<PMDataManager *>::iterator I = S.begin(),
1630 E = S.end(); I != E; ++I)
1631 printf("%s ", dynamic_cast<Pass *>(*I)->getPassName());
1637 /// Find appropriate Module Pass Manager in the PM Stack and
1638 /// add self into that manager.
1639 void ModulePass::assignPassManager(PMStack &PMS,
1640 PassManagerType PreferredType) {
1641 // Find Module Pass Manager
1642 while(!PMS.empty()) {
1643 PassManagerType TopPMType = PMS.top()->getPassManagerType();
1644 if (TopPMType == PreferredType)
1645 break; // We found desired pass manager
1646 else if (TopPMType > PMT_ModulePassManager)
1647 PMS.pop(); // Pop children pass managers
1651 assert(!PMS.empty() && "Unable to find appropriate Pass Manager");
1652 PMS.top()->add(this);
1655 /// Find appropriate Function Pass Manager or Call Graph Pass Manager
1656 /// in the PM Stack and add self into that manager.
1657 void FunctionPass::assignPassManager(PMStack &PMS,
1658 PassManagerType PreferredType) {
1660 // Find Module Pass Manager
1661 while(!PMS.empty()) {
1662 if (PMS.top()->getPassManagerType() > PMT_FunctionPassManager)
1667 FPPassManager *FPP = dynamic_cast<FPPassManager *>(PMS.top());
1669 // Create new Function Pass Manager
1671 assert(!PMS.empty() && "Unable to create Function Pass Manager");
1672 PMDataManager *PMD = PMS.top();
1674 // [1] Create new Function Pass Manager
1675 FPP = new FPPassManager(PMD->getDepth() + 1);
1676 FPP->populateInheritedAnalysis(PMS);
1678 // [2] Set up new manager's top level manager
1679 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1680 TPM->addIndirectPassManager(FPP);
1682 // [3] Assign manager to manage this new manager. This may create
1683 // and push new managers into PMS
1684 FPP->assignPassManager(PMS, PMD->getPassManagerType());
1686 // [4] Push new manager into PMS
1690 // Assign FPP as the manager of this pass.
1694 /// Find appropriate Basic Pass Manager or Call Graph Pass Manager
1695 /// in the PM Stack and add self into that manager.
1696 void BasicBlockPass::assignPassManager(PMStack &PMS,
1697 PassManagerType PreferredType) {
1698 BBPassManager *BBP = NULL;
1700 // Basic Pass Manager is a leaf pass manager. It does not handle
1701 // any other pass manager.
1703 BBP = dynamic_cast<BBPassManager *>(PMS.top());
1705 // If leaf manager is not Basic Block Pass manager then create new
1706 // basic Block Pass manager.
1709 assert(!PMS.empty() && "Unable to create BasicBlock Pass Manager");
1710 PMDataManager *PMD = PMS.top();
1712 // [1] Create new Basic Block Manager
1713 BBP = new BBPassManager(PMD->getDepth() + 1);
1715 // [2] Set up new manager's top level manager
1716 // Basic Block Pass Manager does not live by itself
1717 PMTopLevelManager *TPM = PMD->getTopLevelManager();
1718 TPM->addIndirectPassManager(BBP);
1720 // [3] Assign manager to manage this new manager. This may create
1721 // and push new managers into PMS
1722 BBP->assignPassManager(PMS);
1724 // [4] Push new manager into PMS
1728 // Assign BBP as the manager of this pass.
1732 PassManagerBase::~PassManagerBase() {}
1734 /*===-- C Bindings --------------------------------------------------------===*/
1736 LLVMPassManagerRef LLVMCreatePassManager() {
1737 return wrap(new PassManager());
1740 LLVMPassManagerRef LLVMCreateFunctionPassManager(LLVMModuleProviderRef P) {
1741 return wrap(new FunctionPassManager(unwrap(P)));
1744 int LLVMRunPassManager(LLVMPassManagerRef PM, LLVMModuleRef M) {
1745 return unwrap<PassManager>(PM)->run(*unwrap(M));
1748 int LLVMInitializeFunctionPassManager(LLVMPassManagerRef FPM) {
1749 return unwrap<FunctionPassManager>(FPM)->doInitialization();
1752 int LLVMRunFunctionPassManager(LLVMPassManagerRef FPM, LLVMValueRef F) {
1753 return unwrap<FunctionPassManager>(FPM)->run(*unwrap<Function>(F));
1756 int LLVMFinalizeFunctionPassManager(LLVMPassManagerRef FPM) {
1757 return unwrap<FunctionPassManager>(FPM)->doFinalization();
1760 void LLVMDisposePassManager(LLVMPassManagerRef PM) {