brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.3 KiB · 797a037 Raw
75 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; This test case checks for array access functions where the order in which the5; loop ivs appear in the array subscript does not follow the order of the6; the loops in which they are defined. This (very common) case caused problems7; in the delinearization pass.8;9; void foo(long n, long m, long o, double A[n][m][o]) {10;11;   for (long i = 0; i < n; i++)12;     for (long k = 0; k < o; k++)13;       for (long j = 0; j < m; j++)14;         A[i][j][k] = 1.0;15; }16 17; CHECK:      Assumed Context:18; CHECK-NEXT: [m, o, n] -> {  :  }19;20; CHECK:      p0: %m21; CHECK-NEXT: p1: %o22; CHECK-NEXT: p2: %n23; CHECK-NOT:  p324;25; CHECK:      Statements {26; CHECK-NEXT:     Stmt_for_j27; CHECK-NEXT:         Domain :=28; CHECK-NEXT:             [m, o, n] -> { Stmt_for_j[i0, i1, i2] : 0 <= i0 < n and 0 <= i1 < o and 0 <= i2 < m };29; CHECK-NEXT:         Schedule :=30; CHECK-NEXT:             [m, o, n] -> { Stmt_for_j[i0, i1, i2] -> [i0, i1, i2] };31; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 0]32; CHECK-NEXT:             [m, o, n] -> { Stmt_for_j[i0, i1, i2] -> MemRef_A[i0, i2, i1] };33; CHECK-NEXT: }34 35define void @foo(i64 %n, i64 %m, i64 %o, ptr %A) {36entry:37  br label %for.i38 39for.i:40  %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]41  br label %for.k42 43for.k:44  %k = phi i64 [ 0, %for.i ], [ %k.inc, %for.k.inc ]45  br label %for.j46 47for.j:48  %j = phi i64 [ 0, %for.k ], [ %j.inc, %for.j.inc ]49  %subscript0 = mul i64 %i, %m50  %subscript1 = add i64 %j, %subscript051  %subscript2 = mul i64 %subscript1, %o52  %subscript = add i64 %subscript2, %k53  %idx = getelementptr inbounds double, ptr %A, i64 %subscript54  store double 1.0, ptr %idx55  br label %for.j.inc56 57for.j.inc:58  %j.inc = add nsw i64 %j, 159  %j.exitcond = icmp eq i64 %j.inc, %m60  br i1 %j.exitcond, label %for.k.inc, label %for.j61 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.i.inc, label %for.k66 67for.i.inc:68  %i.inc = add nsw i64 %i, 169  %i.exitcond = icmp eq i64 %i.inc, %n70  br i1 %i.exitcond, label %end, label %for.i71 72end:73  ret void74}75