diff options
author | Andrew Trick <atrick@apple.com> | 2011-08-10 00:28:10 +0000 |
---|---|---|
committer | Andrew Trick <atrick@apple.com> | 2011-08-10 00:28:10 +0000 |
commit | b1eede12818d91a32adac928c6fffcf6d2800dc0 (patch) | |
tree | 4070b1152a0888c9b929e2e6779b19063e6e371f /test/Transforms/LoopUnroll | |
parent | 33e57515b173baf572398fafeffcf4644c2a7381 (diff) | |
download | external_llvm-b1eede12818d91a32adac928c6fffcf6d2800dc0.zip external_llvm-b1eede12818d91a32adac928c6fffcf6d2800dc0.tar.gz external_llvm-b1eede12818d91a32adac928c6fffcf6d2800dc0.tar.bz2 |
Fix the LoopUnroller to handle nontrivial loops and partial unrolling.
These are not individual bug fixes. I had to rewrite a good chunk of
the unroller to make it sane. I think it was getting lucky on trivial
completely unrolled loops with no early exits. I included some fairly
simple unit tests for partial unrolling. I didn't do much stress
testing, so it may not be perfect, but should be usable now.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@137190 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Transforms/LoopUnroll')
-rw-r--r-- | test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll | 100 | ||||
-rw-r--r-- | test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll | 62 |
2 files changed, 162 insertions, 0 deletions
diff --git a/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll b/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll new file mode 100644 index 0000000..3353e51 --- /dev/null +++ b/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll @@ -0,0 +1,100 @@ +; RUN: opt < %s -loop-unroll -S -unroll-count=4 | FileCheck %s +; Test phi update after partial unroll. + +declare i1 @check() nounwind + +; CHECK: @test +; CHECK: if.else: +; CHECK: if.then.loopexit +; CHECK: %sub5.lcssa = phi i32 [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ] +; CHECK: if.else.3 +define void @test1(i32 %i, i32 %j) nounwind uwtable ssp { +entry: + %cond1 = call zeroext i1 @check() + br i1 %cond1, label %if.then, label %if.else.lr.ph + +if.else.lr.ph: ; preds = %entry + br label %if.else + +if.else: ; preds = %if.else, %if.else.lr.ph + %sub = phi i32 [ %i, %if.else.lr.ph ], [ %sub5, %if.else ] + %sub5 = sub i32 %sub, %j + %cond2 = call zeroext i1 @check() + br i1 %cond2, label %if.then, label %if.else + +if.then: ; preds = %if.else, %entry + %i.tr = phi i32 [ %i, %entry ], [ %sub5, %if.else ] + ret void + +} + +; PR7318: assertion failure after doing a simple loop unroll +; +; CHECK: @test2 +; CHECK: bb1.bb2_crit_edge: +; CHECK: %.lcssa = phi i32 [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ] +; CHECK: bb1.3: +define i32 @test2(i32* nocapture %p, i32 %n) nounwind readonly { +entry: + %0 = icmp sgt i32 %n, 0 ; <i1> [#uses=1] + br i1 %0, label %bb.nph, label %bb2 + +bb.nph: ; preds = %entry + %tmp = zext i32 %n to i64 ; <i64> [#uses=1] + br label %bb + +bb: ; preds = %bb.nph, %bb1 + %indvar = phi i64 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i64> [#uses=2] + %s.01 = phi i32 [ 0, %bb.nph ], [ %2, %bb1 ] ; <i32> [#uses=1] + %scevgep = getelementptr i32* %p, i64 %indvar ; <i32*> [#uses=1] + %1 = load i32* %scevgep, align 1 ; <i32> [#uses=1] + %2 = add nsw i32 %1, %s.01 ; <i32> [#uses=2] + br label %bb1 + +bb1: ; preds = %bb + %indvar.next = add i64 %indvar, 1 ; <i64> [#uses=2] + %exitcond = icmp ne i64 %indvar.next, %tmp ; <i1> [#uses=1] + br i1 %exitcond, label %bb, label %bb1.bb2_crit_edge + +bb1.bb2_crit_edge: ; preds = %bb1 + %.lcssa = phi i32 [ %2, %bb1 ] ; <i32> [#uses=1] + br label %bb2 + +bb2: ; preds = %bb1.bb2_crit_edge, %entry + %s.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ 0, %entry ] ; <i32> [#uses=1] + ret i32 %s.0.lcssa +} + +; Check phi update for loop with an early-exit. +; +; CHECK: @test3 +; CHECK: return.loopexit: +; CHECK: %tmp7.i.lcssa = phi i32 [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ] +; CHECK: exit.3: +define i32 @test3() nounwind uwtable ssp align 2 { +entry: + br i1 undef, label %return, label %if.end + +if.end: ; preds = %entry + br label %do.body + +do.body: ; preds = %do.cond, %if.end + br i1 undef, label %exit, label %do.cond + +exit: ; preds = %do.body + %tmp7.i = load i32* undef, align 8 + br i1 undef, label %do.cond, label %land.lhs.true + +land.lhs.true: ; preds = %exit + br i1 undef, label %return, label %do.cond + +do.cond: ; preds = %land.lhs.true, %exit, %do.body + br i1 undef, label %do.end, label %do.body + +do.end: ; preds = %do.cond + br label %return + +return: ; preds = %do.end, %land.lhs.true, %entry + %retval.0 = phi i32 [ 0, %do.end ], [ 0, %entry ], [ %tmp7.i, %land.lhs.true ] + ret i32 %retval.0 +} diff --git a/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll b/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll new file mode 100644 index 0000000..c1221f5 --- /dev/null +++ b/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll @@ -0,0 +1,62 @@ +; RUN: opt -S < %s -instcombine -inline -jump-threading -loop-unroll -unroll-count=4 | FileCheck %s +; +; This is a test case that required a number of setup passes because +; it depends on block order. + +target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64" +target triple = "x86_64-apple-macosx10.6.8" + +declare i1 @check() nounwind +declare i32 @getval() nounwind + +; Check that the loop exit merges values from all the iterations. This +; could be a tad fragile, but it's a good test. +; +; CHECK: @foo +; CHECK: return: +; CHECK: %retval.0 = phi i32 [ %tmp7.i, %land.lhs.true ], [ 0, %do.cond ], [ %tmp7.i.1, %land.lhs.true.1 ], [ 0, %do.cond.1 ], [ %tmp7.i.2, %land.lhs.true.2 ], [ 0, %do.cond.2 ], [ %tmp7.i.3, %land.lhs.true.3 ], [ 0, %do.cond.3 ] +; CHECK-NOT: @bar +; CHECK: bar.exit.3 +define i32 @foo() uwtable ssp align 2 { +entry: + br i1 undef, label %return, label %if.end + +if.end: ; preds = %entry + %call2 = call i32 @getval() + br label %do.body + +do.body: ; preds = %do.cond, %if.end + %call6 = call i32 @bar() + %cmp = icmp ne i32 %call6, 0 + br i1 %cmp, label %land.lhs.true, label %do.cond + +land.lhs.true: ; preds = %do.body + %call10 = call i32 @getval() + %cmp11 = icmp eq i32 0, %call10 + br i1 %cmp11, label %return, label %do.cond + +do.cond: ; preds = %land.lhs.true, %do.body + %cmp18 = icmp sle i32 0, %call2 + br i1 %cmp18, label %do.body, label %return + +return: ; preds = %do.cond, %land.lhs.true, %entry + %retval.0 = phi i32 [ 0, %entry ], [ %call6, %land.lhs.true ], [ 0, %do.cond ] + ret i32 %retval.0 +} + +define linkonce_odr i32 @bar() nounwind uwtable ssp align 2 { +entry: + br i1 undef, label %land.lhs.true, label %cond.end + +land.lhs.true: ; preds = %entry + %cmp4 = call zeroext i1 @check() + br i1 %cmp4, label %cond.true, label %cond.end + +cond.true: ; preds = %land.lhs.true + %tmp7 = call i32 @getval() + br label %cond.end + +cond.end: ; preds = %cond.true, %land.lhs.true, %entry + %cond = phi i32 [ %tmp7, %cond.true ], [ 0, %land.lhs.true ], [ 0, %entry ] + ret i32 %cond +} |