1 ; RUN: opt %loadPolly -polly-detect-unprofitable -analyze -polly-scops -polly-model-phi-nodes < %s | FileCheck %s
3 ; void f(int *A, int c, int N) {
5 ; for (int i = 0; i < N; i++) {
16 ; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
17 ; CHECK: [N, c] -> { Stmt_bb6[i0] -> MemRef_tmp_0[] };
19 ; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
20 ; CHECK: [N, c] -> { Stmt_bb7[i0] -> MemRef_tmp_0[] };
22 ; CHECK: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
23 ; CHECK: [N, c] -> { Stmt_bb8[i0] -> MemRef_tmp_0[] };
24 ; CHECK: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
25 ; CHECK: [N, c] -> { Stmt_bb8[i0] -> MemRef_A[i0] };
28 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
30 define void @f(i32* %A, i32 %c, i32 %N) {
32 %tmp = sext i32 %N to i64
33 %tmp1 = sext i32 %c to i64
36 bb2: ; preds = %bb10, %bb
37 %indvars.iv = phi i64 [ %indvars.iv.next, %bb10 ], [ 0, %bb ]
38 %tmp3 = icmp slt i64 %indvars.iv, %tmp
39 br i1 %tmp3, label %bb4, label %bb11
42 %tmp5 = icmp sgt i64 %indvars.iv, %tmp1
43 br i1 %tmp5, label %bb6, label %bb7
51 bb8: ; preds = %bb7, %bb6
52 %tmp.0 = phi i32 [ 3, %bb6 ], [ 5, %bb7 ]
53 %tmp9 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
54 store i32 %tmp.0, i32* %tmp9, align 4
58 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1