comparison mlir/test/Dialect/Linalg/parallel_loops.mlir @ 150:1d019706d866

LLVM10
author anatofuz
date Thu, 13 Feb 2020 15:10:13 +0900
parents
children 0572611fdcc8
comparison
equal deleted inserted replaced
147:c2174574ed3a 150:1d019706d866
1 // RUN: mlir-opt %s -convert-linalg-to-parallel-loops -split-input-file | FileCheck %s --dump-input-on-failure
2
3 #map0 = affine_map<(d0, d1) -> (d0, d1)>
4 func @linalg_generic_sum(%lhs: memref<2x2xf32>,
5 %rhs: memref<2x2xf32>,
6 %sum: memref<2x2xf32>) {
7 linalg.generic {
8 args_in = 2 : i64,
9 args_out = 1 : i64,
10 indexing_maps = [#map0, #map0, #map0],
11 iterator_types = ["parallel", "parallel"]
12 } %lhs, %rhs, %sum {
13 ^bb0(%lhs_in: f32, %rhs_in: f32, %sum_out: f32): // no predecessors
14 %0 = addf %lhs_in, %rhs_in : f32
15 linalg.yield %0 : f32
16 }: memref<2x2xf32>, memref<2x2xf32>, memref<2x2xf32>
17 return
18 }
19 // CHECK-LABEL: @linalg_generic_sum
20 // CHECK: (%[[LHS:.*]]:{{.*}}, %[[RHS:.*]]:{{.*}}, %[[SUM:.*]]:{{.*}})
21 // CHECK-DAG: %[[C2:.*]] = constant 2
22 // CHECK-DAG: %[[C0:.*]] = constant 0
23 // CHECK-DAG: %[[C1:.*]] = constant 1
24 // CHECK: loop.parallel (%[[I:.*]], %[[J:.*]]) = {{.*}}
25 // CHECK: %[[LHS_ELEM:.*]] = load %[[LHS]][%[[I]], %[[J]]]
26 // CHECK: %[[RHS_ELEM:.*]] = load %[[RHS]][%[[I]], %[[J]]]
27 // CHECK: %[[SUM_ELEM:.*]] = load %[[SUM]][%[[I]], %[[J]]]
28 // CHECK: %[[SUM:.*]] = addf %[[LHS_ELEM]], %[[RHS_ELEM]] : f32
29 // CHECK: store %[[SUM]], %{{.*}}[%[[I]], %[[J]]]
30 // CHECK: "loop.terminator"() : () -> ()
31
32 // -----
33
34 #accesses = [
35 affine_map<(m, n) -> (m, n)>,
36 affine_map<(m, n) -> (m)>
37 ]
38 #trait = {
39 args_in = 1,
40 args_out = 1,
41 iterator_types = ["parallel", "reduction"],
42 indexing_maps = #accesses
43 }
44
45 func @do_not_lower_reduce(%A: memref<2x4xf32>, %B: memref<2xf32>) {
46 linalg.generic #trait %A, %B {
47 ^bb0(%a: f32, %b: f32):
48 linalg.yield %a: f32
49 } : memref<2x4xf32>, memref<2xf32>
50 return
51 }
52 // CHECK-LABEL: @do_not_lower_reduce
53 // CHECK: linalg.generic