88 lines · plain
1; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops '-passes=polly-custom<scops>' -polly-print-detect -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops -polly-process-unprofitable=false '-passes=polly-custom<scops>' -polly-print-detect -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s --check-prefix=PROFIT3; RUN: opt %loadNPMPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops -polly-detect-reductions=false '-passes=polly-custom<scops>' -polly-print-detect -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s -check-prefix=NO-REDUCTION4;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: f13; CHECK-NEXT: Region: %bb1---%bb1214; CHECK-NEXT: Max Loop Depth: 115; 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 425; CHECK-NEXT: i32 MemRef_A[*]; // Element size 426; CHECK-NEXT: }27; CHECK-NEXT: Arrays (Bounds as pw_affs) {28; CHECK-NEXT: i32 MemRef_C[*]; // Element size 429; CHECK-NEXT: i32 MemRef_A[*]; // Element size 430; 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__bb1035; 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: Statements48 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 %bb156 57bb1: ; preds = %bb11, %bb58 %indvars.iv = phi i64 [ %indvars.iv.next, %bb11 ], [ 0, %bb ]59 %exitcond = icmp ne i64 %indvars.iv, 102460 br i1 %exitcond, label %bb2, label %bb1261 62bb2: ; preds = %bb163 br label %bb364 65bb3: ; preds = %bb6, %bb266 %tmp = getelementptr inbounds i32, ptr %C, i64 %indvars.iv67 %tmp4 = load i32, ptr %tmp, align 468 %tmp5 = icmp eq i32 %tmp4, 069 br i1 %tmp5, label %bb10, label %bb670 71bb6: ; preds = %bb372 %tmp7 = getelementptr inbounds i32, ptr %A, i64 %indvars.iv73 %tmp8 = load i32, ptr %tmp7, align 474 %tmp9 = add nsw i32 %tmp8, 175 store i32 %tmp9, ptr %tmp7, align 476 br label %bb377 78bb10: ; preds = %bb379 br label %bb1180 81bb11: ; preds = %bb1082 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 183 br label %bb184 85bb12: ; preds = %bb186 ret void87}88