RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-23 20:45:06 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use simpler test to filter loops.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41516 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel 2007-08-27 21:34:31 +00:00
parent 9bd8a566eb
commit 1cd39a4f6e
1 changed files with 3 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
lib/Transforms/Scalar/LoopIndexSplit.cpp
View File

@ -752,21 +752,10 @@ bool LoopIndexSplit::safeSplitCondition(SplitInfo &SD) {
&& (Latch == Succ0 || Latch == Succ1))
return false;
// If one of the split condition branch is post dominating other then loop
// index split is not appropriate.
if (DT->dominates(Succ0, Latch) || DT->dominates(Succ1, Latch))
// If split condition branches heads do not have single predecessor,
// SplitCondBlock, then is not possible to remove inactive branch.
if (!Succ0->getSinglePredecessor() || !Succ1->getSinglePredecessor())
return false;
// If one of the split condition branch is a predecessor of the other
// split condition branch head then do not split loop on this condition.
for(pred_iterator PI = pred_begin(Succ0), PE = pred_end(Succ0);
PI != PE; ++PI)
if (Succ1 == *PI)
return false;
for(pred_iterator PI = pred_begin(Succ1), PE = pred_end(Succ1);
PI != PE; ++PI)
if (Succ0 == *PI)
return false;
// Finally this split condition is safe only if merge point for
// split condition branch is loop latch. This check along with previous