| ; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s |
| ; RUN: opt %loadPolly -polly-ast -analyze < %s | FileCheck %s --check-prefix=AST |
| ; |
| ; void f(int *A, int N) { |
| ; for (int i = 0; i < N; i++) |
| ; switch (i % 4) { |
| ; case 0: |
| ; break; |
| ; case 1: |
| ; A[i] += 1; |
| ; break; |
| ; case 2: |
| ; A[i] += 2; |
| ; break; |
| ; case 3: |
| ; A[i] += 3; |
| ; break; |
| ; } |
| ; } |
| |
| ; CHECK: Statements { |
| ; CHECK-NEXT: Stmt_sw_bb_1 |
| ; CHECK-NEXT: Domain := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_1[i0] : (-1 + i0) mod 4 = 0 and 0 < i0 < N }; |
| ; CHECK-NEXT: Schedule := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_1[i0] -> [i0, 2] }; |
| ; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_1[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_1[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: Stmt_sw_bb_2 |
| ; CHECK-NEXT: Domain := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_2[i0] : (2 + i0) mod 4 = 0 and 2 <= i0 < N }; |
| ; CHECK-NEXT: Schedule := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_2[i0] -> [i0, 1] }; |
| ; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_2[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_2[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: Stmt_sw_bb_6 |
| ; CHECK-NEXT: Domain := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_6[i0] : (1 + i0) mod 4 = 0 and 3 <= i0 < N }; |
| ; CHECK-NEXT: Schedule := |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_6[i0] -> [i0, 0] }; |
| ; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_6[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0] |
| ; CHECK-NEXT: [N] -> { Stmt_sw_bb_6[i0] -> MemRef_A[i0] }; |
| ; CHECK-NEXT: } |
| |
| ; AST: if (1) |
| ; |
| ; AST: for (int c0 = 1; c0 < N; c0 += 4) { |
| ; AST-NEXT: Stmt_sw_bb_1(c0); |
| ; AST-NEXT: if (N >= c0 + 2) { |
| ; AST-NEXT: Stmt_sw_bb_2(c0 + 1); |
| ; AST-NEXT: if (N >= c0 + 3) |
| ; AST-NEXT: Stmt_sw_bb_6(c0 + 2); |
| ; AST-NEXT: } |
| ; AST-NEXT: } |
| ; |
| ; AST: else |
| ; AST-NEXT: { /* original code */ } |
| |
| target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" |
| |
| define void @f(i32* %A, i32 %N) { |
| entry: |
| %tmp = sext i32 %N to i64 |
| br label %for.cond |
| |
| for.cond: ; preds = %for.inc, %entry |
| %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ] |
| %cmp = icmp slt i64 %indvars.iv, %tmp |
| br i1 %cmp, label %for.body, label %for.end |
| |
| for.body: ; preds = %for.cond |
| %tmp1 = trunc i64 %indvars.iv to i32 |
| %rem = srem i32 %tmp1, 4 |
| switch i32 %rem, label %sw.epilog [ |
| i32 0, label %sw.bb |
| i32 1, label %sw.bb.1 |
| i32 2, label %sw.bb.2 |
| i32 3, label %sw.bb.6 |
| ] |
| |
| sw.bb: ; preds = %for.body |
| br label %sw.epilog |
| |
| sw.bb.1: ; preds = %for.body |
| %arrayidx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv |
| %tmp2 = load i32, i32* %arrayidx, align 4 |
| %add = add nsw i32 %tmp2, 1 |
| store i32 %add, i32* %arrayidx, align 4 |
| br label %sw.epilog |
| |
| sw.bb.2: ; preds = %for.body |
| %arrayidx4 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv |
| %tmp3 = load i32, i32* %arrayidx4, align 4 |
| %add5 = add nsw i32 %tmp3, 2 |
| store i32 %add5, i32* %arrayidx4, align 4 |
| br label %sw.epilog |
| |
| sw.bb.6: ; preds = %for.body |
| %arrayidx8 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv |
| %tmp4 = load i32, i32* %arrayidx8, align 4 |
| %add9 = add nsw i32 %tmp4, 3 |
| store i32 %add9, i32* %arrayidx8, align 4 |
| br label %sw.epilog |
| |
| sw.epilog: ; preds = %sw.bb.6, %sw.bb.2, %sw.bb.1, %sw.bb, %for.body |
| br label %for.inc |
| |
| for.inc: ; preds = %sw.epilog |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 |
| br label %for.cond |
| |
| for.end: ; preds = %for.cond |
| ret void |
| } |