150
|
1 ; RUN: opt %loadPolly -polly-dependences -analyze < %s | FileCheck %s
|
|
2 ;
|
|
3 ; CHECK: RAW dependences:
|
|
4 ; CHECK-NEXT: { 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; Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96 }
|
|
5 ; CHECK-NEXT: WAR dependences:
|
|
6 ; CHECK-NEXT: { 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; Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96 }
|
|
7 ; CHECK-NEXT: WAW dependences:
|
|
8 ; CHECK-NEXT: { 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; Stmt_S1[i0] -> Stmt_S3[2 + i0] : 0 <= i0 <= 96 }
|
|
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 ;
|
|
22 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
|
|
23
|
|
24 define void @f(i32* %sum) {
|
|
25 entry:
|
|
26 br label %for.cond
|
|
27
|
|
28 for.cond: ; preds = %for.inc10, %entry
|
|
29 %i.0 = phi i32 [ 0, %entry ], [ %inc11, %for.inc10 ]
|
|
30 %exitcond1 = icmp ne i32 %i.0, 99
|
|
31 br i1 %exitcond1, label %for.body, label %for.end12
|
|
32
|
|
33 for.body: ; preds = %for.cond
|
|
34 br label %S1
|
|
35
|
|
36 S1: ; preds = %for.body
|
|
37 %add = add nsw i32 %i.0, 1
|
|
38 %arrayidx = getelementptr inbounds i32, i32* %sum, i32 %add
|
|
39 %tmp = load i32, i32* %arrayidx, align 4
|
|
40 %add1 = add nsw i32 %tmp, 42
|
|
41 store i32 %add1, i32* %arrayidx, align 4
|
|
42 br label %for.cond2
|
|
43
|
|
44 for.cond2: ; preds = %for.inc, %S1
|
|
45 %j.0 = phi i32 [ %i.0, %S1 ], [ %inc, %for.inc ]
|
|
46 %exitcond = icmp ne i32 %j.0, 100
|
|
47 br i1 %exitcond, label %for.body4, label %for.end
|
|
48
|
|
49 for.body4: ; preds = %for.cond2
|
|
50 br label %S2
|
|
51
|
|
52 S2: ; preds = %for.body4
|
|
53 %mul = mul nsw i32 %i.0, %j.0
|
|
54 %sub = sub nsw i32 %i.0, %j.0
|
|
55 %arrayidx5 = getelementptr inbounds i32, i32* %sum, i32 %sub
|
|
56 %tmp2 = load i32, i32* %arrayidx5, align 4
|
|
57 %add6 = add nsw i32 %tmp2, %mul
|
|
58 store i32 %add6, i32* %arrayidx5, align 4
|
|
59 br label %for.inc
|
|
60
|
|
61 for.inc: ; preds = %S2
|
|
62 %inc = add nsw i32 %j.0, 1
|
|
63 br label %for.cond2
|
|
64
|
|
65 for.end: ; preds = %for.cond2
|
|
66 br label %S3
|
|
67
|
|
68 S3: ; preds = %for.end
|
|
69 %sub7 = add nsw i32 %i.0, -1
|
|
70 %arrayidx8 = getelementptr inbounds i32, i32* %sum, i32 %sub7
|
|
71 %tmp3 = load i32, i32* %arrayidx8, align 4
|
|
72 %add9 = add nsw i32 %tmp3, 7
|
|
73 store i32 %add9, i32* %arrayidx8, align 4
|
|
74 br label %for.inc10
|
|
75
|
|
76 for.inc10: ; preds = %S3
|
|
77 %inc11 = add nsw i32 %i.0, 1
|
|
78 br label %for.cond
|
|
79
|
|
80 for.end12: ; preds = %for.cond
|
|
81 ret void
|
|
82 }
|