// RUN: mlir-opt -split-input-file \ // RUN: -transform-preload-library='transform-library-paths=%p/td/xfer-drop-unit-dims.mlir' \ // RUN: -transform-interpreter=entry-point=drop_unit_dims %s | FileCheck %s //----------------------------------------------------------------------------- // 1. vector.transfer_read // [Pattern: DropInnerMostUnitDimsTransferRead] //----------------------------------------------------------------------------- func.func @contiguous_inner_most(%src: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>) -> vector<1x8x1xf32>{ %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%c0, %c0, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, vector<1x8x1xf32> return %v : vector<1x8x1xf32> } // CHECK: func @contiguous_inner_most(%[[SRC:.+]]: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK-SAME: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> to memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>> // CHECK: %[[VEC:.+]] = vector.transfer_read %[[SRC_0]] // CHECK-SAME: memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>>, vector<1x8xf32> // CHECK: %[[RESULT:.+]] = vector.shape_cast %[[VEC]] // CHECK: return %[[RESULT]] // Same as the top example within this split, but with the inner vector // dim scalable. Note that this example only makes sense when "8 = [8]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_scalable_inner_dim(%src: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>) -> vector<1x[8]x1xf32>{ %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%c0, %c0, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, vector<1x[8]x1xf32> return %v : vector<1x[8]x1xf32> } // CHECK: func @contiguous_inner_most_scalable_inner_dim(%[[SRC:.+]]: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK-SAME: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> to memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>> // CHECK: %[[VEC:.+]] = vector.transfer_read %[[SRC_0]] // CHECK-SAME: memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>>, vector<1x[8]xf32> // CHECK: %[[RESULT:.+]] = vector.shape_cast %[[VEC]] // CHECK: return %[[RESULT]] // Same as the top example within this split, but the trailing unit dim was // replaced with a dyn dim - not supported func.func @negative_dynamic_trailing_dim(%src: memref<1x1x8x?xf32, strided<[3072, 8, 1, 1], offset: ?>>) -> vector<1x8x1xf32>{ %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%c0, %c0, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<1x1x8x?xf32, strided<[3072, 8, 1, 1], offset: ?>>, vector<1x8x1xf32> return %v : vector<1x8x1xf32> } // CHECK-LABEL: func @negative_dynamic_trailing_dim // CHECK-NOT: memref.subview // CHECK-NOT: vector.shape_cast // Same as the top example within this split, but with a "scalable unit" dim in // the output vector - not supported (scalable 1, [1], is _not_ a unit dimension). func.func @negative_scalable_one_trailing_dim(%src: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>) -> vector<1x8x[1]xf32>{ %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%c0, %c0, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, vector<1x8x[1]xf32> return %v : vector<1x8x[1]xf32> } // CHECK-LABEL: func @negative_scalable_one_trailing_dim // CHECK-NOT: memref.subview // CHECK-NOT: vector.shape_cast // ----- func.func @contiguous_inner_most_dynamic_outer(%i: index, %ii: index, %memref: memref) -> vector<8x1xf32> { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %memref[%i, %ii, %c0, %c0], %pad {in_bounds = [true, true]} : memref, vector<8x1xf32> return %v : vector<8x1xf32> } // CHECK: func.func @contiguous_inner_most_dynamic_outer // CHECK-SAME: %[[IDX0:[a-zA-Z0-9]+]] // CHECK-SAME: %[[IDX1:[a-zA-Z0-9]+]] // CHECK-SAME: %[[SRC:[a-zA-Z0-9]+]] // CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index // CHECK-DAG: %[[C1:.+]] = arith.constant 1 : index // CHECK-DAG: %[[PAD:.+]] = arith.constant 0.000000e+00 : f32 // CHECK: %[[D0:.+]] = memref.dim %[[SRC]], %[[C0]] // CHECK: %[[D1:.+]] = memref.dim %[[SRC]], %[[C1]] // CHECK: %[[VIEW:.+]] = memref.subview %[[SRC]][0, 0, 0, 0] [%[[D0]], %[[D1]], 8, 1] [1, 1, 1, 1] // CHECK-SAME: memref to memref> // CHECK: %[[VEC:.+]] = vector.transfer_read %[[VIEW]] // CHECK-SAME: memref>, vector<8xf32> // CHECK: %[[RESULT:.+]] = vector.shape_cast %[[VEC]] // CHECK: return %[[RESULT]] // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "8 = [8]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_outer_dim_dyn_scalable_inner_dim(%i: index, %ii: index, %memref: memref) -> vector<[8]x1xf32> { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %memref[%i, %ii, %c0, %c0], %pad {in_bounds = [true, true]} : memref, vector<[8]x1xf32> return %v : vector<[8]x1xf32> } // CHECK-LABEL: func @contiguous_inner_most_outer_dim_dyn_scalable_inner_dim // CHECK-SAME: %[[IDX0:[a-zA-Z0-9]+]] // CHECK-SAME: %[[IDX1:[a-zA-Z0-9]+]] // CHECK-SAME: %[[SRC:[a-zA-Z0-9]+]] // CHECK: %[[VIEW:.+]] = memref.subview %[[SRC]]{{.*}} memref to memref> // CHECK: %[[VEC_READ:.+]] = vector.transfer_read %[[VIEW]] // CHECK-SAME: {in_bounds = [true]} // CHECK-SAME: memref>, vector<[8]xf32> // CHECK: vector.shape_cast %[[VEC_READ]] // ----- // Test the impact of changing the in_bounds attribute. The behaviour will // depend on whether the index is == 0 or != 0. // The index to be dropped is == 0, so it's safe to collapse. The other index // should be preserved correctly. func.func @contiguous_inner_most_zero_idx_in_bounds(%src: memref<16x1xf32>, %i:index) -> (vector<8x1xf32>) { %pad = arith.constant 0.0 : f32 %c0 = arith.constant 0 : index %v = vector.transfer_read %src[%i, %c0], %pad {in_bounds = [true, true]} : memref<16x1xf32>, vector<8x1xf32> return %v : vector<8x1xf32> } // CHECK-LABEL: func.func @contiguous_inner_most_zero_idx_in_bounds( // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) -> vector<8x1xf32> { // CHECK: %[[PAD:.*]] = arith.constant 0.000000e+00 : f32 // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[READ:.*]] = vector.transfer_read %[[SV]]{{\[}}%[[IDX]]], %[[PAD]] {in_bounds = [true]} : memref<16xf32, strided<[1]>>, vector<8xf32> // CHECK: vector.shape_cast %[[READ]] : vector<8xf32> to vector<8x1xf32> // The index to be dropped is == 0, so it's safe to collapse. The "out of // bounds" attribute is too conservative and will be folded to "in bounds" // before the pattern runs. The other index should be preserved correctly. func.func @contiguous_inner_most_zero_idx_out_of_bounds(%src: memref<16x1xf32>, %i:index) -> (vector<8x1xf32>) { %pad = arith.constant 0.0 : f32 %c0 = arith.constant 0 : index %v = vector.transfer_read %src[%i, %c0], %pad {in_bounds = [true, false]} : memref<16x1xf32>, vector<8x1xf32> return %v : vector<8x1xf32> } // CHECK-LABEL: func.func @contiguous_inner_most_zero_idx_out_of_bounds( // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) -> vector<8x1xf32> { // CHECK: %[[PAD:.*]] = arith.constant 0.000000e+00 : f32 // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[READ:.*]] = vector.transfer_read %[[SV]]{{\[}}%[[IDX]]], %[[PAD]] {in_bounds = [true]} : memref<16xf32, strided<[1]>>, vector<8xf32> // CHECK: vector.shape_cast %[[READ]] : vector<8xf32> to vector<8x1xf32> // The index to be dropped is unknown, but since it's "in bounds", it has to be // == 0. It's safe to collapse the corresponding dim. func.func @contiguous_inner_most_non_zero_idx_in_bounds(%src: memref<16x1xf32>, %i:index) -> (vector<8x1xf32>) { %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%i, %i], %pad {in_bounds = [true, true]} : memref<16x1xf32>, vector<8x1xf32> return %v : vector<8x1xf32> } // CHECK-LABEL: func.func @contiguous_inner_most_non_zero_idx_in_bounds( // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) -> vector<8x1xf32> { // CHECK: %[[PAD:.*]] = arith.constant 0.000000e+00 : f32 // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[READ:.*]] = vector.transfer_read %[[SV]]{{\[}}%[[IDX]]], %[[PAD]] {in_bounds = [true]} : memref<16xf32, strided<[1]>>, vector<8xf32> // CHECK: vector.shape_cast %[[READ]] : vector<8xf32> to vector<8x1xf32> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "8 = [8]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_non_zero_idx_in_bounds_scalable(%src: memref<16x1xf32>, %i:index) -> (vector<[8]x1xf32>) { %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%i, %i], %pad {in_bounds = [true, true]} : memref<16x1xf32>, vector<[8]x1xf32> return %v : vector<[8]x1xf32> } // CHECK-LABEL: func.func @contiguous_inner_most_non_zero_idx_in_bounds_scalable // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) -> vector<[8]x1xf32> { // CHECK: %[[PAD:.*]] = arith.constant 0.000000e+00 : f32 // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[READ:.*]] = vector.transfer_read %[[SV]]{{\[}}%[[IDX]]], %[[PAD]] {in_bounds = [true]} : memref<16xf32, strided<[1]>>, vector<[8]xf32> // CHECK: vector.shape_cast %[[READ]] : vector<[8]xf32> to vector<[8]x1xf32> // The index to be dropped is unknown and "out of bounds" - not safe to // collapse. func.func @negative_contiguous_inner_most_non_zero_idx_out_of_bounds(%src: memref<16x1xf32>, %i:index) -> (vector<8x1xf32>) { %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%i, %i], %pad {in_bounds = [true, false]} : memref<16x1xf32>, vector<8x1xf32> return %v : vector<8x1xf32> } // CHECK-LABEL: func.func @negative_contiguous_inner_most_non_zero_idx_out_of_bounds( // CHECK-NOT: memref.subview // CHECK-NOT: memref.shape_cast // CHECK: vector.transfer_read // ----- func.func @contiguous_inner_most_dim_with_subview(%src: memref<1000x1xf32>, %i:index, %ii:index) -> (vector<4x1xf32>) { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %sv = memref.subview %src[%i, 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> %v = vector.transfer_read %sv[%ii, %c0], %pad {in_bounds = [true, true]} : memref<40x1xf32, strided<[1, 1], offset: ?>>, vector<4x1xf32> return %v : vector<4x1xf32> } // CHECK: func @contiguous_inner_most_dim_with_subview(%[[SRC:.+]]: memref<1000x1xf32>, %[[II:.+]]: index, %[[J:.+]]: index) -> vector<4x1xf32> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK: %[[SRC_1:.+]] = memref.subview %[[SRC_0]] // CHECK: %[[V:.+]] = vector.transfer_read %[[SRC_1]] // CHECK-SAME: {in_bounds = [true]} // CHECK-SAME: vector<4xf32> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "4 = [4]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_dim_with_subview_scalable_inner_dim(%src: memref<1000x1xf32>, %i:index, %ii:index) -> (vector<[4]x1xf32>) { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %sv = memref.subview %src[%i, 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> %v = vector.transfer_read %sv[%ii, %c0], %pad {in_bounds = [true, true]} : memref<40x1xf32, strided<[1, 1], offset: ?>>, vector<[4]x1xf32> return %v : vector<[4]x1xf32> } // CHECK-LABEL: func @contiguous_inner_most_dim_with_subview_scalable_inner_dim // CHECK-SAME: %[[SRC:.+]]: memref<1000x1xf32> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK: %[[V:.+]] = vector.transfer_read %[[SRC_0]] // CHECK-SAME: {in_bounds = [true]} // CHECK-SAME: vector<[4]xf32> // ----- func.func @contiguous_inner_most_dim_with_subview_2d(%src: memref<1000x1x1xf32>, %i:index, %ii:index) -> (vector<4x1x1xf32>) { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %sv = memref.subview %src[%i, 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> %v = vector.transfer_read %sv[%ii, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>>, vector<4x1x1xf32> return %v : vector<4x1x1xf32> } // CHECK: func @contiguous_inner_most_dim_with_subview_2d(%[[SRC:.+]]: memref<1000x1x1xf32>, %[[II:.+]]: index, %[[J:.+]]: index) -> vector<4x1x1xf32> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK: %[[SRC_1:.+]] = memref.subview %[[SRC_0]] // CHECK: %[[V:.+]] = vector.transfer_read %[[SRC_1]] // CHECK-SAME: {in_bounds = [true]} // CHECK-SAME: vector<4xf32> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "4 = [4]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_dim_with_subview_2d_scalable_inner_dim(%src: memref<1000x1x1xf32>, %i:index, %ii:index) -> (vector<[4]x1x1xf32>) { %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %sv = memref.subview %src[%i, 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> %v = vector.transfer_read %sv[%ii, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>>, vector<[4]x1x1xf32> return %v : vector<[4]x1x1xf32> } // CHECK-LABEL: func @contiguous_inner_most_dim_with_subview_2d_scalable_inner_dim( // CHECK-SAME: %[[SRC:.+]]: memref<1000x1x1xf32>, %[[II:.+]]: index, %[[J:.+]]: index) -> vector<[4]x1x1xf32> // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK: %[[SRC_1:.+]] = memref.subview %[[SRC_0]] // CHECK: %[[V:.+]] = vector.transfer_read %[[SRC_1]] // CHECK-SAME: {in_bounds = [true]} // CHECK-SAME: vector<[4]xf32> // CHECK: vector.shape_cast %[[V]] // ----- func.func @contiguous_inner_most_with_mask(%src: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, %mask: vector<1x8x1xi1>) -> vector<1x8x1xf32>{ %c0 = arith.constant 0 : index %pad = arith.constant 0.0 : f32 %v = vector.transfer_read %src[%c0, %c0, %c0, %c0], %pad, %mask {in_bounds = [true, true, true]} : memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, vector<1x8x1xf32> return %v : vector<1x8x1xf32> } // CHECK: func @contiguous_inner_most_with_mask(%[[SRC:.+]]: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, %[[MASK:.+]]: vector<1x8x1xi1>) // CHECK: %[[SRC_0:.+]] = memref.subview %[[SRC]] // CHECK-SAME: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> to memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>> // CHECK: %[[REDUCED_MASK:.+]] = vector.shape_cast %[[MASK]] : vector<1x8x1xi1> to vector<1x8xi1> // CHECK: %[[VEC:.+]] = vector.transfer_read %[[SRC_0]]{{.*}}, %[[REDUCED_MASK]] // CHECK-SAME: memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>>, vector<1x8xf32> // CHECK: %[[RESULT:.+]] = vector.shape_cast %[[VEC]] // CHECK: return %[[RESULT]] // ----- // NOTE: This is an out-of-bounds access. func.func @negative_non_unit_inner_vec_dim(%src: memref<4x1xf32>) -> vector<4x8xf32> { %c0 = arith.constant 0 : index %pad = arith.constant 0.000000e+00 : f32 %v = vector.transfer_read %src[%c0, %c0], %pad : memref<4x1xf32>, vector<4x8xf32> return %v : vector<4x8xf32> } // CHECK: func.func @negative_non_unit_inner_vec_dim // CHECK-NOT: memref.subview // CHECK: vector.transfer_read // ----- func.func @negative_non_unit_inner_memref_dim(%src: memref<4x8xf32>) -> vector<4x1xf32> { %c0 = arith.constant 0 : index %pad = arith.constant 0.000000e+00 : f32 %v = vector.transfer_read %src[%c0, %c0], %pad : memref<4x8xf32>, vector<4x1xf32> return %v : vector<4x1xf32> } // CHECK: func.func @negative_non_unit_inner_memref_dim // CHECK-NOT: memref.subview // CHECK: vector.transfer_read // ----- // The inner most unit dims can not be dropped if the strides are not ones. func.func @negative_non_unit_strides(%src: memref<512x16x1xf32, strided<[8192, 16, 4], offset: ?>>, %i: index) -> vector<16x16x1xf32> { %c0 = arith.constant 0 : index %pad = arith.constant 0.000000e+00 : f32 %v = vector.transfer_read %src[%i, %c0, %c0], %pad {in_bounds = [true, true, true]} : memref<512x16x1xf32, strided<[8192, 16, 4], offset: ?>>, vector<16x16x1xf32> return %v : vector<16x16x1xf32> } // CHECK: func.func @negative_non_unit_strides // CHECK-NOT: memref.subview // ----- //----------------------------------------------------------------------------- // 2. vector.transfer_write // [Pattern: DropInnerMostUnitDimsTransferWrite] //----------------------------------------------------------------------------- func.func @contiguous_inner_most(%dest: memref<1x512x16x1x1xf32>, %v: vector<1x16x16x1x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%c0, %i, %c0, %c0, %c0] {in_bounds = [true, true, true, true, true]} : vector<1x16x16x1x1xf32>, memref<1x512x16x1x1xf32> return } // CHECK: func.func @contiguous_inner_most // CHECK-SAME: %[[DEST:[a-zA-Z0-9]+]] // CHECK-SAME: %[[VEC:[a-zA-Z0-9]+]] // CHECK-SAME: %[[IDX:[a-zA-Z0-9]+]] // CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index // CHECK: %[[SUBVIEW:.+]] = memref.subview %[[DEST]] // CHECK-SAME: memref<1x512x16x1x1xf32> to memref<1x512x16xf32, strided<[8192, 16, 1]>> // CHECK: %[[CAST:.+]] = vector.shape_cast %[[VEC]] : vector<1x16x16x1x1xf32> to vector<1x16x16xf32> // CHECK: vector.transfer_write %[[CAST]], %[[SUBVIEW]] // CHECK-SAME: [%[[C0]], %[[IDX]], %[[C0]]] // Same as the top example within this split, but with the inner vector // dim scalable. Note that this example only makes sense when "16 = [16]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_scalable_inner_dim(%dest: memref<1x512x16x1x1xf32>, %v: vector<1x16x[16]x1x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%c0, %i, %c0, %c0, %c0] {in_bounds = [true, true, true, true, true]} : vector<1x16x[16]x1x1xf32>, memref<1x512x16x1x1xf32> return } // CHECK: func.func @contiguous_inner_most_scalable_inner_dim // CHECK-SAME: %[[DEST:[a-zA-Z0-9]+]] // CHECK-SAME: %[[VEC:[a-zA-Z0-9]+]] // CHECK-SAME: %[[IDX:[a-zA-Z0-9]+]] // CHECK-DAG: %[[C0:.+]] = arith.constant 0 : index // CHECK: %[[SUBVIEW:.+]] = memref.subview %[[DEST]] // CHECK-SAME: memref<1x512x16x1x1xf32> to memref<1x512x16xf32, strided<[8192, 16, 1]>> // CHECK: %[[CAST:.+]] = vector.shape_cast %[[VEC]] : vector<1x16x[16]x1x1xf32> to vector<1x16x[16]xf32> // CHECK: vector.transfer_write %[[CAST]], %[[SUBVIEW]] // CHECK-SAME: [%[[C0]], %[[IDX]], %[[C0]]] // Same as the top example within this split, but the trailing unit dim was // replaced with a dyn dim - not supported func.func @negative_dynamic_trailing_dim(%dest: memref<1x512x16x1x?xf32>, %v: vector<1x16x16x1x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%c0, %i, %c0, %c0, %c0] {in_bounds = [true, true, true, true, true]} : vector<1x16x16x1x1xf32>, memref<1x512x16x1x?xf32> return } // CHECK: func.func @negative_dynamic_trailing_dim // CHECK-NOT: memref.subview // CHECK-NOT: vector.shape_cast // Same as the top example within this split, but with a "scalable unit" dim in // the input vector - not supported (scalable 1, [1], is _not_ a unit dimension). func.func @negative_scalable_one_trailing_dim(%dest: memref<1x512x16x1x1xf32>, %v: vector<1x16x16x1x[1]xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%c0, %i, %c0, %c0, %c0] {in_bounds = [true, true, true, true, true]} : vector<1x16x16x1x[1]xf32>, memref<1x512x16x1x1xf32> return } // CHECK: func.func @negative_scalable_one_trailing_dim // CHECK-NOT: memref.subview // CHECK-NOT: vector.shape_cast // ----- func.func @contiguous_inner_most_dynamic_outer(%i: index, %ii: index, %dest: memref, %v: vector<8x1xf32>) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%i, %ii, %c0, %c0] {in_bounds = [true, true]} : vector<8x1xf32>, memref return } // CHECK-LABEL: func.func @contiguous_inner_most_dynamic_outer( // CHECK-SAME: %[[IDX_0:.*]]: index, %[[IDX_1:.*]]: index, // CHECK-SAME: %[[MEM:.*]]: memref, // CHECK-SAME: %[[VEC:.*]]: vector<8x1xf32>) { // CHECK: %[[C1:.*]] = arith.constant 1 : index // CHECK: %[[C0:.*]] = arith.constant 0 : index // CHECK: %[[DIM0:.*]] = memref.dim %[[MEM]], %[[C0]] : memref // CHECK: %[[DIM1:.*]] = memref.dim %[[MEM]], %[[C1]] : memref // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0, 0, 0] {{\[}}%[[DIM0]], %[[DIM1]], 16, 1] [1, 1, 1, 1] : memref to memref> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<8x1xf32> to vector<8xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX_0]], %[[IDX_1]], %[[C0]]] {in_bounds = [true]} : vector<8xf32>, memref> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "8 = [8]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_dynamic_outer_scalable_inner_dim(%i: index, %ii: index, %dest: memref, %v: vector<[8]x1xf32>) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%i, %ii, %c0, %c0] {in_bounds = [true, true]} : vector<[8]x1xf32>, memref return } // CHECK-LABEL: func.func @contiguous_inner_most_dynamic_outer_scalable_inner_dim( // CHECK-SAME: %[[IDX_0:.*]]: index, %[[IDX_1:.*]]: index, // CHECK-SAME: %[[MEM:.*]]: memref, // CHECK-SAME: %[[VEC:.*]]: vector<[8]x1xf32>) { // CHECK: %[[C1:.*]] = arith.constant 1 : index // CHECK: %[[C0:.*]] = arith.constant 0 : index // CHECK: %[[DIM0:.*]] = memref.dim %[[MEM]], %[[C0]] : memref // CHECK: %[[DIM1:.*]] = memref.dim %[[MEM]], %[[C1]] : memref // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0, 0, 0] {{\[}}%[[DIM0]], %[[DIM1]], 16, 1] [1, 1, 1, 1] : memref to memref> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<[8]x1xf32> to vector<[8]xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX_0]], %[[IDX_1]], %[[C0]]] {in_bounds = [true]} : vector<[8]xf32>, memref> // ----- // Test the impact of changing the in_bounds attribute. The behaviour will // depend on whether the index is == 0 or != 0. // The index to be dropped is == 0, so it's safe to collapse. The other index // should be preserved correctly. func.func @contiguous_inner_most_zero_idx_in_bounds(%dest: memref<16x1xf32>, %v: vector<8x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%i, %c0] {in_bounds = [true, true]} : vector<8x1xf32>, memref<16x1xf32> return } // CHECK-LABEL: func.func @contiguous_inner_most_zero_idx_in_bounds( // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[VEC:.*]]: vector<8x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) { // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<8x1xf32> to vector<8xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX]]] {in_bounds = [true]} : vector<8xf32>, memref<16xf32, strided<[1]>> // The index to be dropped is == 0, so it's safe to collapse. The "out of // bounds" attribute is too conservative and will be folded to "in bounds" // before the pattern runs. The other index should be preserved correctly. func.func @contiguous_inner_most_zero_idx_out_of_bounds(%dest: memref<16x1xf32>, %v: vector<8x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%i, %c0] {in_bounds = [true, false]} : vector<8x1xf32>, memref<16x1xf32> return } // CHECK-LABEL: func.func @contiguous_inner_most_zero_idx_out_of_bounds // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[VEC:.*]]: vector<8x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) { // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<8x1xf32> to vector<8xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX]]] {in_bounds = [true]} : vector<8xf32>, memref<16xf32, strided<[1]>> // The index to be dropped is unknown, but since it's "in bounds", it has to be // == 0. It's safe to collapse the corresponding dim. func.func @contiguous_inner_most_dim_non_zero_idx_in_bounds(%dest: memref<16x1xf32>, %v: vector<8x1xf32>, %i: index) { vector.transfer_write %v, %dest[%i, %i] {in_bounds = [true, true]} : vector<8x1xf32>, memref<16x1xf32> return } // CHECK-LABEL: func @contiguous_inner_most_dim_non_zero_idx_in_bounds // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[VEC:.*]]: vector<8x1xf32>, // CHECK-SAME: %[[IDX:.*]]: index) { // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<8x1xf32> to vector<8xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX]]] {in_bounds = [true]} : vector<8xf32>, memref<16xf32, strided<[1]>> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "8 = [8]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_non_zero_idx_in_bounds_scalable(%dest: memref<16x1xf32>, %v: vector<[8]x1xf32>, %i: index) { vector.transfer_write %v, %dest[%i, %i] {in_bounds = [true, true]} : vector<[8]x1xf32>, memref<16x1xf32> return } // CHECK-LABEL: func.func @contiguous_inner_most_non_zero_idx_in_bounds_scalable( // CHECK-SAME: %[[MEM:.*]]: memref<16x1xf32>, // CHECK-SAME: %[[VEC:.*]]: vector<[8]x1xf32> // CHECK-SAME: %[[IDX:.*]]: index) { // CHECK: %[[SV:.*]] = memref.subview %[[MEM]][0, 0] [16, 1] [1, 1] : memref<16x1xf32> to memref<16xf32, strided<[1]>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<[8]x1xf32> to vector<[8]xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV]]{{\[}}%[[IDX]]] {in_bounds = [true]} : vector<[8]xf32>, memref<16xf32, strided<[1]>> // The index to be dropped is unknown and "out of bounds" - not safe to // collapse. func.func @negative_contiguous_inner_most_dim_non_zero_idx_out_of_bounds(%dest: memref<16x1xf32>, %v: vector<8x1xf32>, %i: index) { vector.transfer_write %v, %dest[%i, %i] {in_bounds = [true, false]} : vector<8x1xf32>, memref<16x1xf32> return } // CHECK-LABEL: func @negative_contiguous_inner_most_dim_non_zero_idx_out_of_bounds // CHECK-NOT: memref.subview // CHECK-NOT: memref.shape_cast // CHECK: vector.transfer_write // ----- // Verify that the transformation does work even when the input is a "subview" func.func @contiguous_inner_most_dim_with_subview(%dest: memref<1000x1xf32>, %i:index, %ii:index, %vec: vector<4x1xf32>) { %c0 = arith.constant 0 : index %cst = arith.constant 0.0 : f32 %0 = memref.subview %dest[%i, 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> vector.transfer_write %vec, %0[%ii, %c0] {in_bounds = [true, true]} : vector<4x1xf32>, memref<40x1xf32, strided<[1, 1], offset: ?>> return } // CHECK-LABEL: func.func @contiguous_inner_most_dim_with_subview( // CHECK-SAME: %[[MEM:.*]]: memref<1000x1xf32>, // CHECK-SAME: %[[IDX_1:.*]]: index, %[[IDX_2:.*]]: index, // CHECK-SAME: %[[VEC:.*]]: vector<4x1xf32>) { // CHECK: %[[SV_1:.*]] = memref.subview %[[MEM]]{{\[}}%[[IDX_1]], 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> // CHECK: %[[SV_2:.*]] = memref.subview %[[SV_1]][0, 0] [40, 1] [1, 1] : memref<40x1xf32, strided<[1, 1], offset: ?>> to memref<40xf32, strided<[1], offset: ?>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<4x1xf32> to vector<4xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV_2]]{{\[}}%[[IDX_2]]] {in_bounds = [true]} : vector<4xf32>, memref<40xf32, strided<[1], offset: ?>> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "4 = [4]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_dim_with_subview_scalable_inner_dim(%dest: memref<1000x1xf32>, %i:index, %ii:index, %vec: vector<[4]x1xf32>) { %c0 = arith.constant 0 : index %cst = arith.constant 0.0 : f32 %0 = memref.subview %dest[%i, 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> vector.transfer_write %vec, %0[%ii, %c0] {in_bounds = [true, true]} : vector<[4]x1xf32>, memref<40x1xf32, strided<[1, 1], offset: ?>> return } // CHECK-LABEL: func.func @contiguous_inner_most_dim_with_subview_scalable_inner_dim // CHECK-SAME: %[[MEM:.*]]: memref<1000x1xf32>, // CHECK-SAME: %[[IDX_1:.*]]: index, %[[IDX_2:.*]]: index, // CHECK-SAME: %[[VEC:.*]]: vector<[4]x1xf32>) { // CHECK: %[[SV_1:.*]] = memref.subview %[[MEM]]{{\[}}%[[IDX_1]], 0] [40, 1] [1, 1] : memref<1000x1xf32> to memref<40x1xf32, strided<[1, 1], offset: ?>> // CHECK: %[[SV_2:.*]] = memref.subview %[[SV_1]][0, 0] [40, 1] [1, 1] : memref<40x1xf32, strided<[1, 1], offset: ?>> to memref<40xf32, strided<[1], offset: ?>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<[4]x1xf32> to vector<[4]xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV_2]]{{\[}}%[[IDX_2]]] {in_bounds = [true]} : vector<[4]xf32>, memref<40xf32, strided<[1], offset: ?>> // ----- func.func @contiguous_inner_most_dim_with_subview_2d(%dest: memref<1000x1x1xf32>, %i:index, %ii:index, %vec: vector<4x1x1xf32>) { %c0 = arith.constant 0 : index %cst = arith.constant 0.0 : f32 %0 = memref.subview %dest[%i, 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> vector.transfer_write %vec, %0[%ii, %c0, %c0] {in_bounds = [true, true, true]} : vector<4x1x1xf32>, memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> return } // CHECK-LABEL: func.func @contiguous_inner_most_dim_with_subview_2d( // CHECK-SAME: %[[MEM:.*]]: memref<1000x1x1xf32>, // CHECK-SAME: %[[IDX_1:.*]]: index, %[[IDX_2:.*]]: index, // CHECK-SAME: %[[VEC:.*]]: vector<4x1x1xf32>) { // CHECK: %[[SV_1:.*]] = memref.subview %[[MEM]]{{\[}}%[[IDX_1]], 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> // CHECK: %[[SV_2:.*]] = memref.subview %[[SV_1]][0, 0, 0] [40, 1, 1] [1, 1, 1] : memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> to memref<40xf32, strided<[1], offset: ?>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<4x1x1xf32> to vector<4xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV_2]]{{\[}}%[[IDX_2]]] {in_bounds = [true]} : vector<4xf32>, memref<40xf32, strided<[1], offset: ?>> // Same as the top example within this split, but with the outer vector // dim scalable. Note that this example only makes sense when "4 = [4]" (i.e. // vscale = 1). This is assumed via the `in_bounds` attribute. func.func @contiguous_inner_most_dim_with_subview_2d_scalable(%dest: memref<1000x1x1xf32>, %i:index, %ii:index, %vec: vector<[4]x1x1xf32>) { %c0 = arith.constant 0 : index %cst = arith.constant 0.0 : f32 %0 = memref.subview %dest[%i, 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> vector.transfer_write %vec, %0[%ii, %c0, %c0] {in_bounds = [true, true, true]} : vector<[4]x1x1xf32>, memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> return } // CHECK-LABEL: func.func @contiguous_inner_most_dim_with_subview_2d_scalable // CHECK-SAME: %[[MEM:.*]]: memref<1000x1x1xf32>, // CHECK-SAME: %[[IDX_1:.*]]: index, %[[IDX_2:.*]]: index, // CHECK-SAME: %[[VEC:.*]]: vector<[4]x1x1xf32>) { // CHECK: %[[SV_1:.*]] = memref.subview %[[MEM]]{{\[}}%[[IDX_1]], 0, 0] [40, 1, 1] [1, 1, 1] : memref<1000x1x1xf32> to memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> // CHECK: %[[SV_2:.*]] = memref.subview %[[SV_1]][0, 0, 0] [40, 1, 1] [1, 1, 1] : memref<40x1x1xf32, strided<[1, 1, 1], offset: ?>> to memref<40xf32, strided<[1], offset: ?>> // CHECK: %[[SC:.*]] = vector.shape_cast %[[VEC]] : vector<[4]x1x1xf32> to vector<[4]xf32> // CHECK: vector.transfer_write %[[SC]], %[[SV_2]]{{\[}}%[[IDX_2]]] {in_bounds = [true]} : vector<[4]xf32>, memref<40xf32, strided<[1], offset: ?>> // ----- func.func @contiguous_inner_most_with_mask(%dest: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, %vec: vector<1x8x1xf32>, %mask: vector<1x8x1xi1>) { %c0 = arith.constant 0 : index vector.transfer_write %vec, %dest[%c0, %c0, %c0, %c0], %mask {in_bounds = [true, true, true]} : vector<1x8x1xf32>, memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> return } // CHECK: func @contiguous_inner_most_with_mask(%[[DEST:.+]]: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>>, %[[VEC:.+]]: vector<1x8x1xf32>, %[[MASK:.+]]: vector<1x8x1xi1>) // CHECK: %[[DEST_0:.+]] = memref.subview %[[DEST]] // CHECK-SAME: memref<1x1x8x1xf32, strided<[3072, 8, 1, 1], offset: ?>> to memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>> // CHECK: %[[REDUCED_VEC:.+]] = vector.shape_cast %[[VEC]] : vector<1x8x1xf32> to vector<1x8xf32> // CHECK: %[[REDUCED_MASK:.+]] = vector.shape_cast %[[MASK]] : vector<1x8x1xi1> to vector<1x8xi1> // CHECK: vector.transfer_write %[[REDUCED_VEC]], %[[DEST_0]]{{.*}}, %[[REDUCED_MASK]] // CHECK-SAME: vector<1x8xf32>, memref<1x1x8xf32, strided<[3072, 8, 1], offset: ?>> // ----- // NOTE: This is an out-of-bounds access. func.func @negative_non_unit_inner_vec_dim(%dest: memref<4x1xf32>, %vec: vector<4x8xf32>) { %c0 = arith.constant 0 : index vector.transfer_write %vec, %dest[%c0, %c0] : vector<4x8xf32>, memref<4x1xf32> return } // CHECK: func.func @negative_non_unit_inner_vec_dim // CHECK-NOT: memref.subview // CHECK: vector.transfer_write // ----- func.func @negative_non_unit_inner_memref_dim(%dest: memref<4x8xf32>, %vec: vector<4x1xf32>) { %c0 = arith.constant 0 : index vector.transfer_write %vec, %dest[%c0, %c0] : vector<4x1xf32>, memref<4x8xf32> return } // CHECK: func.func @negative_non_unit_inner_memref_dim // CHECK-NOT: memref.subview // CHECK: vector.transfer_write // ----- // The inner most unit dims can not be dropped if the strides are not ones. func.func @negative_non_unit_strides(%dest: memref<512x16x1xf32, strided<[8192, 16, 4], offset: ?>>, %v: vector<16x16x1xf32>, %i: index) { %c0 = arith.constant 0 : index vector.transfer_write %v, %dest[%i, %c0, %c0] {in_bounds = [true, true, true]} : vector<16x16x1xf32>, memref<512x16x1xf32, strided<[8192, 16, 4], offset: ?>> return } // CHECK: func.func @negative_non_unit_strides // CHECK-NOT: memref.subview