80 lines · plain
1; RUN: opt %loadNPMPolly -polly-precise-fold-accesses '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2target 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 4; void foo(long n, long m, long o, double A[n][m][o], long p, long q, long r) {5;6; for (long i = 0; i < n; i++)7; for (long j = 0; j < m; j++)8; for (long k = 0; k < o; k++)9; A[i+p][j+q][k+r] = 1.0;10; }11;12; Access function:13; {{{((8 * ((((%m * %p) + %q) * %o) + %r)) + %A),+,(8 * %m * %o)}<%for.i>,+,14; (8 * %o)}<%for.j>,+,8}<%for.k>15 16; CHECK: Assumed Context:17; CHECK-NEXT: [o, m, n, p, q, r] -> { : -m <= q <= 1 and ((-m < q <= 0 and -o < r < 0) or (r = 0 and q <= 0) or (r = -o and q > -m)) }18;19; CHECK: p0: %o20; CHECK-NEXT: p1: %m21; CHECK-NEXT: p2: %n22; CHECK-NEXT: p3: %p23; CHECK-NEXT: p4: %q24; CHECK-NEXT: p5: %r25; CHECK-NOT: p626;27; CHECK: Statements {28; CHECK-NEXT: Stmt_for_k29; CHECK-NEXT: Domain :=30; CHECK-NEXT: [o, m, n, p, q, r] -> { Stmt_for_k[i0, i1, i2] : 0 <= i0 < n and 0 <= i1 < m and 0 <= i2 < o };31; CHECK-NEXT: Schedule :=32; CHECK-NEXT: [o, m, n, p, q, r] -> { Stmt_for_k[i0, i1, i2] -> [i0, i1, i2] };33; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]34; CHECK-NEXT: [o, m, n, p, q, r] -> { Stmt_for_k[i0, i1, i2] -> MemRef_A[-1 + p + i0, -1 + m + q + i1, o + r + i2] : i1 <= -q and i2 < -r; Stmt_for_k[i0, i1, i2] -> MemRef_A[p + i0, -1 + q + i1, o + r + i2] : i1 > -q and i2 < -r; Stmt_for_k[i0, i1, i2] -> MemRef_A[-1 + p + i0, m + q + i1, r + i2] : i1 < -q and i2 >= -r; Stmt_for_k[i0, i1, i2] -> MemRef_A[p + i0, q + i1, r + i2] : i1 >= -q and i2 >= -r };35; CHECK-NEXT: }36 37define void @foo(i64 %n, i64 %m, i64 %o, ptr %A, i64 %p, i64 %q, i64 %r) {38entry:39 br label %for.i40 41for.i:42 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]43 br label %for.j44 45for.j:46 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]47 br label %for.k48 49for.k:50 %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k.inc ]51 %offset0 = add nsw i64 %i, %p52 %subscript0 = mul i64 %offset0, %m53 %offset1 = add nsw i64 %j, %q54 %subscript1 = add i64 %offset1, %subscript055 %subscript2 = mul i64 %subscript1, %o56 %offset2 = add nsw i64 %k, %r57 %subscript = add i64 %subscript2, %offset258 %idx = getelementptr inbounds double, ptr %A, i64 %subscript59 store double 1.0, ptr %idx60 br label %for.k.inc61 62for.k.inc:63 %k.inc = add nsw i64 %k, 164 %k.exitcond = icmp eq i64 %k.inc, %o65 br i1 %k.exitcond, label %for.j.inc, label %for.k66 67for.j.inc:68 %j.inc = add nsw i64 %j, 169 %j.exitcond = icmp eq i64 %j.inc, %m70 br i1 %j.exitcond, label %for.i.inc, label %for.j71 72for.i.inc:73 %i.inc = add nsw i64 %i, 174 %i.exitcond = icmp eq i64 %i.inc, %n75 br i1 %i.exitcond, label %end, label %for.i76 77end:78 ret void79}80