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
|
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polly-function-scops -analyze < %s | FileCheck %s
;void f(long a[][128], long N, long M) {
; long i, j;
; for (j = 0; j < (4*N + 7*M +3); ++j)
; for (i = j; i < (5*N + 2); ++i)
; ...
;}
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"
define void @f([128 x i64]* nocapture %a, i64 %N, i64 %M) nounwind {
entry:
%0 = shl i64 %N, 2 ; <i64> [#uses=2]
%1 = mul i64 %M, 7 ; <i64> [#uses=2]
%2 = or i64 %0, 3 ; <i64> [#uses=1]
%3 = add nsw i64 %2, %1 ; <i64> [#uses=1]
%4 = icmp sgt i64 %3, 0 ; <i1> [#uses=1]
br i1 true, label %bb.nph8, label %return
bb1: ; preds = %bb2.preheader, %bb1
%indvar = phi i64 [ 0, %bb2.preheader ], [ %indvar.next, %bb1 ] ; <i64> [#uses=2]
%scevgep = getelementptr [128 x i64], [128 x i64]* %a, i64 %indvar, i64 %tmp10 ; <i64*> [#uses=1]
store i64 0, i64* %scevgep, align 8
%indvar.next = add i64 %indvar, 1 ; <i64> [#uses=2]
%exitcond = icmp sge i64 %indvar.next, %tmp9 ; <i1> [#uses=1]
br i1 %exitcond, label %bb3, label %bb1
bb3: ; preds = %bb2.preheader, %bb1
%5 = add i64 %8, 1 ; <i64> [#uses=2]
%exitcond14 = icmp sge i64 %5, %tmp13 ; <i1> [#uses=1]
br i1 %exitcond14, label %return, label %bb2.preheader
bb.nph8: ; preds = %entry
%6 = mul i64 %N, 5 ; <i64> [#uses=1]
%7 = add nsw i64 %6, 2 ; <i64> [#uses=2]
%tmp12 = add i64 %1, %0 ; <i64> [#uses=1]
%tmp13 = add i64 %tmp12, 3 ; <i64> [#uses=1]
br label %bb2.preheader
bb2.preheader: ; preds = %bb.nph8, %bb3
%8 = phi i64 [ 0, %bb.nph8 ], [ %5, %bb3 ] ; <i64> [#uses=4]
%tmp10 = mul i64 %8, 129 ; <i64> [#uses=1]
%tmp9 = sub i64 %7, %8 ; <i64> [#uses=1]
%9 = icmp sgt i64 %7, %8 ; <i1> [#uses=1]
br i1 %9, label %bb1, label %bb3
return: ; preds = %bb3, %entry
ret void
}
; CHECK: p0: %N
; CHECK-NEXT: p1: %M
;
; CHECK: Statements {
; CHECK-NEXT: Stmt_bb1
; CHECK-NEXT: Domain :=
; CHECK-NEXT: [N, M] -> { Stmt_bb1[i0, i1] : 0 <= i0 <= 2 + 4N + 7M and 0 <= i1 <= 1 + 5N - i0; Stmt_bb1[0, i1] : 7M <= -3 - 4N and 0 <= i1 <= 1 + 5N };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [N, M] -> { Stmt_bb1[i0, i1] -> [i0, i1] : i0 <= 2 + 4N + 7M; Stmt_bb1[0, i1] -> [0, i1] : 7M <= -3 - 4N };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [N, M] -> { Stmt_bb1[i0, i1] -> MemRef_a[i1, 129i0] };
; CHECK-NEXT: }
|
