- Do not expose ::ID from any of the analyses anymore.
authorChris Lattner <sabre@nondot.org>
Wed, 21 Aug 2002 17:09:49 +0000 (17:09 +0000)
committerChris Lattner <sabre@nondot.org>
Wed, 21 Aug 2002 17:09:49 +0000 (17:09 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3417 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Analysis/LiveVar/FunctionLiveVarInfo.h
include/llvm/CodeGen/FunctionLiveVarInfo.h
lib/Analysis/IPA/CallGraph.cpp
lib/Analysis/IPA/FindUnsafePointerTypes.cpp
lib/Analysis/IPA/FindUsedTypes.cpp
lib/Analysis/IntervalPartition.cpp
lib/Analysis/LoopInfo.cpp
lib/Analysis/PostDominators.cpp
lib/Transforms/Utils/UnifyFunctionExitNodes.cpp

index b120cc0a1b0bae4e193d4834a5c29d3dd8a76ae2..dbbcd6a75bfc8c1f50122a257ad4f80419b7af75 100644 (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.
index b120cc0a1b0bae4e193d4834a5c29d3dd8a76ae2..dbbcd6a75bfc8c1f50122a257ad4f80419b7af75 100644 (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.
index 709c1942f631d105df3485c92c919358992f91a8..5c4b5d81f7ecd06b2c52f639e95dd66b10fe42f8 100644 (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.
index 425c154ecf7514b2860866624308f38021b7367b..5d9745cd7a4778142ef9ecab90f3743c69919fb5 100644 (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
index 6f12612c4efe76902f1204b2647f1e770bd74832..6bd79f25feee93f6e5d81c39e6c91db08c3f851f 100644 (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.
index f0ed32881e408185760e0c472269a076f6838e06..72cf32d91d3873a890cab83bb37747b0cb16eee1 100644 (file)
@@ -13,8 +13,6 @@ using std::make_pair;
 static RegisterAnalysis<IntervalPartition>
 X("intervals", "Interval Partition Construction", true);
 
-AnalysisID IntervalPartition::ID = X;
-
 //===----------------------------------------------------------------------===//
 // IntervalPartition Implementation
 //===----------------------------------------------------------------------===//
index 8988877dc4b77f81bb4c9c871a42478b50b22f74..a2f2ccec5dc0f050e93246951d1355f8c2249628 100644 (file)
@@ -16,7 +16,6 @@
 
 static RegisterAnalysis<LoopInfo>
 X("loops", "Natural Loop Construction", true);
-AnalysisID LoopInfo::ID = X;
 
 //===----------------------------------------------------------------------===//
 // Loop implementation
index 2e49854249216474e345482d791c7b4517a96fcb..c3320ee3db8f85a3d7f8446fb31e0b0a6c4f9496 100644 (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, 
index caa29fdd152e64a97157048e6fd39fabd51fa6cd..3c522b53ab03e1300210a2ba8dcd12256eb0140b 100644 (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