diff options
| author | Tobias Grosser <tobias@grosser.es> | 2014-02-20 21:43:54 +0000 |
|---|---|---|
| committer | Tobias Grosser <tobias@grosser.es> | 2014-02-20 21:43:54 +0000 |
| commit | 37eb422f69e22490396a45cc65de93ccc75ffa2d (patch) | |
| tree | 6371d4ce7bdacea7b4fafddcfa6a3fbb4c9be7ca /polly/test/DeadCodeElimination | |
| parent | 3fc9154c40ad929ae0fbc26c79890e19cebb7a85 (diff) | |
| download | bcm5719-llvm-37eb422f69e22490396a45cc65de93ccc75ffa2d.tar.gz bcm5719-llvm-37eb422f69e22490396a45cc65de93ccc75ffa2d.zip | |
Add polyhedral dead code elimination.
This pass eliminates loop iterations that compute results that are not used
later on. This can help e.g. in D, where the default zero-initialization is
often unnecessary if right after new values are assigned to an array.
Contributed-by: Peter Conn <conn.peter@gmail.com>
llvm-svn: 201817
Diffstat (limited to 'polly/test/DeadCodeElimination')
4 files changed, 275 insertions, 0 deletions
diff --git a/polly/test/DeadCodeElimination/chained_iterations.ll b/polly/test/DeadCodeElimination/chained_iterations.ll new file mode 100644 index 00000000000..5df2a593894 --- /dev/null +++ b/polly/test/DeadCodeElimination/chained_iterations.ll @@ -0,0 +1,62 @@ +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-ast -analyze < %s | FileCheck %s +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-dce -polly-ast -analyze < %s | FileCheck %s -check-prefix=CHECK-DCE +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-pc-linux-gnu" +; +; for(i = 0; i < 200; i++ ) +; A[i] = 2; +; +; for (i = 0; i < 200; i++ ) +; A[i] = 5; +; +; for (i = 0; i < 200; i++ ) +; A[i] = 5; +define void @main() nounwind uwtable { +entry: + %A = alloca [200 x i32], align 16 + br label %for.body.1 + +for.body.1: + %indvar.1 = phi i64 [ 0, %entry ], [ %indvar.next.1, %for.body.1 ] + %arrayidx.1 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.1 + store i32 2, i32* %arrayidx.1, align 4 + %indvar.next.1 = add i64 %indvar.1, 1 + %exitcond.1 = icmp ne i64 %indvar.next.1, 200 + br i1 %exitcond.1, label %for.body.1, label %exit.1 + +exit.1: + br label %for.body.2 + +for.body.2: + %indvar.2 = phi i64 [ 0, %exit.1 ], [ %indvar.next.2, %for.body.2 ] + %arrayidx.2 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.2 + store i32 5, i32* %arrayidx.2, align 4 + %indvar.next.2 = add i64 %indvar.2, 1 + %exitcond.2 = icmp ne i64 %indvar.next.2, 200 + br i1 %exitcond.2, label %for.body.2, label %exit.2 + +exit.2: + br label %for.body.3 + +for.body.3: + %indvar.3 = phi i64 [ 0, %exit.2 ], [ %indvar.next.3, %for.body.3 ] + %arrayidx.3 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.3 + store i32 7, i32* %arrayidx.3, align 4 + %indvar.next.3 = add i64 %indvar.3, 1 + %exitcond.3 = icmp ne i64 %indvar.next.3, 200 + br i1 %exitcond.3, label %for.body.3 , label %exit.3 + +exit.3: + ret void +} + +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_1(c1); +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_2(c1); +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_3(c1); + +; CHECK-DCE: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK-DCE: Stmt_for_body_3(c1); + diff --git a/polly/test/DeadCodeElimination/chained_iterations_2.ll b/polly/test/DeadCodeElimination/chained_iterations_2.ll new file mode 100644 index 00000000000..5c84057601a --- /dev/null +++ b/polly/test/DeadCodeElimination/chained_iterations_2.ll @@ -0,0 +1,66 @@ +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-ast -analyze < %s | FileCheck %s +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-dce -polly-ast -analyze < %s | FileCheck %s -check-prefix=CHECK-DCE +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-pc-linux-gnu" +; +; for(i = 0; i < 200; i++ ) +; A[i] = 2; +; +; for (i = 0; i < 200; i++ ) +; B[i] = A[i]; +; +; for (i = 0; i < 200; i++ ) +; B[i] = A[i] = 5; +define void @main() nounwind uwtable { +entry: + %A = alloca [200 x i32], align 16 + %B = alloca [200 x i32], align 16 + br label %for.body.1 + +for.body.1: + %indvar.1 = phi i64 [ 0, %entry ], [ %indvar.next.1, %for.body.1 ] + %arrayidx.1 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.1 + store i32 2, i32* %arrayidx.1, align 4 + %indvar.next.1 = add i64 %indvar.1, 1 + %exitcond.1 = icmp ne i64 %indvar.next.1, 200 + br i1 %exitcond.1, label %for.body.1, label %exit.1 + +exit.1: + br label %for.body.2 + +for.body.2: + %indvar.2 = phi i64 [ 0, %exit.1 ], [ %indvar.next.2, %for.body.2 ] + %arrayidx.2.a = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.2 + %val = load i32* %arrayidx.2.a, align 4 + %arrayidx.2.b = getelementptr [200 x i32]* %B, i64 0, i64 %indvar.2 + store i32 %val, i32* %arrayidx.2.b, align 4 + %indvar.next.2 = add i64 %indvar.2, 1 + %exitcond.2 = icmp ne i64 %indvar.next.2, 200 + br i1 %exitcond.2, label %for.body.2, label %exit.2 + +exit.2: + br label %for.body.3 + +for.body.3: + %indvar.3 = phi i64 [ 0, %exit.2 ], [ %indvar.next.3, %for.body.3 ] + %arrayidx.3.a = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.3 + %arrayidx.3.b = getelementptr [200 x i32]* %B, i64 0, i64 %indvar.3 + store i32 5, i32* %arrayidx.3.a, align 4 + store i32 5, i32* %arrayidx.3.b, align 4 + %indvar.next.3 = add i64 %indvar.3, 1 + %exitcond.3 = icmp ne i64 %indvar.next.3, 200 + br i1 %exitcond.3, label %for.body.3 , label %exit.3 + +exit.3: + ret void +} + +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_1(c1); +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_2(c1); +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_3(c1); + +; CHECK-DCE: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK-DCE: Stmt_for_body_3(c1); diff --git a/polly/test/DeadCodeElimination/dead_iteration_elimination.ll b/polly/test/DeadCodeElimination/dead_iteration_elimination.ll new file mode 100644 index 00000000000..c32899c607e --- /dev/null +++ b/polly/test/DeadCodeElimination/dead_iteration_elimination.ll @@ -0,0 +1,90 @@ +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-ast -analyze < %s | FileCheck %s +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-dce-precision=full -polly-dce -polly-ast -analyze < %s | FileCheck %s -check-prefix=CHECK-DCE +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-pc-linux-gnu" +; +; for(i = 0; i < 200; i++ ) +; A[i] = 2; +; +; for (i = 0; i < 50; i++ ) +; A[i] = 5; +; +; for (i = 0; i < 70; i++ ) +; A[i] = A[i] + 5; +; +; for (i = 100; i < 110; i++ ) +; A[i] = i; +; +define void @main() nounwind uwtable { +entry: + %A = alloca [200 x i32], align 16 + br label %for.body.1 + +for.body.1: + %indvar.1 = phi i64 [ 0, %entry ], [ %indvar.next.1, %for.body.1 ] + %arrayidx.1 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.1 + store i32 2, i32* %arrayidx.1, align 4 + %indvar.next.1 = add i64 %indvar.1, 1 + %exitcond.1 = icmp ne i64 %indvar.next.1, 200 + br i1 %exitcond.1, label %for.body.1, label %exit.1 + +exit.1: + br label %for.body.2 + +for.body.2: + %indvar.2 = phi i64 [ 0, %exit.1 ], [ %indvar.next.2, %for.body.2 ] + %arrayidx.2 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.2 + store i32 5, i32* %arrayidx.2, align 4 + %indvar.next.2 = add i64 %indvar.2, 1 + %exitcond.2 = icmp ne i64 %indvar.next.2, 50 + br i1 %exitcond.2, label %for.body.2, label %exit.2 + +exit.2: + br label %for.body.3 + +for.body.3: + %indvar.3 = phi i64 [ 0, %exit.2 ], [ %indvar.next.3, %for.body.3 ] + %arrayidx.3 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.3 + %val = load i32* %arrayidx.3, align 4 + %add = add nsw i32 %val, 5 + store i32 %add, i32* %arrayidx.3, align 4 + %indvar.next.3 = add i64 %indvar.3, 1 + %exitcond.3 = icmp ne i64 %indvar.next.3, 70 + br i1 %exitcond.3, label %for.body.3 , label %exit.3 + +exit.3: + br label %for.body.4 + +for.body.4: + %indvar.4 = phi i64 [ 0, %exit.3 ], [ %indvar.next.4, %for.body.4 ] + %indvar.plus = add i64 %indvar.4, 100 + %trunc = trunc i64 %indvar.plus to i32 + %arrayidx.4 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.plus + store i32 %trunc, i32* %arrayidx.4, align 4 + %indvar.next.4 = add i64 %indvar.4, 1 + %exitcond.4 = icmp ne i64 %indvar.next.4, 10 + br i1 %exitcond.4, label %for.body.4, label %exit.4 + +exit.4: + ret void +} + +; CHECK: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK: Stmt_for_body_1(c1); +; CHECK: for (int c1 = 0; c1 <= 49; c1 += 1) +; CHECK: Stmt_for_body_2(c1); +; CHECK: for (int c1 = 0; c1 <= 69; c1 += 1) +; CHECK: Stmt_for_body_3(c1); +; CHECK: for (int c1 = 0; c1 <= 9; c1 += 1) +; CHECK: Stmt_for_body_4(c1); + +; CHECK-DCE: for (int c1 = 50; c1 <= 99; c1 += 1) +; CHECK-DCE: Stmt_for_body_1(c1); +; CHECK-DCE: for (int c1 = 110; c1 <= 199; c1 += 1) +; CHECK-DCE: Stmt_for_body_1(c1); +; CHECK-DCE: for (int c1 = 0; c1 <= 49; c1 += 1) +; CHECK-DCE: Stmt_for_body_2(c1); +; CHECK-DCE: for (int c1 = 0; c1 <= 69; c1 += 1) +; CHECK-DCE: Stmt_for_body_3(c1); +; CHECK-DCE: for (int c1 = 0; c1 <= 9; c1 += 1) +; CHECK-DCE: Stmt_for_body_4(c1); diff --git a/polly/test/DeadCodeElimination/null_schedule.ll b/polly/test/DeadCodeElimination/null_schedule.ll new file mode 100644 index 00000000000..106eac2b89a --- /dev/null +++ b/polly/test/DeadCodeElimination/null_schedule.ll @@ -0,0 +1,57 @@ +; RUN: opt -S %loadPolly -basicaa -polly-dependences-analysis-type=value-based -polly-dce -polly-ast -analyze < %s | FileCheck %s -check-prefix=CHECK-DCE +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-pc-linux-gnu" +; A[0] = 1; +; +; for(i = 0; i < 100; i++ ) +; A[i+1] = A[i] * 2; +; +; for (i = 0; i < 200; i++ ) +; A[i] = B[i] * 2; + +define void @main() nounwind uwtable { + +entry: + %A = alloca [200 x i32], align 16 + %B = alloca [200 x i32], align 16 + + %A.zero = getelementptr [200 x i32]* %A, i64 0, i64 0 + store i32 1, i32* %A.zero, align 4 + + br label %for.body.1 + +for.body.1: + %indvar.1 = phi i64 [ 0, %entry ], [ %indvar.next.1, %for.body.1 ] + %indvar.next.1 = add i64 %indvar.1, 1 + + %A.current.1 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.1 + %val1.1 = load i32* %A.current.1, align 4 + %val2.1 = mul i32 %val1.1, 2 + %A.next.1 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.next.1 + store i32 %val2.1, i32* %A.next.1, align 4 + + %exitcond.1 = icmp ne i64 %indvar.next.1, 100 + br i1 %exitcond.1, label %for.body.1, label %exit.1 + +exit.1: + br label %for.body.2 + +for.body.2: + %indvar.2 = phi i64 [ 0, %exit.1 ], [ %indvar.next.2, %for.body.2 ] + + %B.current.2 = getelementptr [200 x i32]* %B, i64 0, i64 %indvar.2 + %val1.2 = load i32* %B.current.2, align 4 + %val2.2 = mul i32 %val1.2, 2 + %A.current.2 = getelementptr [200 x i32]* %A, i64 0, i64 %indvar.2 + store i32 %val2.2, i32* %A.current.2, align 4 + + %indvar.next.2 = add i64 %indvar.2, 1 + %exitcond.2 = icmp ne i64 %indvar.next.2, 200 + br i1 %exitcond.2, label %for.body.2, label %exit.3 + +exit.3: + ret void +} + +; CHECK-DCE: for (int c1 = 0; c1 <= 199; c1 += 1) +; CHECK-DCE: Stmt_for_body_2(c1); |

