RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Mark analyses that only depend on the CFG of a function

Browse Source 
llvm-svn: 2507
This commit is contained in:
Chris Lattner 2002-05-06 19:32:07 +00:00
parent 06c3ae573f
commit 44c4a3f18f
4 changed files with 18 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Analysis/IntervalPartition.cpp
View File

@ -10,7 +10,7 @@
using std::make_pair;
AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>());
AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>(), true);
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation

2
lib/Analysis/LoopInfo.cpp
View File

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

16
lib/Analysis/PostDominators.cpp
View File

@ -18,8 +18,8 @@ using std::set;
// 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 @@ void DominatorSet::getAnalysisUsage(AnalysisUsage &AU) const {
// 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 @@ void ImmediateDominators::calcIDoms(const DominatorSet &DS) {
// 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 @@ void DominatorTree::calculate(const DominatorSet &DS) {
// 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,

16
lib/VMCore/Dominators.cpp
View File

@ -18,8 +18,8 @@ using std::set;
// 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 @@ void DominatorSet::getAnalysisUsage(AnalysisUsage &AU) const {
// 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 @@ void ImmediateDominators::calcIDoms(const DominatorSet &DS) {
// 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 @@ void DominatorTree::calculate(const DominatorSet &DS) {
// 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,