1; RUN: opt %loadPolly -polly-allow-nonaffine -polly-dce -polly-ast -analyze < %s | FileCheck %s
2;
3;    void f(int *A) {
4;      for (int i = 0; i < 1024; i++)
5; S1:    A[bar(i)] = i;
6;      for (int i = 0; i < 1024; i++)
7; S2:    A[i2] = i;
8;    }
9
10; We unfortunately do need to execute all iterations of S1, as we do not know
11; the size of A and as a result S1 may write for example to A[1024], which
12; is not overwritten by S2.
13
14; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 1)
15; CHECK:   Stmt_S1(c0);
16; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 1)
17; CHECK:   Stmt_S2(c0);
18
19target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
20
21declare i32 @bar(i32) #1
22
23define void @f(i32* %A) {
24entry:
25  br label %for.cond
26
27for.cond:
28  %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
29  %exitcond = icmp ne i32 %i.0, 1024
30  br i1 %exitcond, label %S1, label %next
31
32S1:
33  %nonaff = call i32 @bar(i32 %i.0)
34  %arrayidx = getelementptr inbounds i32, i32* %A, i32 %nonaff
35  store i32 %i.0, i32* %arrayidx, align 4
36  br label %for.inc
37
38for.inc:
39  %inc = add nsw i32 %i.0, 1
40  br label %for.cond
41
42next:
43 br label %for.cond.2
44
45for.cond.2:
46  %i.2 = phi i32 [ 0, %next ], [ %inc.2, %for.inc.2 ]
47  %exitcond.2 = icmp ne i32 %i.2, 1024
48  br i1 %exitcond.2, label %S2, label %for.end
49
50S2:
51  %arrayidx.2 = getelementptr inbounds i32, i32* %A, i32 %i.2
52  store i32 %i.2, i32* %arrayidx.2, align 4
53  br label %for.inc.2
54
55for.inc.2:
56  %inc.2 = add nsw i32 %i.2, 1
57  br label %for.cond.2
58
59for.end:
60  ret void
61}
62
63attributes #1 = { nounwind readnone }
64
65