1; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops '-passes=print<polly-detect>,print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s 2; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops -polly-process-unprofitable=false '-passes=print<polly-detect>,print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s --check-prefix=PROFIT 3; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops -polly-detect-reductions=false '-passes=print<polly-detect>,print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s -check-prefix=NO-REDUCTION 4; 5; void f(int *A, int *C) { 6; for (int i = 0; i < 1024; i++) { 7; while (C[i]) 8; A[i]++; 9; } 10; } 11; 12; CHECK: Function: f 13; CHECK-NEXT: Region: %bb1---%bb12 14; CHECK-NEXT: Max Loop Depth: 1 15; CHECK-NEXT: Invariant Accesses: { 16; CHECK-NEXT: } 17; CHECK-NEXT: Context: 18; CHECK-NEXT: { : } 19; CHECK-NEXT: Assumed Context: 20; CHECK-NEXT: { : } 21; CHECK-NEXT: Invalid Context: 22; CHECK-NEXT: { : false } 23; CHECK: Arrays { 24; CHECK-NEXT: i32 MemRef_C[*]; // Element size 4 25; CHECK-NEXT: i32 MemRef_A[*]; // Element size 4 26; CHECK-NEXT: } 27; CHECK-NEXT: Arrays (Bounds as pw_affs) { 28; CHECK-NEXT: i32 MemRef_C[*]; // Element size 4 29; CHECK-NEXT: i32 MemRef_A[*]; // Element size 4 30; CHECK-NEXT: } 31; CHECK-NEXT: Alias Groups (1): 32; CHECK-NEXT: {{\[\[}} <{ MemRef_C[(0)] }, { MemRef_C[(1024)] }> <{ MemRef_A[(0)] }, { MemRef_A[(1024)] }> {{\]\]}} 33; CHECK-NEXT: Statements { 34; CHECK-NEXT: Stmt_bb3__TO__bb10 35; CHECK-NEXT: Domain := 36; CHECK-NEXT: { Stmt_bb3__TO__bb10[i0] : 0 <= i0 <= 1023 }; 37; CHECK-NEXT: Schedule := 38; CHECK-NEXT: { Stmt_bb3__TO__bb10[i0] -> [i0] }; 39; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] 40; CHECK-NEXT: { Stmt_bb3__TO__bb10[i0] -> MemRef_C[i0] }; 41; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0] 42; CHECK-NEXT: { Stmt_bb3__TO__bb10[i0] -> MemRef_A[i0] }; 43; CHECK-NEXT: MayWriteAccess := [Reduction Type: +] [Scalar: 0] 44; CHECK-NEXT: { Stmt_bb3__TO__bb10[i0] -> MemRef_A[i0] }; 45; CHECK-NEXT: } 46 47; PROFIT-NOT: Statements 48 49; NO-REDUCTION-NOT: Reduction Type: + 50 51target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 52 53define void @f(ptr %A, ptr %C) { 54bb: 55 br label %bb1 56 57bb1: ; preds = %bb11, %bb 58 %indvars.iv = phi i64 [ %indvars.iv.next, %bb11 ], [ 0, %bb ] 59 %exitcond = icmp ne i64 %indvars.iv, 1024 60 br i1 %exitcond, label %bb2, label %bb12 61 62bb2: ; preds = %bb1 63 br label %bb3 64 65bb3: ; preds = %bb6, %bb2 66 %tmp = getelementptr inbounds i32, ptr %C, i64 %indvars.iv 67 %tmp4 = load i32, ptr %tmp, align 4 68 %tmp5 = icmp eq i32 %tmp4, 0 69 br i1 %tmp5, label %bb10, label %bb6 70 71bb6: ; preds = %bb3 72 %tmp7 = getelementptr inbounds i32, ptr %A, i64 %indvars.iv 73 %tmp8 = load i32, ptr %tmp7, align 4 74 %tmp9 = add nsw i32 %tmp8, 1 75 store i32 %tmp9, ptr %tmp7, align 4 76 br label %bb3 77 78bb10: ; preds = %bb3 79 br label %bb11 80 81bb11: ; preds = %bb10 82 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 83 br label %bb1 84 85bb12: ; preds = %bb1 86 ret void 87} 88