55 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 < n; i++)8; for (long j = 0; j < m; j++)9; A[i][j] = 1.0;10; }11 12; CHECK: Assumed Context:13; CHECK-NEXT: [m, n] -> { : }14;15; CHECK: p0: %m16; CHECK-NEXT: p1: %n17; CHECK-NOT: p318;19; CHECK: Statements {20; CHECK-NEXT: Stmt_for_j21; CHECK-NEXT: Domain :=22; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] : 0 <= i0 < n and 0 <= i1 < m };23; CHECK-NEXT: Schedule :=24; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] -> [i0, i1] };25; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]26; CHECK-NEXT: [m, n] -> { Stmt_for_j[i0, i1] -> MemRef_A[i0, i1] };27; CHECK-NEXT: }28 29define void @foo(i64 %n, i64 %m, ptr %A) {30entry:31 br label %for.i32 33for.i:34 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]35 %tmp = mul nsw i64 %i, %m36 br label %for.j37 38for.j:39 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]40 %vlaarrayidx.sum = add i64 %j, %tmp41 %arrayidx = getelementptr inbounds double, ptr %A, i64 %vlaarrayidx.sum42 store double 1.0, ptr %arrayidx43 %j.inc = add nsw i64 %j, 144 %j.exitcond = icmp eq i64 %j.inc, %m45 br i1 %j.exitcond, label %for.i.inc, label %for.j46 47for.i.inc:48 %i.inc = add nsw i64 %i, 149 %i.exitcond = icmp eq i64 %i.inc, %n50 br i1 %i.exitcond, label %end, label %for.i51 52end:53 ret void54}55