1 ; RUN: opt %loadPolly -polly-detect-unprofitable -polly-scops -analyze -polly-delinearize < %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"
3 target triple = "x86_64-unknown-linux-gnu"
5 ; void foo(long n, long m, long o, double A[n][m][o]) {
7 ; for (long i = 0; i < 100; i++)
8 ; for (long j = 0; j < 150; j++)
9 ; for (long k = 0; k < 200; k++)
13 ; CHECK: Assumed Context:
14 ; CHECK: [m, o] -> { : m >= 150 and o >= 200 }
20 ; CHECK: [m, o] -> { Stmt_for_k[i0, i1, i2] : i0 >= 0 and i0 <= 99 and i1 >= 0 and i1 <= 149 and i2 >= 0 and i2 <= 199 };
21 ; CHECK: Scattering :=
22 ; CHECK: [m, o] -> { Stmt_for_k[i0, i1, i2] -> [i0, i1, i2] };
23 ; CHECK: MustWriteAccess := [Reduction Type: NONE]
24 ; CHECK: [m, o] -> { Stmt_for_k[i0, i1, i2] -> MemRef_A[i0, i1, i2] };
26 define void @foo(i64 %n, i64 %m, i64 %o, double* %A) {
31 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
35 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]
39 %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k.inc ]
40 %subscript0 = mul i64 %i, %m
41 %subscript1 = add i64 %j, %subscript0
42 %subscript2 = mul i64 %subscript1, %o
43 %subscript = add i64 %subscript2, %k
44 %idx = getelementptr inbounds double, double* %A, i64 %subscript
45 store double 1.0, double* %idx
49 %k.inc = add nsw i64 %k, 1
50 %k.exitcond = icmp eq i64 %k.inc, 200
51 br i1 %k.exitcond, label %for.j.inc, label %for.k
54 %j.inc = add nsw i64 %j, 1
55 %j.exitcond = icmp eq i64 %j.inc, 150
56 br i1 %j.exitcond, label %for.i.inc, label %for.j
59 %i.inc = add nsw i64 %i, 1
60 %i.exitcond = icmp eq i64 %i.inc, 100
61 br i1 %i.exitcond, label %end, label %for.i