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; Derived from the following code:
5;
6; void foo(long n, long m, double A[n][m]) {
7;   for (long i = 0; i < 100; i++)
8;     for (long j = 0; j < 150; j++)
9;       A[i][j] = 1.0;
10; }
11; CHECK: Assumed Context:
12; CHECK: [m] -> {  : m >= 150 }
13; CHECK: p0: %m
14; CHECK: Statements {
15; CHECK:   Stmt_for_j
16; CHECK:         Domain :=
17; CHECK:             [m] -> { Stmt_for_j[i0, i1]
18; CHECK-DAG:             i0 >= 0
19; CHECK-DAG:          and
20; CHECK-DAG:             i0 <= 99
21; CHECK-DAG:          and
22; CHECK-DAG:             i1 >= 0
23; CHECK-DAG:          and
24; CHECK-DAG:             i1 <= 149
25; CHECK:              }
26; CHECK:         Schedule :=
27; CHECK:             [m] -> { Stmt_for_j[i0, i1] -> [i0, i1] };
28; CHECK:         MustWriteAccess := [Reduction Type: NONE]
29; CHECK:             [m] -> { Stmt_for_j[i0, i1] -> MemRef_A[i0, i1] };
30
31define void @foo(i64 %n, i64 %m, double* %A) {
32entry:
33  br label %for.i
34
35for.i:
36  %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
37  %tmp = mul nsw i64 %i, %m
38  br label %for.j
39
40for.j:
41  %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
42  %vlaarrayidx.sum = add i64 %j, %tmp
43  %arrayidx = getelementptr inbounds double, double* %A, i64 %vlaarrayidx.sum
44  store double 1.0, double* %arrayidx
45  %j.inc = add nsw i64 %j, 1
46  %j.exitcond = icmp eq i64 %j.inc, 150
47  br i1 %j.exitcond, label %for.i.inc, label %for.j
48
49for.i.inc:
50  %i.inc = add nsw i64 %i, 1
51  %i.exitcond = icmp eq i64 %i.inc, 100
52  br i1 %i.exitcond, label %end, label %for.i
53
54end:
55  ret void
56}
57