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