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

Achieve what the incorrect test was trying to do by simply requiring that all 

critical edges be split before we begin.

llvm-svn: 37949
This commit is contained in:
Owen Anderson 2007-07-06 18:12:36 +00:00
parent bcdd7ec4c9
commit 3c3dd902ec
1 changed files with 1 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
llvm/lib/Transforms/Scalar/GVNPRE.cpp
View File

@ -568,6 +568,7 @@ namespace {
// This transformation requires dominator postdominator info
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesCFG();
AU.addRequiredID(BreakCriticalEdgesID);
AU.addRequired<UnifyFunctionExitNodes>();
AU.addRequired<DominatorTree>();
}
@ -1761,12 +1762,6 @@ bool GVNPRE::runOnFunction(Function &F) {
// This phase calculates the AVAIL_OUT and ANTIC_IN sets
buildsets(F);
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI) {
DOUT << "ANTIC_IN: " << FI->getName() << "\n";
dump(anticipatedIn[FI]);
DOUT << "\n\n";
}
// Phase 2: Insert
// This phase inserts values to make partially redundant values
// fully redundant