commit 07a228d1f7342c2fbe7dd7a307ee43b6bc026fc7
author Chris Lattner <sabre@nondot.org> Mon May 06 19:32:07 2002 +0000
committer Chris Lattner <sabre@nondot.org> Mon May 06 19:32:07 2002 +0000
tree 80e96f7e18cd29656794813d1722da00a24bc38b
parent 27ad137d5ef5bb08f95c388e825b02e9c074b667

Mark analyses that only depend on the CFG of a function


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2507 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/IntervalPartition.cpp

diff --git a/lib/Analysis/IntervalPartition.cpp b/lib/Analysis/IntervalPartition.cpp
index a774c5c..5dfccd2 100644
--- a/lib/Analysis/IntervalPartition.cpp
+++ b/lib/Analysis/IntervalPartition.cpp
@@ -10,7 +10,7 @@
 
 using std::make_pair;
 
-AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>());
+AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>(), true);
 
 //===----------------------------------------------------------------------===//
 // IntervalPartition Implementation

lib/Analysis/LoopInfo.cpp

diff --git a/lib/Analysis/LoopInfo.cpp b/lib/Analysis/LoopInfo.cpp
index 244db30..d99f0f7 100644
--- a/lib/Analysis/LoopInfo.cpp
+++ b/lib/Analysis/LoopInfo.cpp
@@ -13,7 +13,7 @@
 #include "Support/DepthFirstIterator.h"
 #include <algorithm>
 
-AnalysisID LoopInfo::ID(AnalysisID::create<LoopInfo>());
+AnalysisID LoopInfo::ID(AnalysisID::create<LoopInfo>(), true);
 
 //===----------------------------------------------------------------------===//
 // Loop implementation

lib/Analysis/PostDominators.cpp

diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp
index f542d11..9697f1f 100644
--- a/lib/Analysis/PostDominators.cpp
+++ b/lib/Analysis/PostDominators.cpp
@@ -18,8 +18,8 @@
 //  DominatorSet Implementation
 //===----------------------------------------------------------------------===//
 
-AnalysisID DominatorSet::ID(AnalysisID::create<DominatorSet>());
-AnalysisID DominatorSet::PostDomID(AnalysisID::create<DominatorSet>());
+AnalysisID DominatorSet::ID(AnalysisID::create<DominatorSet>(), true);
+AnalysisID DominatorSet::PostDomID(AnalysisID::create<DominatorSet>(), true);
 
 bool DominatorSet::runOnFunction(Function *F) {
   Doms.clear();   // Reset from the last time we were run...
@@ -146,8 +146,8 @@
 //  ImmediateDominators Implementation
 //===----------------------------------------------------------------------===//
 
-AnalysisID ImmediateDominators::ID(AnalysisID::create<ImmediateDominators>());
-AnalysisID ImmediateDominators::PostDomID(AnalysisID::create<ImmediateDominators>());
+AnalysisID ImmediateDominators::ID(AnalysisID::create<ImmediateDominators>(), true);
+AnalysisID ImmediateDominators::PostDomID(AnalysisID::create<ImmediateDominators>(), true);
 
 // calcIDoms - Calculate the immediate dominator mapping, given a set of
 // dominators for every basic block.
@@ -190,8 +190,8 @@
 //  DominatorTree Implementation
 //===----------------------------------------------------------------------===//
 
-AnalysisID DominatorTree::ID(AnalysisID::create<DominatorTree>());
-AnalysisID DominatorTree::PostDomID(AnalysisID::create<DominatorTree>());
+AnalysisID DominatorTree::ID(AnalysisID::create<DominatorTree>(), true);
+AnalysisID DominatorTree::PostDomID(AnalysisID::create<DominatorTree>(), true);
 
 // DominatorTree::reset - Free all of the tree node memory.
 //
@@ -324,8 +324,8 @@
 //  DominanceFrontier Implementation
 //===----------------------------------------------------------------------===//
 
-AnalysisID DominanceFrontier::ID(AnalysisID::create<DominanceFrontier>());
-AnalysisID DominanceFrontier::PostDomID(AnalysisID::create<DominanceFrontier>());
+AnalysisID DominanceFrontier::ID(AnalysisID::create<DominanceFrontier>(), true);
+AnalysisID DominanceFrontier::PostDomID(AnalysisID::create<DominanceFrontier>(), true);
 
 const DominanceFrontier::DomSetType &
 DominanceFrontier::calcDomFrontier(const DominatorTree &DT,