1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
; RUN: opt %loadNPMPolly '-passes=print<polly-function-scops>' -disable-output \
; RUN: -polly-invariant-load-hoisting < %s 2>&1 | FileCheck %s
; CHECK: Invariant Accesses: {
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [val] -> { Stmt_next[] -> MemRef_ptr[0] };
; CHECK-NEXT: Execution Context: [val] -> { : }
; CHECK-NEXT: }
; CHECK: Statements {
; CHECK-NEXT: Stmt_a
; CHECK-NEXT: Domain :=
; CHECK-NEXT: [val] -> { Stmt_a[] : val = -1 };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [val] -> { Stmt_a[] -> [1, 0] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [val] -> { Stmt_a[] -> MemRef_X[0] };
; CHECK-NEXT: Stmt_loop
; CHECK-NEXT: Domain :=
; CHECK-NEXT: [val] -> { Stmt_loop[i0] : val = 0 and 0 <= i0 <= 1025 };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [val] -> { Stmt_loop[i0] -> [0, i0] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [val] -> { Stmt_loop[i0] -> MemRef_X[0] };
; CHECK-NEXT: }
define void @foo(ptr %ptr, ptr %X) {
entry:
br label %next
next:
%val = load i1, ptr %ptr
br i1 %val, label %a, label %loop
a:
store float 1.0, ptr %X
br label %merge
loop:
%indvar = phi i64 [0, %next], [%indvar.next, %loop]
store float 1.0, ptr %X
%indvar.next = add nsw i64 %indvar, 1
%cmp = icmp sle i64 %indvar, 1024
br i1 %cmp, label %loop, label %merge
merge:
br label %exit
exit:
ret void
}
|
