1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
; RUN: opt %loadPolly -polly-print-scops -disable-output < %s | FileCheck %s
;
;
; void f(int *A) {
; for (int i = 0; i < 1024; i++)
; A[i % 2] += i;
; }
;
; Verify that we detect the reduction on A
;
; CHECK: ReadAccess := [Reduction Type: +] [Scalar: 0]
; CHECK: MustWriteAccess := [Reduction Type: +] [Scalar: 0]
;
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
define void @f(ptr %A) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %i.0, 1024
br i1 %exitcond, label %for.body, label %for.end
for.body: ; preds = %for.cond
%rem = srem i32 %i.0, 2
%arrayidx = getelementptr inbounds i32, ptr %A, i32 %rem
%tmp = load i32, ptr %arrayidx, align 4
%add = add nsw i32 %tmp, %i.0
store i32 %add, ptr %arrayidx, align 4
br label %for.inc
for.inc: ; preds = %for.body
%inc = add nsw i32 %i.0, 1
br label %for.cond
for.end: ; preds = %for.cond
ret void
}
|
