1 ; RUN: opt < %s -analyze -delinearize | FileCheck %s
3 ; Derived from the following code:
5 ; void foo(long n, long m, double A[n][m]) {
6 ; for (long i = 0; i < n; i++)
7 ; for (long j = 0; j < m; j++)
11 ; AddRec: {{%A,+,(8 * %m)}<%for.i>,+,8}<%for.j>
12 ; CHECK: Base offset: %A
13 ; CHECK: ArrayDecl[UnknownSize][%m] with elements of sizeof(double) bytes.
14 ; CHECK: ArrayRef[{0,+,1}<nuw><nsw><%for.i>][{0,+,1}<nuw><nsw><%for.j>]
16 ; AddRec: {(-8 + (8 * %m) + %A),+,(8 * %m)}<%for.i>
17 ; CHECK: Base offset: %A
18 ; CHECK: ArrayDecl[UnknownSize] with elements of sizeof(double) bytes.
19 ; CHECK: ArrayRef[{(-1 + %m),+,%m}<%for.i>]
21 define void @foo(i64 %n, i64 %m, double* %A) {
26 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
27 %tmp = mul nsw i64 %i, %m
31 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
32 %vlaarrayidx.sum = add i64 %j, %tmp
33 %arrayidx = getelementptr inbounds double* %A, i64 %vlaarrayidx.sum
34 store double 1.0, double* %arrayidx
35 %j.inc = add nsw i64 %j, 1
36 %j.exitcond = icmp eq i64 %j.inc, %m
37 br i1 %j.exitcond, label %for.i.inc, label %for.j
40 %i.inc = add nsw i64 %i, 1
41 %i.exitcond = icmp eq i64 %i.inc, %n
42 br i1 %i.exitcond, label %end, label %for.i