maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/DeadCodeElimination/chained_iterations.ll

62 lines
2.1 KiB
LLVM
Raw Normal View History

tests: Drop -polly-detect-unprofitable and -polly-no-early-exit These flags are now always passed to all tests and need to be disabled if not needed. Disabling these flags, rather than passing them to almost all tests, significantly simplfies our RUN: lines. llvm-svn: 249422
2015-10-06 23:36:44 +08:00
; 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
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
2014-02-21 05:43:54 +08:00
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"
;
; 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 ]
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx.1 = getelementptr [200 x i32], [200 x i32]* %A, i64 0, i64 %indvar.1
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
2014-02-21 05:43:54 +08:00
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 ]
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx.2 = getelementptr [200 x i32], [200 x i32]* %A, i64 0, i64 %indvar.2
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
2014-02-21 05:43:54 +08:00
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 ]
Update Polly tests to handle explicitly typed gep changes in LLVM llvm-svn: 230784
2015-02-28 03:20:19 +08:00
%arrayidx.3 = getelementptr [200 x i32], [200 x i32]* %A, i64 0, i64 %indvar.3
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
2014-02-21 05:43:54 +08:00
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
}
Use schedule trees to represent execution order of statements Instead of flat schedules, we now use so-called schedule trees to represent the execution order of the statements in a SCoP. Schedule trees make it a lot easier to analyze, understand and modify properties of a schedule, as specific nodes in the tree can be choosen and possibly replaced. This patch does not yet fully move our DependenceInfo pass to schedule trees, as some additional performance analysis is needed here. (In general schedule trees should be faster in compile-time, as the more structured representation is generally easier to analyze and work with). We also can not yet perform the reduction analysis on schedule trees. For more information regarding schedule trees, please see Section 6 of https://lirias.kuleuven.be/handle/123456789/497238 llvm-svn: 242130
2015-07-14 17:33:13 +08:00
; CHECK: for (int c0 = 0; c0 <= 199; c0 += 1)
; CHECK: Stmt_for_body_1(c0);
; CHECK: for (int c0 = 0; c0 <= 199; c0 += 1)
; CHECK: Stmt_for_body_2(c0);
; CHECK: for (int c0 = 0; c0 <= 199; c0 += 1)
; CHECK: Stmt_for_body_3(c0);
; CHECK-DCE: for (int c0 = 0; c0 <= 199; c0 += 1)
; CHECK-DCE: Stmt_for_body_3(c0);
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
2014-02-21 05:43:54 +08:00