#include "llvm/PassManager.h"
#include "llvm/ADT/SmallVector.h"
+#include <deque>
+#include <map>
//===----------------------------------------------------------------------===//
// Overview:
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
//
public:
virtual unsigned getNumContainedManagers() {
- return PassManagers.size();
+ return (unsigned)PassManagers.size();
}
/// Schedule pass P for execution. Make sure that passes required by
return ImmutablePasses;
}
- void addPassManager(Pass *Manager) {
+ void addPassManager(PMDataManager *Manager) {
PassManagers.push_back(Manager);
}
protected:
/// Collection of pass managers
- std::vector<Pass *> PassManagers;
+ std::vector<PMDataManager *> PassManagers;
private:
const std::vector<AnalysisID> &Set) const;
virtual unsigned getNumContainedPasses() {
- return PassVector.size();
+ return (unsigned)PassVector.size();
}
virtual PassManagerType getPassManagerType() const {