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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
; RUN: opt %loadPolly -polly-print-optree -disable-output < %s | FileCheck %s -match-full-lines
;
; Synthesizable values defined outside of a loop can be used
; inside the loop.
;
; for (int j = 0; j < n; j += 1) {
; bodyA:
; double val = j;
;
; for (int i = 0; i < n; i += 1) {
; bodyB:
; A[0] = val;
; }
; }
;
define void @func(i32 %n, ptr noalias nonnull %A) {
entry:
br label %for
for:
%j = phi i32 [0, %entry], [%j.inc, %inc]
%j.cmp = icmp slt i32 %j, %n
br i1 %j.cmp, label %bodyA, label %exit
bodyA:
%val = sitofp i32 %j to double
br label %inner.for
inner.for:
%i = phi i32 [0, %bodyA], [%i.inc, %inner.inc]
%i.cmp = icmp slt i32 %i, %n
br i1 %i.cmp, label %bodyB, label %inner.exit
bodyB:
store double %val, ptr %A
br label %inner.inc
inner.inc:
%i.inc = add nuw nsw i32 %i, 1
br label %inner.for
inner.exit:
br label %inc
inc:
%j.inc = add nuw nsw i32 %j, 1
br label %for
exit:
br label %return
return:
ret void
}
; CHECK: Statistics {
; CHECK: Instructions copied: 1
; CHECK: Operand trees forwarded: 1
; CHECK: Statements with forwarded operand trees: 1
; CHECK: }
; CHECK: After statements {
; CHECK-NEXT: Stmt_bodyA
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
; CHECK-NEXT: [n] -> { Stmt_bodyA[i0] -> MemRef_val[] };
; CHECK-NEXT: Instructions {
; CHECK-NEXT: %val = sitofp i32 %j to double
; CHECK-NEXT: }
; CHECK-NEXT: Stmt_bodyB
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [n] -> { Stmt_bodyB[i0, i1] -> MemRef_A[0] };
; CHECK-NEXT: Instructions {
; CHECK-NEXT: %val = sitofp i32 %j to double
; CHECK-NEXT: store double %val, ptr %A, align 8
; CHECK-NEXT: }
; CHECK-NEXT: }
|
