1; RUN: opt %loadPolly -polly-scops -analyze -polly-delinearize < %s | FileCheck %s
2target 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-n8:16:32:64-S128"
3
4; void foo(long n, long m, long o, double A[n][m][o]) {
5;
6;   for (long i = 0; i < 100; i++)
7;     for (long j = 0; j < 150; j++)
8;       for (long k = 0; k < 200; k++)
9;         A[i][j][k] = 1.0;
10; }
11
12; CHECK:   Assumed Context:
13; CHECK:   [m, o] -> {  :
14; CHECK-DAG:               m >= 150
15; CHECK-DAG:               and
16; CHECK-DAG:               o >= 200
17; CHECK:             }
18; CHECK:   p0: %m
19; CHECK:   p1: %o
20; CHECK:   Statements {
21; CHECK:     Stmt_for_k
22; CHECK:           Domain :=
23; CHECK:               [m, o] -> { Stmt_for_k[i0, i1, i2] :
24; CHECK-DAG:             i0 >= 0
25; CHECK-DAG:          and
26; CHECK-DAG:             i0 <= 99
27; CHECK-DAG:          and
28; CHECK-DAG:             i1 >= 0
29; CHECK-DAG:          and
30; CHECK-DAG:             i1 <= 149
31; CHECK-DAG:          and
32; CHECK-DAG:             i2 >= 0
33; CHECK-DAG:          and
34; CHECK-DAG:             i2 <= 199
35; CHECK:              }
36; CHECK:           Schedule :=
37; CHECK:               [m, o] -> { Stmt_for_k[i0, i1, i2] -> [i0, i1, i2] };
38; CHECK:           MustWriteAccess := [Reduction Type: NONE]
39; CHECK:               [m, o] -> { Stmt_for_k[i0, i1, i2] -> MemRef_A[i0, i1, i2] };
40
41define void @foo(i64 %n, i64 %m, i64 %o, double* %A) {
42entry:
43  br label %for.i
44
45for.i:
46  %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
47  br label %for.j
48
49for.j:
50  %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]
51  br label %for.k
52
53for.k:
54  %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k.inc ]
55  %subscript0 = mul i64 %i, %m
56  %subscript1 = add i64 %j, %subscript0
57  %subscript2 = mul i64 %subscript1, %o
58  %subscript = add i64 %subscript2, %k
59  %idx = getelementptr inbounds double, double* %A, i64 %subscript
60  store double 1.0, double* %idx
61  br label %for.k.inc
62
63for.k.inc:
64  %k.inc = add nsw i64 %k, 1
65  %k.exitcond = icmp eq i64 %k.inc, 200
66  br i1 %k.exitcond, label %for.j.inc, label %for.k
67
68for.j.inc:
69  %j.inc = add nsw i64 %j, 1
70  %j.exitcond = icmp eq i64 %j.inc, 150
71  br i1 %j.exitcond, label %for.i.inc, label %for.j
72
73for.i.inc:
74  %i.inc = add nsw i64 %i, 1
75  %i.exitcond = icmp eq i64 %i.inc, 100
76  br i1 %i.exitcond, label %end, label %for.i
77
78end:
79  ret void
80}
81