2006-11-07 21:31:57 +00:00
|
|
|
//===- PassManager.cpp - LLVM Pass Infrastructure Implementation ----------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2006-11-08 10:05:38 +00:00
|
|
|
// This file was developed by Devang Patel and is distributed under
|
2006-11-07 21:31:57 +00:00
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the LLVM Pass Manager infrastructure.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
|
|
|
|
#include "llvm/PassManager.h"
|
|
|
|
#include "llvm/Module.h"
|
2006-11-15 01:27:05 +00:00
|
|
|
#include "llvm/ModuleProvider.h"
|
2006-11-28 02:09:03 +00:00
|
|
|
#include "llvm/Support/Streams.h"
|
2006-11-11 01:31:05 +00:00
|
|
|
#include <vector>
|
2006-11-14 01:59:59 +00:00
|
|
|
#include <map>
|
2006-11-07 21:31:57 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2006-12-07 18:23:30 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Overview:
|
|
|
|
// The Pass Manager Infrastructure manages passes. It's responsibilities are:
|
|
|
|
//
|
|
|
|
// o Manage optimization pass execution order
|
|
|
|
// o Make required Analysis information available before pass P is run
|
|
|
|
// o Release memory occupied by dead passes
|
|
|
|
// o If Analysis information is dirtied by a pass then regenerate Analysis
|
|
|
|
// information before it is consumed by another pass.
|
|
|
|
//
|
|
|
|
// Pass Manager Infrastructure uses multipe pass managers. They are PassManager,
|
|
|
|
// FunctionPassManager, ModulePassManager, BasicBlockPassManager. This class
|
|
|
|
// hierarcy uses multiple inheritance but pass managers do not derive from
|
|
|
|
// another pass manager.
|
|
|
|
//
|
|
|
|
// PassManager and FunctionPassManager are two top level pass manager that
|
|
|
|
// represents the external interface of this entire pass manager infrastucture.
|
|
|
|
//
|
|
|
|
// Important classes :
|
|
|
|
//
|
|
|
|
// [o] class PMTopLevelManager;
|
|
|
|
//
|
|
|
|
// Two top level managers, PassManager and FunctionPassManager, derive from
|
|
|
|
// PMTopLevelManager. PMTopLevelManager manages information used by top level
|
|
|
|
// managers such as last user info.
|
|
|
|
//
|
|
|
|
// [o] class PMDataManager;
|
|
|
|
//
|
|
|
|
// PMDataManager manages information, e.g. list of available analysis info,
|
|
|
|
// used by a pass manager to manage execution order of passes. It also provides
|
|
|
|
// a place to implement common pass manager APIs. All pass managers derive from
|
|
|
|
// PMDataManager.
|
|
|
|
//
|
|
|
|
// [o] class BasicBlockPassManager : public FunctionPass, public PMDataManager;
|
|
|
|
//
|
|
|
|
// BasicBlockPassManager manages BasicBlockPasses.
|
|
|
|
//
|
|
|
|
// [o] class FunctionPassManager;
|
|
|
|
//
|
|
|
|
// This is a external interface used by JIT to manage FunctionPasses. This
|
|
|
|
// interface relies on FunctionPassManagerImpl to do all the tasks.
|
|
|
|
//
|
|
|
|
// [o] class FunctionPassManagerImpl : public ModulePass, PMDataManager,
|
|
|
|
// public PMTopLevelManager;
|
|
|
|
//
|
|
|
|
// FunctionPassManagerImpl is a top level manager. It manages FunctionPasses
|
|
|
|
// and BasicBlockPassManagers.
|
|
|
|
//
|
|
|
|
// [o] class ModulePassManager : public Pass, public PMDataManager;
|
|
|
|
//
|
|
|
|
// ModulePassManager manages ModulePasses and FunctionPassManagerImpls.
|
|
|
|
//
|
|
|
|
// [o] class PassManager;
|
|
|
|
//
|
|
|
|
// This is a external interface used by various tools to manages passes. It
|
|
|
|
// relies on PassManagerImpl to do all the tasks.
|
|
|
|
//
|
|
|
|
// [o] class PassManagerImpl : public Pass, public PMDataManager,
|
|
|
|
// public PMDTopLevelManager
|
|
|
|
//
|
|
|
|
// PassManagerImpl is a top level pass manager responsible for managing
|
|
|
|
// ModulePassManagers.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2006-12-12 22:35:25 +00:00
|
|
|
class PMDataManager;
|
|
|
|
|
2006-12-07 19:21:29 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PMTopLevelManager
|
|
|
|
//
|
|
|
|
/// PMTopLevelManager manages LastUser info and collects common APIs used by
|
|
|
|
/// top level pass managers.
|
|
|
|
class PMTopLevelManager {
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
inline std::vector<Pass *>::iterator passManagersBegin() {
|
|
|
|
return PassManagers.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline std::vector<Pass *>::iterator passManagersEnd() {
|
|
|
|
return PassManagers.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Schedule pass P for execution. Make sure that passes required by
|
|
|
|
/// P are run before P is run. Update analysis info maintained by
|
|
|
|
/// the manager. Remove dead passes. This is a recursive function.
|
2006-12-08 22:34:02 +00:00
|
|
|
void schedulePass(Pass *P);
|
2006-12-07 19:21:29 +00:00
|
|
|
|
|
|
|
/// This is implemented by top level pass manager and used by
|
|
|
|
/// schedulePass() to add analysis info passes that are not available.
|
|
|
|
virtual void addTopLevelPass(Pass *P) = 0;
|
|
|
|
|
|
|
|
/// Set pass P as the last user of the given analysis passes.
|
|
|
|
void setLastUser(std::vector<Pass *> &AnalysisPasses, Pass *P);
|
|
|
|
|
|
|
|
/// Collect passes whose last user is P
|
|
|
|
void collectLastUses(std::vector<Pass *> &LastUses, Pass *P);
|
|
|
|
|
2006-12-08 22:30:11 +00:00
|
|
|
/// Find the pass that implements Analysis AID. Search immutable
|
|
|
|
/// passes and all pass managers. If desired pass is not found
|
|
|
|
/// then return NULL.
|
|
|
|
Pass *findAnalysisPass(AnalysisID AID);
|
|
|
|
|
2006-12-07 19:21:29 +00:00
|
|
|
virtual ~PMTopLevelManager() {
|
|
|
|
PassManagers.clear();
|
|
|
|
}
|
|
|
|
|
2006-12-07 20:51:18 +00:00
|
|
|
/// Add immutable pass and initialize it.
|
|
|
|
inline void addImmutablePass(ImmutablePass *P) {
|
|
|
|
P->initializePass();
|
|
|
|
ImmutablePasses.push_back(P);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline std::vector<ImmutablePass *>& getImmutablePasses() {
|
|
|
|
return ImmutablePasses;
|
|
|
|
}
|
|
|
|
|
2006-12-08 22:47:25 +00:00
|
|
|
void addPassManager(Pass *Manager) {
|
|
|
|
PassManagers.push_back(Manager);
|
|
|
|
}
|
|
|
|
|
2006-12-08 23:11:43 +00:00
|
|
|
// Add Manager into the list of managers that are not directly
|
|
|
|
// maintained by this top level pass manager
|
2006-12-12 22:35:25 +00:00
|
|
|
inline void addIndirectPassManager(PMDataManager *Manager) {
|
|
|
|
IndirectPassManagers.push_back(Manager);
|
2006-12-08 23:11:43 +00:00
|
|
|
}
|
|
|
|
|
2006-12-07 19:21:29 +00:00
|
|
|
private:
|
|
|
|
|
|
|
|
/// Collection of pass managers
|
|
|
|
std::vector<Pass *> PassManagers;
|
|
|
|
|
2006-12-08 23:11:43 +00:00
|
|
|
/// Collection of pass managers that are not directly maintained
|
|
|
|
/// by this pass manager
|
2006-12-12 22:35:25 +00:00
|
|
|
std::vector<PMDataManager *> IndirectPassManagers;
|
2006-12-08 23:11:43 +00:00
|
|
|
|
2006-12-07 19:21:29 +00:00
|
|
|
// Map to keep track of last user of the analysis pass.
|
|
|
|
// LastUser->second is the last user of Lastuser->first.
|
|
|
|
std::map<Pass *, Pass *> LastUser;
|
2006-12-07 20:51:18 +00:00
|
|
|
|
|
|
|
/// Immutable passes are managed by top level manager.
|
|
|
|
std::vector<ImmutablePass *> ImmutablePasses;
|
2006-12-07 19:21:29 +00:00
|
|
|
};
|
|
|
|
|
2006-12-07 19:54:15 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PMDataManager
|
2006-12-07 19:21:29 +00:00
|
|
|
|
2006-12-07 18:36:24 +00:00
|
|
|
/// PMDataManager provides the common place to manage the analysis data
|
|
|
|
/// used by pass managers.
|
|
|
|
class PMDataManager {
|
2006-11-11 01:31:05 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
2006-12-07 23:24:58 +00:00
|
|
|
PMDataManager(int D) : TPM(NULL), Depth(D) {
|
2006-12-07 19:54:15 +00:00
|
|
|
initializeAnalysisInfo();
|
|
|
|
}
|
|
|
|
|
2006-11-11 01:31:05 +00:00
|
|
|
/// Return true IFF pass P's required analysis set does not required new
|
|
|
|
/// manager.
|
|
|
|
bool manageablePass(Pass *P);
|
|
|
|
|
|
|
|
/// Augment AvailableAnalysis by adding analysis made available by pass P.
|
2006-12-07 19:33:53 +00:00
|
|
|
void recordAvailableAnalysis(Pass *P);
|
2006-11-11 01:31:05 +00:00
|
|
|
|
|
|
|
/// Remove Analysis that is not preserved by the pass
|
|
|
|
void removeNotPreservedAnalysis(Pass *P);
|
|
|
|
|
|
|
|
/// Remove dead passes
|
2006-11-14 03:05:08 +00:00
|
|
|
void removeDeadPasses(Pass *P);
|
2006-11-11 01:31:05 +00:00
|
|
|
|
2006-12-07 18:47:25 +00:00
|
|
|
/// Add pass P into the PassVector. Update
|
2006-11-11 02:04:19 +00:00
|
|
|
/// AvailableAnalysis appropriately if ProcessAnalysis is true.
|
|
|
|
void addPassToManager (Pass *P, bool ProcessAnalysis = true);
|
2006-11-11 01:51:02 +00:00
|
|
|
|
2006-12-07 23:05:44 +00:00
|
|
|
/// Initialize available analysis information.
|
2006-12-07 18:41:09 +00:00
|
|
|
void initializeAnalysisInfo() {
|
2006-12-07 23:55:10 +00:00
|
|
|
ForcedLastUses.clear();
|
2006-11-14 01:23:29 +00:00
|
|
|
AvailableAnalysis.clear();
|
|
|
|
}
|
|
|
|
|
2006-12-07 23:05:44 +00:00
|
|
|
/// Populate RequiredPasses with the analysis pass that are required by
|
|
|
|
/// pass P.
|
|
|
|
void collectRequiredAnalysisPasses(std::vector<Pass *> &RequiredPasses,
|
|
|
|
Pass *P);
|
|
|
|
|
|
|
|
/// All Required analyses should be available to the pass as it runs! Here
|
|
|
|
/// we fill in the AnalysisImpls member of the pass so that it can
|
|
|
|
/// successfully use the getAnalysis() method to retrieve the
|
|
|
|
/// implementations it needs.
|
|
|
|
void initializeAnalysisImpl(Pass *P);
|
2006-11-14 01:59:59 +00:00
|
|
|
|
2006-12-08 22:30:11 +00:00
|
|
|
/// Find the pass that implements Analysis AID. If desired pass is not found
|
|
|
|
/// then return NULL.
|
|
|
|
Pass *findAnalysisPass(AnalysisID AID, bool Direction);
|
|
|
|
|
2006-11-11 01:51:02 +00:00
|
|
|
inline std::vector<Pass *>::iterator passVectorBegin() {
|
|
|
|
return PassVector.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline std::vector<Pass *>::iterator passVectorEnd() {
|
|
|
|
return PassVector.end();
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:54:15 +00:00
|
|
|
// Access toplevel manager
|
|
|
|
PMTopLevelManager *getTopLevelManager() { return TPM; }
|
|
|
|
void setTopLevelManager(PMTopLevelManager *T) { TPM = T; }
|
|
|
|
|
2006-12-07 23:24:58 +00:00
|
|
|
unsigned getDepth() { return Depth; }
|
|
|
|
|
2006-12-07 23:55:10 +00:00
|
|
|
protected:
|
|
|
|
|
|
|
|
// Collection of pass whose last user asked this manager to claim
|
|
|
|
// last use. If a FunctionPass F is the last user of ModulePass info M
|
|
|
|
// then the F's manager, not F, records itself as a last user of M.
|
|
|
|
std::vector<Pass *> ForcedLastUses;
|
|
|
|
|
|
|
|
// Top level manager.
|
|
|
|
PMTopLevelManager *TPM;
|
|
|
|
|
2006-11-11 01:31:05 +00:00
|
|
|
private:
|
2006-11-14 00:03:04 +00:00
|
|
|
// Set of available Analysis. This information is used while scheduling
|
|
|
|
// pass. If a pass requires an analysis which is not not available then
|
|
|
|
// equired analysis pass is scheduled to run before the pass itself is
|
|
|
|
// scheduled to run.
|
2006-11-14 01:59:59 +00:00
|
|
|
std::map<AnalysisID, Pass*> AvailableAnalysis;
|
2006-11-11 01:51:02 +00:00
|
|
|
|
|
|
|
// Collection of pass that are managed by this manager
|
|
|
|
std::vector<Pass *> PassVector;
|
2006-12-07 19:54:15 +00:00
|
|
|
|
2006-12-07 23:24:58 +00:00
|
|
|
unsigned Depth;
|
2006-11-11 01:31:05 +00:00
|
|
|
};
|
|
|
|
|
2006-12-12 22:47:13 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// BasicBlockPassManager_New
|
|
|
|
//
|
2006-11-08 10:05:38 +00:00
|
|
|
/// BasicBlockPassManager_New manages BasicBlockPass. It batches all the
|
|
|
|
/// pass together and sequence them to process one basic block before
|
|
|
|
/// processing next basic block.
|
2006-12-07 18:36:24 +00:00
|
|
|
class BasicBlockPassManager_New : public PMDataManager,
|
2006-11-15 01:11:27 +00:00
|
|
|
public FunctionPass {
|
2006-11-08 10:05:38 +00:00
|
|
|
|
|
|
|
public:
|
2006-12-07 23:24:58 +00:00
|
|
|
BasicBlockPassManager_New(int D) : PMDataManager(D) { }
|
2006-11-08 10:05:38 +00:00
|
|
|
|
|
|
|
/// Add a pass into a passmanager queue.
|
|
|
|
bool addPass(Pass *p);
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution. Keep track of
|
|
|
|
/// whether any of the passes modifies the function, and if so, return true.
|
|
|
|
bool runOnFunction(Function &F);
|
|
|
|
|
2006-12-07 19:57:52 +00:00
|
|
|
/// Pass Manager itself does not invalidate any analysis info.
|
|
|
|
void getAnalysisUsage(AnalysisUsage &Info) const {
|
|
|
|
Info.setPreservesAll();
|
|
|
|
}
|
|
|
|
|
2006-12-08 00:59:05 +00:00
|
|
|
bool doInitialization(Module &M);
|
|
|
|
bool doInitialization(Function &F);
|
|
|
|
bool doFinalization(Module &M);
|
|
|
|
bool doFinalization(Function &F);
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
};
|
|
|
|
|
2006-12-12 22:47:13 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// FunctionPassManagerImpl_New
|
|
|
|
//
|
2006-11-08 10:44:40 +00:00
|
|
|
/// FunctionPassManagerImpl_New manages FunctionPasses and BasicBlockPassManagers.
|
2006-11-08 10:05:38 +00:00
|
|
|
/// It batches all function passes and basic block pass managers together and
|
|
|
|
/// sequence them to process one function at a time before processing next
|
|
|
|
/// function.
|
2006-12-07 21:27:23 +00:00
|
|
|
class FunctionPassManagerImpl_New : public ModulePass,
|
|
|
|
public PMDataManager,
|
|
|
|
public PMTopLevelManager {
|
2006-11-08 10:05:38 +00:00
|
|
|
public:
|
2006-12-07 23:24:58 +00:00
|
|
|
FunctionPassManagerImpl_New(int D) : PMDataManager(D) {
|
2006-11-08 10:05:38 +00:00
|
|
|
activeBBPassManager = NULL;
|
|
|
|
}
|
2006-11-08 10:44:40 +00:00
|
|
|
~FunctionPassManagerImpl_New() { /* TODO */ };
|
2006-11-08 10:05:38 +00:00
|
|
|
|
2006-12-07 21:27:23 +00:00
|
|
|
inline void addTopLevelPass(Pass *P) {
|
2006-12-08 23:53:00 +00:00
|
|
|
|
2006-12-08 23:57:43 +00:00
|
|
|
if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
|
2006-12-08 23:53:00 +00:00
|
|
|
|
|
|
|
// P is a immutable pass then it will be managed by this
|
|
|
|
// top level manager. Set up analysis resolver to connect them.
|
|
|
|
AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
|
|
|
|
P->setResolver(AR);
|
2006-12-12 22:21:37 +00:00
|
|
|
initializeAnalysisImpl(P);
|
2006-12-08 23:57:43 +00:00
|
|
|
addImmutablePass(IP);
|
2006-12-12 22:21:37 +00:00
|
|
|
recordAvailableAnalysis(IP);
|
2006-12-08 23:57:43 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
addPass(P);
|
2006-12-07 21:27:23 +00:00
|
|
|
}
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
/// add - Add a pass to the queue of passes to run. This passes
|
|
|
|
/// ownership of the Pass to the PassManager. When the
|
|
|
|
/// PassManager_X is destroyed, the pass will be destroyed as well, so
|
|
|
|
/// there is no need to delete the pass. (TODO delete passes.)
|
|
|
|
/// This implies that all passes MUST be allocated with 'new'.
|
2006-12-07 21:32:57 +00:00
|
|
|
void add(Pass *P) {
|
2006-12-08 22:34:02 +00:00
|
|
|
schedulePass(P);
|
2006-12-07 21:32:57 +00:00
|
|
|
}
|
2006-11-08 10:05:38 +00:00
|
|
|
|
|
|
|
/// Add pass into the pass manager queue.
|
|
|
|
bool addPass(Pass *P);
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution. Keep
|
|
|
|
/// track of whether any of the passes modifies the function, and if
|
|
|
|
/// so, return true.
|
|
|
|
bool runOnModule(Module &M);
|
2006-11-15 19:39:54 +00:00
|
|
|
bool runOnFunction(Function &F);
|
2006-12-08 22:57:48 +00:00
|
|
|
bool run(Function &F);
|
2006-11-08 10:05:38 +00:00
|
|
|
|
2006-11-15 01:27:05 +00:00
|
|
|
/// doInitialization - Run all of the initializers for the function passes.
|
|
|
|
///
|
|
|
|
bool doInitialization(Module &M);
|
|
|
|
|
|
|
|
/// doFinalization - Run all of the initializers for the function passes.
|
|
|
|
///
|
|
|
|
bool doFinalization(Module &M);
|
2006-12-07 19:57:52 +00:00
|
|
|
|
|
|
|
/// Pass Manager itself does not invalidate any analysis info.
|
|
|
|
void getAnalysisUsage(AnalysisUsage &Info) const {
|
|
|
|
Info.setPreservesAll();
|
|
|
|
}
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
private:
|
|
|
|
// Active Pass Managers
|
|
|
|
BasicBlockPassManager_New *activeBBPassManager;
|
|
|
|
};
|
|
|
|
|
2006-12-12 22:47:13 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ModulePassManager_New
|
|
|
|
//
|
2006-11-08 10:05:38 +00:00
|
|
|
/// ModulePassManager_New manages ModulePasses and function pass managers.
|
|
|
|
/// It batches all Module passes passes and function pass managers together and
|
|
|
|
/// sequence them to process one module.
|
2006-12-07 23:55:10 +00:00
|
|
|
class ModulePassManager_New : public Pass,
|
|
|
|
public PMDataManager {
|
2006-11-08 10:05:38 +00:00
|
|
|
|
|
|
|
public:
|
2006-12-07 23:24:58 +00:00
|
|
|
ModulePassManager_New(int D) : PMDataManager(D) {
|
|
|
|
activeFunctionPassManager = NULL;
|
|
|
|
}
|
2006-11-08 10:05:38 +00:00
|
|
|
|
|
|
|
/// Add a pass into a passmanager queue.
|
|
|
|
bool addPass(Pass *p);
|
|
|
|
|
|
|
|
/// run - Execute all of the passes scheduled for execution. Keep track of
|
|
|
|
/// whether any of the passes modifies the module, and if so, return true.
|
|
|
|
bool runOnModule(Module &M);
|
2006-11-13 22:40:09 +00:00
|
|
|
|
2006-12-07 19:57:52 +00:00
|
|
|
/// Pass Manager itself does not invalidate any analysis info.
|
|
|
|
void getAnalysisUsage(AnalysisUsage &Info) const {
|
|
|
|
Info.setPreservesAll();
|
|
|
|
}
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
private:
|
|
|
|
// Active Pass Manager
|
2006-11-08 10:44:40 +00:00
|
|
|
FunctionPassManagerImpl_New *activeFunctionPassManager;
|
2006-11-08 10:05:38 +00:00
|
|
|
};
|
|
|
|
|
2006-12-12 22:47:13 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PassManagerImpl_New
|
|
|
|
//
|
|
|
|
/// PassManagerImpl_New manages ModulePassManagers
|
2006-12-07 21:32:57 +00:00
|
|
|
class PassManagerImpl_New : public Pass,
|
|
|
|
public PMDataManager,
|
2006-12-07 21:27:23 +00:00
|
|
|
public PMTopLevelManager {
|
2006-11-08 10:29:57 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
2006-12-12 22:57:43 +00:00
|
|
|
PassManagerImpl_New(int D) : PMDataManager(D) {
|
|
|
|
activeManager = NULL;
|
|
|
|
}
|
2006-12-07 23:24:58 +00:00
|
|
|
|
2006-11-08 10:29:57 +00:00
|
|
|
/// add - Add a pass to the queue of passes to run. This passes ownership of
|
|
|
|
/// the Pass to the PassManager. When the PassManager is destroyed, the pass
|
|
|
|
/// will be destroyed as well, so there is no need to delete the pass. This
|
|
|
|
/// implies that all passes MUST be allocated with 'new'.
|
2006-12-07 21:32:57 +00:00
|
|
|
void add(Pass *P) {
|
2006-12-08 22:34:02 +00:00
|
|
|
schedulePass(P);
|
2006-12-07 21:32:57 +00:00
|
|
|
}
|
2006-11-08 10:29:57 +00:00
|
|
|
|
|
|
|
/// run - Execute all of the passes scheduled for execution. Keep track of
|
|
|
|
/// whether any of the passes modifies the module, and if so, return true.
|
|
|
|
bool run(Module &M);
|
|
|
|
|
2006-12-07 19:57:52 +00:00
|
|
|
/// Pass Manager itself does not invalidate any analysis info.
|
|
|
|
void getAnalysisUsage(AnalysisUsage &Info) const {
|
|
|
|
Info.setPreservesAll();
|
|
|
|
}
|
|
|
|
|
2006-12-07 21:27:23 +00:00
|
|
|
inline void addTopLevelPass(Pass *P) {
|
2006-12-08 23:53:00 +00:00
|
|
|
|
2006-12-08 23:57:43 +00:00
|
|
|
if (ImmutablePass *IP = dynamic_cast<ImmutablePass *> (P)) {
|
2006-12-08 23:53:00 +00:00
|
|
|
|
|
|
|
// P is a immutable pass and it will be managed by this
|
|
|
|
// top level manager. Set up analysis resolver to connect them.
|
|
|
|
AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
|
|
|
|
P->setResolver(AR);
|
2006-12-12 22:21:37 +00:00
|
|
|
initializeAnalysisImpl(P);
|
2006-12-08 23:57:43 +00:00
|
|
|
addImmutablePass(IP);
|
2006-12-12 22:21:37 +00:00
|
|
|
recordAvailableAnalysis(IP);
|
2006-12-08 23:53:00 +00:00
|
|
|
}
|
2006-12-08 23:57:43 +00:00
|
|
|
else
|
|
|
|
addPass(P);
|
2006-12-07 21:27:23 +00:00
|
|
|
}
|
|
|
|
|
2006-11-08 10:29:57 +00:00
|
|
|
private:
|
|
|
|
|
2006-12-07 21:10:57 +00:00
|
|
|
/// Add a pass into a passmanager queue.
|
2006-11-08 10:29:57 +00:00
|
|
|
bool addPass(Pass *p);
|
|
|
|
|
|
|
|
// Active Pass Manager
|
|
|
|
ModulePassManager_New *activeManager;
|
|
|
|
};
|
|
|
|
|
2006-11-08 10:05:38 +00:00
|
|
|
} // End of llvm namespace
|
|
|
|
|
2006-12-12 22:35:25 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PMTopLevelManager implementation
|
|
|
|
|
|
|
|
/// Set pass P as the last user of the given analysis passes.
|
|
|
|
void PMTopLevelManager::setLastUser(std::vector<Pass *> &AnalysisPasses,
|
|
|
|
Pass *P) {
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator I = AnalysisPasses.begin(),
|
|
|
|
E = AnalysisPasses.end(); I != E; ++I) {
|
|
|
|
Pass *AP = *I;
|
|
|
|
LastUser[AP] = P;
|
|
|
|
// If AP is the last user of other passes then make P last user of
|
|
|
|
// such passes.
|
|
|
|
for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
|
|
|
|
LUE = LastUser.end(); LUI != LUE; ++LUI) {
|
|
|
|
if (LUI->second == AP)
|
|
|
|
LastUser[LUI->first] = P;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Collect passes whose last user is P
|
|
|
|
void PMTopLevelManager::collectLastUses(std::vector<Pass *> &LastUses,
|
|
|
|
Pass *P) {
|
|
|
|
for (std::map<Pass *, Pass *>::iterator LUI = LastUser.begin(),
|
|
|
|
LUE = LastUser.end(); LUI != LUE; ++LUI)
|
|
|
|
if (LUI->second == P)
|
|
|
|
LastUses.push_back(LUI->first);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Schedule pass P for execution. Make sure that passes required by
|
|
|
|
/// P are run before P is run. Update analysis info maintained by
|
|
|
|
/// the manager. Remove dead passes. This is a recursive function.
|
|
|
|
void PMTopLevelManager::schedulePass(Pass *P) {
|
|
|
|
|
|
|
|
// TODO : Allocate function manager for this pass, other wise required set
|
|
|
|
// may be inserted into previous function manager
|
|
|
|
|
|
|
|
AnalysisUsage AnUsage;
|
|
|
|
P->getAnalysisUsage(AnUsage);
|
|
|
|
const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
|
|
|
|
for (std::vector<AnalysisID>::const_iterator I = RequiredSet.begin(),
|
|
|
|
E = RequiredSet.end(); I != E; ++I) {
|
|
|
|
|
|
|
|
Pass *AnalysisPass = findAnalysisPass(*I);
|
|
|
|
if (!AnalysisPass) {
|
|
|
|
// Schedule this analysis run first.
|
|
|
|
AnalysisPass = (*I)->createPass();
|
|
|
|
schedulePass(AnalysisPass);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now all required passes are available.
|
|
|
|
addTopLevelPass(P);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Find the pass that implements Analysis AID. Search immutable
|
|
|
|
/// passes and all pass managers. If desired pass is not found
|
|
|
|
/// then return NULL.
|
|
|
|
Pass *PMTopLevelManager::findAnalysisPass(AnalysisID AID) {
|
|
|
|
|
|
|
|
Pass *P = NULL;
|
2006-12-12 22:50:05 +00:00
|
|
|
// Check pass managers
|
|
|
|
for (std::vector<Pass *>::iterator I = PassManagers.begin(),
|
|
|
|
E = PassManagers.end(); P == NULL && I != E; ++I) {
|
|
|
|
PMDataManager *PMD = dynamic_cast<PMDataManager *>(*I);
|
|
|
|
assert(PMD && "This is not a PassManager");
|
|
|
|
P = PMD->findAnalysisPass(AID, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check other pass managers
|
|
|
|
for (std::vector<PMDataManager *>::iterator I = IndirectPassManagers.begin(),
|
|
|
|
E = IndirectPassManagers.end(); P == NULL && I != E; ++I)
|
|
|
|
P = (*I)->findAnalysisPass(AID, false);
|
|
|
|
|
2006-12-12 22:35:25 +00:00
|
|
|
for (std::vector<ImmutablePass *>::iterator I = ImmutablePasses.begin(),
|
|
|
|
E = ImmutablePasses.end(); P == NULL && I != E; ++I) {
|
|
|
|
const PassInfo *PI = (*I)->getPassInfo();
|
|
|
|
if (PI == AID)
|
|
|
|
P = *I;
|
|
|
|
|
|
|
|
// If Pass not found then check the interfaces implemented by Immutable Pass
|
|
|
|
if (!P) {
|
|
|
|
const std::vector<const PassInfo*> &ImmPI =
|
|
|
|
PI->getInterfacesImplemented();
|
|
|
|
for (unsigned Index = 0, End = ImmPI.size();
|
|
|
|
P == NULL && Index != End; ++Index)
|
|
|
|
if (ImmPI[Index] == AID)
|
|
|
|
P = *I;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return P;
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-12-07 18:36:24 +00:00
|
|
|
// PMDataManager implementation
|
2006-11-07 22:35:17 +00:00
|
|
|
|
2006-11-08 01:31:28 +00:00
|
|
|
/// Return true IFF pass P's required analysis set does not required new
|
2006-11-07 22:35:17 +00:00
|
|
|
/// manager.
|
2006-12-07 18:36:24 +00:00
|
|
|
bool PMDataManager::manageablePass(Pass *P) {
|
2006-11-07 22:35:17 +00:00
|
|
|
|
2006-12-07 18:47:25 +00:00
|
|
|
// TODO
|
|
|
|
// If this pass is not preserving information that is required by a
|
|
|
|
// pass maintained by higher level pass manager then do not insert
|
|
|
|
// this pass into current manager. Use new manager. For example,
|
|
|
|
// For example, If FunctionPass F is not preserving ModulePass Info M1
|
|
|
|
// that is used by another ModulePass M2 then do not insert F in
|
|
|
|
// current function pass manager.
|
2006-11-07 22:35:17 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2006-11-11 01:10:19 +00:00
|
|
|
/// Augement AvailableAnalysis by adding analysis made available by pass P.
|
2006-12-07 19:33:53 +00:00
|
|
|
void PMDataManager::recordAvailableAnalysis(Pass *P) {
|
2006-11-14 01:59:59 +00:00
|
|
|
|
2006-11-11 01:10:19 +00:00
|
|
|
if (const PassInfo *PI = P->getPassInfo()) {
|
2006-11-14 01:59:59 +00:00
|
|
|
AvailableAnalysis[PI] = P;
|
2006-11-11 01:10:19 +00:00
|
|
|
|
2006-12-07 19:33:53 +00:00
|
|
|
//This pass is the current implementation of all of the interfaces it
|
|
|
|
//implements as well.
|
|
|
|
const std::vector<const PassInfo*> &II = PI->getInterfacesImplemented();
|
|
|
|
for (unsigned i = 0, e = II.size(); i != e; ++i)
|
|
|
|
AvailableAnalysis[II[i]] = P;
|
2006-11-11 01:10:19 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-11-07 22:35:17 +00:00
|
|
|
/// Remove Analyss not preserved by Pass P
|
2006-12-07 18:36:24 +00:00
|
|
|
void PMDataManager::removeNotPreservedAnalysis(Pass *P) {
|
2006-11-11 01:24:55 +00:00
|
|
|
AnalysisUsage AnUsage;
|
|
|
|
P->getAnalysisUsage(AnUsage);
|
|
|
|
|
2006-12-07 20:03:49 +00:00
|
|
|
if (AnUsage.getPreservesAll())
|
|
|
|
return;
|
|
|
|
|
|
|
|
const std::vector<AnalysisID> &PreservedSet = AnUsage.getPreservedSet();
|
2006-11-14 01:59:59 +00:00
|
|
|
for (std::map<AnalysisID, Pass*>::iterator I = AvailableAnalysis.begin(),
|
2006-12-12 23:07:44 +00:00
|
|
|
E = AvailableAnalysis.end(); I != E; ) {
|
2006-11-14 01:59:59 +00:00
|
|
|
if (std::find(PreservedSet.begin(), PreservedSet.end(), I->first) ==
|
2006-11-11 01:24:55 +00:00
|
|
|
PreservedSet.end()) {
|
|
|
|
// Remove this analysis
|
2006-12-12 23:07:44 +00:00
|
|
|
if (!dynamic_cast<ImmutablePass*>(I->second)) {
|
|
|
|
std::map<AnalysisID, Pass*>::iterator J = I++;
|
|
|
|
AvailableAnalysis.erase(J);
|
|
|
|
} else
|
|
|
|
++I;
|
|
|
|
} else
|
|
|
|
++I;
|
2006-11-11 01:24:55 +00:00
|
|
|
}
|
2006-11-07 22:35:17 +00:00
|
|
|
}
|
|
|
|
|
2006-11-14 03:05:08 +00:00
|
|
|
/// Remove analysis passes that are not used any longer
|
2006-12-07 18:36:24 +00:00
|
|
|
void PMDataManager::removeDeadPasses(Pass *P) {
|
2006-12-08 00:37:52 +00:00
|
|
|
|
|
|
|
std::vector<Pass *> DeadPasses;
|
|
|
|
TPM->collectLastUses(DeadPasses, P);
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator I = DeadPasses.begin(),
|
|
|
|
E = DeadPasses.end(); I != E; ++I) {
|
|
|
|
(*I)->releaseMemory();
|
|
|
|
|
|
|
|
std::map<AnalysisID, Pass*>::iterator Pos =
|
|
|
|
AvailableAnalysis.find((*I)->getPassInfo());
|
|
|
|
|
2006-12-08 00:59:05 +00:00
|
|
|
// It is possible that pass is already removed from the AvailableAnalysis
|
2006-12-08 00:37:52 +00:00
|
|
|
if (Pos != AvailableAnalysis.end())
|
|
|
|
AvailableAnalysis.erase(Pos);
|
|
|
|
}
|
2006-11-14 03:05:08 +00:00
|
|
|
}
|
|
|
|
|
2006-12-07 18:47:25 +00:00
|
|
|
/// Add pass P into the PassVector. Update
|
2006-11-11 02:04:19 +00:00
|
|
|
/// AvailableAnalysis appropriately if ProcessAnalysis is true.
|
2006-12-07 20:03:49 +00:00
|
|
|
void PMDataManager::addPassToManager(Pass *P,
|
|
|
|
bool ProcessAnalysis) {
|
2006-11-11 01:51:02 +00:00
|
|
|
|
2006-12-08 23:53:00 +00:00
|
|
|
// This manager is going to manage pass P. Set up analysis resolver
|
|
|
|
// to connect them.
|
|
|
|
AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
|
|
|
|
P->setResolver(AR);
|
|
|
|
|
2006-11-11 02:04:19 +00:00
|
|
|
if (ProcessAnalysis) {
|
2006-12-07 23:55:10 +00:00
|
|
|
|
|
|
|
// At the moment, this pass is the last user of all required passes.
|
|
|
|
std::vector<Pass *> LastUses;
|
|
|
|
std::vector<Pass *> RequiredPasses;
|
|
|
|
unsigned PDepth = this->getDepth();
|
|
|
|
|
|
|
|
collectRequiredAnalysisPasses(RequiredPasses, P);
|
|
|
|
for (std::vector<Pass *>::iterator I = RequiredPasses.begin(),
|
|
|
|
E = RequiredPasses.end(); I != E; ++I) {
|
|
|
|
Pass *PRequired = *I;
|
|
|
|
unsigned RDepth = 0;
|
2006-12-09 00:07:38 +00:00
|
|
|
|
|
|
|
PMDataManager &DM = PRequired->getResolver()->getPMDataManager();
|
|
|
|
RDepth = DM.getDepth();
|
|
|
|
|
2006-12-07 23:55:10 +00:00
|
|
|
if (PDepth == RDepth)
|
|
|
|
LastUses.push_back(PRequired);
|
|
|
|
else if (PDepth > RDepth) {
|
|
|
|
// Let the parent claim responsibility of last use
|
|
|
|
ForcedLastUses.push_back(PRequired);
|
|
|
|
} else {
|
|
|
|
// Note : This feature is not yet implemented
|
|
|
|
assert (0 &&
|
|
|
|
"Unable to handle Pass that requires lower level Analysis pass");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!LastUses.empty())
|
|
|
|
TPM->setLastUser(LastUses, P);
|
|
|
|
|
2006-12-07 22:09:36 +00:00
|
|
|
// Take a note of analysis required and made available by this pass.
|
2006-11-11 02:04:19 +00:00
|
|
|
// Remove the analysis not preserved by this pass
|
|
|
|
removeNotPreservedAnalysis(P);
|
2006-12-07 22:09:36 +00:00
|
|
|
recordAvailableAnalysis(P);
|
2006-11-11 02:04:19 +00:00
|
|
|
}
|
2006-11-11 01:51:02 +00:00
|
|
|
|
|
|
|
// Add pass
|
|
|
|
PassVector.push_back(P);
|
|
|
|
}
|
|
|
|
|
2006-12-07 23:05:44 +00:00
|
|
|
/// Populate RequiredPasses with the analysis pass that are required by
|
|
|
|
/// pass P.
|
|
|
|
void PMDataManager::collectRequiredAnalysisPasses(std::vector<Pass *> &RP,
|
|
|
|
Pass *P) {
|
|
|
|
AnalysisUsage AnUsage;
|
|
|
|
P->getAnalysisUsage(AnUsage);
|
|
|
|
const std::vector<AnalysisID> &RequiredSet = AnUsage.getRequiredSet();
|
|
|
|
for (std::vector<AnalysisID>::const_iterator
|
|
|
|
I = RequiredSet.begin(), E = RequiredSet.end();
|
|
|
|
I != E; ++I) {
|
2006-12-08 22:30:11 +00:00
|
|
|
Pass *AnalysisPass = findAnalysisPass(*I, true);
|
2006-12-07 23:05:44 +00:00
|
|
|
assert (AnalysisPass && "Analysis pass is not available");
|
|
|
|
RP.push_back(AnalysisPass);
|
|
|
|
}
|
2006-12-12 23:09:32 +00:00
|
|
|
|
|
|
|
const std::vector<AnalysisID> &IDs = AnUsage.getRequiredTransitiveSet();
|
|
|
|
for (std::vector<AnalysisID>::const_iterator I = IDs.begin(),
|
|
|
|
E = IDs.end(); I != E; ++I) {
|
|
|
|
Pass *AnalysisPass = findAnalysisPass(*I, true);
|
|
|
|
assert (AnalysisPass && "Analysis pass is not available");
|
|
|
|
RP.push_back(AnalysisPass);
|
|
|
|
}
|
2006-12-07 23:05:44 +00:00
|
|
|
}
|
|
|
|
|
2006-11-14 21:49:36 +00:00
|
|
|
// All Required analyses should be available to the pass as it runs! Here
|
|
|
|
// we fill in the AnalysisImpls member of the pass so that it can
|
|
|
|
// successfully use the getAnalysis() method to retrieve the
|
|
|
|
// implementations it needs.
|
|
|
|
//
|
2006-12-07 18:36:24 +00:00
|
|
|
void PMDataManager::initializeAnalysisImpl(Pass *P) {
|
2006-11-15 01:27:05 +00:00
|
|
|
AnalysisUsage AnUsage;
|
|
|
|
P->getAnalysisUsage(AnUsage);
|
2006-11-14 21:49:36 +00:00
|
|
|
|
|
|
|
for (std::vector<const PassInfo *>::const_iterator
|
|
|
|
I = AnUsage.getRequiredSet().begin(),
|
|
|
|
E = AnUsage.getRequiredSet().end(); I != E; ++I) {
|
2006-12-08 22:30:11 +00:00
|
|
|
Pass *Impl = findAnalysisPass(*I, true);
|
2006-11-14 21:49:36 +00:00
|
|
|
if (Impl == 0)
|
|
|
|
assert(0 && "Analysis used but not available!");
|
2006-12-09 01:11:34 +00:00
|
|
|
AnalysisResolver_New *AR = P->getResolver();
|
|
|
|
AR->addAnalysisImplsPair(*I, Impl);
|
2006-11-14 21:49:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-08 22:30:11 +00:00
|
|
|
/// Find the pass that implements Analysis AID. If desired pass is not found
|
|
|
|
/// then return NULL.
|
|
|
|
Pass *PMDataManager::findAnalysisPass(AnalysisID AID, bool SearchParent) {
|
|
|
|
|
|
|
|
// Check if AvailableAnalysis map has one entry.
|
|
|
|
std::map<AnalysisID, Pass*>::const_iterator I = AvailableAnalysis.find(AID);
|
|
|
|
|
|
|
|
if (I != AvailableAnalysis.end())
|
|
|
|
return I->second;
|
|
|
|
|
|
|
|
// Search Parents through TopLevelManager
|
|
|
|
if (SearchParent)
|
|
|
|
return TPM->findAnalysisPass(AID);
|
|
|
|
|
2006-12-09 00:09:12 +00:00
|
|
|
return NULL;
|
2006-12-08 22:30:11 +00:00
|
|
|
}
|
|
|
|
|
2006-12-08 23:28:54 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// NOTE: Is this the right place to define this method ?
|
|
|
|
// getAnalysisToUpdate - Return an analysis result or null if it doesn't exist
|
|
|
|
Pass *AnalysisResolver_New::getAnalysisToUpdate(AnalysisID ID, bool dir) const {
|
|
|
|
return PM.findAnalysisPass(ID, dir);
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// BasicBlockPassManager_New implementation
|
2006-11-07 21:31:57 +00:00
|
|
|
|
2006-11-08 01:31:28 +00:00
|
|
|
/// Add pass P into PassVector and return true. If this pass is not
|
|
|
|
/// manageable by this manager then return false.
|
2006-11-07 21:31:57 +00:00
|
|
|
bool
|
2006-11-08 01:31:28 +00:00
|
|
|
BasicBlockPassManager_New::addPass(Pass *P) {
|
2006-11-07 21:31:57 +00:00
|
|
|
|
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
if (!BP)
|
|
|
|
return false;
|
|
|
|
|
2006-11-07 22:56:50 +00:00
|
|
|
// If this pass does not preserve anlysis that is used by other passes
|
|
|
|
// managed by this manager than it is not a suiable pass for this manager.
|
2006-11-08 01:31:28 +00:00
|
|
|
if (!manageablePass(P))
|
2006-11-07 22:56:50 +00:00
|
|
|
return false;
|
|
|
|
|
2006-11-11 01:51:02 +00:00
|
|
|
addPassToManager (BP);
|
2006-11-11 01:24:55 +00:00
|
|
|
|
2006-11-07 21:31:57 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution by invoking
|
|
|
|
/// runOnBasicBlock method. Keep track of whether any of the passes modifies
|
|
|
|
/// the function, and if so, return true.
|
|
|
|
bool
|
|
|
|
BasicBlockPassManager_New::runOnFunction(Function &F) {
|
|
|
|
|
2006-12-12 23:15:28 +00:00
|
|
|
if (F.isExternal())
|
|
|
|
return false;
|
|
|
|
|
2006-12-08 01:38:28 +00:00
|
|
|
bool Changed = doInitialization(F);
|
2006-12-07 18:41:09 +00:00
|
|
|
initializeAnalysisInfo();
|
2006-11-14 01:23:29 +00:00
|
|
|
|
2006-11-07 21:31:57 +00:00
|
|
|
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
|
2006-11-11 01:51:02 +00:00
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
2006-11-07 21:31:57 +00:00
|
|
|
Pass *P = *itr;
|
2006-12-12 23:13:09 +00:00
|
|
|
initializeAnalysisImpl(P);
|
2006-11-07 21:31:57 +00:00
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
Changed |= BP->runOnBasicBlock(*I);
|
2006-11-14 01:23:29 +00:00
|
|
|
removeNotPreservedAnalysis(P);
|
2006-12-07 22:09:36 +00:00
|
|
|
recordAvailableAnalysis(P);
|
2006-11-14 03:05:08 +00:00
|
|
|
removeDeadPasses(P);
|
2006-11-07 21:31:57 +00:00
|
|
|
}
|
2006-12-08 01:38:28 +00:00
|
|
|
return Changed | doFinalization(F);
|
2006-11-07 21:31:57 +00:00
|
|
|
}
|
|
|
|
|
2006-12-08 00:59:05 +00:00
|
|
|
// Implement doInitialization and doFinalization
|
|
|
|
inline bool BasicBlockPassManager_New::doInitialization(Module &M) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
Changed |= BP->doInitialization(M);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool BasicBlockPassManager_New::doFinalization(Module &M) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
Changed |= BP->doFinalization(M);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool BasicBlockPassManager_New::doInitialization(Function &F) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
Changed |= BP->doInitialization(F);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool BasicBlockPassManager_New::doFinalization(Function &F) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P);
|
|
|
|
Changed |= BP->doFinalization(F);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-11-07 21:49:50 +00:00
|
|
|
// FunctionPassManager_New implementation
|
2006-12-07 19:39:39 +00:00
|
|
|
|
2006-11-08 10:44:40 +00:00
|
|
|
/// Create new Function pass manager
|
|
|
|
FunctionPassManager_New::FunctionPassManager_New() {
|
2006-12-07 23:24:58 +00:00
|
|
|
FPM = new FunctionPassManagerImpl_New(0);
|
2006-11-08 10:44:40 +00:00
|
|
|
}
|
|
|
|
|
2006-12-08 18:57:16 +00:00
|
|
|
FunctionPassManager_New::FunctionPassManager_New(ModuleProvider *P) {
|
|
|
|
FPM = new FunctionPassManagerImpl_New(0);
|
2006-12-12 22:02:16 +00:00
|
|
|
// FPM is the top level manager.
|
|
|
|
FPM->setTopLevelManager(FPM);
|
2006-12-12 23:27:37 +00:00
|
|
|
|
|
|
|
PMDataManager *PMD = dynamic_cast<PMDataManager *>(FPM);
|
|
|
|
AnalysisResolver_New *AR = new AnalysisResolver_New(*PMD);
|
|
|
|
FPM->setResolver(AR);
|
|
|
|
|
|
|
|
FPM->addPassManager(FPM);
|
2006-12-08 18:57:16 +00:00
|
|
|
MP = P;
|
|
|
|
}
|
|
|
|
|
2006-11-08 10:44:40 +00:00
|
|
|
/// add - Add a pass to the queue of passes to run. This passes
|
|
|
|
/// ownership of the Pass to the PassManager. When the
|
|
|
|
/// PassManager_X is destroyed, the pass will be destroyed as well, so
|
|
|
|
/// there is no need to delete the pass. (TODO delete passes.)
|
|
|
|
/// This implies that all passes MUST be allocated with 'new'.
|
2006-11-15 19:39:54 +00:00
|
|
|
void FunctionPassManager_New::add(Pass *P) {
|
2006-11-08 10:44:40 +00:00
|
|
|
FPM->add(P);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution. Keep
|
|
|
|
/// track of whether any of the passes modifies the function, and if
|
|
|
|
/// so, return true.
|
2006-11-15 19:39:54 +00:00
|
|
|
bool FunctionPassManager_New::runOnModule(Module &M) {
|
2006-11-08 10:44:40 +00:00
|
|
|
return FPM->runOnModule(M);
|
|
|
|
}
|
|
|
|
|
2006-11-15 19:39:54 +00:00
|
|
|
/// run - Execute all of the passes scheduled for execution. Keep
|
|
|
|
/// track of whether any of the passes modifies the function, and if
|
|
|
|
/// so, return true.
|
|
|
|
///
|
|
|
|
bool FunctionPassManager_New::run(Function &F) {
|
|
|
|
std::string errstr;
|
|
|
|
if (MP->materializeFunction(&F, &errstr)) {
|
2006-12-07 01:30:32 +00:00
|
|
|
cerr << "Error reading bytecode file: " << errstr << "\n";
|
2006-11-15 19:39:54 +00:00
|
|
|
abort();
|
|
|
|
}
|
2006-12-08 22:57:48 +00:00
|
|
|
return FPM->run(F);
|
2006-11-15 19:39:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-11-15 01:27:05 +00:00
|
|
|
/// doInitialization - Run all of the initializers for the function passes.
|
|
|
|
///
|
|
|
|
bool FunctionPassManager_New::doInitialization() {
|
|
|
|
return FPM->doInitialization(*MP->getModule());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// doFinalization - Run all of the initializers for the function passes.
|
|
|
|
///
|
|
|
|
bool FunctionPassManager_New::doFinalization() {
|
|
|
|
return FPM->doFinalization(*MP->getModule());
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-11-08 10:44:40 +00:00
|
|
|
// FunctionPassManagerImpl_New implementation
|
2006-11-07 21:49:50 +00:00
|
|
|
|
|
|
|
/// Add pass P into the pass manager queue. If P is a BasicBlockPass then
|
|
|
|
/// either use it into active basic block pass manager or create new basic
|
|
|
|
/// block pass manager to handle pass P.
|
|
|
|
bool
|
2006-11-08 10:44:40 +00:00
|
|
|
FunctionPassManagerImpl_New::addPass(Pass *P) {
|
2006-11-07 21:49:50 +00:00
|
|
|
|
|
|
|
// If P is a BasicBlockPass then use BasicBlockPassManager_New.
|
|
|
|
if (BasicBlockPass *BP = dynamic_cast<BasicBlockPass*>(P)) {
|
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
if (!activeBBPassManager || !activeBBPassManager->addPass(BP)) {
|
2006-11-07 21:49:50 +00:00
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
// If active manager exists then clear its analysis info.
|
|
|
|
if (activeBBPassManager)
|
|
|
|
activeBBPassManager->initializeAnalysisInfo();
|
2006-12-07 21:58:50 +00:00
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
// Create and add new manager
|
2006-12-07 23:24:58 +00:00
|
|
|
activeBBPassManager =
|
|
|
|
new BasicBlockPassManager_New(getDepth() + 1);
|
2006-12-12 22:02:16 +00:00
|
|
|
// Inherit top level manager
|
|
|
|
activeBBPassManager->setTopLevelManager(this->getTopLevelManager());
|
2006-12-12 22:35:25 +00:00
|
|
|
|
|
|
|
// Add new manager into current manager's list.
|
2006-11-11 02:04:19 +00:00
|
|
|
addPassToManager(activeBBPassManager, false);
|
2006-12-12 22:35:25 +00:00
|
|
|
|
|
|
|
// Add new manager into top level manager's indirect passes list
|
|
|
|
PMDataManager *PMD = dynamic_cast<PMDataManager *>(activeBBPassManager);
|
|
|
|
assert (PMD && "Manager is not Pass Manager");
|
|
|
|
TPM->addIndirectPassManager(PMD);
|
2006-12-07 22:34:21 +00:00
|
|
|
|
|
|
|
// Add pass into new manager. This time it must succeed.
|
2006-11-08 01:31:28 +00:00
|
|
|
if (!activeBBPassManager->addPass(BP))
|
|
|
|
assert(0 && "Unable to add Pass");
|
2006-11-07 21:49:50 +00:00
|
|
|
}
|
2006-12-07 23:55:10 +00:00
|
|
|
|
|
|
|
if (!ForcedLastUses.empty())
|
|
|
|
TPM->setLastUser(ForcedLastUses, this);
|
|
|
|
|
2006-11-07 21:49:50 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
FunctionPass *FP = dynamic_cast<FunctionPass *>(P);
|
|
|
|
if (!FP)
|
|
|
|
return false;
|
|
|
|
|
2006-11-07 22:56:50 +00:00
|
|
|
// If this pass does not preserve anlysis that is used by other passes
|
|
|
|
// managed by this manager than it is not a suiable pass for this manager.
|
2006-11-08 01:31:28 +00:00
|
|
|
if (!manageablePass(P))
|
2006-11-07 22:56:50 +00:00
|
|
|
return false;
|
|
|
|
|
2006-11-11 01:51:02 +00:00
|
|
|
addPassToManager (FP);
|
2006-12-07 22:34:21 +00:00
|
|
|
|
|
|
|
// If active manager exists then clear its analysis info.
|
|
|
|
if (activeBBPassManager) {
|
|
|
|
activeBBPassManager->initializeAnalysisInfo();
|
|
|
|
activeBBPassManager = NULL;
|
|
|
|
}
|
|
|
|
|
2006-11-07 21:49:50 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution by invoking
|
|
|
|
/// runOnFunction method. Keep track of whether any of the passes modifies
|
|
|
|
/// the function, and if so, return true.
|
2006-11-15 19:39:54 +00:00
|
|
|
bool FunctionPassManagerImpl_New::runOnModule(Module &M) {
|
2006-11-07 21:49:50 +00:00
|
|
|
|
2006-12-08 19:04:09 +00:00
|
|
|
bool Changed = doInitialization(M);
|
2006-12-07 18:41:09 +00:00
|
|
|
initializeAnalysisInfo();
|
2006-11-14 01:23:29 +00:00
|
|
|
|
2006-11-07 21:49:50 +00:00
|
|
|
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
|
2006-12-08 19:03:05 +00:00
|
|
|
this->runOnFunction(*I);
|
|
|
|
|
2006-12-08 19:04:09 +00:00
|
|
|
return Changed | doFinalization(M);
|
2006-11-07 21:49:50 +00:00
|
|
|
}
|
|
|
|
|
2006-11-15 19:39:54 +00:00
|
|
|
/// Execute all of the passes scheduled for execution by invoking
|
|
|
|
/// runOnFunction method. Keep track of whether any of the passes modifies
|
|
|
|
/// the function, and if so, return true.
|
|
|
|
bool FunctionPassManagerImpl_New::runOnFunction(Function &F) {
|
|
|
|
|
|
|
|
bool Changed = false;
|
2006-12-12 23:15:28 +00:00
|
|
|
|
|
|
|
if (F.isExternal())
|
|
|
|
return false;
|
|
|
|
|
2006-12-07 18:41:09 +00:00
|
|
|
initializeAnalysisInfo();
|
2006-11-15 19:39:54 +00:00
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
2006-12-12 23:13:09 +00:00
|
|
|
initializeAnalysisImpl(P);
|
2006-11-15 19:39:54 +00:00
|
|
|
FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
|
|
|
|
Changed |= FP->runOnFunction(F);
|
|
|
|
removeNotPreservedAnalysis(P);
|
2006-12-07 22:09:36 +00:00
|
|
|
recordAvailableAnalysis(P);
|
2006-11-15 19:39:54 +00:00
|
|
|
removeDeadPasses(P);
|
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-11-15 01:27:05 +00:00
|
|
|
inline bool FunctionPassManagerImpl_New::doInitialization(Module &M) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
|
|
|
|
FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
|
|
|
|
Changed |= FP->doInitialization(M);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool FunctionPassManagerImpl_New::doFinalization(Module &M) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
|
|
|
Pass *P = *itr;
|
|
|
|
|
|
|
|
FunctionPass *FP = dynamic_cast<FunctionPass*>(P);
|
|
|
|
Changed |= FP->doFinalization(M);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2006-12-08 22:57:48 +00:00
|
|
|
// Execute all the passes managed by this top level manager.
|
|
|
|
// Return true if any function is modified by a pass.
|
|
|
|
bool FunctionPassManagerImpl_New::run(Function &F) {
|
|
|
|
|
|
|
|
bool Changed = false;
|
|
|
|
for (std::vector<Pass *>::iterator I = passManagersBegin(),
|
|
|
|
E = passManagersEnd(); I != E; ++I) {
|
|
|
|
FunctionPass *FP = dynamic_cast<FunctionPass *>(*I);
|
|
|
|
Changed |= FP->runOnFunction(F);
|
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2006-11-07 22:03:15 +00:00
|
|
|
// ModulePassManager implementation
|
|
|
|
|
|
|
|
/// Add P into pass vector if it is manageble. If P is a FunctionPass
|
2006-11-08 10:44:40 +00:00
|
|
|
/// then use FunctionPassManagerImpl_New to manage it. Return false if P
|
2006-11-07 22:03:15 +00:00
|
|
|
/// is not manageable by this manager.
|
|
|
|
bool
|
2006-11-08 01:31:28 +00:00
|
|
|
ModulePassManager_New::addPass(Pass *P) {
|
2006-11-07 22:03:15 +00:00
|
|
|
|
|
|
|
// If P is FunctionPass then use function pass maanager.
|
|
|
|
if (FunctionPass *FP = dynamic_cast<FunctionPass*>(P)) {
|
|
|
|
|
2006-12-08 22:30:11 +00:00
|
|
|
if (!activeFunctionPassManager || !activeFunctionPassManager->addPass(P)) {
|
2006-11-07 22:03:15 +00:00
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
// If active manager exists then clear its analysis info.
|
|
|
|
if (activeFunctionPassManager)
|
|
|
|
activeFunctionPassManager->initializeAnalysisInfo();
|
2006-12-07 21:58:50 +00:00
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
// Create and add new manager
|
2006-12-07 23:24:58 +00:00
|
|
|
activeFunctionPassManager =
|
|
|
|
new FunctionPassManagerImpl_New(getDepth() + 1);
|
2006-12-12 22:35:25 +00:00
|
|
|
|
|
|
|
// Add new manager into current manager's list
|
2006-11-11 02:04:19 +00:00
|
|
|
addPassToManager(activeFunctionPassManager, false);
|
2006-12-12 22:35:25 +00:00
|
|
|
|
2006-12-12 22:02:16 +00:00
|
|
|
// Inherit top level manager
|
|
|
|
activeFunctionPassManager->setTopLevelManager(this->getTopLevelManager());
|
2006-12-12 22:35:25 +00:00
|
|
|
|
|
|
|
// Add new manager into top level manager's indirect passes list
|
|
|
|
PMDataManager *PMD = dynamic_cast<PMDataManager *>(activeFunctionPassManager);
|
|
|
|
assert (PMD && "Manager is not Pass Manager");
|
|
|
|
TPM->addIndirectPassManager(PMD);
|
2006-12-08 23:11:43 +00:00
|
|
|
|
2006-12-07 22:34:21 +00:00
|
|
|
// Add pass into new manager. This time it must succeed.
|
2006-11-08 01:31:28 +00:00
|
|
|
if (!activeFunctionPassManager->addPass(FP))
|
|
|
|
assert(0 && "Unable to add pass");
|
2006-11-07 22:03:15 +00:00
|
|
|
}
|
2006-12-07 23:55:10 +00:00
|
|
|
|
|
|
|
if (!ForcedLastUses.empty())
|
|
|
|
TPM->setLastUser(ForcedLastUses, this);
|
|
|
|
|
2006-11-07 22:03:15 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
ModulePass *MP = dynamic_cast<ModulePass *>(P);
|
|
|
|
if (!MP)
|
|
|
|
return false;
|
|
|
|
|
2006-11-07 22:56:50 +00:00
|
|
|
// If this pass does not preserve anlysis that is used by other passes
|
|
|
|
// managed by this manager than it is not a suiable pass for this manager.
|
2006-11-08 01:31:28 +00:00
|
|
|
if (!manageablePass(P))
|
2006-11-07 22:56:50 +00:00
|
|
|
return false;
|
|
|
|
|
2006-11-11 01:51:02 +00:00
|
|
|
addPassToManager(MP);
|
2006-12-07 22:34:21 +00:00
|
|
|
// If active manager exists then clear its analysis info.
|
|
|
|
if (activeFunctionPassManager) {
|
|
|
|
activeFunctionPassManager->initializeAnalysisInfo();
|
|
|
|
activeFunctionPassManager = NULL;
|
|
|
|
}
|
|
|
|
|
2006-11-07 22:03:15 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Execute all of the passes scheduled for execution by invoking
|
|
|
|
/// runOnModule method. Keep track of whether any of the passes modifies
|
|
|
|
/// the module, and if so, return true.
|
|
|
|
bool
|
|
|
|
ModulePassManager_New::runOnModule(Module &M) {
|
|
|
|
bool Changed = false;
|
2006-12-07 18:41:09 +00:00
|
|
|
initializeAnalysisInfo();
|
2006-11-14 01:23:29 +00:00
|
|
|
|
2006-11-11 01:51:02 +00:00
|
|
|
for (std::vector<Pass *>::iterator itr = passVectorBegin(),
|
|
|
|
e = passVectorEnd(); itr != e; ++itr) {
|
2006-11-07 22:03:15 +00:00
|
|
|
Pass *P = *itr;
|
2006-12-12 23:13:09 +00:00
|
|
|
initializeAnalysisImpl(P);
|
2006-11-07 22:03:15 +00:00
|
|
|
ModulePass *MP = dynamic_cast<ModulePass*>(P);
|
|
|
|
Changed |= MP->runOnModule(M);
|
2006-11-14 01:23:29 +00:00
|
|
|
removeNotPreservedAnalysis(P);
|
2006-12-07 22:09:36 +00:00
|
|
|
recordAvailableAnalysis(P);
|
2006-11-14 03:05:08 +00:00
|
|
|
removeDeadPasses(P);
|
2006-11-07 22:03:15 +00:00
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PassManagerImpl implementation
|
|
|
|
|
2006-11-07 22:23:34 +00:00
|
|
|
// PassManager_New implementation
|
|
|
|
/// Add P into active pass manager or use new module pass manager to
|
|
|
|
/// manage it.
|
2006-11-11 02:22:31 +00:00
|
|
|
bool PassManagerImpl_New::addPass(Pass *P) {
|
2006-11-07 22:23:34 +00:00
|
|
|
|
2006-11-11 00:42:16 +00:00
|
|
|
if (!activeManager || !activeManager->addPass(P)) {
|
2006-12-07 23:24:58 +00:00
|
|
|
activeManager = new ModulePassManager_New(getDepth() + 1);
|
2006-12-12 22:02:16 +00:00
|
|
|
// Inherit top level manager
|
|
|
|
activeManager->setTopLevelManager(this->getTopLevelManager());
|
2006-12-08 23:53:00 +00:00
|
|
|
|
|
|
|
// This top level manager is going to manage activeManager.
|
|
|
|
// Set up analysis resolver to connect them.
|
|
|
|
AnalysisResolver_New *AR = new AnalysisResolver_New(*this);
|
|
|
|
activeManager->setResolver(AR);
|
|
|
|
|
2006-12-08 22:47:25 +00:00
|
|
|
addPassManager(activeManager);
|
2006-12-07 21:44:12 +00:00
|
|
|
return activeManager->addPass(P);
|
2006-11-07 22:23:34 +00:00
|
|
|
}
|
2006-12-07 21:44:12 +00:00
|
|
|
return true;
|
2006-11-07 22:23:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// run - Execute all of the passes scheduled for execution. Keep track of
|
|
|
|
/// whether any of the passes modifies the module, and if so, return true.
|
2006-11-11 02:22:31 +00:00
|
|
|
bool PassManagerImpl_New::run(Module &M) {
|
2006-11-07 22:23:34 +00:00
|
|
|
|
|
|
|
bool Changed = false;
|
2006-12-08 22:47:25 +00:00
|
|
|
for (std::vector<Pass *>::iterator I = passManagersBegin(),
|
|
|
|
E = passManagersEnd(); I != E; ++I) {
|
|
|
|
ModulePassManager_New *MP = dynamic_cast<ModulePassManager_New *>(*I);
|
|
|
|
Changed |= MP->runOnModule(M);
|
2006-11-07 22:23:34 +00:00
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
2006-11-08 10:29:57 +00:00
|
|
|
|
2006-12-07 19:39:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PassManager implementation
|
|
|
|
|
2006-11-08 10:29:57 +00:00
|
|
|
/// Create new pass manager
|
|
|
|
PassManager_New::PassManager_New() {
|
2006-12-07 23:24:58 +00:00
|
|
|
PM = new PassManagerImpl_New(0);
|
2006-12-12 22:02:16 +00:00
|
|
|
// PM is the top level manager
|
|
|
|
PM->setTopLevelManager(PM);
|
2006-11-08 10:29:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// add - Add a pass to the queue of passes to run. This passes ownership of
|
|
|
|
/// the Pass to the PassManager. When the PassManager is destroyed, the pass
|
|
|
|
/// will be destroyed as well, so there is no need to delete the pass. This
|
|
|
|
/// implies that all passes MUST be allocated with 'new'.
|
|
|
|
void
|
|
|
|
PassManager_New::add(Pass *P) {
|
|
|
|
PM->add(P);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// run - Execute all of the passes scheduled for execution. Keep track of
|
|
|
|
/// whether any of the passes modifies the module, and if so, return true.
|
|
|
|
bool
|
|
|
|
PassManager_New::run(Module &M) {
|
|
|
|
return PM->run(M);
|
|
|
|
}
|
|
|
|
|