97 lines · plain
1; RUN: opt %loadNPMPolly -aa-pipeline=basic-aa -polly-invariant-load-hoisting=true '-passes=polly-custom<ast>' -polly-print-ast -disable-output < %s | FileCheck %s --allow-empty2 3;#include <string.h>4;#include <stdio.h>5;#define N 10216;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 ; <ptr> [#uses=6]32 %RED = alloca [1 x i32], align 4 ; <ptr> [#uses=3]33 %arraydecay = getelementptr inbounds [1021 x i32], ptr %A, i32 0, i32 0 ; <ptr> [#uses=1]34 call void @llvm.memset.p0.i64(ptr %arraydecay, i8 0, i64 4084, i32 1, i1 false)35 %arraydecay1 = getelementptr inbounds [1021 x i32], ptr %A, i32 0, i32 0 ; <ptr> [#uses=1]36 %arrayidx = getelementptr inbounds i32, ptr %arraydecay1, i64 0 ; <ptr> [#uses=1]37 store i32 1, ptr %arrayidx38 %arraydecay2 = getelementptr inbounds [1021 x i32], ptr %A, i32 0, i32 0 ; <ptr> [#uses=1]39 %arrayidx3 = getelementptr inbounds i32, ptr %arraydecay2, i64 1 ; <ptr> [#uses=1]40 store i32 1, ptr %arrayidx341 %arraydecay4 = getelementptr inbounds [1 x i32], ptr %RED, i32 0, i32 0 ; <ptr> [#uses=1]42 %arrayidx5 = getelementptr inbounds i32, ptr %arraydecay4, i64 0 ; <ptr> [#uses=1]43 store i32 0, ptr %arrayidx544 br label %for.cond45 46for.cond: ; preds = %for.inc, %entry47 %indvar = phi i64 [ %indvar.next, %for.inc ], [ 0, %entry ] ; <i64> [#uses=5]48 %arrayidx15 = getelementptr [1021 x i32], ptr %A, i64 0, i64 %indvar ; <ptr> [#uses=2]49 %tmp = add i64 %indvar, 2 ; <i64> [#uses=1]50 %arrayidx20 = getelementptr [1021 x i32], ptr %A, i64 0, i64 %tmp ; <ptr> [#uses=1]51 %tmp1 = add i64 %indvar, 1 ; <i64> [#uses=1]52 %arrayidx9 = getelementptr [1021 x i32], ptr %A, i64 0, i64 %tmp1 ; <ptr> [#uses=1]53 %exitcond = icmp ne i64 %indvar, 1019 ; <i1> [#uses=1]54 br i1 %exitcond, label %for.body, label %for.end55 56for.body: ; preds = %for.cond57 %tmp10 = load i32, ptr %arrayidx9 ; <i32> [#uses=1]58 %tmp16 = load i32, ptr %arrayidx15 ; <i32> [#uses=1]59 %add = add nsw i32 %tmp10, %tmp16 ; <i32> [#uses=1]60 store i32 %add, ptr %arrayidx2061 %tmp26 = load i32, ptr %arrayidx15 ; <i32> [#uses=1]62 %arraydecay27 = getelementptr inbounds [1 x i32], ptr %RED, i32 0, i32 0 ; <ptr> [#uses=1]63 %arrayidx28 = getelementptr inbounds i32, ptr %arraydecay27, i64 0 ; <ptr> [#uses=2]64 %tmp29 = load i32, ptr %arrayidx28 ; <i32> [#uses=1]65 %add30 = add nsw i32 %tmp29, %tmp26 ; <i32> [#uses=1]66 store i32 %add30, ptr %arrayidx2867 br label %for.inc68 69for.inc: ; preds = %for.body70 %indvar.next = add i64 %indvar, 1 ; <i64> [#uses=1]71 br label %for.cond72 73for.end: ; preds = %for.cond74 %arraydecay32 = getelementptr inbounds [1 x i32], ptr %RED, i32 0, i32 0 ; <ptr> [#uses=1]75 %arrayidx33 = getelementptr inbounds i32, ptr %arraydecay32, i64 0 ; <ptr> [#uses=1]76 %tmp34 = load i32, ptr %arrayidx33 ; <i32> [#uses=1]77 %cmp35 = icmp ne i32 %tmp34, 382399368 ; <i1> [#uses=1]78 br i1 %cmp35, label %if.then, label %if.end79 80if.then: ; preds = %for.end81 br label %if.end82 83if.end: ; preds = %if.then, %for.end84 %retval.0 = phi i32 [ 1, %if.then ], [ 0, %for.end ] ; <i32> [#uses=1]85 ret i32 %retval.086}87 88declare void @llvm.memset.p0.i64(ptr nocapture, i8, i64, i32, i1) nounwind89 90; This is a negative test. We can prove that RED[0] in the conditional after91; the loop is dereferenceable and consequently expand the SCoP from the92; loop to include the conditional. However, during SCoP generation we realize93; that, while RED[0] is invariant, it is written to as part of the same scop94; and can consequently not be hoisted. Hence, we invalidate the scop.95;96; CHECK-NOT: for (int c0 = 0; c0 <= 1018; c0 += 1)97