#include "llvm/PassManager.h"
#include "llvm/ADT/SmallVector.h"
+#include "llvm/ADT/SmallPtrSet.h"
+#include "llvm/ADT/DenseMap.h"
+#include <deque>
+#include <map>
//===----------------------------------------------------------------------===//
// Overview:
//
// Pass Manager Infrastructure uses multiple pass managers. They are
// PassManager, FunctionPassManager, MPPassManager, FPPassManager, BBPassManager.
-// This class hierarcy uses multiple inheritance but pass managers do not derive
-// from another pass manager.
+// This class hierarchy 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.
#ifndef PASSMANAGERS_H
#define PASSMANAGERS_H
+#include "llvm/Pass.h"
+#include <deque>
+
namespace llvm {
/// FunctionPassManager and PassManager, two top level managers, serve
ON_CG_MSG // "' on Call Graph ...\n'"
};
+//===----------------------------------------------------------------------===//
+// PMStack
+//
+/// PMStack
+/// Top level pass managers (see PassManager.cpp) maintain active Pass Managers
+/// using PMStack. Each Pass implements assignPassManager() to connect itself
+/// with appropriate manager. assignPassManager() walks PMStack to find
+/// suitable manager.
+///
+/// PMStack is just a wrapper around standard deque that overrides pop() and
+/// push() methods.
+class PMStack {
+public:
+ typedef std::deque<PMDataManager *>::reverse_iterator iterator;
+ iterator begin() { return S.rbegin(); }
+ iterator end() { return S.rend(); }
+
+ void handleLastUserOverflow();
+
+ void pop();
+ inline PMDataManager *top() { return S.back(); }
+ void push(PMDataManager *PM);
+ inline bool empty() { return S.empty(); }
+
+ void dump();
+private:
+ std::deque<PMDataManager *> S;
+};
+
+
//===----------------------------------------------------------------------===//
// PMTopLevelManager
//
class PMTopLevelManager {
public:
- virtual unsigned getNumContainedManagers() {
- return PassManagers.size();
+ virtual unsigned getNumContainedManagers() const {
+ return (unsigned)PassManagers.size();
}
/// Schedule pass P for execution. Make sure that passes required by
/// then return NULL.
Pass *findAnalysisPass(AnalysisID AID);
+ /// Find analysis usage information for the pass P.
+ AnalysisUsage *findAnalysisUsage(Pass *P);
+
explicit PMTopLevelManager(enum TopLevelManagerType t);
virtual ~PMTopLevelManager();
ImmutablePasses.push_back(P);
}
- inline std::vector<ImmutablePass *>& getImmutablePasses() {
+ inline SmallVector<ImmutablePass *, 8>& getImmutablePasses() {
return ImmutablePasses;
}
- void addPassManager(Pass *Manager) {
+ void addPassManager(PMDataManager *Manager) {
PassManagers.push_back(Manager);
}
protected:
/// Collection of pass managers
- std::vector<Pass *> PassManagers;
+ SmallVector<PMDataManager *, 8> PassManagers;
private:
/// Collection of pass managers that are not directly maintained
/// by this pass manager
- std::vector<PMDataManager *> IndirectPassManagers;
+ SmallVector<PMDataManager *, 8> IndirectPassManagers;
// 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;
+ DenseMap<Pass *, Pass *> LastUser;
+
+ // Map to keep track of passes that are last used by a pass.
+ // This inverse map is initialized at PM->run() based on
+ // LastUser map.
+ DenseMap<Pass *, SmallPtrSet<Pass *, 8> > InversedLastUser;
/// Immutable passes are managed by top level manager.
- std::vector<ImmutablePass *> ImmutablePasses;
+ SmallVector<ImmutablePass *, 8> ImmutablePasses;
+
+ DenseMap<Pass *, AnalysisUsage *> AnUsageMap;
};
/// verifyPreservedAnalysis -- Verify analysis presreved by pass P.
void verifyPreservedAnalysis(Pass *P);
+ /// verifyDomInfo -- Verify dominator information if it is available.
+ void verifyDomInfo(Pass &P, Function &F);
+
/// Remove Analysis that is not preserved by the pass
void removeNotPreservedAnalysis(Pass *P);
void dumpPassArguments() const;
void dumpPassInfo(Pass *P, enum PassDebuggingString S1,
enum PassDebuggingString S2, const char *Msg);
- void dumpAnalysisSetInfo(const char *Msg, Pass *P,
- const std::vector<AnalysisID> &Set) const;
+ void dumpRequiredSet(const Pass *P) const;
+ void dumpPreservedSet(const Pass *P) const;
- virtual unsigned getNumContainedPasses() {
- return PassVector.size();
+ virtual unsigned getNumContainedPasses() const {
+ return (unsigned)PassVector.size();
}
virtual PassManagerType getPassManagerType() const {
PMTopLevelManager *TPM;
// Collection of pass that are managed by this manager
- std::vector<Pass *> PassVector;
+ SmallVector<Pass *, 16> PassVector;
// Collection of Analysis provided by Parent pass manager and
// used by current pass manager. At at time there can not be more
std::map<AnalysisID, Pass *> *InheritedAnalysis[PMT_Last];
private:
+ void dumpAnalysisUsage(const char *Msg, const Pass *P,
+ const AnalysisUsage::VectorType &Set) const;
+
// 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
// Collection of higher level analysis used by the pass managed by
// this manager.
- std::vector<Pass *> HigherLevelAnalysis;
+ SmallVector<Pass *, 8> HigherLevelAnalysis;
unsigned Depth;
};