1 //===- PassManager.cpp - LLVM Pass Infrastructure Implementation ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Devang Patel and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the LLVM Pass Manager infrastructure.
12 //===----------------------------------------------------------------------===//
15 #include "llvm/PassManager.h"
16 #include "llvm/Module.h"
22 /// BasicBlockPassManager_New manages BasicBlockPass. It batches all the
23 /// pass together and sequence them to process one basic block before
24 /// processing next basic block.
25 class BasicBlockPassManager_New : public CommonPassManagerImpl {
28 BasicBlockPassManager_New() { }
30 /// Add a pass into a passmanager queue.
31 bool addPass(Pass *p);
33 /// Execute all of the passes scheduled for execution. Keep track of
34 /// whether any of the passes modifies the function, and if so, return true.
35 bool runOnFunction(Function &F);
38 // Collection of pass that are managed by this manager
39 std::vector<Pass *> PassVector;
42 /// FunctionPassManagerImpl_New manages FunctionPasses and BasicBlockPassManagers.
43 /// It batches all function passes and basic block pass managers together and
44 /// sequence them to process one function at a time before processing next
46 class FunctionPassManagerImpl_New : public CommonPassManagerImpl {
48 FunctionPassManagerImpl_New(ModuleProvider *P) { /* TODO */ }
49 FunctionPassManagerImpl_New() {
50 activeBBPassManager = NULL;
52 ~FunctionPassManagerImpl_New() { /* TODO */ };
54 /// add - Add a pass to the queue of passes to run. This passes
55 /// ownership of the Pass to the PassManager. When the
56 /// PassManager_X is destroyed, the pass will be destroyed as well, so
57 /// there is no need to delete the pass. (TODO delete passes.)
58 /// This implies that all passes MUST be allocated with 'new'.
59 void add(Pass *P) { /* TODO*/ }
61 /// Add pass into the pass manager queue.
62 bool addPass(Pass *P);
64 /// Execute all of the passes scheduled for execution. Keep
65 /// track of whether any of the passes modifies the function, and if
67 bool runOnModule(Module &M);
70 // Collection of pass that are manged by this manager
71 std::vector<Pass *> PassVector;
73 // Active Pass Managers
74 BasicBlockPassManager_New *activeBBPassManager;
77 /// ModulePassManager_New manages ModulePasses and function pass managers.
78 /// It batches all Module passes passes and function pass managers together and
79 /// sequence them to process one module.
80 class ModulePassManager_New : public CommonPassManagerImpl {
83 ModulePassManager_New() { activeFunctionPassManager = NULL; }
85 /// Add a pass into a passmanager queue.
86 bool addPass(Pass *p);
88 /// run - Execute all of the passes scheduled for execution. Keep track of
89 /// whether any of the passes modifies the module, and if so, return true.
90 bool runOnModule(Module &M);
93 // Collection of pass that are managed by this manager
94 std::vector<Pass *> PassVector;
96 // Active Pass Manager
97 FunctionPassManagerImpl_New *activeFunctionPassManager;
100 /// PassManager_New manages ModulePassManagers
101 class PassManagerImpl_New : public CommonPassManagerImpl {
105 /// add - Add a pass to the queue of passes to run. This passes ownership of
106 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
107 /// will be destroyed as well, so there is no need to delete the pass. This
108 /// implies that all passes MUST be allocated with 'new'.
111 /// run - Execute all of the passes scheduled for execution. Keep track of
112 /// whether any of the passes modifies the module, and if so, return true.
117 /// Add a pass into a passmanager queue. This is used by schedulePasses
118 bool addPass(Pass *p);
120 /// Schedule all passes collected in pass queue using add(). Add all the
121 /// schedule passes into various manager's queue using addPass().
122 void schedulePasses();
124 // Collection of pass managers
125 std::vector<ModulePassManager_New *> PassManagers;
127 // Collection of pass that are not yet scheduled
128 std::vector<Pass *> PassVector;
130 // Active Pass Manager
131 ModulePassManager_New *activeManager;
134 } // End of llvm namespace
136 // CommonPassManagerImpl implementation
138 /// Return true IFF pass P's required analysis set does not required new
140 bool CommonPassManagerImpl::manageablePass(Pass *P) {
142 AnalysisUsage AnUsage;
143 P->getAnalysisUsage(AnUsage);
145 // If this pass is not preserving information that is required by the other
146 // passes managed by this manager then use new manager
147 if (!AnUsage.getPreservesAll()) {
148 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
149 for (std::vector<AnalysisID>::iterator I = RequiredAnalysis.begin(),
150 E = RequiredAnalysis.end(); I != E; ++I) {
151 if (std::find(PreservedSet.begin(), PreservedSet.end(), *I) ==
153 // This analysis is not preserved. Need new manager.
160 /// Return true IFF AnalysisID AID is currently available.
161 bool CommonPassManagerImpl::analysisCurrentlyAvailable(AnalysisID AID) {
167 /// Augment RequiredAnalysis by adding analysis required by pass P.
168 void CommonPassManagerImpl::noteDownRequiredAnalysis(Pass *P) {
169 AnalysisUsage AnUsage;
170 P->getAnalysisUsage(AnUsage);
171 const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
173 // FIXME: What about duplicates ?
174 RequiredAnalysis.insert(RequiredAnalysis.end(), RequiredSet.begin(),
178 /// Augement AvailableAnalysis by adding analysis made available by pass P.
179 void CommonPassManagerImpl::noteDownAvailableAnalysis(Pass *P) {
181 if (const PassInfo *PI = P->getPassInfo()) {
182 AvailableAnalysis.insert(PI);
184 //TODO This pass is the current implementation of all of the interfaces it
185 //TODO implements as well.
187 //TODO const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
188 //TODO for (unsigned i = 0, e = II.size(); i != e; ++i)
189 //TODO CurrentAnalyses[II[i]] = P;
193 /// Remove AnalysisID from the RequiredSet
194 void CommonPassManagerImpl::removeAnalysis(AnalysisID AID) {
199 /// Remove Analyss not preserved by Pass P
200 void CommonPassManagerImpl::removeNotPreservedAnalysis(Pass *P) {
201 AnalysisUsage AnUsage;
202 P->getAnalysisUsage(AnUsage);
203 const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
205 for (std::set<AnalysisID>::iterator I = AvailableAnalysis.begin(),
206 E = AvailableAnalysis.end(); I != E; ++I ) {
208 if (std::find(PreservedSet.begin(), PreservedSet.end(), *I) ==
209 PreservedSet.end()) {
210 // Remove this analysis
211 std::set<AnalysisID>::iterator J = I++;
212 AvailableAnalysis.erase(J);
217 /// BasicBlockPassManager implementation
219 /// Add pass P into PassVector and return true. If this pass is not
220 /// manageable by this manager then return false.
222 BasicBlockPassManager_New::addPass(Pass *P) {
224 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
228 // If this pass does not preserve anlysis that is used by other passes
229 // managed by this manager than it is not a suiable pass for this manager.
230 if (!manageablePass(P))
233 // Take a note of analysis required and made available by this pass
234 noteDownRequiredAnalysis(P);
235 noteDownAvailableAnalysis(P);
238 PassVector.push_back(BP);
240 // Remove the analysis not preserved by this pass
241 removeNotPreservedAnalysis(P);
246 /// Execute all of the passes scheduled for execution by invoking
247 /// runOnBasicBlock method. Keep track of whether any of the passes modifies
248 /// the function, and if so, return true.
250 BasicBlockPassManager_New::runOnFunction(Function &F) {
252 bool Changed = false;
253 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
254 for (std::vector<Pass *>::iterator itr = PassVector.begin(),
255 e = PassVector.end(); itr != e; ++itr) {
257 BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
258 Changed |= BP->runOnBasicBlock(*I);
263 // FunctionPassManager_New implementation
264 /// Create new Function pass manager
265 FunctionPassManager_New::FunctionPassManager_New() {
266 FPM = new FunctionPassManagerImpl_New();
269 /// add - Add a pass to the queue of passes to run. This passes
270 /// ownership of the Pass to the PassManager. When the
271 /// PassManager_X is destroyed, the pass will be destroyed as well, so
272 /// there is no need to delete the pass. (TODO delete passes.)
273 /// This implies that all passes MUST be allocated with 'new'.
275 FunctionPassManager_New::add(Pass *P) {
279 /// Execute all of the passes scheduled for execution. Keep
280 /// track of whether any of the passes modifies the function, and if
283 FunctionPassManager_New::runOnModule(Module &M) {
284 return FPM->runOnModule(M);
287 // FunctionPassManagerImpl_New implementation
289 // FunctionPassManager
291 /// Add pass P into the pass manager queue. If P is a BasicBlockPass then
292 /// either use it into active basic block pass manager or create new basic
293 /// block pass manager to handle pass P.
295 FunctionPassManagerImpl_New::addPass(Pass *P) {
297 // If P is a BasicBlockPass then use BasicBlockPassManager_New.
298 if (BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P)) {
300 if (!activeBBPassManager
301 || !activeBBPassManager->addPass(BP)) {
303 activeBBPassManager = new BasicBlockPassManager_New();
305 PassVector.push_back(activeBBPassManager);
306 if (!activeBBPassManager->addPass(BP))
307 assert(0 && "Unable to add Pass");
312 FunctionPass *FP = dynamic_cast<FunctionPass *>(P);
316 // If this pass does not preserve anlysis that is used by other passes
317 // managed by this manager than it is not a suiable pass for this manager.
318 if (!manageablePass(P))
321 // Take a note of analysis required and made available by this pass
322 noteDownRequiredAnalysis(P);
323 noteDownAvailableAnalysis(P);
325 PassVector.push_back(FP);
327 // Remove the analysis not preserved by this pass
328 removeNotPreservedAnalysis(P);
330 activeBBPassManager = NULL;
334 /// Execute all of the passes scheduled for execution by invoking
335 /// runOnFunction method. Keep track of whether any of the passes modifies
336 /// the function, and if so, return true.
338 FunctionPassManagerImpl_New::runOnModule(Module &M) {
340 bool Changed = false;
341 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
342 for (std::vector<Pass *>::iterator itr = PassVector.begin(),
343 e = PassVector.end(); itr != e; ++itr) {
345 FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
346 Changed |= FP->runOnFunction(*I);
352 // ModulePassManager implementation
354 /// Add P into pass vector if it is manageble. If P is a FunctionPass
355 /// then use FunctionPassManagerImpl_New to manage it. Return false if P
356 /// is not manageable by this manager.
358 ModulePassManager_New::addPass(Pass *P) {
360 // If P is FunctionPass then use function pass maanager.
361 if (FunctionPass *FP = dynamic_cast<FunctionPass*>(P)) {
363 activeFunctionPassManager = NULL;
365 if (!activeFunctionPassManager
366 || !activeFunctionPassManager->addPass(P)) {
368 activeFunctionPassManager = new FunctionPassManagerImpl_New();
370 PassVector.push_back(activeFunctionPassManager);
371 if (!activeFunctionPassManager->addPass(FP))
372 assert(0 && "Unable to add pass");
377 ModulePass *MP = dynamic_cast<ModulePass *>(P);
381 // If this pass does not preserve anlysis that is used by other passes
382 // managed by this manager than it is not a suiable pass for this manager.
383 if (!manageablePass(P))
386 // Take a note of analysis required and made available by this pass
387 noteDownRequiredAnalysis(P);
388 noteDownAvailableAnalysis(P);
390 PassVector.push_back(MP);
392 // Remove the analysis not preserved by this pass
393 removeNotPreservedAnalysis(P);
395 activeFunctionPassManager = NULL;
400 /// Execute all of the passes scheduled for execution by invoking
401 /// runOnModule method. Keep track of whether any of the passes modifies
402 /// the module, and if so, return true.
404 ModulePassManager_New::runOnModule(Module &M) {
405 bool Changed = false;
406 for (std::vector<Pass *>::iterator itr = PassVector.begin(),
407 e = PassVector.end(); itr != e; ++itr) {
409 ModulePass *MP = dynamic_cast<ModulePass*>(P);
410 Changed |= MP->runOnModule(M);
415 /// Schedule all passes from the queue by adding them in their
416 /// respective manager's queue.
418 PassManagerImpl_New::schedulePasses() {
422 /// Add pass P to the queue of passes to run.
424 PassManagerImpl_New::add(Pass *P) {
428 // PassManager_New implementation
429 /// Add P into active pass manager or use new module pass manager to
432 PassManagerImpl_New::addPass(Pass *P) {
434 if (!activeManager || !activeManager->addPass(P)) {
435 activeManager = new ModulePassManager_New();
436 PassManagers.push_back(activeManager);
439 return activeManager->addPass(P);
442 /// run - Execute all of the passes scheduled for execution. Keep track of
443 /// whether any of the passes modifies the module, and if so, return true.
445 PassManagerImpl_New::run(Module &M) {
448 bool Changed = false;
449 for (std::vector<ModulePassManager_New *>::iterator itr = PassManagers.begin(),
450 e = PassManagers.end(); itr != e; ++itr) {
451 ModulePassManager_New *pm = *itr;
452 Changed |= pm->runOnModule(M);
457 /// Create new pass manager
458 PassManager_New::PassManager_New() {
459 PM = new PassManagerImpl_New();
462 /// add - Add a pass to the queue of passes to run. This passes ownership of
463 /// the Pass to the PassManager. When the PassManager is destroyed, the pass
464 /// will be destroyed as well, so there is no need to delete the pass. This
465 /// implies that all passes MUST be allocated with 'new'.
467 PassManager_New::add(Pass *P) {
471 /// run - Execute all of the passes scheduled for execution. Keep track of
472 /// whether any of the passes modifies the module, and if so, return true.
474 PassManager_New::run(Module &M) {