reduction_different_reduction_clauses.ll
2.04 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
; RUN: opt %loadPolly -basic-aa -polly-ast -polly-ast-detect-parallel -analyze < %s | FileCheck %s
;
; CHECK: #pragma simd reduction (+ : MemRef_sum{{[1,2]}}, MemRef_sum{{[1,2]}}) reduction (* : MemRef_prod) reduction (| : MemRef_or) reduction (& : MemRef_and)
; CHECK: #pragma known-parallel reduction (+ : MemRef_sum{{[1,2]}}, MemRef_sum{{[1,2]}}) reduction (* : MemRef_prod) reduction (| : MemRef_or) reduction (& : MemRef_and)
; CHECK: for (int c0 = 0; c0 < N; c0 += 1)
; CHECK: Stmt_for_body(c0);
;
; void f(int N, int *restrict sum1, int *restrict sum2, int *restrict prod,
; int *restrict and, int *restrict or ) {
; for (int i = 0; i < N; i++) {
; *sum1 += i;
; *sum2 += i + 1;
; *prod *= i;
; *and &= i;
; * or |= i;
; }
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @f(i32 %N, i32* noalias %sum1, i32* noalias %sum2, i32* noalias %prod, i32* noalias %and, i32* noalias %or) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
%cmp = icmp slt i32 %i.0, %N
br i1 %cmp, label %for.body, label %for.end
for.body: ; preds = %for.cond
%tmp = load i32, i32* %sum1, align 4
%add = add nsw i32 %tmp, %i.0
store i32 %add, i32* %sum1, align 4
%add1 = add nsw i32 %i.0, 1
%tmp1 = load i32, i32* %sum2, align 4
%add2 = add nsw i32 %tmp1, %add1
store i32 %add2, i32* %sum2, align 4
%tmp2 = load i32, i32* %prod, align 4
%mul = mul nsw i32 %tmp2, %i.0
store i32 %mul, i32* %prod, align 4
%tmp3 = load i32, i32* %and, align 4
%and3 = and i32 %tmp3, %i.0
store i32 %and3, i32* %and, align 4
%tmp4 = load i32, i32* %or, align 4
%or4 = or i32 %tmp4, %i.0
store i32 %or4, i32* %or, 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
}