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