1; RUN: opt < %s -analyze -delinearize | FileCheck %s 2 3; void foo(long n, long m, long o, long p, double A[n][m][o+p]) { 4; 5; for (long i = 0; i < n; i++) 6; for (long j = 0; j < m; j++) 7; for (long k = 0; k < o; k++) 8; A[i+3][j-4][k+7] = 1.0; 9; } 10 11; AddRec: {{{(56 + (8 * (-4 + (3 * %m)) * (%o + %p)) + %A),+,(8 * (%o + %p) * %m)}<%for.cond4.preheader.lr.ph.us>,+,(8 * (%o + %p))}<%for.body6.lr.ph.us.us>,+,8}<%for.body6.us.us> 12; CHECK: Base offset: %A 13; CHECK: ArrayDecl[UnknownSize][%m][(%o + %p)] with elements of sizeof(double) bytes. 14; CHECK: ArrayRef[{3,+,1}<nw><%for.cond4.preheader.lr.ph.us>][{-4,+,1}<nw><%for.body6.lr.ph.us.us>][{7,+,1}<nw><%for.body6.us.us>] 15 16; AddRec: {{(48 + (8 * %o) + (8 * (-4 + (3 * %m)) * (%o + %p)) + %A),+,(8 * (%o + %p) * %m)}<%for.cond4.preheader.lr.ph.us>,+,(8 * (%o + %p))}<%for.body6.lr.ph.us.us> 17; CHECK: Base offset: %A 18; CHECK: ArrayDecl[UnknownSize][(%o + %p)] with elements of sizeof(double) bytes. 19; CHECK: ArrayRef[{(-4 + (3 * %m)),+,%m}<%for.cond4.preheader.lr.ph.us>][{(6 + %o),+,(%o + %p)}<%for.body6.lr.ph.us.us>] 20 21; AddRec: {(48 + (8 * %o) + ((-40 + (32 * %m)) * (%o + %p)) + %A),+,(8 * (%o + %p) * %m)}<%for.cond4.preheader.lr.ph.us> 22; CHECK: Base offset: %A 23; CHECK: ArrayDecl[UnknownSize] with elements of sizeof(double) bytes. 24; CHECK: ArrayRef[{(6 + ((-5 + (4 * %m)) * (%o + %p)) + %o),+,((%o + %p) * %m)}<%for.cond4.preheader.lr.ph.us>] 25 26define void @foo(i64 %n, i64 %m, i64 %o, i64 %p, double* nocapture %A) nounwind uwtable { 27entry: 28 %add = add nsw i64 %p, %o 29 %cmp22 = icmp sgt i64 %n, 0 30 br i1 %cmp22, label %for.cond1.preheader.lr.ph, label %for.end16 31 32for.cond1.preheader.lr.ph: ; preds = %entry 33 %cmp220 = icmp sgt i64 %m, 0 34 %cmp518 = icmp sgt i64 %o, 0 35 br i1 %cmp220, label %for.cond4.preheader.lr.ph.us, label %for.end16 36 37for.inc14.us: ; preds = %for.cond4.preheader.lr.ph.us, %for.inc11.us.us 38 %inc15.us = add nsw i64 %i.023.us, 1 39 %exitcond43 = icmp eq i64 %inc15.us, %n 40 br i1 %exitcond43, label %for.end16, label %for.cond4.preheader.lr.ph.us 41 42for.cond4.preheader.lr.ph.us: ; preds = %for.inc14.us, %for.cond1.preheader.lr.ph 43 %i.023.us = phi i64 [ %inc15.us, %for.inc14.us ], [ 0, %for.cond1.preheader.lr.ph ] 44 %add8.us = add nsw i64 %i.023.us, 3 45 %0 = mul i64 %add8.us, %m 46 %sub.us = add i64 %0, -4 47 br i1 %cmp518, label %for.body6.lr.ph.us.us, label %for.inc14.us 48 49for.inc11.us.us: ; preds = %for.body6.us.us 50 %inc12.us.us = add nsw i64 %j.021.us.us, 1 51 %exitcond42 = icmp eq i64 %inc12.us.us, %m 52 br i1 %exitcond42, label %for.inc14.us, label %for.body6.lr.ph.us.us 53 54for.body6.lr.ph.us.us: ; preds = %for.cond4.preheader.lr.ph.us, %for.inc11.us.us 55 %j.021.us.us = phi i64 [ %inc12.us.us, %for.inc11.us.us ], [ 0, %for.cond4.preheader.lr.ph.us ] 56 %tmp.us.us = add i64 %sub.us, %j.021.us.us 57 %tmp17.us.us = mul i64 %tmp.us.us, %add 58 br label %for.body6.us.us 59 60for.body6.us.us: ; preds = %for.body6.us.us, %for.body6.lr.ph.us.us 61 %k.019.us.us = phi i64 [ 0, %for.body6.lr.ph.us.us ], [ %inc.us.us, %for.body6.us.us ] 62 %arrayidx.sum.us.us = add i64 %k.019.us.us, 7 63 %arrayidx9.sum.us.us = add i64 %arrayidx.sum.us.us, %tmp17.us.us 64 %arrayidx10.us.us = getelementptr inbounds double* %A, i64 %arrayidx9.sum.us.us 65 store double 1.000000e+00, double* %arrayidx10.us.us, align 8 66 %inc.us.us = add nsw i64 %k.019.us.us, 1 67 %exitcond = icmp eq i64 %inc.us.us, %o 68 br i1 %exitcond, label %for.inc11.us.us, label %for.body6.us.us 69 70for.end16: ; preds = %for.cond1.preheader.lr.ph, %for.inc14.us, %entry 71 ret void 72} 73