diff options
author | Dan Gohman <gohman@apple.com> | 2009-02-16 00:56:15 +0000 |
---|---|---|
committer | Dan Gohman <gohman@apple.com> | 2009-02-16 00:56:15 +0000 |
commit | 74786c0f4360db7547f8a12980260b5b7a441627 (patch) | |
tree | b6c70648223bc2e9f62a6c4f33748f7c7d05b4da /test/Transforms/IndVarSimplify/tripcount_compute.ll | |
parent | 926b0a27b9adf79b89042785b8496cced5a49883 (diff) | |
download | external_llvm-74786c0f4360db7547f8a12980260b5b7a441627.zip external_llvm-74786c0f4360db7547f8a12980260b5b7a441627.tar.gz external_llvm-74786c0f4360db7547f8a12980260b5b7a441627.tar.bz2 |
Rename IndVarsSimplify to IndVarSimplify, to be consistent with
the name used in the code that these tests are for.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@64624 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Transforms/IndVarSimplify/tripcount_compute.ll')
-rw-r--r-- | test/Transforms/IndVarSimplify/tripcount_compute.ll | 100 |
1 files changed, 100 insertions, 0 deletions
diff --git a/test/Transforms/IndVarSimplify/tripcount_compute.ll b/test/Transforms/IndVarSimplify/tripcount_compute.ll new file mode 100644 index 0000000..9ffce81 --- /dev/null +++ b/test/Transforms/IndVarSimplify/tripcount_compute.ll @@ -0,0 +1,100 @@ +; These tests ensure that we can compute the trip count of various forms of +; loops. If the trip count of the loop is computable, then we will know what +; the exit value of the loop will be for some value, allowing us to substitute +; it directly into users outside of the loop, making the loop dead. +; +; RUN: llvm-as < %s | opt -indvars -loop-deletion -simplifycfg | llvm-dis | not grep br + +define i32 @linear_setne() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3] + %i.next = add i32 %i, 1 ; <i32> [#uses=1] + %c = icmp ne i32 %i, 100 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + ret i32 %i +} + +define i32 @linear_setne_2() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3] + %i.next = add i32 %i, 2 ; <i32> [#uses=1] + %c = icmp ne i32 %i, 100 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + ret i32 %i +} + +define i32 @linear_setne_overflow() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 1024, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3] + %i.next = add i32 %i, 1024 ; <i32> [#uses=1] + %c = icmp ne i32 %i, 0 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + ret i32 %i +} + +define i32 @linear_setlt() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3] + %i.next = add i32 %i, 1 ; <i32> [#uses=1] + %c = icmp slt i32 %i, 100 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + ret i32 %i +} + +define i32 @quadratic_setlt() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 7, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4] + %i.next = add i32 %i, 3 ; <i32> [#uses=1] + %i2 = mul i32 %i, %i ; <i32> [#uses=1] + %c = icmp slt i32 %i2, 1000 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + ret i32 %i +} + +define i32 @chained() { +entry: + br label %loop + +loop: ; preds = %loop, %entry + %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3] + %i.next = add i32 %i, 1 ; <i32> [#uses=1] + %c = icmp ne i32 %i, 100 ; <i1> [#uses=1] + br i1 %c, label %loop, label %loopexit + +loopexit: ; preds = %loop + br label %loop2 + +loop2: ; preds = %loop2, %loopexit + %j = phi i32 [ %i, %loopexit ], [ %j.next, %loop2 ] ; <i32> [#uses=3] + %j.next = add i32 %j, 1 ; <i32> [#uses=1] + %c2 = icmp ne i32 %j, 200 ; <i1> [#uses=1] + br i1 %c2, label %loop2, label %loopexit2 + +loopexit2: ; preds = %loop2 + ret i32 %j +} |