maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Correlated Exprs pass now requires BCE pass instead of doing it manually 

llvm-svn: 3908
This commit is contained in:
Chris Lattner 2002-09-24 15:43:56 +00:00
parent 4bec665b09
commit b4e7e22be3
1 changed files with 1 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp
View File

@ -204,9 +204,9 @@ namespace {
// We don't modify the program, so we preserve all analyses // We don't modify the program, so we preserve all analyses
virtual void getAnalysisUsage(AnalysisUsage &AU) const { virtual void getAnalysisUsage(AnalysisUsage &AU) const {
//AU.preservesCFG();
AU.addRequired<DominatorSet>(); AU.addRequired<DominatorSet>();
AU.addRequired<DominatorTree>(); AU.addRequired<DominatorTree>();
AU.addRequiredID(BreakCriticalEdgesID);
}; };
// print - Implement the standard print form to print out analysis // print - Implement the standard print form to print out analysis
@ -307,25 +307,6 @@ bool CEE::TransformRegion(BasicBlock *BB, std::set<BasicBlock*> &VisitedBlocks){
// Get the terminator of this basic block... // Get the terminator of this basic block...
TerminatorInst *TI = BB->getTerminator(); TerminatorInst *TI = BB->getTerminator();
// If this is a conditional branch, make sure that there is a branch target
// for each successor that can hold any information gleaned from the branch,
// by breaking any critical edges that may be laying about.
//
if (TI->getNumSuccessors() > 1) {
// If any of the successors has multiple incoming branches, add a new dummy
// destination branch that only contains an unconditional branch to the real
// target.
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
BasicBlock *Succ = TI->getSuccessor(i);
// If there is more than one predecessor of the destination block, break
// this critical edge by inserting a new block. This updates dominatorset
// and dominatortree information.
//
if (isCriticalEdge(TI, i))
SplitCriticalEdge(TI, i, this);
}
}
// Loop over all of the blocks that this block is the immediate dominator for. // Loop over all of the blocks that this block is the immediate dominator for.
// Because all information known in this region is also known in all of the // Because all information known in this region is also known in all of the
// blocks that are dominated by this one, we can safely propogate the // blocks that are dominated by this one, we can safely propogate the