llvm-project/polly/test/ScopInfo/two-loops-right-after-each-...

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

57 lines
1.9 KiB
LLVM
Raw Normal View History

; RUN: opt %loadPolly -polly-scops -analyze \
; RUN: < %s | FileCheck %s
; CHECK: Statements {
; CHECK-NEXT: Stmt_loop_1
; CHECK-NEXT: Domain :=
2016-01-15 23:54:45 +08:00
; CHECK-NEXT: [N] -> { Stmt_loop_1[i0] : N <= 100 and 0 <= i0 <= 101 };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [N] -> { Stmt_loop_1[i0] -> [0, i0] };
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [N] -> { Stmt_loop_1[i0] -> MemRef_A[0] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [N] -> { Stmt_loop_1[i0] -> MemRef_A[0] };
; CHECK-NEXT: Stmt_loop_2
; CHECK-NEXT: Domain :=
2016-01-15 23:54:45 +08:00
; CHECK-NEXT: [N] -> { Stmt_loop_2[i0] : N <= 100 and 0 <= i0 <= 301 };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [N] -> { Stmt_loop_2[i0] -> [1, i0] };
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [N] -> { Stmt_loop_2[i0] -> MemRef_A[0] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [N] -> { Stmt_loop_2[i0] -> MemRef_A[0] };
; CHECK-NEXT: }
define void @foo(float* %A, i64 %N) {
entry:
br label %branch
branch:
%cond = icmp sle i64 %N, 100
br i1 %cond, label %loop.1, label %merge
loop.1:
%indvar.1 = phi i64 [0, %branch], [%indvar.next.1, %loop.1]
%indvar.next.1 = add i64 %indvar.1, 1
%val.1 = load float, float* %A
%sum.1 = fadd float %val.1, 1.0
store float %sum.1, float* %A
%cond.1 = icmp sle i64 %indvar.1, 100
br i1 %cond.1, label %loop.1, label %loop.2
loop.2:
%indvar.2 = phi i64 [0, %loop.1], [%indvar.next.2, %loop.2]
%indvar.next.2 = add i64 %indvar.2, 1
%val.2 = load float, float* %A
%sum.2 = fadd float %val.2, 1.0
store float %sum.2, float* %A
%cond.2 = icmp sle i64 %indvar.2, 300
br i1 %cond.2, label %loop.2, label %merge
merge:
br label %exit
exit:
ret void
}