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

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3417 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-08-21 17:09:49 +00:00
parent 044f908791
commit 546b027b3e
9 changed files with 0 additions and 15 deletions

View File

@ -89,8 +89,6 @@ class FunctionLiveVarInfo : public FunctionPass {
void calcLiveVarSetsForBB(const BasicBlock *BB);
public:
static AnalysisID ID; // We are an analysis, we must have an ID
// --------- Implement the FunctionPass interface ----------------------
// runOnFunction - Perform analysis, update internal data structures.

View File

@ -89,8 +89,6 @@ class FunctionLiveVarInfo : public FunctionPass {
void calcLiveVarSetsForBB(const BasicBlock *BB);
public:
static AnalysisID ID; // We are an analysis, we must have an ID
// --------- Implement the FunctionPass interface ----------------------
// runOnFunction - Perform analysis, update internal data structures.

View File

@ -46,7 +46,6 @@
#include <algorithm>
static RegisterAnalysis<CallGraph> X("callgraph", "Call Graph Construction");
AnalysisID CallGraph::ID = X;
// getNodeFor - Return the node for the specified function or create one if it
// does not already exist.

View File

@ -25,7 +25,6 @@
static RegisterAnalysis<FindUnsafePointerTypes>
X("unsafepointertypes", "Find Unsafe Pointer Types");
AnalysisID FindUnsafePointerTypes::ID = X;
// Provide a command line option to turn on printing of which instructions cause
// a type to become invalid

View File

@ -13,7 +13,6 @@
static RegisterAnalysis<FindUsedTypes>
X("printusedtypes", "Find Used Types");
AnalysisID FindUsedTypes::ID = X;
// IncorporateType - Incorporate one type and all of its subtypes into the
// collection of used types.

View File

@ -13,8 +13,6 @@ using std::make_pair;
static RegisterAnalysis<IntervalPartition>
X("intervals", "Interval Partition Construction", true);
AnalysisID IntervalPartition::ID = X;
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation
//===----------------------------------------------------------------------===//

View File

@ -16,7 +16,6 @@
static RegisterAnalysis<LoopInfo>
X("loops", "Natural Loop Construction", true);
AnalysisID LoopInfo::ID = X;
//===----------------------------------------------------------------------===//
// Loop implementation

View File

@ -17,7 +17,6 @@ using std::set;
static RegisterAnalysis<PostDominatorSet>
B("postdomset", "Post-Dominator Set Construction", true);
AnalysisID PostDominatorSet::ID = B;
// Postdominator set construction. This converts the specified function to only
// have a single exit node (return stmt), then calculates the post dominance
@ -88,7 +87,6 @@ void PostDominatorSet::getAnalysisUsage(AnalysisUsage &AU) const {
static RegisterAnalysis<ImmediatePostDominators>
D("postidom", "Immediate Post-Dominators Construction", true);
AnalysisID ImmediatePostDominators::ID = D;
//===----------------------------------------------------------------------===//
// PostDominatorTree Implementation
@ -96,7 +94,6 @@ AnalysisID ImmediatePostDominators::ID = D;
static RegisterAnalysis<PostDominatorTree>
F("postdomtree", "Post-Dominator Tree Construction", true);
AnalysisID PostDominatorTree::ID = F;
void PostDominatorTree::calculate(const PostDominatorSet &DS) {
Nodes[Root] = new Node(Root, 0); // Add a node for the root...
@ -152,7 +149,6 @@ void PostDominatorTree::calculate(const PostDominatorSet &DS) {
static RegisterAnalysis<PostDominanceFrontier>
H("postdomfrontier", "Post-Dominance Frontier Construction", true);
AnalysisID PostDominanceFrontier::ID = H;
const DominanceFrontier::DomSetType &
PostDominanceFrontier::calculate(const PostDominatorTree &DT,

View File

@ -17,7 +17,6 @@ using std::vector;
static RegisterOpt<UnifyFunctionExitNodes>
X("mergereturn", "Unify function exit nodes");
AnalysisID UnifyFunctionExitNodes::ID = X;
// UnifyAllExitNodes - Unify all exit nodes of the CFG by creating a new
// BasicBlock, and converting all returns to unconditional branches to this