brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.1 KiB · 81235d6 Raw
85 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<deps>' -polly-print-deps -disable-output < %s | FileCheck %s2;3; We have privatization dependences from a textually later statement to a4; textually earlier one, but the dependences still go forward in time.5;6; CHECK:      RAW dependences:7; CHECK-NEXT:     { Stmt_S3[i0] -> Stmt_S2[1 + i0, o1] : 0 <= i0 <= 97 and 0 <= o1 <= 99; Stmt_S1[i0] -> Stmt_S3[i0] : 0 <= i0 <= 98 }8; CHECK-NEXT: WAR dependences:9; CHECK-NEXT:     { Stmt_S3[i0] -> Stmt_S2[1 + i0, o1] : 0 <= i0 <= 97 and 0 <= o1 <= 99; Stmt_S1[i0] -> Stmt_S3[i0] : 0 <= i0 <= 98 }10; CHECK-NEXT: WAW dependences:11; CHECK-NEXT:     { Stmt_S3[i0] -> Stmt_S2[1 + i0, o1] : 0 <= i0 <= 97 and 0 <= o1 <= 99; Stmt_S1[i0] -> Stmt_S3[i0] : 0 <= i0 <= 98 }12; CHECK-NEXT: Reduction dependences:13; CHECK-NEXT:     { Stmt_S2[i0, i1] -> Stmt_S2[i0, 1 + i1] : 0 <= i0 <= 98 and 0 <= i1 <= 98 }14;15;    void f(int *sum) {16;      int i, j;17;      for (i = 0; i < 99; i++) {18; S1:    sum[i + 1] += 42;19;        for (j = 0; j < 100; j++)20; S2:      sum[i] += i * j;21; S3:    sum[i + 1] += 7;22;      }23;    }24;25target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"26 27define void @f(ptr %sum)  {28entry:29  br label %for.cond30 31for.cond:                                         ; preds = %for.inc10, %entry32  %i.0 = phi i32 [ 0, %entry ], [ %inc11, %for.inc10 ]33  %exitcond1 = icmp ne i32 %i.0, 9934  br i1 %exitcond1, label %for.body, label %for.end1235 36for.body:                                         ; preds = %for.cond37  br label %S138 39S1:                                               ; preds = %for.body40  %add = add nsw i32 %i.0, 141  %arrayidx = getelementptr inbounds i32, ptr %sum, i32 %add42  %tmp = load i32, ptr %arrayidx, align 443  %add1 = add nsw i32 %tmp, 4244  store i32 %add1, ptr %arrayidx, align 445  br label %for.cond246 47for.cond2:                                        ; preds = %for.inc, %S148  %j.0 = phi i32 [ 0, %S1 ], [ %inc, %for.inc ]49  %exitcond = icmp ne i32 %j.0, 10050  br i1 %exitcond, label %for.body4, label %for.end51 52for.body4:                                        ; preds = %for.cond253  br label %S254 55S2:                                               ; preds = %for.body456  %mul = mul nsw i32 %i.0, %j.057  %arrayidx5 = getelementptr inbounds i32, ptr %sum, i32 %i.058  %tmp2 = load i32, ptr %arrayidx5, align 459  %add6 = add nsw i32 %tmp2, %mul60  store i32 %add6, ptr %arrayidx5, align 461  br label %for.inc62 63for.inc:                                          ; preds = %S264  %inc = add nsw i32 %j.0, 165  br label %for.cond266 67for.end:                                          ; preds = %for.cond268  br label %S369 70S3:                                               ; preds = %for.end71  %add7 = add nsw i32 %i.0, 172  %arrayidx8 = getelementptr inbounds i32, ptr %sum, i32 %add773  %tmp3 = load i32, ptr %arrayidx8, align 474  %add9 = add nsw i32 %tmp3, 775  store i32 %add9, ptr %arrayidx8, align 476  br label %for.inc1077 78for.inc10:                                        ; preds = %S379  %inc11 = add nsw i32 %i.0, 180  br label %for.cond81 82for.end12:                                        ; preds = %for.cond83  ret void84}85