RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-04 01:11:44 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

- Do not expose ::ID from any of the analyses anymore.

Browse Source 
llvm-svn: 3416
This commit is contained in:
Chris Lattner 2002-08-21 17:09:45 +00:00
parent ae2d7ffd42
commit b90f78e2b3
12 changed files with 1 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/llvm/Analysis/CallGraph.h
View File

@ -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(); }

6
include/llvm/Analysis/DataStructure.h
View File

@ -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);

16
include/llvm/Analysis/Dominators.h
View File

@ -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 &) {

2
include/llvm/Analysis/FindUnsafePointerTypes.h
View File

@ -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;

5
include/llvm/Analysis/FindUsedTypes.h
View File

@ -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.
//

2
include/llvm/Analysis/IntervalPartition.h
View File

@ -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

2
include/llvm/Analysis/LoopInfo.h
View File

@ -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(); }

3
include/llvm/Transforms/Utils/UnifyFunctionExitNodes.h
View File

@ -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.
//

1
lib/Analysis/DataStructure/BottomUpClosure.cpp
View File

@ -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...

1
lib/Analysis/DataStructure/Local.cpp
View File

@ -20,7 +20,6 @@ using std::vector;
static RegisterAnalysis<LocalDataStructures>
X("datastructure", "Local Data Structure Analysis");
AnalysisID LocalDataStructures::ID = X;
//===----------------------------------------------------------------------===//
// GraphBuilder Class

1
lib/Analysis/DataStructure/TopDownClosure.cpp
View File

@ -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...

1
lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp
View File

@ -17,7 +17,6 @@
static RegisterAnalysis<FunctionLiveVarInfo>
X("livevar", "Live Variable Analysis");
AnalysisID FunctionLiveVarInfo::ID = X;
LiveVarDebugLevel_t DEBUG_LV;