236
|
1 ; RUN: opt %loadPolly -polly-print-scops -disable-output < %s | FileCheck %s
|
150
|
2 ;
|
|
3 ; CHECK: Assumed Context:
|
|
4 ; CHECK-NEXT: [N] -> { : }
|
|
5 ; CHECK-NEXT: Invalid Context:
|
|
6 ; CHECK-NEXT: [N] -> { : false }
|
221
|
7 ; CHECK: p0: %N
|
150
|
8 ; CHECK: Statements {
|
|
9 ; CHECK-NEXT: Stmt_for_body
|
|
10 ; CHECK-NEXT: Domain :=
|
|
11 ; CHECK-NEXT: [N] -> { Stmt_for_body[i0] : 0 <= i0 < N };
|
|
12 ; CHECK-NEXT: Schedule :=
|
|
13 ; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> [i0] };
|
|
14 ; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0]
|
|
15 ; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[1] : (1 + i0) mod 2 = 0; Stmt_for_body[i0] -> MemRef_A[0] : (i0) mod 2 = 0 }
|
|
16 ; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0]
|
236
|
17 ; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[1] : (1 + i0) mod 2 = 0; Stmt_for_body[i0] -> MemRef_A[0] : (i0) mod 2 = 0 };
|
150
|
18 ; CHECK-NEXT: }
|
|
19 ;
|
|
20 ; void f(int *A, int N) {
|
|
21 ; for (int i = 0; i < N; i++) {
|
|
22 ; A[i % 2]++;
|
|
23 ; }
|
|
24 ; }
|
|
25 ;
|
|
26 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
27
|
252
|
28 define void @f(ptr %A, i32 %N) {
|
150
|
29 entry:
|
|
30 br label %for.cond
|
|
31
|
|
32 for.cond: ; preds = %for.inc, %entry
|
|
33 %i.0 = phi i32 [ 0, %entry ], [ %inc1, %for.inc ]
|
|
34 %cmp = icmp slt i32 %i.0, %N
|
|
35 br i1 %cmp, label %for.body, label %for.end
|
|
36
|
|
37 for.body: ; preds = %for.cond
|
|
38 %i.t = trunc i32 %i.0 to i1
|
|
39 %rem = zext i1 %i.t to i32
|
|
40 %idxprom = sext i32 %rem to i64
|
252
|
41 %arrayidx = getelementptr inbounds i32, ptr %A, i64 %idxprom
|
|
42 %tmp = load i32, ptr %arrayidx, align 4
|
150
|
43 %inc = add nsw i32 %tmp, 1
|
252
|
44 store i32 %inc, ptr %arrayidx, align 4
|
150
|
45 br label %for.inc
|
|
46
|
|
47 for.inc: ; preds = %for.body
|
|
48 %inc1 = add nuw nsw i32 %i.0, 1
|
|
49 br label %for.cond
|
|
50
|
|
51 for.end: ; preds = %for.cond
|
|
52 ret void
|
|
53 }
|