| 1 |
// RUN: mlir-opt -transform-interpreter -split-input-file %s | FileCheck %s |
| 2 |
|
| 3 |
func.func @conv1d_nwc_4x2x8_memref(%input: memref<4x6x3xf32>, %filter: memref<1x3x8xf32>, %output: memref<4x2x8xf32>) { |
| 4 |
linalg.conv_1d_nwc_wcf |
| 5 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 6 |
ins(%input, %filter : memref<4x6x3xf32>, memref<1x3x8xf32>) |
| 7 |
outs(%output : memref<4x2x8xf32>) |
| 8 |
return |
| 9 |
} |
| 10 |
|
| 11 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 12 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 13 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 14 |
|
| 15 |
// CHECK: func @conv1d_nwc_4x2x8_memref |
| 16 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x6x3xf32>, %[[FILTER:.+]]: memref<1x3x8xf32>, %[[OUTPUT:.+]]: memref<4x2x8xf32>) |
| 17 |
|
| 18 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 19 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 20 |
|
| 21 |
/// Read the whole data in one shot. |
| 22 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 23 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 24 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 25 |
|
| 26 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 27 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 28 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 29 |
// CHECK-SAME: {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 30 |
|
| 31 |
// CHECK: %[[V_FILTER:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<1x3x8xf32> |
| 32 |
|
| 33 |
// CHECK: %[[V_OUTPUT_0:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 34 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 35 |
// CHECK: %[[V_OUTPUT_1:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 36 |
// CHECK-SAME: {offsets = [0, 1, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 37 |
|
| 38 |
/// w == 0, kw == 0 |
| 39 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 40 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 41 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 42 |
// CHECK-SAME: kind = #vector.kind<add> |
| 43 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER]], %[[V_OUTPUT_0]] |
| 44 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 45 |
|
| 46 |
/// w == 1, kw == 0 |
| 47 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 48 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 49 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 50 |
// CHECK-SAME: kind = #vector.kind<add> |
| 51 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER]], %[[V_OUTPUT_1]] |
| 52 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 53 |
|
| 54 |
/// w == 0, kw == 0 |
| 55 |
// CHECK: %[[RES_0:.+]] = vector.insert_strided_slice %[[CONTRACT_0]], %[[V_OUTPUT_R]] |
| 56 |
// CHECK-SAME: {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 57 |
/// w == 1, kw == 0 |
| 58 |
// CHECK: %[[RES_1:.+]] = vector.insert_strided_slice %[[CONTRACT_1]], %[[RES_0]] |
| 59 |
// CHECK-SAME: {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 60 |
|
| 61 |
// Write the result back in one shot. |
| 62 |
// CHECK: vector.transfer_write %[[RES_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 63 |
|
| 64 |
module attributes {transform.with_named_sequence} { |
| 65 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 66 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 67 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 68 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 69 |
transform.yield |
| 70 |
} |
| 71 |
} |
| 72 |
|
| 73 |
// ----- |
| 74 |
|
| 75 |
// This test is same as above but for i1 type with the only difference being that |
| 76 |
// the combining kind for `vector.contract` is `OR`. |
| 77 |
func.func @conv1d_nwc_4x2x8_memref_i1(%input: memref<4x6x3xi1>, %filter: memref<1x3x8xi1>, %output: memref<4x2x8xi1>) { |
| 78 |
linalg.conv_1d_nwc_wcf |
| 79 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 80 |
ins(%input, %filter : memref<4x6x3xi1>, memref<1x3x8xi1>) |
| 81 |
outs(%output : memref<4x2x8xi1>) |
| 82 |
return |
| 83 |
} |
| 84 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 85 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 86 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 87 |
|
| 88 |
// CHECK: func @conv1d_nwc_4x2x8_memref_i1 |
| 89 |
/// w == 0, kw == 0 |
| 90 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 91 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 92 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 93 |
// CHECK-SAME: kind = #vector.kind<or> |
| 94 |
// CHECK-SAME: : vector<4x1x3xi1>, vector<3x8xi1> into vector<4x1x8xi1> |
| 95 |
|
| 96 |
/// w == 1, kw == 0 |
| 97 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 98 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 99 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 100 |
// CHECK-SAME: kind = #vector.kind<or> |
| 101 |
// CHECK-SAME: : vector<4x1x3xi1>, vector<3x8xi1> into vector<4x1x8xi1> |
| 102 |
|
| 103 |
module attributes {transform.with_named_sequence} { |
| 104 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 105 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 106 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 107 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 108 |
transform.yield |
| 109 |
} |
| 110 |
} |
| 111 |
|
| 112 |
// ----- |
| 113 |
|
| 114 |
// The i8i8i32 case is similar to f32 case, so checking one case is enough for |
| 115 |
// test coverage. |
| 116 |
func.func @conv1d_nwc_4x2x8_i8i8i32_memref(%input: memref<4x6x3xi8>, %filter: memref<1x3x8xi8>, %output: memref<4x2x8xi32>) { |
| 117 |
linalg.conv_1d_nwc_wcf |
| 118 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 119 |
ins(%input, %filter : memref<4x6x3xi8>, memref<1x3x8xi8>) |
| 120 |
outs(%output : memref<4x2x8xi32>) |
| 121 |
return |
| 122 |
} |
| 123 |
|
| 124 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 125 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 126 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 127 |
|
| 128 |
// CHECK: func @conv1d_nwc_4x2x8_i8i8i32_memref |
| 129 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x6x3xi8>, %[[FILTER:.+]]: memref<1x3x8xi8>, %[[OUTPUT:.+]]: memref<4x2x8xi32>) |
| 130 |
|
| 131 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 132 |
// CHECK-DAG: %[[C0_I8:.+]] = arith.constant 0 : i8 |
| 133 |
// CHECK-DAG: %[[C0_I32:.+]] = arith.constant 0 : i32 |
| 134 |
|
| 135 |
/// Read the whole data in one shot. |
| 136 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[C0_I8]] |
| 137 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[C0_I8]] |
| 138 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[C0_I32]] |
| 139 |
|
| 140 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 141 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 142 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 143 |
// CHECK-SAME: {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 144 |
|
| 145 |
// CHECK: %[[V_FILTER:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xi8> from vector<1x3x8xi8> |
| 146 |
|
| 147 |
// CHECK: %[[V_OUTPUT_0:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 148 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xi32> to vector<4x1x8xi32> |
| 149 |
// CHECK: %[[V_OUTPUT_1:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 150 |
// CHECK-SAME: {offsets = [0, 1, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xi32> to vector<4x1x8xi32> |
| 151 |
|
| 152 |
/// w == 0, kw == 0 |
| 153 |
// CHECK: %[[EXT_LHS_0:.+]] = arith.extsi %[[V_INPUT_0]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 154 |
// CHECK: %[[EXT_RHS_0:.+]] = arith.extsi %[[V_FILTER]] : vector<3x8xi8> to vector<3x8xi32> |
| 155 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 156 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 157 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 158 |
// CHECK-SAME: %[[EXT_LHS_0]], %[[EXT_RHS_0]], %[[V_OUTPUT_0]] |
| 159 |
// CHECK-SAME: : vector<4x1x3xi32>, vector<3x8xi32> into vector<4x1x8xi32> |
| 160 |
|
| 161 |
/// w == 1, kw == 0 |
| 162 |
// CHECK: %[[EXT_LHS_1:.+]] = arith.extsi %[[V_INPUT_1]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 163 |
// CHECK: %[[EXT_RHS_1:.+]] = arith.extsi %[[V_FILTER]] : vector<3x8xi8> to vector<3x8xi32> |
| 164 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 165 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 166 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 167 |
// CHECK-SAME: %[[EXT_LHS_1]], %[[EXT_RHS_1]], %[[V_OUTPUT_1]] |
| 168 |
// CHECK-SAME: : vector<4x1x3xi32>, vector<3x8xi32> into vector<4x1x8xi32> |
| 169 |
|
| 170 |
/// w == 0, kw == 0 |
| 171 |
// CHECK: %[[RES_0:.+]] = vector.insert_strided_slice %[[CONTRACT_0]], %[[V_OUTPUT_R]] |
| 172 |
// CHECK-SAME: {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x8xi32> into vector<4x2x8xi32> |
| 173 |
/// w == 1, kw == 0 |
| 174 |
// CHECK: %[[RES_1:.+]] = vector.insert_strided_slice %[[CONTRACT_1]], %[[RES_0]] |
| 175 |
// CHECK-SAME: {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x8xi32> into vector<4x2x8xi32> |
| 176 |
|
| 177 |
// Write the result back in one shot. |
| 178 |
// CHECK: vector.transfer_write %[[RES_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 179 |
|
| 180 |
module attributes {transform.with_named_sequence} { |
| 181 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 182 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 183 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 184 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 185 |
transform.yield |
| 186 |
} |
| 187 |
} |
| 188 |
|
| 189 |
// ----- |
| 190 |
|
| 191 |
func.func @conv1d_nwc_4x2x8_memref(%input: memref<4x6x3xf32>, %filter: memref<2x3x8xf32>, %output: memref<4x2x8xf32>) { |
| 192 |
linalg.conv_1d_nwc_wcf |
| 193 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 194 |
ins(%input, %filter : memref<4x6x3xf32>, memref<2x3x8xf32>) |
| 195 |
outs(%output : memref<4x2x8xf32>) |
| 196 |
return |
| 197 |
} |
| 198 |
|
| 199 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 200 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 201 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 202 |
|
| 203 |
// CHECK: func @conv1d_nwc_4x2x8_memref |
| 204 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x6x3xf32>, %[[FILTER:.+]]: memref<2x3x8xf32>, %[[OUTPUT:.+]]: memref<4x2x8xf32>) |
| 205 |
|
| 206 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 207 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 208 |
|
| 209 |
/// Read the whole data in one shot. |
| 210 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 211 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 212 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 213 |
|
| 214 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 215 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 216 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 217 |
// CHECK-SAME: {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 218 |
// CHECK: %[[V_INPUT_2:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 219 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 220 |
// CHECK: %[[V_INPUT_3:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 221 |
// CHECK-SAME: {offsets = [0, 5, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 222 |
|
| 223 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<2x3x8xf32> |
| 224 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<3x8xf32> from vector<2x3x8xf32> |
| 225 |
|
| 226 |
// CHECK: %[[V_OUTPUT_0:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 227 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 228 |
// CHECK: %[[V_OUTPUT_1:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 229 |
// CHECK-SAME: {offsets = [0, 1, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 230 |
|
| 231 |
/// w == 0, kw == 0 |
| 232 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 233 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 234 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 235 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER_0]], %[[V_OUTPUT_0]] |
| 236 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 237 |
/// w == 1, kw == 0 |
| 238 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 239 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 240 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 241 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER_0]], %[[V_OUTPUT_1]] |
| 242 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 243 |
/// w == 1, kw == 1 |
| 244 |
// CHECK: %[[CONTRACT_2:.+]] = vector.contract { |
| 245 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 246 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 247 |
// CHECK-SAME: %[[V_INPUT_2]], %[[V_FILTER_1]], %[[CONTRACT_0]] |
| 248 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 249 |
/// w == 1, kw == 1 |
| 250 |
// CHECK: %[[CONTRACT_3:.+]] = vector.contract { |
| 251 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 252 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 253 |
// CHECK-SAME: %[[V_INPUT_3]], %[[V_FILTER_1]], %[[CONTRACT_1]] |
| 254 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 255 |
|
| 256 |
/// w == 0, kw == 0 |
| 257 |
// CHECK: %[[RES_0:.+]] = vector.insert_strided_slice %[[CONTRACT_2]], %[[V_OUTPUT_R]] |
| 258 |
// CHECK-SAME: {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 259 |
/// w == 1, kw == 0 |
| 260 |
// CHECK: %[[RES_1:.+]] = vector.insert_strided_slice %[[CONTRACT_3]], %[[RES_0]] |
| 261 |
// CHECK-SAME: {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 262 |
|
| 263 |
// Write the result back in one shot. |
| 264 |
// CHECK: vector.transfer_write %[[RES_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 265 |
|
| 266 |
module attributes {transform.with_named_sequence} { |
| 267 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 268 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 269 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 270 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 271 |
transform.yield |
| 272 |
} |
| 273 |
} |
| 274 |
|
| 275 |
// ----- |
| 276 |
|
| 277 |
func.func @conv1d_nwc_4x2x8_memref(%input: memref<4x6x3xf32>, %filter: memref<2x3x8xf32>, %output: memref<4x2x8xf32>) { |
| 278 |
linalg.conv_1d_nwc_wcf |
| 279 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 280 |
ins(%input, %filter : memref<4x6x3xf32>, memref<2x3x8xf32>) |
| 281 |
outs(%output : memref<4x2x8xf32>) |
| 282 |
return |
| 283 |
} |
| 284 |
|
| 285 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 286 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 287 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 288 |
|
| 289 |
// CHECK: func @conv1d_nwc_4x2x8_memref |
| 290 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x6x3xf32>, %[[FILTER:.+]]: memref<2x3x8xf32>, %[[OUTPUT:.+]]: memref<4x2x8xf32>) |
| 291 |
|
| 292 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 293 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 294 |
|
| 295 |
/// Read the whole data in one shot. |
| 296 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 297 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 298 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 299 |
|
| 300 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 301 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 302 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 303 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 304 |
|
| 305 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<2x3x8xf32> |
| 306 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<3x8xf32> from vector<2x3x8xf32> |
| 307 |
|
| 308 |
/// w == 0, kw == 0 |
| 309 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 310 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 311 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 312 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER_0]], %[[V_OUTPUT_R]] |
| 313 |
// CHECK-SAME: : vector<4x2x3xf32>, vector<3x8xf32> into vector<4x2x8xf32> |
| 314 |
/// w == 0, kw == 1 |
| 315 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 316 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 317 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 318 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER_1]], %[[CONTRACT_0]] |
| 319 |
// CHECK-SAME: : vector<4x2x3xf32>, vector<3x8xf32> into vector<4x2x8xf32> |
| 320 |
|
| 321 |
// Write the result back in one shot. |
| 322 |
// CHECK: vector.transfer_write %[[CONTRACT_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 323 |
|
| 324 |
module attributes {transform.with_named_sequence} { |
| 325 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 326 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 327 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 328 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 329 |
transform.yield |
| 330 |
} |
| 331 |
} |
| 332 |
|
| 333 |
// ----- |
| 334 |
|
| 335 |
func.func @conv1d_ncw_4x8x2_memref(%input: memref<4x3x6xf32>, %filter: memref<8x3x1xf32>, %output: memref<4x8x2xf32>) { |
| 336 |
linalg.conv_1d_ncw_fcw |
| 337 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 338 |
ins(%input, %filter : memref<4x3x6xf32>, memref<8x3x1xf32>) |
| 339 |
outs(%output : memref<4x8x2xf32>) |
| 340 |
return |
| 341 |
} |
| 342 |
|
| 343 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 344 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 345 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 346 |
|
| 347 |
// CHECK: func @conv1d_ncw_4x8x2_memref |
| 348 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x3x6xf32>, %[[FILTER:.+]]: memref<8x3x1xf32>, %[[OUTPUT:.+]]: memref<4x8x2xf32>) |
| 349 |
|
| 350 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 351 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 352 |
|
| 353 |
/// Read the whole data in one shot. |
| 354 |
// CHECK-DAG: %[[V_NWC_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 355 |
// CHECK-DAG: %[[V_NWC_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 356 |
// CHECK-DAG: %[[V_NWC_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 357 |
|
| 358 |
/// Transpose result to nwc format. |
| 359 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transpose %[[V_NWC_INPUT_R]], [0, 2, 1] |
| 360 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transpose %[[V_NWC_FILTER_R]], [2, 1, 0] |
| 361 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transpose %[[V_NWC_OUTPUT_R]], [0, 2, 1] |
| 362 |
|
| 363 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 364 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 365 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 366 |
// CHECK-SAME: {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 367 |
|
| 368 |
// CHECK: %[[V_FILTER:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<1x3x8xf32> |
| 369 |
|
| 370 |
// CHECK: %[[V_OUTPUT_0:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 371 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 372 |
// CHECK: %[[V_OUTPUT_1:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 373 |
// CHECK-SAME: {offsets = [0, 1, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 374 |
|
| 375 |
/// w == 0, kw == 0 |
| 376 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 377 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 378 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 379 |
// CHECK-SAME: kind = #vector.kind<add> |
| 380 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER]], %[[V_OUTPUT_0]] |
| 381 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 382 |
|
| 383 |
/// w == 1, kw == 0 |
| 384 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 385 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 386 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 387 |
// CHECK-SAME: kind = #vector.kind<add> |
| 388 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER]], %[[V_OUTPUT_1]] |
| 389 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 390 |
|
| 391 |
/// w == 0, kw == 0 |
| 392 |
// CHECK: %[[RES_0:.+]] = vector.insert_strided_slice %[[CONTRACT_0]], %[[V_OUTPUT_R]] |
| 393 |
// CHECK-SAME: {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 394 |
/// w == 1, kw == 0 |
| 395 |
// CHECK: %[[RES_1:.+]] = vector.insert_strided_slice %[[CONTRACT_1]], %[[RES_0]] |
| 396 |
// CHECK-SAME: {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 397 |
|
| 398 |
/// Transpose result to ncw format. |
| 399 |
// CHECK: %[[RES_2:.+]] = vector.transpose %[[RES_1]], [0, 2, 1] |
| 400 |
|
| 401 |
// Write the result back in one shot. |
| 402 |
// CHECK: vector.transfer_write %[[RES_2]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 403 |
|
| 404 |
module attributes {transform.with_named_sequence} { |
| 405 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 406 |
%0 = transform.structured.match ops{["linalg.conv_1d_ncw_fcw"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 407 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 408 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 409 |
transform.yield |
| 410 |
} |
| 411 |
} |
| 412 |
|
| 413 |
// ----- |
| 414 |
|
| 415 |
// This test is same as above but for i1 type with the only difference being that |
| 416 |
// the combining kind for `vector.contract` is `OR`. |
| 417 |
func.func @conv1d_ncw_4x8x2_memref_i1(%input: memref<4x3x6xi1>, %filter: memref<8x3x1xi1>, %output: memref<4x8x2xi1>) { |
| 418 |
linalg.conv_1d_ncw_fcw |
| 419 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 420 |
ins(%input, %filter : memref<4x3x6xi1>, memref<8x3x1xi1>) |
| 421 |
outs(%output : memref<4x8x2xi1>) |
| 422 |
return |
| 423 |
} |
| 424 |
|
| 425 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 426 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 427 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 428 |
|
| 429 |
// CHECK: func @conv1d_ncw_4x8x2_memref_i1 |
| 430 |
/// w == 0, kw == 0 |
| 431 |
// CHECK: vector.contract { |
| 432 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 433 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 434 |
// CHECK-SAME: kind = #vector.kind<or> |
| 435 |
// CHECK-SAME: : vector<4x1x3xi1>, vector<3x8xi1> into vector<4x1x8xi1> |
| 436 |
|
| 437 |
/// w == 1, kw == 0 |
| 438 |
// CHECK: vector.contract { |
| 439 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 440 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 441 |
// CHECK-SAME: kind = #vector.kind<or> |
| 442 |
// CHECK-SAME: : vector<4x1x3xi1>, vector<3x8xi1> into vector<4x1x8xi1> |
| 443 |
|
| 444 |
module attributes {transform.with_named_sequence} { |
| 445 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 446 |
%0 = transform.structured.match ops{["linalg.conv_1d_ncw_fcw"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 447 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 448 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 449 |
transform.yield |
| 450 |
} |
| 451 |
} |
| 452 |
|
| 453 |
// ----- |
| 454 |
|
| 455 |
func.func @conv1d_ncw_4x8x2_memref(%input: memref<4x3x6xf32>, %filter: memref<8x3x2xf32>, %output: memref<4x8x2xf32>) { |
| 456 |
linalg.conv_1d_ncw_fcw |
| 457 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 458 |
ins(%input, %filter : memref<4x3x6xf32>, memref<8x3x2xf32>) |
| 459 |
outs(%output : memref<4x8x2xf32>) |
| 460 |
return |
| 461 |
} |
| 462 |
|
| 463 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 464 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 465 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 466 |
|
| 467 |
// CHECK: func @conv1d_ncw_4x8x2_memref |
| 468 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x3x6xf32>, %[[FILTER:.+]]: memref<8x3x2xf32>, %[[OUTPUT:.+]]: memref<4x8x2xf32>) |
| 469 |
|
| 470 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 471 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 472 |
|
| 473 |
/// Read the whole data in one shot. |
| 474 |
// CHECK-DAG: %[[V_NWC_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 475 |
// CHECK-DAG: %[[V_NWC_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 476 |
// CHECK-DAG: %[[V_NWC_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 477 |
|
| 478 |
/// Transpose result to nwc format. |
| 479 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transpose %[[V_NWC_INPUT_R]], [0, 2, 1] |
| 480 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transpose %[[V_NWC_FILTER_R]], [2, 1, 0] |
| 481 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transpose %[[V_NWC_OUTPUT_R]], [0, 2, 1] |
| 482 |
|
| 483 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 484 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 485 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 486 |
// CHECK-SAME: {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 487 |
// CHECK: %[[V_INPUT_2:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 488 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 489 |
// CHECK: %[[V_INPUT_3:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 490 |
// CHECK-SAME: {offsets = [0, 5, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 491 |
|
| 492 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<2x3x8xf32> |
| 493 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<3x8xf32> from vector<2x3x8xf32> |
| 494 |
|
| 495 |
// CHECK: %[[V_OUTPUT_0:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 496 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 497 |
// CHECK: %[[V_OUTPUT_1:.+]] = vector.extract_strided_slice %[[V_OUTPUT_R]] |
| 498 |
// CHECK-SAME: {offsets = [0, 1, 0], sizes = [4, 1, 8], strides = [1, 1, 1]} : vector<4x2x8xf32> to vector<4x1x8xf32> |
| 499 |
|
| 500 |
/// w == 0, kw == 0 |
| 501 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 502 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 503 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 504 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER_0]], %[[V_OUTPUT_0]] |
| 505 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 506 |
/// w == 1, kw == 0 |
| 507 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 508 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 509 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 510 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER_0]], %[[V_OUTPUT_1]] |
| 511 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 512 |
/// w == 1, kw == 1 |
| 513 |
// CHECK: %[[CONTRACT_2:.+]] = vector.contract { |
| 514 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 515 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 516 |
// CHECK-SAME: %[[V_INPUT_2]], %[[V_FILTER_1]], %[[CONTRACT_0]] |
| 517 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 518 |
/// w == 1, kw == 1 |
| 519 |
// CHECK: %[[CONTRACT_3:.+]] = vector.contract { |
| 520 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 521 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 522 |
// CHECK-SAME: %[[V_INPUT_3]], %[[V_FILTER_1]], %[[CONTRACT_1]] |
| 523 |
// CHECK-SAME: : vector<4x1x3xf32>, vector<3x8xf32> into vector<4x1x8xf32> |
| 524 |
|
| 525 |
/// w == 0, kw == 0 |
| 526 |
// CHECK: %[[RES_0:.+]] = vector.insert_strided_slice %[[CONTRACT_2]], %[[V_OUTPUT_R]] |
| 527 |
// CHECK-SAME: {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 528 |
/// w == 1, kw == 0 |
| 529 |
// CHECK: %[[RES_1:.+]] = vector.insert_strided_slice %[[CONTRACT_3]], %[[RES_0]] |
| 530 |
// CHECK-SAME: {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x8xf32> into vector<4x2x8xf32> |
| 531 |
|
| 532 |
/// Transpose result to ncw format. |
| 533 |
// CHECK: %[[RES_2:.+]] = vector.transpose %[[RES_1]], [0, 2, 1] |
| 534 |
|
| 535 |
// Write the result back in one shot. |
| 536 |
// CHECK: vector.transfer_write %[[RES_2]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 537 |
|
| 538 |
module attributes {transform.with_named_sequence} { |
| 539 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 540 |
%0 = transform.structured.match ops{["linalg.conv_1d_ncw_fcw"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 541 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 542 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 543 |
transform.yield |
| 544 |
} |
| 545 |
} |
| 546 |
|
| 547 |
// ----- |
| 548 |
|
| 549 |
func.func @conv1d_ncw_4x8x2_memref(%input: memref<4x3x6xf32>, %filter: memref<8x3x2xf32>, %output: memref<4x8x2xf32>) { |
| 550 |
linalg.conv_1d_ncw_fcw |
| 551 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 552 |
ins(%input, %filter : memref<4x3x6xf32>, memref<8x3x2xf32>) |
| 553 |
outs(%output : memref<4x8x2xf32>) |
| 554 |
return |
| 555 |
} |
| 556 |
|
| 557 |
// CHECK: #[[INPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)> |
| 558 |
// CHECK: #[[FILTER_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d2)> |
| 559 |
// CHECK: #[[OUTPUT_MAP:.+]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)> |
| 560 |
|
| 561 |
// CHECK: func @conv1d_ncw_4x8x2_memref |
| 562 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x3x6xf32>, %[[FILTER:.+]]: memref<8x3x2xf32>, %[[OUTPUT:.+]]: memref<4x8x2xf32>) |
| 563 |
|
| 564 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 565 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 566 |
|
| 567 |
/// Read the whole data in one shot. |
| 568 |
// CHECK-DAG: %[[V_NWC_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 569 |
// CHECK-DAG: %[[V_NWC_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 570 |
// CHECK-DAG: %[[V_NWC_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]], %[[F0]] |
| 571 |
|
| 572 |
/// Transpose result to nwc format. |
| 573 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transpose %[[V_NWC_INPUT_R]], [0, 2, 1] |
| 574 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transpose %[[V_NWC_FILTER_R]], [2, 1, 0] |
| 575 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transpose %[[V_NWC_OUTPUT_R]], [0, 2, 1] |
| 576 |
|
| 577 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 578 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 579 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 580 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 581 |
|
| 582 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x8xf32> from vector<2x3x8xf32> |
| 583 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<3x8xf32> from vector<2x3x8xf32> |
| 584 |
|
| 585 |
/// w == 0, kw == 0 |
| 586 |
// CHECK: %[[CONTRACT_0:.+]] = vector.contract { |
| 587 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 588 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 589 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER_0]], %[[V_OUTPUT_R]] |
| 590 |
// CHECK-SAME: : vector<4x2x3xf32>, vector<3x8xf32> into vector<4x2x8xf32> |
| 591 |
/// w == 0, kw == 1 |
| 592 |
// CHECK: %[[CONTRACT_1:.+]] = vector.contract { |
| 593 |
// CHECK-SAME: indexing_maps = [#[[INPUT_MAP]], #[[FILTER_MAP]], #[[OUTPUT_MAP]]], |
| 594 |
// CHECK-SAME: iterator_types = ["parallel", "parallel", "parallel", "reduction"] |
| 595 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER_1]], %[[CONTRACT_0]] |
| 596 |
// CHECK-SAME: : vector<4x2x3xf32>, vector<3x8xf32> into vector<4x2x8xf32> |
| 597 |
|
| 598 |
/// Transpose result to ncw format. |
| 599 |
// CHECK: %[[RES:.+]] = vector.transpose %[[CONTRACT_1]], [0, 2, 1] |
| 600 |
|
| 601 |
// Write the result back in one shot. |
| 602 |
// CHECK: vector.transfer_write %[[RES]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 603 |
|
| 604 |
|
| 605 |
module attributes {transform.with_named_sequence} { |
| 606 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 607 |
%0 = transform.structured.match ops{["linalg.conv_1d_ncw_fcw"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 608 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 609 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 610 |
transform.yield |
| 611 |
} |
| 612 |
} |
| 613 |
|
| 614 |
// ----- |
| 615 |
|
| 616 |
func.func @conv1d_8_tensor(%input: tensor<11xf32>, %filter: tensor<4xf32>, %output: tensor<8xf32>) -> tensor<8xf32> { |
| 617 |
%0 = linalg.conv_1d ins(%input, %filter : tensor<11xf32>, tensor<4xf32>) |
| 618 |
outs(%output : tensor<8xf32>) -> tensor<8xf32> |
| 619 |
return %0 : tensor<8xf32> |
| 620 |
} |
| 621 |
|
| 622 |
// CHECK: func @conv1d_8_tensor |
| 623 |
// CHECK-SAME: (%[[INPUT:.+]]: tensor<11xf32>, %[[FILTER:.+]]: tensor<4xf32>, %[[OUTPUT:.+]]: tensor<8xf32>) |
| 624 |
|
| 625 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 626 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 627 |
|
| 628 |
/// Read the whole data in one shot. |
| 629 |
// CHECK-DAG: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]]], %[[F0]] |
| 630 |
// CHECK-DAG: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]]], %[[F0]] |
| 631 |
// CHECK-DAG: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]]], %[[F0]] |
| 632 |
|
| 633 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 634 |
// CHECK-SAME: {offsets = [0], sizes = [8], strides = [1]} : vector<11xf32> to vector<8xf32> |
| 635 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 636 |
// CHECK-SAME: {offsets = [1], sizes = [8], strides = [1]} : vector<11xf32> to vector<8xf32> |
| 637 |
// CHECK: %[[V_INPUT_2:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 638 |
// CHECK-SAME: {offsets = [2], sizes = [8], strides = [1]} : vector<11xf32> to vector<8xf32> |
| 639 |
// CHECK: %[[V_INPUT_3:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 640 |
// CHECK-SAME: {offsets = [3], sizes = [8], strides = [1]} : vector<11xf32> to vector<8xf32> |
| 641 |
|
| 642 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : f32 from vector<4xf32> |
| 643 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : f32 from vector<4xf32> |
| 644 |
// CHECK: %[[V_FILTER_2:.+]] = vector.extract %[[V_FILTER_R]][2] : f32 from vector<4xf32> |
| 645 |
// CHECK: %[[V_FILTER_3:.+]] = vector.extract %[[V_FILTER_R]][3] : f32 from vector<4xf32> |
| 646 |
|
| 647 |
/// w == 0, kw == 0 |
| 648 |
// CHECK: %[[RES_0:.+]] = vector.outerproduct |
| 649 |
// CHECK-SAME: %[[V_INPUT_0]], %[[V_FILTER_0]], %[[V_OUTPUT_R]] {kind = #vector.kind<add>} |
| 650 |
// CHECK-SAME: : vector<8xf32>, f32 |
| 651 |
/// w == 1, kw == 1 |
| 652 |
// CHECK: %[[RES_1:.+]] = vector.outerproduct |
| 653 |
// CHECK-SAME: %[[V_INPUT_1]], %[[V_FILTER_1]], %[[RES_0]] {kind = #vector.kind<add>} |
| 654 |
// CHECK-SAME: : vector<8xf32>, f32 |
| 655 |
/// w == 2, kw == 2 |
| 656 |
// CHECK: %[[RES_2:.+]] = vector.outerproduct |
| 657 |
// CHECK-SAME: %[[V_INPUT_2]], %[[V_FILTER_2]], %[[RES_1]] {kind = #vector.kind<add>} |
| 658 |
// CHECK-SAME: : vector<8xf32>, f32 |
| 659 |
/// w == 3, kw == 3 |
| 660 |
// CHECK: %[[RES_3:.+]] = vector.outerproduct |
| 661 |
// CHECK-SAME: %[[V_INPUT_3]], %[[V_FILTER_3]], %[[RES_2]] {kind = #vector.kind<add>} |
| 662 |
// CHECK-SAME: : vector<8xf32>, f32 |
| 663 |
|
| 664 |
// Write the result back in one shot. |
| 665 |
// CHECK: vector.transfer_write %[[RES_3]], %[[OUTPUT]][%[[C0]]] |
| 666 |
|
| 667 |
module attributes {transform.with_named_sequence} { |
| 668 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 669 |
%0 = transform.structured.match ops{["linalg.conv_1d"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 670 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 671 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 672 |
transform.yield |
| 673 |
} |
| 674 |
} |
| 675 |
|
| 676 |
// ----- |
| 677 |
|
| 678 |
func.func @depthwise_conv1d_nwc_wc_3x5x4xf32_memref(%input: memref<3x5x4xf32>, %filter: memref<2x4xf32>, %output: memref<3x2x4xf32>) { |
| 679 |
linalg.depthwise_conv_1d_nwc_wc |
| 680 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 681 |
ins(%input, %filter : memref<3x5x4xf32>, memref<2x4xf32>) |
| 682 |
outs(%output : memref<3x2x4xf32>) |
| 683 |
return |
| 684 |
} |
| 685 |
|
| 686 |
// CHECK: func @depthwise_conv1d_nwc_wc_3x5x4xf32_memref |
| 687 |
// CHECK-SAME: (%[[INPUT:[0-9a-z]+]]: memref<3x5x4xf32>, %[[FILTER:[0-9a-z]+]]: memref<2x4xf32>, %[[OUTPUT:[0-9a-z]+]]: memref<3x2x4xf32>) |
| 688 |
|
| 689 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 690 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 691 |
|
| 692 |
/// Read the whole data in one shot. |
| 693 |
// CHECK: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 694 |
// CHECK: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]]] |
| 695 |
// CHECK: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 696 |
|
| 697 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 698 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [3, 2, 4], strides = [1, 1, 1]} : vector<3x4x4xf32> to vector<3x2x4xf32> |
| 699 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 700 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [3, 2, 4], strides = [1, 1, 1]} : vector<3x4x4xf32> to vector<3x2x4xf32> |
| 701 |
|
| 702 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<4xf32> from vector<2x4xf32> |
| 703 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<4xf32> from vector<2x4xf32> |
| 704 |
|
| 705 |
/// w == 0, kw = 0 |
| 706 |
// CHECK: %[[B_FILTER_0:.*]] = vector.broadcast %[[V_FILTER_0]] : vector<4xf32> to vector<3x2x4xf32> |
| 707 |
// CHECK: %[[FMA_0:.*]] = vector.fma %[[V_INPUT_0]], %[[B_FILTER_0]], %[[V_OUTPUT_R]] : vector<3x2x4xf32> |
| 708 |
|
| 709 |
/// w == 0, kw = 1 |
| 710 |
// CHECK: %[[B_FILTER_1:.*]] = vector.broadcast %[[V_FILTER_1]] : vector<4xf32> to vector<3x2x4xf32> |
| 711 |
// CHECK: %[[FMA_1:.*]] = vector.fma %[[V_INPUT_1]], %[[B_FILTER_1]], %[[FMA_0]] : vector<3x2x4xf32> |
| 712 |
|
| 713 |
// Write the result back in one shot. |
| 714 |
// CHECK: vector.transfer_write %[[FMA_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 715 |
|
| 716 |
|
| 717 |
module attributes {transform.with_named_sequence} { |
| 718 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 719 |
%0 = transform.structured.match ops{["linalg.depthwise_conv_1d_nwc_wc"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 720 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 721 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 722 |
transform.yield |
| 723 |
} |
| 724 |
} |
| 725 |
|
| 726 |
// ----- |
| 727 |
|
| 728 |
func.func @depthwise_conv1d_nwc_wc_3x5x4xi8_memref(%input: memref<3x5x4xi8>, %filter: memref<2x4xi8>, %output: memref<3x2x4xi32>) { |
| 729 |
linalg.depthwise_conv_1d_nwc_wc |
| 730 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 731 |
ins(%input, %filter : memref<3x5x4xi8>, memref<2x4xi8>) |
| 732 |
outs(%output : memref<3x2x4xi32>) |
| 733 |
return |
| 734 |
} |
| 735 |
|
| 736 |
// CHECK: func @depthwise_conv1d_nwc_wc_3x5x4xi8_memref |
| 737 |
// CHECK-SAME: (%[[INPUT:[0-9a-z]+]]: memref<3x5x4xi8>, %[[FILTER:[0-9a-z]+]]: memref<2x4xi8>, %[[OUTPUT:[0-9a-z]+]]: memref<3x2x4xi32>) |
| 738 |
|
| 739 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 740 |
|
| 741 |
/// Read the whole data in one shot. |
| 742 |
// CHECK: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 743 |
// CHECK: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]]] |
| 744 |
// CHECK: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 745 |
|
| 746 |
// CHECK: %[[V_INPUT_0:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 747 |
// CHECK-SAME: {offsets = [0, 0, 0], sizes = [3, 2, 4], strides = [1, 1, 1]} : vector<3x4x4xi8> to vector<3x2x4xi8> |
| 748 |
// CHECK: %[[V_INPUT_1:.+]] = vector.extract_strided_slice %[[V_INPUT_R]] |
| 749 |
// CHECK-SAME: {offsets = [0, 2, 0], sizes = [3, 2, 4], strides = [1, 1, 1]} : vector<3x4x4xi8> to vector<3x2x4xi8> |
| 750 |
|
| 751 |
// CHECK: %[[V_FILTER_0:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<4xi8> from vector<2x4xi8> |
| 752 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][1] : vector<4xi8> from vector<2x4xi8> |
| 753 |
|
| 754 |
/// w == 0, kw = |
| 755 |
// CHECK: %[[EXT_INPUT_0:.*]] = arith.extsi %[[V_INPUT_0]] : vector<3x2x4xi8> to vector<3x2x4xi32> |
| 756 |
// CHECK: %[[EXT_FILTER_0:.*]] = arith.extsi %[[V_FILTER_0]] : vector<4xi8> to vector<4xi32> |
| 757 |
// CHECK: %[[B_FILTER_0:.*]] = vector.broadcast %[[EXT_FILTER_0]] : vector<4xi32> to vector<3x2x4xi32> |
| 758 |
// CHECK: %[[MUL_0:.*]] = arith.muli %[[EXT_INPUT_0]], %[[B_FILTER_0]] : vector<3x2x4xi32> |
| 759 |
// CHECK: %[[ADD_0:.*]] = arith.addi %[[MUL_0]], %[[V_OUTPUT_R]] : vector<3x2x4xi32> |
| 760 |
|
| 761 |
/// w == 0, kw = 1 |
| 762 |
// CHECK: %[[EXT_INPUT_1:.*]] = arith.extsi %[[V_INPUT_1]] : vector<3x2x4xi8> to vector<3x2x4xi32> |
| 763 |
// CHECK: %[[EXT_FILTER_1:.*]] = arith.extsi %[[V_FILTER_1]] : vector<4xi8> to vector<4xi32> |
| 764 |
// CHECK: %[[B_FILTER_1:.*]] = vector.broadcast %[[EXT_FILTER_1]] : vector<4xi32> to vector<3x2x4xi32> |
| 765 |
// CHECK: %[[MUL_1:.*]] = arith.muli %[[EXT_INPUT_1]], %[[B_FILTER_1]] : vector<3x2x4xi32> |
| 766 |
// CHECK: %[[ADD_1:.*]] = arith.addi %[[MUL_1]], %[[ADD_0]] : vector<3x2x4xi32> |
| 767 |
|
| 768 |
// Write the result back in one shot. |
| 769 |
// CHECK: vector.transfer_write %[[ADD_1]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 770 |
|
| 771 |
module attributes {transform.with_named_sequence} { |
| 772 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 773 |
%0 = transform.structured.match ops{["linalg.depthwise_conv_1d_nwc_wc"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 774 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 775 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 776 |
transform.yield |
| 777 |
} |
| 778 |
} |
| 779 |
|
| 780 |
// ----- |
| 781 |
|
| 782 |
func.func @conv_1d_nwc_wcf_mixed_type_memref(%input: memref<1x2x3xf16>, %filter: memref<1x3x2xf16>, %output: memref<1x2x2xf32>) { |
| 783 |
linalg.conv_1d_nwc_wcf |
| 784 |
{dilations = dense<1> : vector<1xi64>, strides = dense<1> : vector<1xi64>} |
| 785 |
ins(%input, %filter : memref<1x2x3xf16>, memref<1x3x2xf16>) |
| 786 |
outs(%output : memref<1x2x2xf32>) |
| 787 |
return |
| 788 |
} |
| 789 |
|
| 790 |
// CHECK: func @conv_1d_nwc_wcf_mixed_type_memref |
| 791 |
// CHECK-SAME: (%[[INPUT:[0-9a-z]+]]: memref<1x2x3xf16>, %[[FILTER:[0-9a-z]+]]: memref<1x3x2xf16>, %[[OUTPUT:[0-9a-z]+]]: memref<1x2x2xf32>) |
| 792 |
|
| 793 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index |
| 794 |
// CHECK-DAG: %[[F0:.+]] = arith.constant 0.000000e+00 : f32 |
| 795 |
|
| 796 |
/// Read the whole data in one shot. |
| 797 |
// CHECK: %[[V_INPUT_R:.+]] = vector.transfer_read %[[INPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 798 |
// CHECK: %[[V_FILTER_R:.+]] = vector.transfer_read %[[FILTER]][%[[C0]], %[[C0]], %[[C0]]] |
| 799 |
// CHECK: %[[V_OUTPUT_R:.+]] = vector.transfer_read %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 800 |
// CHECK: %[[V_FILTER_1:.+]] = vector.extract %[[V_FILTER_R]][0] : vector<3x2xf16> from vector<1x3x2xf16> |
| 801 |
// CHECK: %[[CONT:.*]] = vector.contract |
| 802 |
// {{.*}} %[[V_INPUT_R]], %[[V_FILTER_1]], %[[V_OUTPUT_R]] : vector<1x2x3xf16>, vector<3x2xf16> into vector<1x2x2xf32> |
| 803 |
// CHECK: vector.transfer_write %[[CONT]], %[[OUTPUT]][%[[C0]], %[[C0]], %[[C0]]] |
| 804 |
|
| 805 |
module attributes {transform.with_named_sequence} { |
| 806 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 807 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 808 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 809 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 810 |
transform.yield |
| 811 |
} |
| 812 |
} |
| 813 |
|
| 814 |
// ----- |
| 815 |
|
| 816 |
func.func @conv_1d_nwc_wcf_mixed_int_fp_memref(%input: memref<1x2x3xi8>, %filter: memref<1x3x2xi8>, %output: memref<1x2x2xf32>) { |
| 817 |
linalg.conv_1d_nwc_wcf |
| 818 |
{dilations = dense<1> : vector<1xi64>, strides = dense<1> : vector<1xi64>} |
| 819 |
ins(%input, %filter : memref<1x2x3xi8>, memref<1x3x2xi8>) |
| 820 |
outs(%output : memref<1x2x2xf32>) |
| 821 |
return |
| 822 |
} |
| 823 |
|
| 824 |
|
| 825 |
// CHECK-LABEL: func @conv_1d_nwc_wcf_mixed_int_fp_memref |
| 826 |
// CHECK-SAME: (%[[INPUT:[0-9a-z]+]]: memref<1x2x3xi8>, %[[FILTER:[0-9a-z]+]]: memref<1x3x2xi8>, %[[OUTPUT:[0-9a-z]+]]: memref<1x2x2xf32>) |
| 827 |
// CHECK-DAG: %[[CST:.+]] = arith.constant 0.000000e+00 : f32 |
| 828 |
// CHECK-DAG: %[[I0:.+]] = arith.constant 0 : index |
| 829 |
// CHECK-DAG: %[[C0:.+]] = arith.constant 0 : i8 |
| 830 |
// CHECK: %[[READ0:.+]] = vector.transfer_read %arg0[%[[I0]], %[[I0]], %[[I0]]], %[[C0]] |
| 831 |
// CHECK: %[[READ1:.+]] = vector.transfer_read %arg1[%[[I0]], %[[I0]], %[[I0]]], %[[C0]] |
| 832 |
// CHECK: %[[READ2:.+]] = vector.transfer_read %arg2[%[[I0]], %[[I0]], %[[I0]]], %[[CST]] |
| 833 |
// CHECK: %[[EXT:.+]] = vector.extract %[[READ1]][0] : vector<3x2xi8> from vector<1x3x2xi8> |
| 834 |
// CHECK: %[[CAST0:.+]] = arith.sitofp %[[READ0]] : vector<1x2x3xi8> to vector<1x2x3xf32> |
| 835 |
// CHECK: %[[CAST1:.+]] = arith.sitofp %[[EXT]] : vector<3x2xi8> to vector<3x2xf32> |
| 836 |
// CHECK: %[[CONTRACT:.+]] = vector.contract {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "parallel", "reduction"], kind = #vector.kind<add>} %[[CAST0]], %[[CAST1]], %[[READ2]] |
| 837 |
// CHECK: vector.transfer_write %[[CONTRACT]], %arg2[%[[I0]], %[[I0]], %[[I0]]] |
| 838 |
|
| 839 |
module attributes {transform.with_named_sequence} { |
| 840 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 841 |
%0 = transform.structured.match ops{["linalg.conv_1d_nwc_wcf"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 842 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 843 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 844 |
transform.yield |
| 845 |
} |
| 846 |
} |
| 847 |
|
| 848 |
// ----- |
| 849 |
|
| 850 |
func.func @pooling_nwc_sum_memref_1_2_1_3(%input: memref<4x4x3xf32>, %filter: memref<1xf32>, %output: memref<4x2x3xf32>) { |
| 851 |
linalg.pooling_nwc_sum |
| 852 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 853 |
ins(%input, %filter : memref<4x4x3xf32>, memref<1xf32>) |
| 854 |
outs(%output : memref<4x2x3xf32>) |
| 855 |
return |
| 856 |
} |
| 857 |
|
| 858 |
// CHECK-LABEL: func.func @pooling_nwc_sum_memref_1_2_1_3 |
| 859 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x4x3xf32>, %[[FILTER:.+]]: memref<1xf32>, %[[OUTPUT:.+]]: memref<4x2x3xf32>) |
| 860 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 861 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 862 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x4x3xf32>, vector<4x4x3xf32> |
| 863 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x3xf32>, vector<4x2x3xf32> |
| 864 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 865 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 866 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 867 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 868 |
// CHECK: %[[V6:.+]] = arith.addf %[[V2]], %[[V4]] : vector<4x1x3xf32> |
| 869 |
// CHECK: %[[V7:.+]] = arith.addf %[[V3]], %[[V5]] : vector<4x1x3xf32> |
| 870 |
// CHECK: %[[V8:.+]] = vector.insert_strided_slice %[[V6]], %[[V1]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 871 |
// CHECK: %[[V9:.+]] = vector.insert_strided_slice %[[V7]], %[[V8]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 872 |
// CHECK: vector.transfer_write %[[V9]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xf32>, memref<4x2x3xf32> |
| 873 |
|
| 874 |
module attributes {transform.with_named_sequence} { |
| 875 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 876 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 877 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 878 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 879 |
transform.yield |
| 880 |
} |
| 881 |
} |
| 882 |
|
| 883 |
// ----- |
| 884 |
|
| 885 |
func.func @pooling_nwc_max_memref_1_2_1_3(%input: memref<4x4x3xf32>, %filter: memref<1xf32>, %output: memref<4x2x3xf32>) { |
| 886 |
linalg.pooling_nwc_max |
| 887 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 888 |
ins(%input, %filter : memref<4x4x3xf32>, memref<1xf32>) |
| 889 |
outs(%output : memref<4x2x3xf32>) |
| 890 |
return |
| 891 |
} |
| 892 |
|
| 893 |
// CHECK-LABEL: func.func @pooling_nwc_max_memref_1_2_1_3 |
| 894 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x4x3xf32>, %[[FILTER:.+]]: memref<1xf32>, %[[OUTPUT:.+]]: memref<4x2x3xf32>) |
| 895 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 896 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 897 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x4x3xf32>, vector<4x4x3xf32> |
| 898 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x3xf32>, vector<4x2x3xf32> |
| 899 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 900 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 901 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 902 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 903 |
// CHECK: %[[V6:.+]] = arith.maximumf %[[V2]], %[[V4]] : vector<4x1x3xf32> |
| 904 |
// CHECK: %[[V7:.+]] = arith.maximumf %[[V3]], %[[V5]] : vector<4x1x3xf32> |
| 905 |
// CHECK: %[[V8:.+]] = vector.insert_strided_slice %[[V6]], %[[V1]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 906 |
// CHECK: %[[V9:.+]] = vector.insert_strided_slice %[[V7]], %[[V8]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 907 |
// CHECK: vector.transfer_write %[[V9]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xf32>, memref<4x2x3xf32> |
| 908 |
|
| 909 |
module attributes {transform.with_named_sequence} { |
| 910 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 911 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_max"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 912 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 913 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 914 |
transform.yield |
| 915 |
} |
| 916 |
} |
| 917 |
|
| 918 |
// ----- |
| 919 |
|
| 920 |
// The i8i8i32 case is similar to f32 case, so checking one case is enough for |
| 921 |
// test coverage. |
| 922 |
func.func @pooling_nwc_sum_i8i8i32_memref_1_2_1_3(%input: memref<4x4x3xi8>, %filter: memref<1xi8>, %output: memref<4x2x3xi32>) { |
| 923 |
linalg.pooling_nwc_sum |
| 924 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 925 |
ins(%input, %filter : memref<4x4x3xi8>, memref<1xi8>) |
| 926 |
outs(%output : memref<4x2x3xi32>) |
| 927 |
return |
| 928 |
} |
| 929 |
|
| 930 |
// CHECK-LABEL: func.func @pooling_nwc_sum_i8i8i32_memref_1_2_1_3 |
| 931 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x4x3xi8>, %[[FILTER:.+]]: memref<1xi8>, %[[OUTPUT:.+]]: memref<4x2x3xi32>) |
| 932 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 933 |
// CHECK-DAG: %[[Vc0_i8:.+]] = arith.constant 0 : i8 |
| 934 |
// CHECK-DAG: %[[Vc0_i32:.+]] = arith.constant 0 : i32 |
| 935 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vc0_i8]] {in_bounds = [true, true, true]} : memref<4x4x3xi8>, vector<4x4x3xi8> |
| 936 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vc0_i32]] {in_bounds = [true, true, true]} : memref<4x2x3xi32>, vector<4x2x3xi32> |
| 937 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 938 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 939 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xi32> to vector<4x1x3xi32> |
| 940 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xi32> to vector<4x1x3xi32> |
| 941 |
// CHECK: %[[V6:.+]] = arith.extsi %[[V2]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 942 |
// CHECK: %[[V7:.+]] = arith.addi %[[V6]], %[[V4]] : vector<4x1x3xi32> |
| 943 |
// CHECK: %[[V8:.+]] = arith.extsi %[[V3]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 944 |
// CHECK: %[[V9:.+]] = arith.addi %[[V8]], %[[V5]] : vector<4x1x3xi32> |
| 945 |
// CHECK: %[[V10:.+]] = vector.insert_strided_slice %[[V7]], %[[V1]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xi32> into vector<4x2x3xi32> |
| 946 |
// CHECK: %[[V11:.+]] = vector.insert_strided_slice %[[V9]], %[[V10]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xi32> into vector<4x2x3xi32> |
| 947 |
// CHECK: vector.transfer_write %[[V11]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xi32>, memref<4x2x3xi32> |
| 948 |
// CHECK: return |
| 949 |
|
| 950 |
module attributes {transform.with_named_sequence} { |
| 951 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 952 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 953 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 954 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 955 |
transform.yield |
| 956 |
} |
| 957 |
} |
| 958 |
|
| 959 |
// ----- |
| 960 |
|
| 961 |
// The i8i8i32 case is similar to f32 case, so checking one case is enough for |
| 962 |
// test coverage. |
| 963 |
func.func @pooling_nwc_max_i8i8i32_memref_1_2_1_3(%input: memref<4x4x3xi8>, %filter: memref<1xi8>, %output: memref<4x2x3xi32>) { |
| 964 |
linalg.pooling_nwc_max |
| 965 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 966 |
ins(%input, %filter : memref<4x4x3xi8>, memref<1xi8>) |
| 967 |
outs(%output : memref<4x2x3xi32>) |
| 968 |
return |
| 969 |
} |
| 970 |
|
| 971 |
// CHECK-LABEL: func.func @pooling_nwc_max_i8i8i32_memref_1_2_1_3 |
| 972 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x4x3xi8>, %[[FILTER:.+]]: memref<1xi8>, %[[OUTPUT:.+]]: memref<4x2x3xi32>) |
| 973 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 974 |
// CHECK-DAG: %[[Vc0_i8:.+]] = arith.constant 0 : i8 |
| 975 |
// CHECK-DAG: %[[Vc0_i32:.+]] = arith.constant 0 : i32 |
| 976 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vc0_i8]] {in_bounds = [true, true, true]} : memref<4x4x3xi8>, vector<4x4x3xi8> |
| 977 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vc0_i32]] {in_bounds = [true, true, true]} : memref<4x2x3xi32>, vector<4x2x3xi32> |
| 978 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 979 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xi8> to vector<4x1x3xi8> |
| 980 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xi32> to vector<4x1x3xi32> |
| 981 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xi32> to vector<4x1x3xi32> |
| 982 |
// CHECK: %[[V6:.+]] = arith.extsi %[[V2]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 983 |
// CHECK: %[[V7:.+]] = arith.maxsi %[[V6]], %[[V4]] : vector<4x1x3xi32> |
| 984 |
// CHECK: %[[V8:.+]] = arith.extsi %[[V3]] : vector<4x1x3xi8> to vector<4x1x3xi32> |
| 985 |
// CHECK: %[[V9:.+]] = arith.maxsi %[[V8]], %[[V5]] : vector<4x1x3xi32> |
| 986 |
// CHECK: %[[V10:.+]] = vector.insert_strided_slice %[[V7]], %[[V1]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xi32> into vector<4x2x3xi32> |
| 987 |
// CHECK: %[[V11:.+]] = vector.insert_strided_slice %[[V9]], %[[V10]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xi32> into vector<4x2x3xi32> |
| 988 |
// CHECK: vector.transfer_write %[[V11]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xi32>, memref<4x2x3xi32> |
| 989 |
// CHECK: return |
| 990 |
|
| 991 |
module attributes {transform.with_named_sequence} { |
| 992 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 993 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_max"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 994 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 995 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 996 |
transform.yield |
| 997 |
} |
| 998 |
} |
| 999 |
|
| 1000 |
// ----- |
| 1001 |
|
| 1002 |
func.func @pooling_nwc_sum_memref_2_2_2_3(%input: memref<4x6x3xf32>, %filter: memref<2xf32>, %output: memref<4x2x3xf32>) { |
| 1003 |
linalg.pooling_nwc_sum |
| 1004 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 1005 |
ins(%input, %filter : memref<4x6x3xf32>, memref<2xf32>) |
| 1006 |
outs(%output : memref<4x2x3xf32>) |
| 1007 |
return |
| 1008 |
} |
| 1009 |
|
| 1010 |
// CHECK-LABEL: func.func @pooling_nwc_sum_memref_2_2_2_3 |
| 1011 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x6x3xf32>, %[[FILTER:.+]]: memref<2xf32>, %[[OUTPUT:.+]]: memref<4x2x3xf32>) |
| 1012 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1013 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 1014 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x6x3xf32>, vector<4x6x3xf32> |
| 1015 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x3xf32>, vector<4x2x3xf32> |
| 1016 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1017 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1018 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 2, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1019 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 5, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1020 |
// CHECK: %[[V6:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1021 |
// CHECK: %[[V7:.+]] = vector.extract_strided_slice %[[V1]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1022 |
// CHECK: %[[V8:.+]] = arith.addf %[[V2]], %[[V6]] : vector<4x1x3xf32> |
| 1023 |
// CHECK: %[[V9:.+]] = arith.addf %[[V3]], %[[V7]] : vector<4x1x3xf32> |
| 1024 |
// CHECK: %[[V10:.+]] = arith.addf %[[V4]], %[[V8]] : vector<4x1x3xf32> |
| 1025 |
// CHECK: %[[V11:.+]] = arith.addf %[[V5]], %[[V9]] : vector<4x1x3xf32> |
| 1026 |
// CHECK: %[[V12:.+]] = vector.insert_strided_slice %[[V10]], %[[V1]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1027 |
// CHECK: %[[V13:.+]] = vector.insert_strided_slice %[[V11]], %[[V12]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1028 |
// CHECK: vector.transfer_write %[[V13:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xf32>, memref<4x2x3xf32> |
| 1029 |
|
| 1030 |
module attributes {transform.with_named_sequence} { |
| 1031 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1032 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1033 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1034 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1035 |
transform.yield |
| 1036 |
} |
| 1037 |
} |
| 1038 |
|
| 1039 |
|
| 1040 |
// ----- |
| 1041 |
|
| 1042 |
func.func @pooling_ncw_sum_memref_1_2_1_3(%input: memref<4x3x4xf32>, %filter: memref<1xf32>, %output: memref<4x3x2xf32>) { |
| 1043 |
linalg.pooling_ncw_sum |
| 1044 |
{dilations = dense<1> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 1045 |
ins(%input, %filter : memref<4x3x4xf32>, memref<1xf32>) |
| 1046 |
outs(%output : memref<4x3x2xf32>) |
| 1047 |
return |
| 1048 |
} |
| 1049 |
|
| 1050 |
// CHECK-LABEL: func.func @pooling_ncw_sum_memref_1_2_1_3 |
| 1051 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x3x4xf32>, %[[FILTER:.+]]: memref<1xf32>, %[[OUTPUT:.+]]: memref<4x3x2xf32>) |
| 1052 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1053 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 1054 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x3x4xf32>, vector<4x3x4xf32> |
| 1055 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x3x2xf32>, vector<4x3x2xf32> |
| 1056 |
// CHECK: %[[V2:.+]] = vector.transpose %[[V0]], [0, 2, 1] : vector<4x3x4xf32> to vector<4x4x3xf32> |
| 1057 |
// CHECK: %[[V3:.+]] = vector.transpose %[[V1]], [0, 2, 1] : vector<4x3x2xf32> to vector<4x2x3xf32> |
| 1058 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 1059 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x1x3xf32> |
| 1060 |
// CHECK: %[[V6:.+]] = vector.extract_strided_slice %[[V3]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1061 |
// CHECK: %[[V7:.+]] = vector.extract_strided_slice %[[V3]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1062 |
// CHECK: %[[V8:.+]] = arith.addf %[[V4]], %[[V6]] : vector<4x1x3xf32> |
| 1063 |
// CHECK: %[[V9:.+]] = arith.addf %[[V5]], %[[V7]] : vector<4x1x3xf32> |
| 1064 |
// CHECK: %[[V10:.+]] = vector.insert_strided_slice %[[V8]], %[[V3]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1065 |
// CHECK: %[[V11:.+]] = vector.insert_strided_slice %[[V9]], %[[V10]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1066 |
// CHECK: %[[V12:.+]] = vector.transpose %[[V11]], [0, 2, 1] : vector<4x2x3xf32> to vector<4x3x2xf32> |
| 1067 |
// CHECK: vector.transfer_write %[[V12:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x3x2xf32>, memref<4x3x2xf32> |
| 1068 |
|
| 1069 |
module attributes {transform.with_named_sequence} { |
| 1070 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1071 |
%0 = transform.structured.match ops{["linalg.pooling_ncw_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1072 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1073 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1074 |
transform.yield |
| 1075 |
} |
| 1076 |
} |
| 1077 |
|
| 1078 |
|
| 1079 |
// ----- |
| 1080 |
|
| 1081 |
func.func @pooling_nwc_sum_mixed_type_memref_1_2_1_1(%input: memref<1x2x3xf16>, %filter: memref<1xf16>, %output: memref<1x2x3xf32>) { |
| 1082 |
linalg.pooling_nwc_sum |
| 1083 |
{dilations = dense<1> : vector<1xi64>, strides = dense<1> : vector<1xi64>} |
| 1084 |
ins(%input, %filter : memref<1x2x3xf16>, memref<1xf16>) |
| 1085 |
outs(%output : memref<1x2x3xf32>) |
| 1086 |
return |
| 1087 |
} |
| 1088 |
|
| 1089 |
// CHECK-LABEL: func.func @pooling_nwc_sum_mixed_type_memref_1_2_1_1 |
| 1090 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<1x2x3xf16>, %[[FILTER:.+]]: memref<1xf16>, %[[OUTPUT:.+]]: memref<1x2x3xf32>) |
| 1091 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1092 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f16 |
| 1093 |
// CHECK-DAG: %[[Vcst_0:.+]] = arith.constant 0.000000e+00 : f32 |
| 1094 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<1x2x3xf16>, vector<1x2x3xf16> |
| 1095 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst_0]] {in_bounds = [true, true, true]} : memref<1x2x3xf32>, vector<1x2x3xf32> |
| 1096 |
// CHECK: %[[V2:.+]] = arith.extf %[[V0]] : vector<1x2x3xf16> to vector<1x2x3xf32> |
| 1097 |
// CHECK: %[[V3:.+]] = arith.addf %[[V2]], %[[V1]] : vector<1x2x3xf32> |
| 1098 |
// CHECK: vector.transfer_write %[[V3:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<1x2x3xf32>, memref<1x2x3xf32> |
| 1099 |
|
| 1100 |
module attributes {transform.with_named_sequence} { |
| 1101 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1102 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1103 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1104 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1105 |
transform.yield |
| 1106 |
} |
| 1107 |
} |
| 1108 |
|
| 1109 |
// ----- |
| 1110 |
|
| 1111 |
func.func @pooling_nwc_sum_memref_2_2_2_1(%input: memref<4x4x3xf32>, %filter: memref<2xf32>, %output: memref<4x2x3xf32>) { |
| 1112 |
linalg.pooling_nwc_sum |
| 1113 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 1114 |
ins(%input, %filter : memref<4x4x3xf32>, memref<2xf32>) |
| 1115 |
outs(%output : memref<4x2x3xf32>) |
| 1116 |
return |
| 1117 |
} |
| 1118 |
|
| 1119 |
// CHECK-LABEL: func.func @pooling_nwc_sum_memref_2_2_2_1 |
| 1120 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x4x3xf32>, %[[FILTER:.+]]: memref<2xf32>, %[[OUTPUT:.+]]: memref<4x2x3xf32>) |
| 1121 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1122 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 1123 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x4x3xf32>, vector<4x4x3xf32> |
| 1124 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x3xf32>, vector<4x2x3xf32> |
| 1125 |
// CHECK: %[[V2:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 0, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 1126 |
// CHECK: %[[V3:.+]] = vector.extract_strided_slice %[[V0]] {offsets = [0, 2, 0], sizes = [4, 2, 3], strides = [1, 1, 1]} : vector<4x4x3xf32> to vector<4x2x3xf32> |
| 1127 |
// CHECK: %[[V4:.+]] = arith.addf %[[V2]], %[[V1]] : vector<4x2x3xf32> |
| 1128 |
// CHECK: %[[V5:.+]] = arith.addf %[[V3]], %[[V4]] : vector<4x2x3xf32> |
| 1129 |
// CHECK: vector.transfer_write %[[V5:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xf32>, memref<4x2x3xf32> |
| 1130 |
|
| 1131 |
|
| 1132 |
module attributes {transform.with_named_sequence} { |
| 1133 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1134 |
%0 = transform.structured.match ops{["linalg.pooling_nwc_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1135 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1136 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1137 |
transform.yield |
| 1138 |
} |
| 1139 |
} |
| 1140 |
|
| 1141 |
// ----- |
| 1142 |
|
| 1143 |
func.func @pooling_ncw_sum_memref_2_2_2_3(%input: memref<4x3x6xf32>, %filter: memref<2xf32>, %output: memref<4x3x2xf32>) { |
| 1144 |
linalg.pooling_ncw_sum |
| 1145 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<3> : tensor<1xi64>} |
| 1146 |
ins(%input, %filter : memref<4x3x6xf32>, memref<2xf32>) |
| 1147 |
outs(%output : memref<4x3x2xf32>) |
| 1148 |
return |
| 1149 |
} |
| 1150 |
|
| 1151 |
// CHECK-LABEL: func.func @pooling_ncw_sum_memref_2_2_2_3 |
| 1152 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x3x6xf32>, %[[FILTER:.+]]: memref<2xf32>, %[[OUTPUT:.+]]: memref<4x3x2xf32>) |
| 1153 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1154 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 1155 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x3x6xf32>, vector<4x3x6xf32> |
| 1156 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x3x2xf32>, vector<4x3x2xf32> |
| 1157 |
// CHECK: %[[V2:.+]] = vector.transpose %[[V0]], [0, 2, 1] : vector<4x3x6xf32> to vector<4x6x3xf32> |
| 1158 |
// CHECK: %[[V3:.+]] = vector.transpose %[[V1]], [0, 2, 1] : vector<4x3x2xf32> to vector<4x2x3xf32> |
| 1159 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1160 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 3, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1161 |
// CHECK: %[[V6:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 2, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1162 |
// CHECK: %[[V7:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 5, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x6x3xf32> to vector<4x1x3xf32> |
| 1163 |
// CHECK: %[[V8:.+]] = vector.extract_strided_slice %[[V3]] {offsets = [0, 0, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1164 |
// CHECK: %[[V9:.+]] = vector.extract_strided_slice %[[V3]] {offsets = [0, 1, 0], sizes = [4, 1, 3], strides = [1, 1, 1]} : vector<4x2x3xf32> to vector<4x1x3xf32> |
| 1165 |
// CHECK: %[[V10:.+]] = arith.addf %[[V4]], %[[V8]] : vector<4x1x3xf32> |
| 1166 |
// CHECK: %[[V11:.+]] = arith.addf %[[V5]], %[[V9]] : vector<4x1x3xf32> |
| 1167 |
// CHECK: %[[V12:.+]] = arith.addf %[[V6]], %[[V10]] : vector<4x1x3xf32> |
| 1168 |
// CHECK: %[[V13:.+]] = arith.addf %[[V7]], %[[V11]] : vector<4x1x3xf32> |
| 1169 |
// CHECK: %[[V14:.+]] = vector.insert_strided_slice %[[V12]], %[[V3]] {offsets = [0, 0, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1170 |
// CHECK: %[[V15:.+]] = vector.insert_strided_slice %[[V13]], %[[V14]] {offsets = [0, 1, 0], strides = [1, 1, 1]} : vector<4x1x3xf32> into vector<4x2x3xf32> |
| 1171 |
// CHECK: %[[V16:.+]] = vector.transpose %[[V15]], [0, 2, 1] : vector<4x2x3xf32> to vector<4x3x2xf32> |
| 1172 |
// CHECK: vector.transfer_write %[[V16:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x3x2xf32>, memref<4x3x2xf32> |
| 1173 |
|
| 1174 |
module attributes {transform.with_named_sequence} { |
| 1175 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1176 |
%0 = transform.structured.match ops{["linalg.pooling_ncw_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1177 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1178 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1179 |
transform.yield |
| 1180 |
} |
| 1181 |
} |
| 1182 |
|
| 1183 |
// ----- |
| 1184 |
|
| 1185 |
func.func @pooling_ncw_sum_memref_2_3_2_1(%input: memref<4x2x5xf32>, %filter: memref<2xf32>, %output: memref<4x2x3xf32>) { |
| 1186 |
linalg.pooling_ncw_sum |
| 1187 |
{dilations = dense<2> : tensor<1xi64>, strides = dense<1> : tensor<1xi64>} |
| 1188 |
ins(%input, %filter : memref<4x2x5xf32>, memref<2xf32>) |
| 1189 |
outs(%output : memref<4x2x3xf32>) |
| 1190 |
return |
| 1191 |
} |
| 1192 |
|
| 1193 |
// CHECK-LABEL: func.func @pooling_ncw_sum_memref_2_3_2_1 |
| 1194 |
// CHECK-SAME: (%[[INPUT:.+]]: memref<4x2x5xf32>, %[[FILTER:.+]]: memref<2xf32>, %[[OUTPUT:.+]]: memref<4x2x3xf32>) |
| 1195 |
// CHECK-DAG: %[[Vc0:.+]] = arith.constant 0 : index |
| 1196 |
// CHECK-DAG: %[[Vcst:.+]] = arith.constant 0.000000e+00 : f32 |
| 1197 |
// CHECK: %[[V0:.+]] = vector.transfer_read %[[INPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x5xf32>, vector<4x2x5xf32> |
| 1198 |
// CHECK: %[[V1:.+]] = vector.transfer_read %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]], %[[Vcst]] {in_bounds = [true, true, true]} : memref<4x2x3xf32>, vector<4x2x3xf32> |
| 1199 |
// CHECK: %[[V2:.+]] = vector.transpose %[[V0]], [0, 2, 1] : vector<4x2x5xf32> to vector<4x5x2xf32> |
| 1200 |
// CHECK: %[[V3:.+]] = vector.transpose %[[V1]], [0, 2, 1] : vector<4x2x3xf32> to vector<4x3x2xf32> |
| 1201 |
// CHECK: %[[V4:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 0, 0], sizes = [4, 3, 2], strides = [1, 1, 1]} : vector<4x5x2xf32> to vector<4x3x2xf32> |
| 1202 |
// CHECK: %[[V5:.+]] = vector.extract_strided_slice %[[V2]] {offsets = [0, 2, 0], sizes = [4, 3, 2], strides = [1, 1, 1]} : vector<4x5x2xf32> to vector<4x3x2xf32> |
| 1203 |
// CHECK: %[[V6:.+]] = arith.addf %[[V4]], %[[V3]] : vector<4x3x2xf32> |
| 1204 |
// CHECK: %[[V7:.+]] = arith.addf %[[V5]], %[[V6]] : vector<4x3x2xf32> |
| 1205 |
// CHECK: %[[V8:.+]] = vector.transpose %[[V7]], [0, 2, 1] : vector<4x3x2xf32> to vector<4x2x3xf32> |
| 1206 |
// CHECK: vector.transfer_write %[[V8:.+]], %[[OUTPUT]][%[[Vc0]], %[[Vc0]], %[[Vc0]]] {in_bounds = [true, true, true]} : vector<4x2x3xf32>, memref<4x2x3xf32> |
| 1207 |
|
| 1208 |
module attributes {transform.with_named_sequence} { |
| 1209 |
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) { |
| 1210 |
%0 = transform.structured.match ops{["linalg.pooling_ncw_sum"]} in %arg1 : (!transform.any_op) -> !transform.any_op |
| 1211 |
%1 = transform.get_parent_op %0 {isolated_from_above} : (!transform.any_op) -> !transform.any_op |
| 1212 |
%2 = transform.structured.vectorize_children_and_apply_patterns %1 : (!transform.any_op) -> !transform.any_op |
| 1213 |
transform.yield |
| 1214 |
} |
| 1215 |
} |