1 ; RUN: opt %loadNPMPolly '-passes=print<polly-dependences>' -aa-pipeline=basic-aa -disable-output < %s | FileCheck %s
3 ; CHECK: Reduction dependences:
4 ; CHECK-NEXT: [N] -> { Stmt_for_body3[i0, i1] -> Stmt_for_body3[i0, 1 + i1] : 0 <= i0 <= 1023 and i1 >= 0 and 1024 - N + i0 <= i1 <= 1022 }
6 ; void f(int N, int * restrict sums, int * restrict escape) {
7 ; for (int i = 0; i < 1024; i++) {
8 ; for (int j = 0; j < 1024; j++) {
10 ; if (N - i + j < 1024)
11 ; escape[N - i + j] = sums[i];
15 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
17 define void @f(i32 %N, ptr noalias %sums, ptr noalias %escape) {
21 for.cond: ; preds = %for.inc10, %entry
22 %i.0 = phi i32 [ 0, %entry ], [ %inc11, %for.inc10 ]
23 %exitcond1 = icmp ne i32 %i.0, 1024
24 br i1 %exitcond1, label %for.body, label %for.end12
26 for.body: ; preds = %for.cond
29 for.cond1: ; preds = %for.inc, %for.body
30 %j.0 = phi i32 [ 0, %for.body ], [ %inc, %for.inc ]
31 %exitcond = icmp ne i32 %j.0, 1024
32 br i1 %exitcond, label %for.body3, label %for.end
34 for.body3: ; preds = %for.cond1
35 %arrayidx = getelementptr inbounds i32, ptr %sums, i32 %i.0
36 %tmp = load i32, ptr %arrayidx, align 4
37 %add = add nsw i32 %tmp, 5
38 store i32 %add, ptr %arrayidx, align 4
39 %sub = sub nsw i32 %N, %i.0
40 %add4 = add nsw i32 %sub, %j.0
41 %cmp5 = icmp slt i32 %add4, 1024
42 br i1 %cmp5, label %if.then, label %if.end
44 if.then: ; preds = %for.body3
45 %arrayidx6 = getelementptr inbounds i32, ptr %sums, i32 %i.0
46 %tmp2 = load i32, ptr %arrayidx6, align 4
47 %sub7 = sub nsw i32 %N, %i.0
48 %add8 = add nsw i32 %sub7, %j.0
49 %arrayidx9 = getelementptr inbounds i32, ptr %escape, i32 %add8
50 store i32 %tmp2, ptr %arrayidx9, align 4
53 if.end: ; preds = %if.then, %for.body3
56 for.inc: ; preds = %if.end
57 %inc = add nsw i32 %j.0, 1
60 for.end: ; preds = %for.cond1
63 for.inc10: ; preds = %for.end
64 %inc11 = add nsw i32 %i.0, 1
67 for.end12: ; preds = %for.cond