| ; RUN: opt %loadPolly -polly-process-unprofitable -polly-scops -polly-invariant-load-hoisting=true -analyze < %s | FileCheck %s |
| ; |
| ; CHECK: Invariant Accesses: |
| ; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] |
| ; CHECK-NEXT: { Stmt_bb2[i0] -> MemRef_B[0] }; |
| ; CHECK-NOT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1] |
| ; CHECK-NOT: { Stmt_bb2[i0] -> MemRef_tmp[] }; |
| ; |
| ; void f(int *restrict A, int *restrict B) { |
| ; for (int i = 0; i < 1024; i++) |
| ; auto tmp = *B; |
| ; // Split BB |
| ; A[i] = tmp; |
| ; } |
| ; |
| target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" |
| |
| define void @f(i32* noalias %A, i32* noalias %B) { |
| bb: |
| br label %bb1 |
| |
| bb1: ; preds = %bb4, %bb |
| %indvars.iv = phi i64 [ %indvars.iv.next, %bb4 ], [ 0, %bb ] |
| %exitcond = icmp ne i64 %indvars.iv, 1024 |
| br i1 %exitcond, label %bb2, label %bb5 |
| |
| bb2: ; preds = %bb1 |
| %tmp = load i32, i32* %B, align 4 |
| br label %bb2b |
| |
| bb2b: |
| %tmp3 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv |
| store i32 %tmp, i32* %tmp3, align 4 |
| br label %bb4 |
| |
| bb4: ; preds = %bb2 |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 |
| br label %bb1 |
| |
| bb5: ; preds = %bb1 |
| ret void |
| } |