1 ; RUN: opt %loadPolly -polly-import-jscop -polly-ast -polly-ast-detect-parallel -analyze < %s | FileCheck %s
3 ; CHECK: #pragma known-parallel reduction (+ : MemRef_A)
4 ; CHECK-NEXT: for (int c0 = 0; c0 <= 2; c0 += 1) {
5 ; CHECK-NEXT: if (c0 == 1) {
6 ; CHECK-NEXT: #pragma simd
7 ; CHECK-NEXT: for (int c1 = 0; c1 < 2 * n; c1 += 1)
8 ; CHECK-NEXT: Stmt_S1(c1);
10 ; CHECK-NEXT: #pragma simd reduction (+ : MemRef_A)
11 ; CHECK-NEXT: for (int c1 = (-c0 / 2) + 2; c1 <= 2 * n; c1 += 2)
12 ; CHECK-NEXT: Stmt_S0(2 * n - c1);
15 ; void rmalrs(int *A, long n) {
16 ; for (long i = 0; i < 2 * n; i++)
18 ; for (long i = 0; i < 2 * n; i++)
22 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
24 define void @rmalrs(i32* %A, i32 %n) {
28 for.cond: ; preds = %for.inc, %entry
29 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
30 %mul = shl nsw i32 %n, 1
31 %cmp = icmp slt i32 %i.0, %mul
32 br i1 %cmp, label %for.body, label %for.end
34 for.body: ; preds = %for.cond
37 S0: ; preds = %for.body
38 %tmp = load i32, i32* %A, align 4
39 %add = add nsw i32 %tmp, %i.0
40 store i32 %add, i32* %A, align 4
43 for.inc: ; preds = %S0
44 %inc = add nsw i32 %i.0, 1
47 for.end: ; preds = %for.cond
50 for.cond2: ; preds = %for.inc8, %for.end
51 %i1.0 = phi i32 [ 0, %for.end ], [ %inc9, %for.inc8 ]
52 %mul3 = shl nsw i32 %n, 1
53 %cmp4 = icmp slt i32 %i1.0, %mul3
54 br i1 %cmp4, label %for.body5, label %for.end10
56 for.body5: ; preds = %for.cond2
59 S1: ; preds = %for.body5
60 %add6 = add nsw i32 %i1.0, 1
61 %arrayidx7 = getelementptr inbounds i32, i32* %A, i32 %add6
62 store i32 1, i32* %arrayidx7, align 4
65 for.inc8: ; preds = %S1
66 %inc9 = add nsw i32 %i1.0, 1
69 for.end10: ; preds = %for.cond2