1; RUN: opt %loadPolly -basic-aa -polly-invariant-load-hoisting=true -polly-print-ast -disable-output < %s | FileCheck %s --allow-empty
2
3;#include <string.h>
4;#include <stdio.h>
5;#define N 1021
6;
7;int main () {
8;  int i;
9;  int A[N];
10;  int RED[1];
11;
12;  memset(A, 0, sizeof(int) * N);
13;
14;  A[0] = 1;
15;  A[1] = 1;
16;  RED[0] = 0;
17;
18;  for (i = 2; i < N; i++) {
19;    A[i] = A[i-1] + A[i-2];
20;    RED[0] += A[i-2];
21;  }
22;
23;  if (RED[0] != 382399368)
24;    return 1;
25;}
26
27target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
28
29define i32 @main() nounwind {
30entry:
31  %A = alloca [1021 x i32], align 4               ; <[1021 x i32]*> [#uses=6]
32  %RED = alloca [1 x i32], align 4                ; <[1 x i32]*> [#uses=3]
33  %arraydecay = getelementptr inbounds [1021 x i32], [1021 x i32]* %A, i32 0, i32 0 ; <i32*> [#uses=1]
34  %conv = bitcast i32* %arraydecay to i8*         ; <i8*> [#uses=1]
35  call void @llvm.memset.p0i8.i64(i8* %conv, i8 0, i64 4084, i32 1, i1 false)
36  %arraydecay1 = getelementptr inbounds [1021 x i32], [1021 x i32]* %A, i32 0, i32 0 ; <i32*> [#uses=1]
37  %arrayidx = getelementptr inbounds i32, i32* %arraydecay1, i64 0 ; <i32*> [#uses=1]
38  store i32 1, i32* %arrayidx
39  %arraydecay2 = getelementptr inbounds [1021 x i32], [1021 x i32]* %A, i32 0, i32 0 ; <i32*> [#uses=1]
40  %arrayidx3 = getelementptr inbounds i32, i32* %arraydecay2, i64 1 ; <i32*> [#uses=1]
41  store i32 1, i32* %arrayidx3
42  %arraydecay4 = getelementptr inbounds [1 x i32], [1 x i32]* %RED, i32 0, i32 0 ; <i32*> [#uses=1]
43  %arrayidx5 = getelementptr inbounds i32, i32* %arraydecay4, i64 0 ; <i32*> [#uses=1]
44  store i32 0, i32* %arrayidx5
45  br label %for.cond
46
47for.cond:                                         ; preds = %for.inc, %entry
48  %indvar = phi i64 [ %indvar.next, %for.inc ], [ 0, %entry ] ; <i64> [#uses=5]
49  %arrayidx15 = getelementptr [1021 x i32], [1021 x i32]* %A, i64 0, i64 %indvar ; <i32*> [#uses=2]
50  %tmp = add i64 %indvar, 2                       ; <i64> [#uses=1]
51  %arrayidx20 = getelementptr [1021 x i32], [1021 x i32]* %A, i64 0, i64 %tmp ; <i32*> [#uses=1]
52  %tmp1 = add i64 %indvar, 1                      ; <i64> [#uses=1]
53  %arrayidx9 = getelementptr [1021 x i32], [1021 x i32]* %A, i64 0, i64 %tmp1 ; <i32*> [#uses=1]
54  %exitcond = icmp ne i64 %indvar, 1019           ; <i1> [#uses=1]
55  br i1 %exitcond, label %for.body, label %for.end
56
57for.body:                                         ; preds = %for.cond
58  %tmp10 = load i32, i32* %arrayidx9                   ; <i32> [#uses=1]
59  %tmp16 = load i32, i32* %arrayidx15                  ; <i32> [#uses=1]
60  %add = add nsw i32 %tmp10, %tmp16               ; <i32> [#uses=1]
61  store i32 %add, i32* %arrayidx20
62  %tmp26 = load i32, i32* %arrayidx15                  ; <i32> [#uses=1]
63  %arraydecay27 = getelementptr inbounds [1 x i32], [1 x i32]* %RED, i32 0, i32 0 ; <i32*> [#uses=1]
64  %arrayidx28 = getelementptr inbounds i32, i32* %arraydecay27, i64 0 ; <i32*> [#uses=2]
65  %tmp29 = load i32, i32* %arrayidx28                  ; <i32> [#uses=1]
66  %add30 = add nsw i32 %tmp29, %tmp26             ; <i32> [#uses=1]
67  store i32 %add30, i32* %arrayidx28
68  br label %for.inc
69
70for.inc:                                          ; preds = %for.body
71  %indvar.next = add i64 %indvar, 1               ; <i64> [#uses=1]
72  br label %for.cond
73
74for.end:                                          ; preds = %for.cond
75  %arraydecay32 = getelementptr inbounds [1 x i32], [1 x i32]* %RED, i32 0, i32 0 ; <i32*> [#uses=1]
76  %arrayidx33 = getelementptr inbounds i32, i32* %arraydecay32, i64 0 ; <i32*> [#uses=1]
77  %tmp34 = load i32, i32* %arrayidx33                  ; <i32> [#uses=1]
78  %cmp35 = icmp ne i32 %tmp34, 382399368          ; <i1> [#uses=1]
79  br i1 %cmp35, label %if.then, label %if.end
80
81if.then:                                          ; preds = %for.end
82  br label %if.end
83
84if.end:                                           ; preds = %if.then, %for.end
85  %retval.0 = phi i32 [ 1, %if.then ], [ 0, %for.end ] ; <i32> [#uses=1]
86  ret i32 %retval.0
87}
88
89declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i32, i1) nounwind
90
91; This is a negative test. We can prove that RED[0] in the conditional after
92; the loop is dereferencable and consequently expand the SCoP from the
93; loop to include the conditional. However, during SCoP generation we realize
94; that, while RED[0] is invariant, it is written to as part of the same scop
95; and can consequently not be hoisted. Hence, we invalidate the scop.
96;
97; CHECK-NOT: for (int c0 = 0; c0 <= 1018; c0 += 1)
98