52 lines · plain
1; RUN: opt %loadNPMPolly '-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; Derived from the following code:5;6; void foo(long n, long m, double A[n][m]) {7; for (long i = 0; i < 100; i++)8; for (long j = 0; j < 150; j++)9; A[i][j] = 1.0;10; }11; CHECK: Assumed Context:12; CHECK-NEXT: [m] -> { : m >= 150 }13;14; CHECK: p0: %m15;16; CHECK: Statements {17; CHECK-NEXT: Stmt_for_j18; CHECK-NEXT: Domain :=19; CHECK-NEXT: [m] -> { Stmt_for_j[i0, i1] : 0 <= i0 <= 99 and 0 <= i1 <= 149 };20; CHECK-NEXT: Schedule :=21; CHECK-NEXT: [m] -> { Stmt_for_j[i0, i1] -> [i0, i1] };22; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]23; CHECK-NEXT: [m] -> { Stmt_for_j[i0, i1] -> MemRef_A[i0, i1] };24; CHECK-NEXT: }25 26define void @foo(i64 %n, i64 %m, ptr %A) {27entry:28 br label %for.i29 30for.i:31 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]32 %tmp = mul nsw i64 %i, %m33 br label %for.j34 35for.j:36 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]37 %vlaarrayidx.sum = add i64 %j, %tmp38 %arrayidx = getelementptr inbounds double, ptr %A, i64 %vlaarrayidx.sum39 store double 1.0, ptr %arrayidx40 %j.inc = add nsw i64 %j, 141 %j.exitcond = icmp eq i64 %j.inc, 15042 br i1 %j.exitcond, label %for.i.inc, label %for.j43 44for.i.inc:45 %i.inc = add nsw i64 %i, 146 %i.exitcond = icmp eq i64 %i.inc, 10047 br i1 %i.exitcond, label %end, label %for.i48 49end:50 ret void51}52