brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.8 KiB · 7f0c8b1 Raw
90 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2 3; void foo(int n, int m, int o, double A[n][m][o]) {4;5;   for (int i = 0; i < n; i++)6;     for (int j = 0; j < m; j++)7;       for (int k = 0; k < o; k++)8;         A[i][j][k] = 1.0;9; }10 11; CHECK:      Assumed Context:12; CHECK-NEXT: [o, m, n] -> {  :  }13; CHECK-NEXT: Invalid Context:14; CHECK-NEXT: [o, m, n] -> { : o < 0 or m < 0 or n <= 0 or (m <= 0 and n > 0) or (o <= 0 and m > 0 and n > 0) }15 16;17; CHECK:      p0: %o18; CHECK-NEXT: p1: %m19; CHECK-NEXT: p2: %n20; CHECK-NOT:  p321;22; CHECK:      Arrays {23; CHECK-NEXT:     double MemRef_A[*][(zext i32 %m to i64)][(zext i32 %o to i64)]; // Element size 824; CHECK-NEXT: }25;26; CHECK:      Arrays (Bounds as pw_affs) {27; CHECK-NEXT:     double MemRef_A[*][ [m] -> { [] -> [(m)] } ][ [o] -> { [] -> [(o)] } ]; // Element size 828; CHECK-NEXT: }29;30; CHECK:      Statements {31; CHECK-NEXT:     Stmt_for_k32; CHECK-NEXT:         Domain :=33; CHECK-NEXT:             [o, m, n] -> { Stmt_for_k[i0, i1, i2] : 0 <= i0 < n and 0 <= i1 < m and 0 <= i2 < o };34; CHECK-NEXT:         Schedule :=35; CHECK-NEXT:             [o, m, n] -> { Stmt_for_k[i0, i1, i2] -> [i0, i1, i2] };36; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 0]37; CHECK-NEXT:             [o, m, n] -> { Stmt_for_k[i0, i1, i2] -> MemRef_A[i0, i1, i2] };38; CHECK-NEXT: }39 40target 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"41 42define void @foo(i32 %n, i32 %m, i32 %o, ptr %A) {43entry:44  %m_zext = zext i32 %m to i6445  %n_zext = zext i32 %o to i6446  br label %for.i47 48for.i:49  %i = phi i64 [ %i.inc, %for.i.inc ], [ 0, %entry ]50  br label %for.j51 52for.j:53  %j = phi i64 [ %j.inc, %for.j.inc ], [ 0, %for.i ]54  br label %for.k55 56for.k:57  %k = phi i64 [ %k.inc, %for.k.inc ], [ 0, %for.j ]58  %tmp = mul i64 %i, %m_zext59  %tmp1 = trunc i64 %j to i3260  %tmp2 = trunc i64 %i to i3261  %mul.us.us = mul nsw i32 %tmp1, %tmp262  %tmp.us.us = add i64 %j, %tmp63  %tmp17.us.us = mul i64 %tmp.us.us, %n_zext64  %subscript = add i64 %tmp17.us.us, %k65  %idx = getelementptr inbounds double, ptr %A, i64 %subscript66  store double 1.0, ptr %idx67  br label %for.k.inc68 69for.k.inc:70  %k.inc = add i64 %k, 171  %k.inc.trunc = trunc i64 %k.inc to i3272  %k.exitcond = icmp eq i32 %k.inc.trunc, %o73  br i1 %k.exitcond, label %for.j.inc, label %for.k74 75for.j.inc:76  %j.inc = add i64 %j, 177  %j.inc.trunc = trunc i64 %j.inc to i3278  %j.exitcond = icmp eq i32 %j.inc.trunc, %m79  br i1 %j.exitcond, label %for.i.inc, label %for.j80 81for.i.inc:82  %i.inc = add i64 %i, 183  %i.inc.trunc = trunc i64 %i.inc to i3284  %i.exitcond = icmp eq i32 %i.inc.trunc, %n85  br i1 %i.exitcond, label %end, label %for.i86 87end:88  ret void89}90