1; RUN: opt %loadPolly -polly-codegen -polly-invariant-load-hoisting=true -polly-ignore-aliasing -polly-process-unprofitable -S < %s | FileCheck %s 2; 3; CHECK-LABEL: polly.preload.begin: 4; CHECK-NEXT: %0 = sext i32 %N to i64 5; CHECK-NEXT: %1 = icmp sge i64 %0, 514 6; CHECK-NEXT: br label %polly.preload.cond 7; 8; CHECK-LABEL: polly.preload.cond: 9; CHECK-NEXT: br i1 %1, label %polly.preload.exec, label %polly.preload.merge 10; 11; CHECK-LABEL: polly.preload.merge: 12; CHECK-NEXT: %polly.preload.tmp6.merge = phi i32* [ %polly.access.BPLoc.load, %polly.preload.exec ], [ null, %polly.preload.cond ] 13; 14; CHECK-LABEL: polly.stmt.bb5: 15; CHECK-NEXT: %scevgep9 = getelementptr i32, i32* %polly.preload.tmp6.merge, i64 %polly.indvar6 16; 17; void f(int **BPLoc, int *A, int N) { 18; for (int i = 0; i < N; i++) 19; if (i > 512) 20; (*BPLoc)[i] = 0; 21; else 22; A[i] = 0; 23; } 24; 25target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 26 27define void @f(i32** %BPLoc, i32* %A, i32 %N) { 28bb: 29 %tmp = sext i32 %N to i64 30 br label %bb1 31 32bb1: ; preds = %bb11, %bb 33 %indvars.iv = phi i64 [ %indvars.iv.next, %bb11 ], [ 0, %bb ] 34 %tmp2 = icmp slt i64 %indvars.iv, %tmp 35 br i1 %tmp2, label %bb3, label %bb12 36 37bb3: ; preds = %bb1 38 %tmp4 = icmp sgt i64 %indvars.iv, 512 39 br i1 %tmp4, label %bb5, label %bb8 40 41bb5: ; preds = %bb3 42 %tmp6 = load i32*, i32** %BPLoc, align 8 43 %tmp7 = getelementptr inbounds i32, i32* %tmp6, i64 %indvars.iv 44 store i32 0, i32* %tmp7, align 4 45 br label %bb10 46 47bb8: ; preds = %bb3 48 %tmp9 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv 49 store i32 0, i32* %tmp9, align 4 50 br label %bb10 51 52bb10: ; preds = %bb8, %bb5 53 br label %bb11 54 55bb11: ; preds = %bb10 56 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 57 br label %bb1 58 59bb12: ; preds = %bb1 60 ret void 61} 62