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 %loadPolly -polly-reschedule=0 -polly-loopfusion-greedy=1 -polly-postopts=0 -polly-print-opt-isl -disable-output < %s | FileCheck %s
; RUN: opt %loadPolly -polly-reschedule=1 -polly-loopfusion-greedy=1 -polly-postopts=0 -polly-print-opt-isl -disable-output < %s | FileCheck %s
; This could theoretically be fused by adjusting the offset of the second loop by %k (instead of relying on schedule dimensions).
define void @func(i32 %n, ptr noalias nonnull %A, i32 %k) {
entry:
br label %for1
for1:
%j1 = phi i32 [0, %entry], [%j1.inc, %inc1]
%j1.cmp = icmp slt i32 %j1, %n
br i1 %j1.cmp, label %body1, label %exit1
body1:
%arrayidx1 = getelementptr inbounds double, ptr %A, i32 %j1
store double 21.0, ptr %arrayidx1
br label %inc1
inc1:
%j1.inc = add nuw nsw i32 %j1, 1
br label %for1
exit1:
br label %for2
for2:
%j2 = phi i32 [0, %exit1], [%j2.inc, %inc2]
%j2.cmp = icmp slt i32 %j2, %n
br i1 %j2.cmp, label %body2, label %exit2
body2:
%idx2 = add i32 %j2, %k
%arrayidx2 = getelementptr inbounds double, ptr %A, i32 %idx2
store double 42.0, ptr %arrayidx2
br label %inc2
inc2:
%j2.inc = add nuw nsw i32 %j2, 1
br label %for2
exit2:
br label %return
return:
ret void
}
; CHECK: Calculated schedule:
; CHECK-NEXT: n/a
|
