1; RUN: opt %loadPolly -polly-detect-unprofitable -polly-scops -analyze < %s | FileCheck %s 2; 3; float f(float *A, int N) { 4; float tmp = 0; 5; for (int i = 0; i < N; i++) 6; tmp += A[i]; 7; } 8; 9; CHECK: Statements { 10; CHECK-LABEL: Stmt_bb1 11; CHECK-NOT: Access 12; CHECK: ReadAccess := [Reduction Type: NONE] 13; CHECK: [N] -> { Stmt_bb1[i0] -> MemRef_tmp_0[] }; 14; CHECK-NOT: Access 15; CHECK: MustWriteAccess := [Reduction Type: NONE] 16; CHECK: [N] -> { Stmt_bb1[i0] -> MemRef_tmp_0[] }; 17; CHECK-NOT: Access 18; CHECK-LABEL: Stmt_bb4 19; CHECK-NOT: Access 20; CHECK: MustWriteAccess := [Reduction Type: NONE] 21; CHECK: [N] -> { Stmt_bb4[i0] -> MemRef_tmp_0[] }; 22; CHECK-NOT: Access 23; CHECK: ReadAccess := [Reduction Type: NONE] 24; CHECK: [N] -> { Stmt_bb4[i0] -> MemRef_tmp_0[] }; 25; CHECK-NOT: Access 26; CHECK: ReadAccess := [Reduction Type: NONE] 27; CHECK: [N] -> { Stmt_bb4[i0] -> MemRef_A[i0] }; 28; CHECK-NOT: Access 29; CHECK: } 30target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 31 32define void @f(float* %A, i32 %N) { 33bb: 34 %tmp = sext i32 %N to i64 35 br label %bb1 36 37bb1: ; preds = %bb4, %bb 38 %indvars.iv = phi i64 [ %indvars.iv.next, %bb4 ], [ 0, %bb ] 39 %tmp.0 = phi float [ 0.000000e+00, %bb ], [ %tmp7, %bb4 ] 40 %tmp2 = icmp slt i64 %indvars.iv, %tmp 41 br i1 %tmp2, label %bb3, label %bb8 42 43bb3: ; preds = %bb1 44 br label %bb4 45 46bb4: ; preds = %bb3 47 %tmp5 = getelementptr inbounds float, float* %A, i64 %indvars.iv 48 %tmp6 = load float, float* %tmp5, align 4 49 %tmp7 = fadd float %tmp.0, %tmp6 50 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 51 br label %bb1 52 53bb8: ; preds = %bb1 54 br label %exit 55 56exit: 57 ret void 58} 59