1 ; RUN: opt < %s -analyze -delinearize | FileCheck %s
2 ; void foo(int n, int m, int o, double A[n][m][o]) {
4 ; for (int i = 0; i < n; i++)
5 ; for (int j = 0; j < m; j++)
6 ; for (int k = 0; k < o; k++)
10 ; AddRec: {{{%A,+,(8 * (zext i32 %m to i64) * (zext i32 %o to i64))}<%for.i>,+,(8 * (zext i32 %o to i64))}<%for.j>,+,8}<%for.k>
11 ; CHECK: Base offset: %A
12 ; CHECK: ArrayDecl[UnknownSize][(zext i32 %m to i64)][(zext i32 %o to i64)] with elements of 8 bytes.
13 ; CHECK: ArrayRef[{0,+,1}<%for.i>][{0,+,1}<%for.j>][{0,+,1}<%for.k>]
15 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"
16 target triple = "x86_64-unknown-linux-gnu"
18 define void @foo(i32 %n, i32 %m, i32 %o, double* %A) {
20 %m_zext = zext i32 %m to i64
21 %n_zext = zext i32 %o to i64
25 %i = phi i64 [ %i.inc, %for.i.inc ], [ 0, %entry ]
29 %j = phi i64 [ %j.inc, %for.j.inc ], [ 0, %for.i ]
33 %k = phi i64 [ %k.inc, %for.k.inc ], [ 0, %for.j ]
34 %tmp = mul i64 %i, %m_zext
35 %tmp1 = trunc i64 %j to i32
36 %tmp2 = trunc i64 %i to i32
37 %mul.us.us = mul nsw i32 %tmp1, %tmp2
38 %tmp.us.us = add i64 %j, %tmp
39 %tmp17.us.us = mul i64 %tmp.us.us, %n_zext
40 %subscript = add i64 %tmp17.us.us, %k
41 %idx = getelementptr inbounds double, double* %A, i64 %subscript
42 store double 1.0, double* %idx
46 %k.inc = add i64 %k, 1
47 %k.inc.trunc = trunc i64 %k.inc to i32
48 %k.exitcond = icmp eq i32 %k.inc.trunc, %o
49 br i1 %k.exitcond, label %for.j.inc, label %for.k
52 %j.inc = add i64 %j, 1
53 %j.inc.trunc = trunc i64 %j.inc to i32
54 %j.exitcond = icmp eq i32 %j.inc.trunc, %m
55 br i1 %j.exitcond, label %for.i.inc, label %for.j
58 %i.inc = add i64 %i, 1
59 %i.inc.trunc = trunc i64 %i.inc to i32
60 %i.exitcond = icmp eq i32 %i.inc.trunc, %n
61 br i1 %i.exitcond, label %end, label %for.i