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

Revert previous patch until I get a bug fixed

Browse Source 
llvm-svn: 14853
This commit is contained in:
Chris Lattner 2004-07-15 05:36:31 +00:00
parent 525a4d1e7e
commit fde0e6bb95
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
lib/Transforms/Scalar/LoopSimplify.cpp
View File

@ -147,9 +147,6 @@ bool LoopSimplify::ProcessLoop(Loop *L) {
Changed = true; Changed = true;
} }
DominatorSet &DS = getAnalysis<DominatorSet>(); // Update dominator info
// Next, check to make sure that all exit nodes of the loop only have // Next, check to make sure that all exit nodes of the loop only have
// predecessors that are inside of the loop. This check guarantees that the // predecessors that are inside of the loop. This check guarantees that the
// loop preheader/header will dominate the exit blocks. If the exit block has // loop preheader/header will dominate the exit blocks. If the exit block has
@ -158,16 +155,19 @@ bool LoopSimplify::ProcessLoop(Loop *L) {
L->getExitBlocks(ExitBlocks); L->getExitBlocks(ExitBlocks);
for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) { for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
BasicBlock *ExitBlock = ExitBlocks[i]; BasicBlock *ExitBlock = ExitBlocks[i];
if (!DS.dominates(L->getHeader(), ExitBlock)) { for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock);
BasicBlock *NewBB = RewriteLoopExitBlock(L, ExitBlock); PI != PE; ++PI)
for (unsigned j = i; j != ExitBlocks.size(); ++j) if (!L->contains(*PI)) {
if (ExitBlocks[j] == ExitBlock) BasicBlock *NewBB = RewriteLoopExitBlock(L, ExitBlock);
ExitBlocks[j] = NewBB; for (unsigned j = i; j != ExitBlocks.size(); ++j)
if (ExitBlocks[j] == ExitBlock)
NumInserted++; ExitBlocks[j] = NewBB;
Changed = true;
NumInserted++;
Changed = true;
break;
}
} }
}
// If the header has more than two predecessors at this point (from the // If the header has more than two predecessors at this point (from the
// preheader and from multiple backedges), we must adjust the loop. // preheader and from multiple backedges), we must adjust the loop.