a43ba2d84f
Splitting basic blocks into multiple statements if there are now additional scalar dependencies gives more freedom to the scheduler, but more statements also means higher compile-time complexity. Switch to finer statement granularity, the additional compile time should be limited by the number of operations quota. The regression tests are written for the -polly-stmt-granularity=bb setting, therefore we add that flag to those tests that break with the new default. Some of the tests only fail because the statements are named differently due to a basic block resulting in multiple statements, but which are removed during simplification of statements without side-effects. Previous commits tried to reduce this effect, but it is not completely avoidable. Differential Revision: https://reviews.llvm.org/D42151 llvm-svn: 324169
62 lines
1.9 KiB
LLVM
62 lines
1.9 KiB
LLVM
; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-scops -analyze < %s | FileCheck %s
|
|
|
|
declare void @bar()
|
|
|
|
define void @foo(float* %A, i64 %p) {
|
|
start:
|
|
br label %next
|
|
|
|
next:
|
|
%cmpA = icmp sle i64 %p, 0
|
|
br i1 %cmpA, label %error, label %ok
|
|
|
|
error:
|
|
call void @bar()
|
|
br label %merge
|
|
|
|
ok:
|
|
br label %merge
|
|
|
|
merge:
|
|
%phi = phi i64 [0, %error], [1, %ok]
|
|
store float 42.0, float* %A
|
|
%cmp = icmp eq i64 %phi, %p
|
|
br i1 %cmp, label %loop, label %exit
|
|
|
|
loop:
|
|
%indvar = phi i64 [0, %merge], [%indvar.next, %loop]
|
|
store float 42.0, float* %A
|
|
%indvar.next = add i64 %indvar, 1
|
|
%cmp2 = icmp sle i64 %indvar, 1024
|
|
br i1 %cmp2, label %loop, label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; CHECK: Statements {
|
|
; CHECK-NEXT: Stmt_ok
|
|
; CHECK-NEXT: Domain :=
|
|
; CHECK-NEXT: [p] -> { Stmt_ok[] : p > 0 };
|
|
; CHECK-NEXT: Schedule :=
|
|
; CHECK-NEXT: [p] -> { Stmt_ok[] -> [0, 0] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: [p] -> { Stmt_ok[] -> MemRef_phi__phi[] };
|
|
; CHECK-NEXT: Stmt_merge
|
|
; CHECK-NEXT: Domain :=
|
|
; CHECK-NEXT: [p] -> { Stmt_merge[] };
|
|
; CHECK-NEXT: Schedule :=
|
|
; CHECK-NEXT: [p] -> { Stmt_merge[] -> [1, 0] };
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
|
|
; CHECK-NEXT: [p] -> { Stmt_merge[] -> MemRef_phi__phi[] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
; CHECK-NEXT: [p] -> { Stmt_merge[] -> MemRef_A[0] };
|
|
; CHECK-NEXT: Stmt_loop
|
|
; CHECK-NEXT: Domain :=
|
|
; CHECK-NEXT: [p] -> { Stmt_loop[i0] : p = 1 and 0 <= i0 <= 1025 };
|
|
; CHECK-NEXT: Schedule :=
|
|
; CHECK-NEXT: [p] -> { Stmt_loop[i0] -> [2, i0] };
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
; CHECK-NEXT: [p] -> { Stmt_loop[i0] -> MemRef_A[0] };
|
|
; CHECK-NEXT: }
|