brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.2 KiB · 1fef004 Raw
79 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_S2[i0, i0] : 0 <= i0 <= 98; Stmt_S2[i0, i0] -> Stmt_S3[i0] : 0 <= i0 <= 98; Stmt_S3[i0] -> Stmt_S2[o0, i0] : i0 >= 0 and i0 < o0 <= 98; Stmt_S2[i0, i1] -> Stmt_S1[i1] : i0 >= 0 and i0 < i1 <= 98 }5; CHECK-NEXT: WAR dependences:6; CHECK-NEXT:     { Stmt_S1[i0] -> Stmt_S2[i0, i0] : 0 <= i0 <= 98; Stmt_S2[i0, i0] -> Stmt_S3[i0] : 0 <= i0 <= 98; Stmt_S3[i0] -> Stmt_S2[o0, i0] : i0 >= 0 and i0 < o0 <= 98; Stmt_S2[i0, i1] -> Stmt_S1[i1] : i0 >= 0 and i0 < i1 <= 98 }7; CHECK-NEXT: WAW dependences:8; CHECK-NEXT:     { Stmt_S1[i0] -> Stmt_S2[i0, i0] : 0 <= i0 <= 98; Stmt_S2[i0, i0] -> Stmt_S3[i0] : 0 <= i0 <= 98; Stmt_S3[i0] -> Stmt_S2[o0, i0] : i0 >= 0 and i0 < o0 <= 98; Stmt_S2[i0, i1] -> Stmt_S1[i1] : i0 >= 0 and i0 < i1 <= 98 }9; CHECK-NEXT: Reduction dependences:10; CHECK-NEXT:     { Stmt_S2[i0, i1] -> Stmt_S2[1 + i0, i1] : (i0 >= 0 and 2 + i0 <= i1 <= 99) or (i0 <= 97 and 0 <= i1 < i0) }11;12;    void f(int *sum) {13;      for (int i = 0; i < 99; i++) {14; S1:    sum[i] += 42;15;        for (int j = 0; j < 100; j++)16; S2:      sum[j] += i * j;17; S3:    sum[i] += 7;18;      }19;    }20;21target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"22 23define void @f(ptr %sum)  {24entry:25  br label %for.cond26 27for.cond:                                         ; preds = %for.inc8, %entry28  %i.0 = phi i32 [ 0, %entry ], [ %inc9, %for.inc8 ]29  %exitcond1 = icmp ne i32 %i.0, 9930  br i1 %exitcond1, label %for.body, label %for.end1031 32for.body:                                         ; preds = %for.cond33  br label %S134 35S1:                                               ; preds = %for.body36  %arrayidx = getelementptr inbounds i32, ptr %sum, i32 %i.037  %tmp = load i32, ptr %arrayidx, align 438  %add = add nsw i32 %tmp, 4239  store i32 %add, ptr %arrayidx, align 440  br label %for.cond141 42for.cond1:                                        ; preds = %for.inc, %S143  %j.0 = phi i32 [ 0, %S1 ], [ %inc, %for.inc ]44  %exitcond = icmp ne i32 %j.0, 10045  br i1 %exitcond, label %for.body3, label %for.end46 47for.body3:                                        ; preds = %for.cond148  br label %S249 50S2:                                               ; preds = %for.body351  %mul = mul nsw i32 %i.0, %j.052  %arrayidx4 = getelementptr inbounds i32, ptr %sum, i32 %j.053  %tmp2 = load i32, ptr %arrayidx4, align 454  %add5 = add nsw i32 %tmp2, %mul55  store i32 %add5, ptr %arrayidx4, align 456  br label %for.inc57 58for.inc:                                          ; preds = %S259  %inc = add nsw i32 %j.0, 160  br label %for.cond161 62for.end:                                          ; preds = %for.cond163  br label %S364 65S3:                                               ; preds = %for.end66  %arrayidx6 = getelementptr inbounds i32, ptr %sum, i32 %i.067  %tmp3 = load i32, ptr %arrayidx6, align 468  %add7 = add nsw i32 %tmp3, 769  store i32 %add7, ptr %arrayidx6, align 470  br label %for.inc871 72for.inc8:                                         ; preds = %S373  %inc9 = add nsw i32 %i.0, 174  br label %for.cond75 76for.end10:                                        ; preds = %for.cond77  ret void78}79