1; RUN: opt %loadPolly -polly-detect-unprofitable -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] : i0 >= 0 and i0 <= 99 and i1 >= 0 and i1 <= 149 };
18; CHECK:         Schedule :=
19; CHECK:             [m] -> { Stmt_for_j[i0, i1] -> [i0, i1] };
20; CHECK:         MustWriteAccess := [Reduction Type: NONE]
21; CHECK:             [m] -> { Stmt_for_j[i0, i1] -> MemRef_A[i0, i1] };
22
23define void @foo(i64 %n, i64 %m, double* %A) {
24entry:
25  br label %for.i
26
27for.i:
28  %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
29  %tmp = mul nsw i64 %i, %m
30  br label %for.j
31
32for.j:
33  %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
34  %vlaarrayidx.sum = add i64 %j, %tmp
35  %arrayidx = getelementptr inbounds double, double* %A, i64 %vlaarrayidx.sum
36  store double 1.0, double* %arrayidx
37  %j.inc = add nsw i64 %j, 1
38  %j.exitcond = icmp eq i64 %j.inc, 150
39  br i1 %j.exitcond, label %for.i.inc, label %for.j
40
41for.i.inc:
42  %i.inc = add nsw i64 %i, 1
43  %i.exitcond = icmp eq i64 %i.inc, 100
44  br i1 %i.exitcond, label %end, label %for.i
45
46end:
47  ret void
48}
49