11// RUN: mlir-opt %s --transform-interpreter --split-input-file | FileCheck %s
22
3- // CHECK-LABEL: func @lower_permutation_with_mask_fixed_width(
3+ ///----------------------------------------------------------------------------------------
4+ /// vector.transfer_write
5+ ///----------------------------------------------------------------------------------------
6+ /// Input:
7+ /// * vector.transfer_write op with a map which _is not_ the permutation of a
8+ /// minor identity
9+ /// Output:
10+ /// * vector.broadcast + vector.transfer_write with a map which _is_ the permutation of a
11+ /// minor identity
12+
13+ // CHECK-LABEL: func @permutation_with_mask_xfer_write_fixed_width(
414// CHECK: %[[vec:.*]] = arith.constant dense<-2.000000e+00> : vector<7x1xf32>
515// CHECK: %[[mask:.*]] = arith.constant dense<[true, false, true, false, true, true, true]> : vector<7xi1>
616// CHECK: %[[b:.*]] = vector.broadcast %[[mask]] : vector<7xi1> to vector<1x7xi1>
717// CHECK: %[[tp:.*]] = vector.transpose %[[b]], [1, 0] : vector<1x7xi1> to vector<7x1xi1>
818// CHECK: vector.transfer_write %[[vec]], %{{.*}}[%{{.*}}, %{{.*}}], %[[tp]] {in_bounds = [false, true]} : vector<7x1xf32>, memref<?x?xf32>
9- func.func @lower_permutation_with_mask_fixed_width (%A : memref <?x?xf32 >, %base1 : index ,
10- %base2 : index ) {
19+ func.func @permutation_with_mask_xfer_write_fixed_width (%A : memref <?x?xf32 >, %base1 : index ,
20+ %base2 : index ) {
21+
1122 %fn1 = arith.constant -2.0 : f32
1223 %vf0 = vector.splat %fn1 : vector <7 xf32 >
1324 %mask = arith.constant dense <[1 , 0 , 1 , 0 , 1 , 1 , 1 ]> : vector <7 xi1 >
@@ -17,7 +28,35 @@ func.func @lower_permutation_with_mask_fixed_width(%A : memref<?x?xf32>, %base1
1728 return
1829}
1930
20- // CHECK-LABEL: func.func @permutation_with_mask_scalable(
31+ // CHECK: func.func @permutation_with_mask_xfer_write_scalable(
32+ // CHECK-SAME: %[[ARG_0:.*]]: vector<4x[8]xi16>,
33+ // CHECK-SAME: %[[ARG_1:.*]]: memref<1x4x?x1xi16>,
34+ // CHECK-SAME: %[[MASK:.*]]: vector<4x[8]xi1>) {
35+ // CHECK: %[[C0:.*]] = arith.constant 0 : index
36+ // CHECK: %[[BCAST_1:.*]] = vector.broadcast %[[ARG_0]] : vector<4x[8]xi16> to vector<1x4x[8]xi16>
37+ // CHECK: %[[BCAST_2:.*]] = vector.broadcast %[[MASK]] : vector<4x[8]xi1> to vector<1x4x[8]xi1>
38+ // CHECK: %[[TRANSPOSE_1:.*]] = vector.transpose %[[BCAST_2]], [1, 2, 0] : vector<1x4x[8]xi1> to vector<4x[8]x1xi1>
39+ // CHECK: %[[TRANSPOSE_2:.*]] = vector.transpose %[[BCAST_1]], [1, 2, 0] : vector<1x4x[8]xi16> to vector<4x[8]x1xi16>
40+ // CHECK: vector.transfer_write %[[TRANSPOSE_2]], %[[ARG_1]]{{.*}}, %[[TRANSPOSE_1]] {in_bounds = [true, true, true]} : vector<4x[8]x1xi16>, memref<1x4x?x1xi16>
41+ // CHECK: return
42+ func.func @permutation_with_mask_xfer_write_scalable (%arg0: vector <4 x[8 ]xi16 >, %arg1: memref <1 x4 x?x1 xi16 >, %mask: vector <4 x[8 ]xi1 >){
43+ %c0 = arith.constant 0 : index
44+ vector.transfer_write %arg0 , %arg1 [%c0 , %c0 , %c0 , %c0 ], %mask {in_bounds = [true , true ], permutation_map = affine_map <(d0 , d1 , d2 , d3 ) -> (d1 , d2 )>
45+ } : vector <4 x[8 ]xi16 >, memref <1 x4 x?x1 xi16 >
46+
47+ return
48+ }
49+
50+ ///----------------------------------------------------------------------------------------
51+ /// vector.transfer_read
52+ ///----------------------------------------------------------------------------------------
53+ /// Input:
54+ /// * vector.transfer_read op with a permutation map
55+ /// Output:
56+ /// * vector.transfer_read with a permutation map composed of leading zeros followed by a minor identiy +
57+ /// vector.transpose op
58+
59+ // CHECK-LABEL: func.func @permutation_with_mask_xfer_read_scalable(
2160// CHECK-SAME: %[[ARG_0:.*]]: memref<?x?xf32>,
2261// CHECK-SAME: %[[IDX_1:.*]]: index,
2362// CHECK-SAME: %[[IDX_2:.*]]: index) -> vector<8x[4]x2xf32> {
@@ -29,7 +68,7 @@ func.func @lower_permutation_with_mask_fixed_width(%A : memref<?x?xf32>, %base1
2968// CHECK: %[[TRANSPOSE:.*]] = vector.transpose %[[BCAST]], [0, 2, 1] : vector<8x2x[4]xf32> to vector<8x[4]x2xf32>
3069// CHECK: return %[[TRANSPOSE]] : vector<8x[4]x2xf32>
3170// CHECK: }
32- func.func @permutation_with_mask_scalable (%2: memref <?x?xf32 >, %dim_1: index , %dim_2: index ) -> (vector <8 x[4 ]x2 xf32 >) {
71+ func.func @permutation_with_mask_xfer_read_scalable (%2: memref <?x?xf32 >, %dim_1: index , %dim_2: index ) -> (vector <8 x[4 ]x2 xf32 >) {
3372
3473 %c0 = arith.constant 0 : index
3574 %cst_0 = arith.constant 0.000000e+00 : f32
@@ -41,24 +80,6 @@ func.func @permutation_with_mask_scalable(%2: memref<?x?xf32>, %dim_1: index, %d
4180 return %1 : vector <8 x[4 ]x2 xf32 >
4281}
4382
44- // CHECK: func.func @permutation_with_mask_transfer_write_scalable(
45- // CHECK-SAME: %[[ARG_0:.*]]: vector<4x[8]xi16>,
46- // CHECK-SAME: %[[ARG_1:.*]]: memref<1x4x?x1x1x1x1xi16>,
47- // CHECK-SAME: %[[MASK:.*]]: vector<4x[8]xi1>) {
48- // CHECK: %[[C0:.*]] = arith.constant 0 : index
49- // CHECK: %[[BCAST_1:.*]] = vector.broadcast %[[ARG_0]] : vector<4x[8]xi16> to vector<1x1x1x1x4x[8]xi16>
50- // CHECK: %[[BCAST_2:.*]] = vector.broadcast %[[MASK]] : vector<4x[8]xi1> to vector<1x1x1x1x4x[8]xi1>
51- // CHECK: %[[TRANSPOSE_1:.*]] = vector.transpose %[[BCAST_2]], [4, 5, 0, 1, 2, 3] : vector<1x1x1x1x4x[8]xi1> to vector<4x[8]x1x1x1x1xi1>
52- // CHECK: %[[TRANSPOSE_2:.*]] = vector.transpose %[[BCAST_1]], [4, 5, 0, 1, 2, 3] : vector<1x1x1x1x4x[8]xi16> to vector<4x[8]x1x1x1x1xi16>
53- // CHECK: vector.transfer_write %[[TRANSPOSE_2]], %[[ARG_1]]{{\[}}%[[C0]], %[[C0]], %[[C0]], %[[C0]], %[[C0]], %[[C0]], %[[C0]]], %[[TRANSPOSE_1]] {in_bounds = [true, true, true, true, true, true]} : vector<4x[8]x1x1x1x1xi16>, memref<1x4x?x1x1x1x1xi16>
54- // CHECK: return
55- func.func @permutation_with_mask_transfer_write_scalable (%arg0: vector <4 x[8 ]xi16 >, %arg1: memref <1 x4 x?x1 x1 x1 x1 xi16 >, %mask: vector <4 x[8 ]xi1 >){
56- %c0 = arith.constant 0 : index
57- vector.transfer_write %arg0 , %arg1 [%c0 , %c0 , %c0 , %c0 , %c0 , %c0 , %c0 ], %mask {in_bounds = [true , true ], permutation_map = affine_map <(d0 , d1 , d2 , d3 , d4 , d5 , d6 ) -> (d1 , d2 )>
58- } : vector <4 x[8 ]xi16 >, memref <1 x4 x?x1 x1 x1 x1 xi16 >
59-
60- return
61- }
6283module attributes {transform.with_named_sequence } {
6384 transform.named_sequence @__transform_main (%module_op: !transform.any_op {transform.readonly }) {
6485 %f = transform.structured.match ops {[" func.func" ]} in %module_op
0 commit comments