1 ; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
2 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-n8:16:32:64-S128"
4 ; Derived from the following code:
6 ; void foo(long n, long m, double A[n][m]) {
7 ; for (long i = 0; i < n; i++)
8 ; for (long j = 0; j < m; j++)
12 ; CHECK: Assumed Context:
13 ; CHECK-NEXT: [m, n] -> { : }
20 ; CHECK-NEXT: Stmt_for_j
21 ; CHECK-NEXT: Domain :=
22 ; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] : 0 <= i0 < n and 0 <= i1 < m };
23 ; CHECK-NEXT: Schedule :=
24 ; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] -> [i0, i1] };
25 ; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
26 ; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] -> MemRef_A[i0, i1] };
29 define void @foo(i64 %n, i64 %m, double* %A) {
34 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
35 %tmp = mul nsw i64 %i, %m
39 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
40 %vlaarrayidx.sum = add i64 %j, %tmp
41 %arrayidx = getelementptr inbounds double, double* %A, i64 %vlaarrayidx.sum
42 store double 1.0, double* %arrayidx
43 %j.inc = add nsw i64 %j, 1
44 %j.exitcond = icmp eq i64 %j.inc, %m
45 br i1 %j.exitcond, label %for.i.inc, label %for.j
48 %i.inc = add nsw i64 %i, 1
49 %i.exitcond = icmp eq i64 %i.inc, %n
50 br i1 %i.exitcond, label %end, label %for.i