brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.3 KiB · 6b48ab5 Raw
83 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<deps>' -polly-print-deps -disable-output < %s | FileCheck %s2;3; CHECK:      RAW dependences:4; CHECK-NEXT:     { Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96; Stmt_S2[i0, i1] -> Stmt_S3[o0] : i1 <= 1 - i0 and -i1 < o0 <= 1 and o0 <= 1 + i0 - i1; Stmt_S3[i0] -> Stmt_S2[o0, 1 - i0] : 0 <= i0 <= 1 and i0 < o0 <= 98 }5; CHECK-NEXT: WAR dependences:6; CHECK-NEXT:     { Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96; Stmt_S2[i0, i1] -> Stmt_S3[o0] : i1 <= 1 - i0 and -i1 < o0 <= 1 and o0 <= 1 + i0 - i1; Stmt_S3[i0] -> Stmt_S2[o0, 1 - i0] : 0 <= i0 <= 1 and i0 < o0 <= 98 }7; CHECK-NEXT: WAW dependences:8; CHECK-NEXT:     { Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96; Stmt_S2[i0, i1] -> Stmt_S3[o0] : i1 <= 1 - i0 and -i1 < o0 <= 1 and o0 <= 1 + i0 - i1; Stmt_S3[i0] -> Stmt_S2[o0, 1 - i0] : 0 <= i0 <= 1 and i0 < o0 <= 98 }9; CHECK-NEXT: Reduction dependences:10; CHECK-NEXT:     { Stmt_S2[i0, i1] -> Stmt_S2[1 + i0, i1] : 0 <= i0 <= 97 and i1 >= 0 and 2 - i0 <= i1 <= 98 - i0; Stmt_S2[0, 0] -> Stmt_S2[1, 0] }11;12;    void f(int *sum) {13;      int i, j;14;      for (i = 0; i < 99; i++) {15; S1:    sum[i + 1] += 42;16;        for (j = i; j < 100; j++)17; S2:      sum[i - j] += i * j;18; S3:    sum[i - 1] += 7;19;      }20;    }21;22target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"23 24define void @f(ptr %sum)  {25entry:26  br label %for.cond27 28for.cond:                                         ; preds = %for.inc10, %entry29  %i.0 = phi i32 [ 0, %entry ], [ %inc11, %for.inc10 ]30  %exitcond1 = icmp ne i32 %i.0, 9931  br i1 %exitcond1, label %for.body, label %for.end1232 33for.body:                                         ; preds = %for.cond34  br label %S135 36S1:                                               ; preds = %for.body37  %add = add nsw i32 %i.0, 138  %arrayidx = getelementptr inbounds i32, ptr %sum, i32 %add39  %tmp = load i32, ptr %arrayidx, align 440  %add1 = add nsw i32 %tmp, 4241  store i32 %add1, ptr %arrayidx, align 442  br label %for.cond243 44for.cond2:                                        ; preds = %for.inc, %S145  %j.0 = phi i32 [ %i.0, %S1 ], [ %inc, %for.inc ]46  %exitcond = icmp ne i32 %j.0, 10047  br i1 %exitcond, label %for.body4, label %for.end48 49for.body4:                                        ; preds = %for.cond250  br label %S251 52S2:                                               ; preds = %for.body453  %mul = mul nsw i32 %i.0, %j.054  %sub = sub nsw i32 %i.0, %j.055  %arrayidx5 = getelementptr inbounds i32, ptr %sum, i32 %sub56  %tmp2 = load i32, ptr %arrayidx5, align 457  %add6 = add nsw i32 %tmp2, %mul58  store i32 %add6, ptr %arrayidx5, align 459  br label %for.inc60 61for.inc:                                          ; preds = %S262  %inc = add nsw i32 %j.0, 163  br label %for.cond264 65for.end:                                          ; preds = %for.cond266  br label %S367 68S3:                                               ; preds = %for.end69  %sub7 = add nsw i32 %i.0, -170  %arrayidx8 = getelementptr inbounds i32, ptr %sum, i32 %sub771  %tmp3 = load i32, ptr %arrayidx8, align 472  %add9 = add nsw i32 %tmp3, 773  store i32 %add9, ptr %arrayidx8, align 474  br label %for.inc1075 76for.inc10:                                        ; preds = %S377  %inc11 = add nsw i32 %i.0, 178  br label %for.cond79 80for.end12:                                        ; preds = %for.cond81  ret void82}83