From 546b027b3ee0ed3a8c5e551a7e13fc8a1775ede9 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Wed, 21 Aug 2002 17:09:49 +0000 Subject: [PATCH] - 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 --- include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h | 2 -- include/llvm/CodeGen/FunctionLiveVarInfo.h | 2 -- lib/Analysis/IPA/CallGraph.cpp | 1 - lib/Analysis/IPA/FindUnsafePointerTypes.cpp | 1 - lib/Analysis/IPA/FindUsedTypes.cpp | 1 - lib/Analysis/IntervalPartition.cpp | 2 -- lib/Analysis/LoopInfo.cpp | 1 - lib/Analysis/PostDominators.cpp | 4 ---- lib/Transforms/Utils/UnifyFunctionExitNodes.cpp | 1 - 9 files changed, 15 deletions(-) diff --git a/include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h b/include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h index b120cc0a1b0..dbbcd6a75bf 100644 --- a/include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h +++ b/include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h @@ -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. diff --git a/include/llvm/CodeGen/FunctionLiveVarInfo.h b/include/llvm/CodeGen/FunctionLiveVarInfo.h index b120cc0a1b0..dbbcd6a75bf 100644 --- a/include/llvm/CodeGen/FunctionLiveVarInfo.h +++ b/include/llvm/CodeGen/FunctionLiveVarInfo.h @@ -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. diff --git a/lib/Analysis/IPA/CallGraph.cpp b/lib/Analysis/IPA/CallGraph.cpp index 709c1942f63..5c4b5d81f7e 100644 --- a/lib/Analysis/IPA/CallGraph.cpp +++ b/lib/Analysis/IPA/CallGraph.cpp @@ -46,7 +46,6 @@ #include static RegisterAnalysis 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. diff --git a/lib/Analysis/IPA/FindUnsafePointerTypes.cpp b/lib/Analysis/IPA/FindUnsafePointerTypes.cpp index 425c154ecf7..5d9745cd7a4 100644 --- a/lib/Analysis/IPA/FindUnsafePointerTypes.cpp +++ b/lib/Analysis/IPA/FindUnsafePointerTypes.cpp @@ -25,7 +25,6 @@ static RegisterAnalysis 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 diff --git a/lib/Analysis/IPA/FindUsedTypes.cpp b/lib/Analysis/IPA/FindUsedTypes.cpp index 6f12612c4ef..6bd79f25fee 100644 --- a/lib/Analysis/IPA/FindUsedTypes.cpp +++ b/lib/Analysis/IPA/FindUsedTypes.cpp @@ -13,7 +13,6 @@ static RegisterAnalysis X("printusedtypes", "Find Used Types"); -AnalysisID FindUsedTypes::ID = X; // IncorporateType - Incorporate one type and all of its subtypes into the // collection of used types. diff --git a/lib/Analysis/IntervalPartition.cpp b/lib/Analysis/IntervalPartition.cpp index f0ed32881e4..72cf32d91d3 100644 --- a/lib/Analysis/IntervalPartition.cpp +++ b/lib/Analysis/IntervalPartition.cpp @@ -13,8 +13,6 @@ using std::make_pair; static RegisterAnalysis X("intervals", "Interval Partition Construction", true); -AnalysisID IntervalPartition::ID = X; - //===----------------------------------------------------------------------===// // IntervalPartition Implementation //===----------------------------------------------------------------------===// diff --git a/lib/Analysis/LoopInfo.cpp b/lib/Analysis/LoopInfo.cpp index 8988877dc4b..a2f2ccec5dc 100644 --- a/lib/Analysis/LoopInfo.cpp +++ b/lib/Analysis/LoopInfo.cpp @@ -16,7 +16,6 @@ static RegisterAnalysis X("loops", "Natural Loop Construction", true); -AnalysisID LoopInfo::ID = X; //===----------------------------------------------------------------------===// // Loop implementation diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp index 2e498542492..c3320ee3db8 100644 --- a/lib/Analysis/PostDominators.cpp +++ b/lib/Analysis/PostDominators.cpp @@ -17,7 +17,6 @@ using std::set; static RegisterAnalysis 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 D("postidom", "Immediate Post-Dominators Construction", true); -AnalysisID ImmediatePostDominators::ID = D; //===----------------------------------------------------------------------===// // PostDominatorTree Implementation @@ -96,7 +94,6 @@ AnalysisID ImmediatePostDominators::ID = D; static RegisterAnalysis 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 H("postdomfrontier", "Post-Dominance Frontier Construction", true); -AnalysisID PostDominanceFrontier::ID = H; const DominanceFrontier::DomSetType & PostDominanceFrontier::calculate(const PostDominatorTree &DT, diff --git a/lib/Transforms/Utils/UnifyFunctionExitNodes.cpp b/lib/Transforms/Utils/UnifyFunctionExitNodes.cpp index caa29fdd152..3c522b53ab0 100644 --- a/lib/Transforms/Utils/UnifyFunctionExitNodes.cpp +++ b/lib/Transforms/Utils/UnifyFunctionExitNodes.cpp @@ -17,7 +17,6 @@ using std::vector; static RegisterOpt 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