mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-13 20:32:21 +00:00
- Do not expose ::ID from any of the analyses anymore.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3416 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
607ace696b
commit
044f908791
@ -121,8 +121,6 @@ public:
|
||||
//===---------------------------------------------------------------------
|
||||
// Pass infrastructure interface glue code...
|
||||
//
|
||||
static AnalysisID ID; // We are an analysis, we must have an ID
|
||||
|
||||
CallGraph() : Root(0) {}
|
||||
~CallGraph() { destroy(); }
|
||||
|
||||
|
@ -388,8 +388,6 @@ class LocalDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // DataStructure Analysis ID
|
||||
|
||||
~LocalDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
@ -422,8 +420,6 @@ class BUDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // BUDataStructure Analysis ID
|
||||
|
||||
~BUDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
@ -459,8 +455,6 @@ class TDDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // TDDataStructure Analysis ID
|
||||
|
||||
~TDDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
|
@ -388,8 +388,6 @@ class LocalDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // DataStructure Analysis ID
|
||||
|
||||
~LocalDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
@ -422,8 +420,6 @@ class BUDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // BUDataStructure Analysis ID
|
||||
|
||||
~BUDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
@ -459,8 +455,6 @@ class TDDataStructures : public Pass {
|
||||
// DSInfo, one graph for each function
|
||||
std::map<const Function*, DSGraph*> DSInfo;
|
||||
public:
|
||||
static AnalysisID ID; // TDDataStructure Analysis ID
|
||||
|
||||
~TDDataStructures() { releaseMemory(); }
|
||||
|
||||
virtual bool run(Module &M);
|
||||
|
@ -97,8 +97,6 @@ public:
|
||||
// compute a normal dominator set.
|
||||
//
|
||||
struct DominatorSet : public DominatorSetBase {
|
||||
static AnalysisID ID; // Build dominator set
|
||||
|
||||
DominatorSet() : DominatorSetBase(false) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F);
|
||||
@ -115,8 +113,6 @@ struct DominatorSet : public DominatorSetBase {
|
||||
// compute the post-dominator set.
|
||||
//
|
||||
struct PostDominatorSet : public DominatorSetBase {
|
||||
static AnalysisID ID; // Build post-dominator set
|
||||
|
||||
PostDominatorSet() : DominatorSetBase(true) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F);
|
||||
@ -169,8 +165,6 @@ public:
|
||||
// is used to compute a normal immediate dominator set.
|
||||
//
|
||||
struct ImmediateDominators : public ImmediateDominatorsBase {
|
||||
static AnalysisID ID; // Build immediate dominators
|
||||
|
||||
ImmediateDominators() : ImmediateDominatorsBase(false) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F) {
|
||||
@ -193,8 +187,6 @@ struct ImmediateDominators : public ImmediateDominatorsBase {
|
||||
// that is used to compute the immediate post-dominators.
|
||||
//
|
||||
struct ImmediatePostDominators : public ImmediateDominatorsBase {
|
||||
static AnalysisID ID; // Build immediate postdominators
|
||||
|
||||
ImmediatePostDominators() : ImmediateDominatorsBase(true) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F) {
|
||||
@ -273,8 +265,6 @@ public:
|
||||
// compute a normal dominator tree.
|
||||
//
|
||||
struct DominatorTree : public DominatorTreeBase {
|
||||
static AnalysisID ID; // Build dominator tree
|
||||
|
||||
DominatorTree() : DominatorTreeBase(false) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F) {
|
||||
@ -299,8 +289,6 @@ private:
|
||||
// compute the a post-dominator tree.
|
||||
//
|
||||
struct PostDominatorTree : public DominatorTreeBase {
|
||||
static AnalysisID ID; // Build immediate postdominators
|
||||
|
||||
PostDominatorTree() : DominatorTreeBase(true) {}
|
||||
|
||||
virtual bool runOnFunction(Function &F) {
|
||||
@ -351,8 +339,6 @@ public:
|
||||
// compute a normal dominator tree.
|
||||
//
|
||||
struct DominanceFrontier : public DominanceFrontierBase {
|
||||
static AnalysisID ID; // Build dominance frontier
|
||||
|
||||
DominanceFrontier() : DominanceFrontierBase(false) {}
|
||||
|
||||
virtual bool runOnFunction(Function &) {
|
||||
@ -379,8 +365,6 @@ private:
|
||||
// used to compute the a post-dominance frontier.
|
||||
//
|
||||
struct PostDominanceFrontier : public DominanceFrontierBase {
|
||||
static AnalysisID ID; // Build post dominance frontier
|
||||
|
||||
PostDominanceFrontier() : DominanceFrontierBase(true) {}
|
||||
|
||||
virtual bool runOnFunction(Function &) {
|
||||
|
@ -26,8 +26,6 @@ struct FindUnsafePointerTypes : public Pass {
|
||||
// UnsafeTypes - Set of types that are not safe to transform.
|
||||
std::set<PointerType*> UnsafeTypes;
|
||||
public:
|
||||
static AnalysisID ID; // We are an analysis, we must have an ID
|
||||
|
||||
// Accessor for underlying type set...
|
||||
inline const std::set<PointerType*> &getUnsafeTypes() const {
|
||||
return UnsafeTypes;
|
||||
|
@ -15,11 +15,6 @@ class Type;
|
||||
class FindUsedTypes : public Pass {
|
||||
std::set<const Type *> UsedTypes;
|
||||
public:
|
||||
// FindUsedTypes ctor - This pass can optionally include types that are
|
||||
// referenced only in symbol tables, but the default is not to.
|
||||
//
|
||||
static AnalysisID ID;
|
||||
|
||||
// getTypes - After the pass has been run, return the set containing all of
|
||||
// the types used in the module.
|
||||
//
|
||||
|
@ -36,8 +36,6 @@ class IntervalPartition : public FunctionPass {
|
||||
std::vector<Interval*> Intervals;
|
||||
|
||||
public:
|
||||
static AnalysisID ID; // We are an analysis, we must have an ID
|
||||
|
||||
IntervalPartition() : RootInterval(0) {}
|
||||
|
||||
// run - Calculate the interval partition for this function
|
||||
|
@ -67,8 +67,6 @@ class LoopInfo : public FunctionPass {
|
||||
std::map<BasicBlock*, Loop*> BBMap;
|
||||
std::vector<Loop*> TopLevelLoops;
|
||||
public:
|
||||
static AnalysisID ID; // LoopInfo Analysis ID
|
||||
|
||||
// LoopInfo ctor - Calculate the natural loop information for a CFG
|
||||
~LoopInfo() { releaseMemory(); }
|
||||
|
||||
|
@ -15,8 +15,7 @@
|
||||
struct UnifyFunctionExitNodes : public FunctionPass {
|
||||
BasicBlock *ExitNode;
|
||||
public:
|
||||
static AnalysisID ID; // Pass ID
|
||||
UnifyFunctionExitNodes(AnalysisID id = ID) : ExitNode(0) { assert(ID == id); }
|
||||
UnifyFunctionExitNodes() : ExitNode(0) {}
|
||||
|
||||
// getExitNode - Return the new single (or nonexistant) exit node of the CFG.
|
||||
//
|
||||
|
@ -16,7 +16,6 @@ using std::map;
|
||||
|
||||
static RegisterAnalysis<BUDataStructures>
|
||||
X("budatastructure", "Bottom-up Data Structure Analysis Closure");
|
||||
AnalysisID BUDataStructures::ID = X;
|
||||
|
||||
// releaseMemory - If the pass pipeline is done with this pass, we can release
|
||||
// our memory... here...
|
||||
|
@ -20,7 +20,6 @@ using std::vector;
|
||||
|
||||
static RegisterAnalysis<LocalDataStructures>
|
||||
X("datastructure", "Local Data Structure Analysis");
|
||||
AnalysisID LocalDataStructures::ID = X;
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// GraphBuilder Class
|
||||
|
@ -15,7 +15,6 @@ using std::map;
|
||||
|
||||
static RegisterAnalysis<TDDataStructures>
|
||||
Y("tddatastructure", "Top-down Data Structure Analysis Closure");
|
||||
AnalysisID TDDataStructures::ID = Y;
|
||||
|
||||
// releaseMemory - If the pass pipeline is done with this pass, we can release
|
||||
// our memory... here...
|
||||
|
@ -17,7 +17,6 @@
|
||||
|
||||
static RegisterAnalysis<FunctionLiveVarInfo>
|
||||
X("livevar", "Live Variable Analysis");
|
||||
AnalysisID FunctionLiveVarInfo::ID = X;
|
||||
|
||||
LiveVarDebugLevel_t DEBUG_LV;
|
||||
|
||||
|
@ -17,7 +17,6 @@
|
||||
|
||||
static RegisterAnalysis<FunctionLiveVarInfo>
|
||||
X("livevar", "Live Variable Analysis");
|
||||
AnalysisID FunctionLiveVarInfo::ID = X;
|
||||
|
||||
LiveVarDebugLevel_t DEBUG_LV;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user