1; RUN: opt %loadPolly -polly-dependences -analyze < %s | FileCheck %s 2; 3; We have privatization dependences from a textually later statement to a 4; 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(i32* %sum) { 28entry: 29 br label %for.cond 30 31for.cond: ; preds = %for.inc10, %entry 32 %i.0 = phi i32 [ 0, %entry ], [ %inc11, %for.inc10 ] 33 %exitcond1 = icmp ne i32 %i.0, 99 34 br i1 %exitcond1, label %for.body, label %for.end12 35 36for.body: ; preds = %for.cond 37 br label %S1 38 39S1: ; preds = %for.body 40 %add = add nsw i32 %i.0, 1 41 %arrayidx = getelementptr inbounds i32, i32* %sum, i32 %add 42 %tmp = load i32, i32* %arrayidx, align 4 43 %add1 = add nsw i32 %tmp, 42 44 store i32 %add1, i32* %arrayidx, align 4 45 br label %for.cond2 46 47for.cond2: ; preds = %for.inc, %S1 48 %j.0 = phi i32 [ 0, %S1 ], [ %inc, %for.inc ] 49 %exitcond = icmp ne i32 %j.0, 100 50 br i1 %exitcond, label %for.body4, label %for.end 51 52for.body4: ; preds = %for.cond2 53 br label %S2 54 55S2: ; preds = %for.body4 56 %mul = mul nsw i32 %i.0, %j.0 57 %arrayidx5 = getelementptr inbounds i32, i32* %sum, i32 %i.0 58 %tmp2 = load i32, i32* %arrayidx5, align 4 59 %add6 = add nsw i32 %tmp2, %mul 60 store i32 %add6, i32* %arrayidx5, align 4 61 br label %for.inc 62 63for.inc: ; preds = %S2 64 %inc = add nsw i32 %j.0, 1 65 br label %for.cond2 66 67for.end: ; preds = %for.cond2 68 br label %S3 69 70S3: ; preds = %for.end 71 %add7 = add nsw i32 %i.0, 1 72 %arrayidx8 = getelementptr inbounds i32, i32* %sum, i32 %add7 73 %tmp3 = load i32, i32* %arrayidx8, align 4 74 %add9 = add nsw i32 %tmp3, 7 75 store i32 %add9, i32* %arrayidx8, align 4 76 br label %for.inc10 77 78for.inc10: ; preds = %S3 79 %inc11 = add nsw i32 %i.0, 1 80 br label %for.cond 81 82for.end12: ; preds = %for.cond 83 ret void 84} 85