1; RUN: opt %loadPolly -polly-process-unprofitable -polly-scops -polly-invariant-load-hoisting=true -analyze < %s | FileCheck %s 2; 3; CHECK: Invariant Accesses: 4; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] 5; CHECK-NEXT: { Stmt_bb2[i0] -> MemRef_B[0] }; 6; CHECK-NOT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1] 7; CHECK-NOT: { Stmt_bb2[i0] -> MemRef_tmp[] }; 8; 9; void f(int *restrict A, int *restrict B) { 10; for (int i = 0; i < 1024; i++) 11; auto tmp = *B; 12; // Split BB 13; A[i] = tmp; 14; } 15; 16target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 17 18define void @f(i32* noalias %A, i32* noalias %B) { 19bb: 20 br label %bb1 21 22bb1: ; preds = %bb4, %bb 23 %indvars.iv = phi i64 [ %indvars.iv.next, %bb4 ], [ 0, %bb ] 24 %exitcond = icmp ne i64 %indvars.iv, 1024 25 br i1 %exitcond, label %bb2, label %bb5 26 27bb2: ; preds = %bb1 28 %tmp = load i32, i32* %B, align 4 29 br label %bb2b 30 31bb2b: 32 %tmp3 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv 33 store i32 %tmp, i32* %tmp3, align 4 34 br label %bb4 35 36bb4: ; preds = %bb2 37 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 38 br label %bb1 39 40bb5: ; preds = %bb1 41 ret void 42} 43