| // RUN: mlir-opt %s -test-vector-to-vector-lowering="unroll" | FileCheck %s |
| |
| // CHECK-DAG: #[[MAP1:map[0-9]*]] = affine_map<(d0, d1, d2) -> (d1, d2)> |
| |
| // CHECK-LABEL: func @add4x2 |
| // CHECK: %[[S1:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x2xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S2:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x2xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A1:.*]] = arith.addf %[[S1]], %[[S2]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[VEC0:.*]] = vector.insert_strided_slice %[[A1]], %{{.*}} {offsets = [0, 0], strides = [1, 1]} : vector<2x2xf32> into vector<4x2xf32> |
| // CHECK-NEXT: %[[S3:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x2xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S4:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x2xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A2:.*]] = arith.addf %[[S3]], %[[S4]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[VEC1:.*]] = vector.insert_strided_slice %[[A2]], %[[VEC0]] {offsets = [2, 0], strides = [1, 1]} : vector<2x2xf32> into vector<4x2xf32> |
| // CHECK-NEXT: return %[[VEC1:.*]] : vector<4x2xf32> |
| |
| func.func @add4x2(%0: vector<4x2xf32>) -> vector<4x2xf32> { |
| %1 = arith.addf %0, %0: vector<4x2xf32> |
| return %1: vector<4x2xf32> |
| } |
| |
| // Regression test. Previously, this example would trigger |
| // CastAwayElementwiseLeadingOneDim as: |
| // * `vector<2x[4]x1xf32>`, would be reformulated as |
| // * `vector<2x4x1xf32>`. |
| // With the updated shape, the conversion pattern would incorrectly assume that |
| // some leading dims have been dropped. |
| // CHECK-LABEL: func.func @no_change( |
| // CHECK-SAME: %[[VAL_0:.*]]: vector<2x[4]x1xf32>, |
| // CHECK-SAME: %[[VAL_1:.*]]: vector<2x[4]x1xf32>) |
| // CHECK-NEXT: %[[VAL_2:.*]] = arith.mulf %[[VAL_0]], %[[VAL_1]] : vector<2x[4]x1xf32> |
| // CHECK-NEXT: return %[[VAL_2]] |
| func.func @no_change(%arg0: vector<2x[4]x1xf32>, %arg1: vector<2x[4]x1xf32>) -> vector<2x[4]x1xf32> { |
| %1 = arith.mulf %arg0, %arg1 : vector<2x[4]x1xf32> |
| return %1 : vector<2x[4]x1xf32> |
| } |
| |
| // CHECK-LABEL: func.func @cast_away_leading_one_dim( |
| // CHECK: %[[MUL:.*]] = arith.mulf %{{.*}}, %{{.*}} : vector<4x1xf32> |
| // CHECK: vector.broadcast %[[MUL]] : vector<4x1xf32> to vector<1x4x1xf32> |
| func.func @cast_away_leading_one_dim(%arg0: vector<1x4x1xf32>, %arg1: vector<1x4x1xf32>) -> vector<1x4x1xf32> { |
| %1 = arith.mulf %arg0, %arg1 : vector<1x4x1xf32> |
| return %1: vector<1x4x1xf32> |
| } |
| |
| // CHECK-LABEL: func.func @cast_away_leading_one_dim_scalable( |
| // CHECK: %[[MUL:.*]] = arith.mulf %{{.*}}, %{{.*}} : vector<[4]x1xf32> |
| // CHECK: vector.broadcast %[[MUL]] : vector<[4]x1xf32> to vector<1x[4]x1xf32> |
| func.func @cast_away_leading_one_dim_scalable(%arg0: vector<1x[4]x1xf32>, %arg1: vector<1x[4]x1xf32>) -> vector<1x[4]x1xf32> { |
| %1 = arith.mulf %arg0, %arg1 : vector<1x[4]x1xf32> |
| return %1: vector<1x[4]x1xf32> |
| } |
| |
| // CHECK-LABEL: func @add4x4 |
| // CHECK: %[[S1:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S2:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[A1:.*]] = arith.addf %[[S1]], %[[S2]] : vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[S3:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S4:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[A2:.*]] = arith.addf %[[S3]], %[[S4]] : vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[S5:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S6:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A3:.*]] = arith.addf %[[S5]], %[[S6]] : vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[S7:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[S8:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A4:.*]] = arith.addf %[[S7]], %[[S8]] : vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[S9:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A5:.*]] = arith.addf %[[S9]], %[[A1]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[R1:.*]] = vector.insert_strided_slice %[[A5]], %{{.*}} {offsets = [0, 0], strides = [1, 1]} : vector<2x2xf32> into vector<4x4xf32> |
| |
| |
| // CHECK-NEXT: %[[S11:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [0, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A6:.*]] = arith.addf %[[S11]], %[[A2]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[R2:.*]] = vector.insert_strided_slice %[[A6]], %[[R1]] {offsets = [0, 2], strides = [1, 1]} : vector<2x2xf32> into vector<4x4xf32> |
| |
| // CHECK-NEXT: %[[S13:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 0], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A7:.*]] = arith.addf %[[S13]], %[[A3]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[R3:.*]] = vector.insert_strided_slice %[[A7]], %[[R2]] {offsets = [2, 0], strides = [1, 1]} : vector<2x2xf32> into vector<4x4xf32> |
| |
| // CHECK-NEXT: %[[S15:.*]] = vector.extract_strided_slice %{{.*}} {offsets = [2, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x4xf32> to vector<2x2xf32> |
| // CHECK-NEXT: %[[A8:.*]] = arith.addf %[[S15]], %[[A4]] : vector<2x2xf32> |
| // CHECK-NEXT: %[[R4:.*]] = vector.insert_strided_slice %[[A8]], %[[R3]] {offsets = [2, 2], strides = [1, 1]} : vector<2x2xf32> into vector<4x4xf32> |
| |
| // CHECK-NEXT: return %[[R4]] : vector<4x4xf32> |
| |
| func.func @add4x4(%0: vector<4x4xf32>, %1: vector<4x4xf32>) -> vector<4x4xf32> { |
| %2 = arith.addf %0, %1: vector<4x4xf32> |
| %3 = arith.addf %1, %2: vector<4x4xf32> |
| return %3: vector<4x4xf32> |
| } |
| |
| // CHECK-LABEL: func @contraction4x4_ikj_xfer_read |
| |
| // CHECK-DAG: %[[C2:.*]] = arith.constant 2 : index |
| // CHECK-DAG: %[[C0:.*]] = arith.constant 0 : index |
| |
| // Check LHS vector.transfer read is split for each user. |
| |
| // CHECK: %[[VTR0:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : memref<4x2xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR1:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C0]]], %{{.*}} : memref<4x2xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[VTR2:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : memref<2x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C2]]], %{{.*}} : memref<2x4xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[VTR4:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR5:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C2]]], %{{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR6:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C0]]], %{{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR7:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C2]]], %{{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[R0:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR0]], %[[VTR2]], %[[VTR4]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R1:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR0]], %[[VTR3]], %[[VTR5]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R2:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR1]], %[[VTR2]], %[[VTR6]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R3:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR1]], %[[VTR3]], %[[VTR7]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| |
| // CHECK-NEXT: vector.transfer_write %[[R0]], %{{.*}}[%[[C0]], %[[C0]]] {in_bounds = [true, true]} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK-NEXT: vector.transfer_write %[[R1]], %{{.*}}[%[[C0]], %[[C2]]] {in_bounds = [true, true]} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK-NEXT: vector.transfer_write %[[R2]], %{{.*}}[%[[C2]], %[[C0]]] {in_bounds = [true, true]} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK-NEXT: vector.transfer_write %[[R3]], %{{.*}}[%[[C2]], %[[C2]]] {in_bounds = [true, true]} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK-NEXT: return |
| |
| #contraction_accesses1 = [ |
| affine_map<(i, k, j) -> (i, k)>, |
| affine_map<(i, k, j) -> (k, j)>, |
| affine_map<(i, k, j) -> (i, j)> |
| ] |
| #contraction_trait1 = { |
| indexing_maps = #contraction_accesses1, |
| iterator_types = ["parallel", "reduction", "parallel"] |
| } |
| |
| func.func @contraction4x4_ikj_xfer_read(%arg0 : memref<4x2xf32>, |
| %arg1 : memref<2x4xf32>, |
| %arg2 : memref<4x4xf32>) { |
| %c0 = arith.constant 0 : index |
| %cf0 = arith.constant 0.0 : f32 |
| |
| %0 = vector.transfer_read %arg0[%c0, %c0], %cf0 |
| { permutation_map = affine_map<(d0, d1) -> (d0, d1)> } |
| : memref<4x2xf32>, vector<4x2xf32> |
| |
| %1 = vector.transfer_read %arg1[%c0, %c0], %cf0 |
| { permutation_map = affine_map<(d0, d1) -> (d0, d1)> } |
| : memref<2x4xf32>, vector<2x4xf32> |
| |
| %2 = vector.transfer_read %arg2[%c0, %c0], %cf0 |
| { permutation_map = affine_map<(d0, d1) -> (d0, d1)> } |
| : memref<4x4xf32>, vector<4x4xf32> |
| |
| %3 = vector.contract #contraction_trait1 %0, %1, %2 |
| : vector<4x2xf32>, vector<2x4xf32> into vector<4x4xf32> |
| |
| vector.transfer_write %3, %arg2[%c0, %c0] |
| {permutation_map = affine_map<(d0, d1) -> (d0, d1)>} |
| : vector<4x4xf32>, memref<4x4xf32> |
| return |
| } |
| |
| // TODO: Update test with VTR split transform. |
| // CHECK-LABEL: func @vector_transfers |
| // CHECK-COUNT-8: vector.transfer_read |
| // CHECK-COUNT-4: arith.addf |
| // CHECK-COUNT-4: vector.transfer_write |
| |
| func.func @vector_transfers(%arg0: index, %arg1: index) { |
| %cst = arith.constant 0.000000e+00 : f32 |
| %0 = memref.alloc(%arg0, %arg1) : memref<?x?xf32> |
| %1 = memref.alloc(%arg0, %arg1) : memref<?x?xf32> |
| %2 = memref.alloc(%arg0, %arg1) : memref<?x?xf32> |
| %cst_0 = arith.constant 1.000000e+00 : f32 |
| %cst_1 = arith.constant 2.000000e+00 : f32 |
| affine.for %arg2 = 0 to %arg0 step 4 { |
| affine.for %arg3 = 0 to %arg1 step 4 { |
| %4 = vector.transfer_read %0[%arg2, %arg3], %cst {permutation_map = affine_map<(d0, d1) -> (d0, d1)>} : memref<?x?xf32>, vector<4x4xf32> |
| %5 = vector.transfer_read %1[%arg2, %arg3], %cst {permutation_map = affine_map<(d0, d1) -> (d0, d1)>} : memref<?x?xf32>, vector<4x4xf32> |
| %6 = arith.addf %4, %5 : vector<4x4xf32> |
| vector.transfer_write %6, %2[%arg2, %arg3] {permutation_map = affine_map<(d0, d1) -> (d0, d1)>} : vector<4x4xf32>, memref<?x?xf32> |
| } |
| } |
| return |
| } |
| |
| // CHECK-LABEL: func @cancelling_shape_cast_ops |
| // CHECK-SAME: %[[A0:.*0]]: vector<2x4xf32> |
| // CHECK: return %[[A0]] : vector<2x4xf32> |
| func.func @cancelling_shape_cast_ops(%arg0 : vector<2x4xf32>) -> vector<2x4xf32> { |
| %0 = vector.shape_cast %arg0 : vector<2x4xf32> to vector<8xf32> |
| %1 = vector.shape_cast %0 : vector<8xf32> to vector<2x4xf32> |
| return %1 : vector<2x4xf32> |
| } |
| |
| // CHECK-LABEL: func @elementwise_unroll |
| // CHECK-SAME: (%[[ARG0:.*]]: memref<4x4xf32>, %[[ARG1:.*]]: memref<4x4xf32>) |
| // CHECK-DAG: %[[C2:.*]] = arith.constant 2 : index |
| // CHECK-DAG: %[[C0:.*]] = arith.constant 0 : index |
| // CHECK: %[[VT0:.*]] = vector.transfer_read %[[ARG0]][%[[C0]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT1:.*]] = vector.transfer_read %[[ARG0]][%[[C0]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT2:.*]] = vector.transfer_read %[[ARG0]][%[[C2]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT3:.*]] = vector.transfer_read %[[ARG0]][%[[C2]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT4:.*]] = vector.transfer_read %[[ARG1]][%[[C0]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT5:.*]] = vector.transfer_read %[[ARG1]][%[[C0]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT6:.*]] = vector.transfer_read %[[ARG1]][%[[C2]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT7:.*]] = vector.transfer_read %[[ARG1]][%[[C2]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[CMP0:.*]] = arith.cmpf ult, %[[VT0]], %[[VT4]] : vector<2x2xf32> |
| // CHECK: %[[CMP1:.*]] = arith.cmpf ult, %[[VT1]], %[[VT5]] : vector<2x2xf32> |
| // CHECK: %[[CMP2:.*]] = arith.cmpf ult, %[[VT2]], %[[VT6]] : vector<2x2xf32> |
| // CHECK: %[[CMP3:.*]] = arith.cmpf ult, %[[VT3]], %[[VT7]] : vector<2x2xf32> |
| // CHECK: %[[VT0:.*]] = vector.transfer_read %[[ARG0]][%[[C0]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT1:.*]] = vector.transfer_read %[[ARG0]][%[[C0]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT2:.*]] = vector.transfer_read %[[ARG0]][%[[C2]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT3:.*]] = vector.transfer_read %[[ARG0]][%[[C2]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT4:.*]] = vector.transfer_read %[[ARG1]][%[[C0]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT5:.*]] = vector.transfer_read %[[ARG1]][%[[C0]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT6:.*]] = vector.transfer_read %[[ARG1]][%[[C2]], %[[C0]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[VT7:.*]] = vector.transfer_read %[[ARG1]][%[[C2]], %[[C2]]], {{.*}} : memref<4x4xf32>, vector<2x2xf32> |
| // CHECK: %[[SEL0:.*]] = arith.select %[[CMP0]], %[[VT0]], %[[VT4]] : vector<2x2xi1>, vector<2x2xf32> |
| // CHECK: %[[SEL1:.*]] = arith.select %[[CMP1]], %[[VT1]], %[[VT5]] : vector<2x2xi1>, vector<2x2xf32> |
| // CHECK: %[[SEL2:.*]] = arith.select %[[CMP2]], %[[VT2]], %[[VT6]] : vector<2x2xi1>, vector<2x2xf32> |
| // CHECK: %[[SEL3:.*]] = arith.select %[[CMP3]], %[[VT3]], %[[VT7]] : vector<2x2xi1>, vector<2x2xf32> |
| // CHECK: vector.transfer_write %[[SEL0]], %[[ARG0]][%[[C0]], %[[C0]]] {{.*}} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK: vector.transfer_write %[[SEL1]], %[[ARG0]][%[[C0]], %[[C2]]] {{.*}} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK: vector.transfer_write %[[SEL2]], %[[ARG0]][%[[C2]], %[[C0]]] {{.*}} : vector<2x2xf32>, memref<4x4xf32> |
| // CHECK: vector.transfer_write %[[SEL3]], %[[ARG0]][%[[C2]], %[[C2]]] {{.*}} : vector<2x2xf32>, memref<4x4xf32> |
| func.func @elementwise_unroll(%arg0 : memref<4x4xf32>, %arg1 : memref<4x4xf32>) { |
| %c0 = arith.constant 0 : index |
| %cf0 = arith.constant 0.0 : f32 |
| %0 = vector.transfer_read %arg0[%c0, %c0], %cf0 : memref<4x4xf32>, vector<4x4xf32> |
| %1 = vector.transfer_read %arg1[%c0, %c0], %cf0 : memref<4x4xf32>, vector<4x4xf32> |
| %cond = arith.cmpf ult, %0, %1 : vector<4x4xf32> |
| // Vector transfer split pattern only support single user right now. |
| %2 = vector.transfer_read %arg0[%c0, %c0], %cf0 : memref<4x4xf32>, vector<4x4xf32> |
| %3 = vector.transfer_read %arg1[%c0, %c0], %cf0 : memref<4x4xf32>, vector<4x4xf32> |
| %4 = arith.select %cond, %2, %3 : vector<4x4xi1>, vector<4x4xf32> |
| vector.transfer_write %4, %arg0[%c0, %c0] : vector<4x4xf32>, memref<4x4xf32> |
| return |
| } |
| |
| // Check that vector.transfer read/write are split based on contract unrolling. |
| // CHECK: %[[VTR0:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : tensor<4x2xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR1:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C0]]], %{{.*}} : tensor<4x2xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[VTR2:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : tensor<2x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C2]]], %{{.*}} : tensor<2x4xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[VTR4:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C0]]], %{{.*}} : tensor<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR5:.*]] = vector.transfer_read %{{.*}}[%[[C0]], %[[C2]]], %{{.*}} : tensor<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR6:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C0]]], %{{.*}} : tensor<4x4xf32>, vector<2x2xf32> |
| // CHECK-NEXT: %[[VTR7:.*]] = vector.transfer_read %{{.*}}[%[[C2]], %[[C2]]], %{{.*}} : tensor<4x4xf32>, vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[R0:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR0]], %[[VTR2]], %[[VTR4]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R1:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR0]], %[[VTR3]], %[[VTR5]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R2:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR1]], %[[VTR2]], %[[VTR6]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| // CHECK-NEXT: %[[R3:.*]] = vector.contract {indexing_maps = [#map{{.*}}, #map{{.*}}, #map{{.*}}], iterator_types = ["parallel", "reduction", "parallel"], kind = #vector.kind<add>} %[[VTR1]], %[[VTR3]], %[[VTR7]] : vector<2x2xf32>, vector<2x2xf32> into vector<2x2xf32> |
| |
| // CHECK-NEXT: %[[VTW0:.*]] = vector.transfer_write %[[R0]], %{{.*}}[%[[C0]], %[[C0]]] {in_bounds = [true, true]} : vector<2x2xf32>, tensor<4x4xf32> |
| // CHECK-NEXT: %[[VTW1:.*]] = vector.transfer_write %[[R1]], %[[VTW0]][%[[C0]], %[[C2]]] {in_bounds = [true, true]} : vector<2x2xf32>, tensor<4x4xf32> |
| // CHECK-NEXT: %[[VTW2:.*]] = vector.transfer_write %[[R2]], %[[VTW1]][%[[C2]], %[[C0]]] {in_bounds = [true, true]} : vector<2x2xf32>, tensor<4x4xf32> |
| // CHECK-NEXT: %[[VTW3:.*]] = vector.transfer_write %[[R3]], %[[VTW2]][%[[C2]], %[[C2]]] {in_bounds = [true, true]} : vector<2x2xf32>, tensor<4x4xf32> |
| // CHECK-NEXT: return %[[VTW3]] : tensor<4x4xf32> |
| |
| func.func @contraction4x4_ikj_xfer_read_tensor(%arg0 : tensor<4x2xf32>, |
| %arg1 : tensor<2x4xf32>, |
| %arg2 : tensor<4x4xf32>) -> |
| tensor<4x4xf32> { |
| %c0 = arith.constant 0 : index |
| %cf0 = arith.constant 0.0 : f32 |
| %0 = vector.transfer_read %arg0[%c0, %c0], %cf0 : |
| tensor<4x2xf32>, vector<4x2xf32> |
| %1 = vector.transfer_read %arg1[%c0, %c0], %cf0 : |
| tensor<2x4xf32>, vector<2x4xf32> |
| %2 = vector.transfer_read %arg2[%c0, %c0], %cf0 : |
| tensor<4x4xf32>, vector<4x4xf32> |
| %3 = vector.contract #contraction_trait1 %0, %1, %2 |
| : vector<4x2xf32>, vector<2x4xf32> into vector<4x4xf32> |
| %r = vector.transfer_write %3, %arg2[%c0, %c0] |
| : vector<4x4xf32>, tensor<4x4xf32> |
| return %r : tensor<4x4xf32> |
| } |
| |
| // CHECK-LABEL: func @bubble_down_bitcast_in_extract |
| // CHECK-SAME: %[[SRC:.+]]: vector<4xf32> |
| func.func @bubble_down_bitcast_in_extract(%src: vector<4xf32>) -> (f16, f16) { |
| %0 = vector.bitcast %src : vector<4xf32> to vector<8xf16> |
| // CHECK: %[[EXTRACT1:.+]] = vector.extract %[[SRC]][1] : f32 from vector<4xf32> |
| // CHECK: %[[INSERT1:.+]] = vector.insert %[[EXTRACT1]], %{{.+}} [0] : f32 into vector<1xf32> |
| // CHECK: %[[CAST1:.+]] = vector.bitcast %[[INSERT1]] : vector<1xf32> to vector<2xf16> |
| // CHECK: %[[EXTRACT2:.+]] = vector.extract %[[CAST1]][1] : f16 from vector<2xf16> |
| %1 = vector.extract %0[3] : f16 from vector<8xf16> |
| // CHECK: %[[EXTRACT3:.+]] = vector.extract %[[SRC]][2] : f32 from vector<4xf32> |
| // CHECK: %[[INSERT3:.+]] = vector.insert %[[EXTRACT3]], %{{.+}} [0] : f32 into vector<1xf32> |
| // CHECK: %[[CAST2:.+]] = vector.bitcast %[[INSERT3]] : vector<1xf32> to vector<2xf16> |
| // CHECK: %[[EXTRACT4:.+]] = vector.extract %[[CAST2]][0] : f16 from vector<2xf16> |
| %2 = vector.extract %0[4] : f16 from vector<8xf16> |
| // CHECK: return %[[EXTRACT2]], %[[EXTRACT4]] |
| return %1, %2: f16, f16 |
| } |
| |
| // CHECK-LABEL: func @bubble_down_bitcast_in_strided_slice_extract |
| // CHECK-SAME: %[[SRC:.+]]: vector<4xf32> |
| func.func @bubble_down_bitcast_in_strided_slice_extract(%arg0: vector<4xf32>) -> vector<4xf16> { |
| // CHECK: %[[EXTRACT:.+]] = vector.extract_strided_slice %[[SRC]] {offsets = [2], sizes = [2], strides = [1]} : vector<4xf32> to vector<2xf32> |
| // CHECK: %[[CAST:.+]] = vector.bitcast %[[EXTRACT]] : vector<2xf32> to vector<4xf16> |
| %cast = vector.bitcast %arg0: vector<4xf32> to vector<8xf16> |
| %0 = vector.extract_strided_slice %cast {offsets = [4], sizes = [4], strides = [1]} : vector<8xf16> to vector<4xf16> |
| // CHECK: return %[[CAST]] |
| return %0: vector<4xf16> |
| } |
| |
| // CHECK-LABEL: func @bubble_down_bitcast_in_strided_slice_extract_full_last_dim |
| // CHECK-SAME: %[[SRC:.+]]: vector<4x2xf32> |
| func.func @bubble_down_bitcast_in_strided_slice_extract_full_last_dim(%arg0: vector<4x2xf32>) -> vector<2x4xf16> { |
| // CHECK: %[[EXTRACT:.+]] = vector.extract_strided_slice %[[SRC]] {offsets = [1], sizes = [2], strides = [1]} : vector<4x2xf32> to vector<2x2xf32> |
| // CHECK: %[[CAST:.+]] = vector.bitcast %[[EXTRACT]] : vector<2x2xf32> to vector<2x4xf16> |
| %cast = vector.bitcast %arg0: vector<4x2xf32> to vector<4x4xf16> |
| %0 = vector.extract_strided_slice %cast {offsets = [1], sizes = [2], strides = [1]} : vector<4x4xf16> to vector<2x4xf16> |
| // CHECK: return %[[CAST]] |
| return %0: vector<2x4xf16> |
| } |
| |
| // CHECK-LABEL: func @bubble_down_bitcast_in_strided_slice_extract_odd_offset |
| func.func @bubble_down_bitcast_in_strided_slice_extract_odd_offset(%arg0: vector<4xf32>) -> vector<4xf16> { |
| // CHECK: vector.bitcast |
| // CHECK-NEXT: vector.extract_strided_slice |
| %cast = vector.bitcast %arg0: vector<4xf32> to vector<8xf16> |
| %0 = vector.extract_strided_slice %cast {offsets = [3], sizes = [4], strides = [1]} : vector<8xf16> to vector<4xf16> |
| return %0: vector<4xf16> |
| } |
| |
| // CHECK-LABEL: func @bubble_down_bitcast_in_strided_slice_extract_odd_size |
| func.func @bubble_down_bitcast_in_strided_slice_extract_odd_size(%arg0: vector<4xf32>) -> vector<3xf16> { |
| // CHECK: vector.bitcast |
| // CHECK-NEXT: vector.extract_strided_slice |
| %cast = vector.bitcast %arg0: vector<4xf32> to vector<8xf16> |
| %0 = vector.extract_strided_slice %cast {offsets = [0], sizes = [3], strides = [1]} : vector<8xf16> to vector<3xf16> |
| return %0: vector<3xf16> |
| } |
| |
| // CHECK-LABEL: func.func @bubble_up_bitcast_in_insert_i4_i8( |
| // CHECK-SAME: %[[VAL:.*]]: vector<32xi4>, |
| // CHECK-SAME: %[[DST:.*]]: vector<8x32xi4>) -> vector<8x16xi8> { |
| func.func @bubble_up_bitcast_in_insert_i4_i8(%val: vector<32xi4>, %src: vector<8x32xi4>) -> vector<8x16xi8> { |
| // CHECK: %[[BC_VAL:.*]] = vector.bitcast %[[VAL]] : vector<32xi4> to vector<16xi8> |
| // CHECK: %[[BC_DST:.*]] = vector.bitcast %[[DST]] : vector<8x32xi4> to vector<8x16xi8> |
| // CHECK: vector.insert %[[BC_VAL]], %[[BC_DST]] [4] : vector<16xi8> into vector<8x16xi8> |
| %0 = vector.insert %val, %src[4] : vector<32xi4> into vector<8x32xi4> |
| %1 = vector.bitcast %0 : vector<8x32xi4> to vector<8x16xi8> |
| return %1 : vector<8x16xi8> |
| } |
| |
| // CHECK-LABEL: func.func @bubble_up_bitcast_in_insert_i8_i4( |
| // CHECK-SAME: %[[VAL:.*]]: vector<16xi8>, |
| // CHECK-SAME: %[[DST:.*]]: vector<8x16xi8>) -> vector<8x32xi4> { |
| func.func @bubble_up_bitcast_in_insert_i8_i4(%val: vector<16xi8>, %src: vector<8x16xi8>) -> vector<8x32xi4> { |
| // CHECK: %[[BC_VAL:.*]] = vector.bitcast %[[VAL]] : vector<16xi8> to vector<32xi4> |
| // CHECK: %[[BC_DST:.*]] = vector.bitcast %[[DST]] : vector<8x16xi8> to vector<8x32xi4> |
| // CHECK: vector.insert %[[BC_VAL]], %[[BC_DST]] [4] : vector<32xi4> into vector<8x32xi4> |
| %0 = vector.insert %val, %src[4] : vector<16xi8> into vector<8x16xi8> |
| %1 = vector.bitcast %0 : vector<8x16xi8> to vector<8x32xi4> |
| return %1 : vector<8x32xi4> |
| } |
| |
| // CHECK-LABEL: func.func @bubble_up_bitcast_in_insert_i32_f32( |
| // CHECK-SAME: %[[VAL:.*]]: vector<16xi32>, |
| // CHECK-SAME: %[[DST:.*]]: vector<8x16xi32>) -> vector<8x16xf32> { |
| func.func @bubble_up_bitcast_in_insert_i32_f32(%val: vector<16xi32>, %src: vector<8x16xi32>) -> vector<8x16xf32> { |
| // CHECK: %[[BC_VAL:.*]] = vector.bitcast %[[VAL]] : vector<16xi32> to vector<16xf32> |
| // CHECK: %[[BC_DST:.*]] = vector.bitcast %[[DST]] : vector<8x16xi32> to vector<8x16xf32> |
| // CHECK: vector.insert %[[BC_VAL]], %[[BC_DST]] [4] : vector<16xf32> into vector<8x16xf32> |
| %0 = vector.insert %val, %src[4] : vector<16xi32> into vector<8x16xi32> |
| %1 = vector.bitcast %0 : vector<8x16xi32> to vector<8x16xf32> |
| return %1 : vector<8x16xf32> |
| } |
| |
| // CHECK-LABEL: func.func @bubble_up_bitcast_in_insert_scalar( |
| func.func @bubble_up_bitcast_in_insert_scalar(%val: i8, %src: vector<8x16xi8>) -> vector<8x32xi4> { |
| // CHECK: vector.insert |
| // CHECK-NEXT: vector.bitcast |
| %0 = vector.insert %val, %src[4, 8] : i8 into vector<8x16xi8> |
| %1 = vector.bitcast %0 : vector<8x16xi8> to vector<8x32xi4> |
| return %1 : vector<8x32xi4> |
| } |
| |
| // CHECK-LABEL: func @bubble_up_bitcast_in_strided_slice_insert |
| // CHECK-SAME: (%[[DST:.+]]: vector<8xf16>, %[[SRC1:.+]]: vector<4xf16>, %[[SRC2:.+]]: vector<4xf16>) |
| func.func @bubble_up_bitcast_in_strided_slice_insert(%dst: vector<8xf16>, %src1: vector<4xf16>, %src2: vector<4xf16>) -> vector<4xf32> { |
| // CHECK-DAG: %[[CAST_SRC1:.+]] = vector.bitcast %[[SRC1]] : vector<4xf16> to vector<2xf32> |
| // CHECK-DAG: %[[CAST_SRC2:.+]] = vector.bitcast %[[SRC2]] : vector<4xf16> to vector<2xf32> |
| // CHECK-DAG: %[[CAST_DST:.+]] = vector.bitcast %[[DST]] : vector<8xf16> to vector<4xf32> |
| // CHECK: %[[INSERT1:.+]] = vector.insert_strided_slice %[[CAST_SRC1]], %[[CAST_DST]] {offsets = [0], strides = [1]} : vector<2xf32> into vector<4xf32> |
| // CHECK: %[[INSERT2:.+]] = vector.insert_strided_slice %[[CAST_SRC2]], %[[INSERT1]] {offsets = [2], strides = [1]} : vector<2xf32> into vector<4xf32> |
| %0 = vector.insert_strided_slice %src1, %dst {offsets = [0], strides = [1]} : vector<4xf16> into vector<8xf16> |
| %1 = vector.insert_strided_slice %src2, %0 {offsets = [4], strides = [1]} : vector<4xf16> into vector<8xf16> |
| %cast = vector.bitcast %1: vector<8xf16> to vector<4xf32> |
| // CHECK: return %[[INSERT2]] |
| return %cast: vector<4xf32> |
| } |
| |
| // CHECK-LABEL: func @bubble_up_bitcast_in_strided_slice_insert_odd_offset |
| func.func @bubble_up_bitcast_in_strided_slice_insert_odd_offset(%dst: vector<8xf16>, %src: vector<4xf16>) -> vector<4xf32> { |
| // CHECK: vector.insert_strided_slice |
| // CHECK-NEXT: vector.bitcast |
| %0 = vector.insert_strided_slice %src, %dst {offsets = [3], strides = [1]} : vector<4xf16> into vector<8xf16> |
| %cast = vector.bitcast %0: vector<8xf16> to vector<4xf32> |
| return %cast: vector<4xf32> |
| } |
| |
| // CHECK-LABEL: func @bubble_up_bitcast_in_strided_slice_insert_different_rank |
| func.func @bubble_up_bitcast_in_strided_slice_insert_different_rank(%dst: vector<16x4x8xf16>, %src: vector<2x4xf16>) -> vector<16x4x4xf32> { |
| // CHECK: vector.insert_strided_slice |
| // CHECK-NEXT: vector.bitcast |
| %0 = vector.insert_strided_slice %src, %dst {offsets = [0, 0, 2], strides = [1, 1]} : vector<2x4xf16> into vector<16x4x8xf16> |
| %cast = vector.bitcast %0: vector<16x4x8xf16> to vector<16x4x4xf32> |
| return %cast: vector<16x4x4xf32> |
| } |
| |
| // CHECK-LABEL: func @bubble_up_bitcast_in_strided_slice_insert_odd_shape |
| func.func @bubble_up_bitcast_in_strided_slice_insert_odd_shape(%dst: vector<2xf16>, %src: vector<1xf16>) -> vector<1xf32> { |
| // CHECK: vector.insert_strided_slice |
| // CHECK-NEXT: vector.bitcast |
| %0 = vector.insert_strided_slice %src, %dst {offsets = [0], strides = [1]} : vector<1xf16> into vector<2xf16> |
| %cast = vector.bitcast %0: vector<2xf16> to vector<1xf32> |
| return %cast: vector<1xf32> |
| } |
| |
| // CHECK-LABEL: func @bubble_up_bitcast_in_strided_slice_insert_larger_odd_shape |
| func.func @bubble_up_bitcast_in_strided_slice_insert_larger_odd_shape(%dst: vector<8xf16>, %src: vector<3xf16>) -> vector<4xf32> { |
| // CHECK: vector.insert_strided_slice |
| // CHECK-NEXT: vector.bitcast |
| %0 = vector.insert_strided_slice %src, %dst {offsets = [0], strides = [1]} : vector<3xf16> into vector<8xf16> |
| %cast = vector.bitcast %0: vector<8xf16> to vector<4xf32> |
| return %cast: vector<4xf32> |
| } |
| |
| // Make sure not crash on 0-D vector. |
| // CHECK-LABEL:func.func @vec_0D |
| // CHECK-NEXT:vector.bitcast |
| func.func @vec_0D(%arg0: vector<f32>) -> vector<i32> { |
| %0 = vector.bitcast %arg0 : vector<f32> to vector<i32> |
| return %0 : vector<i32> |
| } |
