forked from OSchip/llvm-project
400 lines
21 KiB
MLIR
400 lines
21 KiB
MLIR
// RUN: mlir-opt %s | mlir-opt | FileCheck %s
|
|
|
|
// CHECK-DAG: #[[MAP0:map[0-9]+]] = affine_map<(d0, d1) -> (d0, d1)>
|
|
|
|
// CHECK-LABEL: func @vector_transfer_ops(
|
|
func @vector_transfer_ops(%arg0: memref<?x?xf32>,
|
|
%arg1 : memref<?x?xvector<4x3xf32>>) {
|
|
// CHECK: %[[C3:.*]] = constant 3 : index
|
|
%c3 = constant 3 : index
|
|
%cst = constant 3.0 : f32
|
|
%f0 = constant 0.0 : f32
|
|
%vf0 = splat %f0 : vector<4x3xf32>
|
|
|
|
//
|
|
// CHECK: vector.transfer_read
|
|
%0 = vector.transfer_read %arg0[%c3, %c3], %f0 {permutation_map = affine_map<(d0, d1)->(d0)>} : memref<?x?xf32>, vector<128xf32>
|
|
// CHECK: vector.transfer_read
|
|
%1 = vector.transfer_read %arg0[%c3, %c3], %f0 {permutation_map = affine_map<(d0, d1)->(d1, d0)>} : memref<?x?xf32>, vector<3x7xf32>
|
|
// CHECK: vector.transfer_read
|
|
%2 = vector.transfer_read %arg0[%c3, %c3], %cst {permutation_map = affine_map<(d0, d1)->(d0)>} : memref<?x?xf32>, vector<128xf32>
|
|
// CHECK: vector.transfer_read
|
|
%3 = vector.transfer_read %arg0[%c3, %c3], %cst {permutation_map = affine_map<(d0, d1)->(d1)>} : memref<?x?xf32>, vector<128xf32>
|
|
// CHECK: vector.transfer_read %{{.*}}[%[[C3]], %[[C3]]], %{{.*}} : memref<?x?xvector<4x3xf32>>, vector<1x1x4x3xf32>
|
|
%4 = vector.transfer_read %arg1[%c3, %c3], %vf0 {permutation_map = affine_map<(d0, d1)->(d0, d1)>} : memref<?x?xvector<4x3xf32>>, vector<1x1x4x3xf32>
|
|
// CHECK: vector.transfer_read %{{.*}}[%[[C3]], %[[C3]]], %{{.*}} {masked = [true, false]} : memref<?x?xvector<4x3xf32>>, vector<1x1x4x3xf32>
|
|
%5 = vector.transfer_read %arg1[%c3, %c3], %vf0 {masked = [true, false]} : memref<?x?xvector<4x3xf32>>, vector<1x1x4x3xf32>
|
|
|
|
// CHECK: vector.transfer_write
|
|
vector.transfer_write %0, %arg0[%c3, %c3] {permutation_map = affine_map<(d0, d1)->(d0)>} : vector<128xf32>, memref<?x?xf32>
|
|
// CHECK: vector.transfer_write
|
|
vector.transfer_write %1, %arg0[%c3, %c3] {permutation_map = affine_map<(d0, d1)->(d1, d0)>} : vector<3x7xf32>, memref<?x?xf32>
|
|
// CHECK: vector.transfer_write %{{.*}}, %{{.*}}[%[[C3]], %[[C3]]] : vector<1x1x4x3xf32>, memref<?x?xvector<4x3xf32>>
|
|
vector.transfer_write %4, %arg1[%c3, %c3] {permutation_map = affine_map<(d0, d1)->(d0, d1)>} : vector<1x1x4x3xf32>, memref<?x?xvector<4x3xf32>>
|
|
// CHECK: vector.transfer_write %{{.*}}, %{{.*}}[%[[C3]], %[[C3]]] : vector<1x1x4x3xf32>, memref<?x?xvector<4x3xf32>>
|
|
vector.transfer_write %5, %arg1[%c3, %c3] {masked = [true, true]} : vector<1x1x4x3xf32>, memref<?x?xvector<4x3xf32>>
|
|
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @vector_broadcast
|
|
func @vector_broadcast(%a: f32, %b: vector<16xf32>, %c: vector<1x16xf32>, %d: vector<8x1xf32>) -> vector<8x16xf32> {
|
|
// CHECK: vector.broadcast %{{.*}} : f32 to vector<16xf32>
|
|
%0 = vector.broadcast %a : f32 to vector<16xf32>
|
|
// CHECK-NEXT: vector.broadcast %{{.*}} : vector<16xf32> to vector<8x16xf32>
|
|
%1 = vector.broadcast %b : vector<16xf32> to vector<8x16xf32>
|
|
// CHECK-NEXT: vector.broadcast %{{.*}} : vector<1x16xf32> to vector<8x16xf32>
|
|
%2 = vector.broadcast %c : vector<1x16xf32> to vector<8x16xf32>
|
|
// CHECK-NEXT: vector.broadcast %{{.*}} : vector<8x1xf32> to vector<8x16xf32>
|
|
%3 = vector.broadcast %d : vector<8x1xf32> to vector<8x16xf32>
|
|
return %3 : vector<8x16xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @shuffle1D
|
|
func @shuffle1D(%a: vector<2xf32>, %b: vector<4xf32>) -> vector<2xf32> {
|
|
// CHECK: vector.shuffle %{{.*}}, %{{.*}}[0, 1, 2, 3] : vector<2xf32>, vector<2xf32>
|
|
%1 = vector.shuffle %a, %a[0, 1, 2, 3] : vector<2xf32>, vector<2xf32>
|
|
// CHECK-NEXT: vector.shuffle %{{.*}}, %{{.*}}[0, 1, 2] : vector<4xf32>, vector<4xf32>
|
|
%2 = vector.shuffle %1, %b[0, 1, 2] : vector<4xf32>, vector<4xf32>
|
|
// CHECK-NEXT: vector.shuffle %{{.*}}, %{{.*}}[0, 6] : vector<3xf32>, vector<4xf32>
|
|
%3 = vector.shuffle %2, %b[0, 6] : vector<3xf32>, vector<4xf32>
|
|
return %3 : vector<2xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @shuffle2D
|
|
func @shuffle2D(%a: vector<1x4xf32>, %b: vector<2x4xf32>) -> vector<3x4xf32> {
|
|
// CHECK: vector.shuffle %{{.*}}, %{{.*}}[0, 1, 2] : vector<1x4xf32>, vector<2x4xf32>
|
|
%1 = vector.shuffle %a, %b[0, 1, 2] : vector<1x4xf32>, vector<2x4xf32>
|
|
return %1 : vector<3x4xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @extract_element
|
|
func @extract_element(%a: vector<16xf32>) -> f32 {
|
|
// CHECK: %[[C15:.*]] = constant 15 : i32
|
|
%c = constant 15 : i32
|
|
// CHECK-NEXT: vector.extractelement %{{.*}}[%[[C15]] : i32] : vector<16xf32>
|
|
%1 = vector.extractelement %a[%c : i32] : vector<16xf32>
|
|
return %1 : f32
|
|
}
|
|
|
|
// CHECK-LABEL: @extract
|
|
func @extract(%arg0: vector<4x8x16xf32>) -> (vector<8x16xf32>, vector<16xf32>, f32) {
|
|
// CHECK: vector.extract {{.*}}[3] : vector<4x8x16xf32>
|
|
%1 = vector.extract %arg0[3] : vector<4x8x16xf32>
|
|
// CHECK-NEXT: vector.extract {{.*}}[3, 3] : vector<4x8x16xf32>
|
|
%2 = vector.extract %arg0[3, 3] : vector<4x8x16xf32>
|
|
// CHECK-NEXT: vector.extract {{.*}}[3, 3, 3] : vector<4x8x16xf32>
|
|
%3 = vector.extract %arg0[3, 3, 3] : vector<4x8x16xf32>
|
|
return %1, %2, %3 : vector<8x16xf32>, vector<16xf32>, f32
|
|
}
|
|
|
|
// CHECK-LABEL: @insert_element
|
|
func @insert_element(%a: f32, %b: vector<16xf32>) -> vector<16xf32> {
|
|
// CHECK: %[[C15:.*]] = constant 15 : i32
|
|
%c = constant 15 : i32
|
|
// CHECK-NEXT: vector.insertelement %{{.*}}, %{{.*}}[%[[C15]] : i32] : vector<16xf32>
|
|
%1 = vector.insertelement %a, %b[%c : i32] : vector<16xf32>
|
|
return %1 : vector<16xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @insert
|
|
func @insert(%a: f32, %b: vector<16xf32>, %c: vector<8x16xf32>, %res: vector<4x8x16xf32>) -> vector<4x8x16xf32> {
|
|
// CHECK: vector.insert %{{.*}}, %{{.*}}[3] : vector<8x16xf32> into vector<4x8x16xf32>
|
|
%1 = vector.insert %c, %res[3] : vector<8x16xf32> into vector<4x8x16xf32>
|
|
// CHECK: vector.insert %{{.*}}, %{{.*}}[3, 3] : vector<16xf32> into vector<4x8x16xf32>
|
|
%2 = vector.insert %b, %res[3, 3] : vector<16xf32> into vector<4x8x16xf32>
|
|
// CHECK: vector.insert %{{.*}}, %{{.*}}[3, 3, 3] : f32 into vector<4x8x16xf32>
|
|
%3 = vector.insert %a, %res[3, 3, 3] : f32 into vector<4x8x16xf32>
|
|
return %3 : vector<4x8x16xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @outerproduct
|
|
func @outerproduct(%arg0: vector<4xf32>, %arg1: vector<8xf32>, %arg2: vector<4x8xf32>) -> vector<4x8xf32> {
|
|
// CHECK: vector.outerproduct {{.*}} : vector<4xf32>, vector<8xf32>
|
|
%0 = vector.outerproduct %arg0, %arg1 : vector<4xf32>, vector<8xf32>
|
|
// CHECK: vector.outerproduct {{.*}}, {{.*}}, {{.*}} : vector<4xf32>, vector<8xf32>
|
|
%1 = vector.outerproduct %arg0, %arg1, %arg2 : vector<4xf32>, vector<8xf32>
|
|
return %1 : vector<4x8xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @insert_strided_slice
|
|
func @insert_strided_slice(%a: vector<4x4xf32>, %b: vector<4x8x16xf32>) {
|
|
// CHECK: vector.insert_strided_slice %{{.*}}, %{{.*}} {offsets = [2, 2, 2], strides = [1, 1]} : vector<4x4xf32> into vector<4x8x16xf32>
|
|
%1 = vector.insert_strided_slice %a, %b {offsets = [2, 2, 2], strides = [1, 1]} : vector<4x4xf32> into vector<4x8x16xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @extract_strided_slice
|
|
func @extract_strided_slice(%arg0: vector<4x8x16xf32>) -> vector<2x2x16xf32> {
|
|
// CHECK: vector.extract_strided_slice %{{.*}} {offsets = [2, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x8x16xf32>
|
|
%1 = vector.extract_strided_slice %arg0 {offsets = [2, 2], sizes = [2, 2], strides = [1, 1]} : vector<4x8x16xf32> to vector<2x2x16xf32>
|
|
return %1: vector<2x2x16xf32>
|
|
}
|
|
|
|
#contraction_to_scalar_accesses = [
|
|
affine_map<(i) -> (i)>,
|
|
affine_map<(i) -> (i)>,
|
|
affine_map<(i) -> ()>
|
|
]
|
|
#contraction_to_scalar_trait = {
|
|
indexing_maps = #contraction_to_scalar_accesses,
|
|
iterator_types = ["reduction"]
|
|
}
|
|
// CHECK-LABEL: @contraction_to_scalar
|
|
func @contraction_to_scalar(%arg0: vector<10xf32>, %arg1: vector<10xf32>) -> f32 {
|
|
// CHECK: %[[C0:.*]] = constant 0.000000e+00 : f32
|
|
%f0 = constant 0.0: f32
|
|
// CHECK: %[[X:.*]] = vector.contract {indexing_maps = [#{{.*}}, #{{.*}}, #{{.*}}], iterator_types = ["reduction"]} %{{.*}}, %{{.*}}, %[[C0]] : vector<10xf32>, vector<10xf32> into f32
|
|
%0 = vector.contract #contraction_to_scalar_trait %arg0, %arg1, %f0
|
|
: vector<10xf32>, vector<10xf32> into f32
|
|
// CHECK: return %[[X]] : f32
|
|
return %0 : f32
|
|
}
|
|
|
|
#contraction_accesses0 = [
|
|
affine_map<(b0, f0, f1, c0, c1) -> (c0, b0, c1, f0)>,
|
|
affine_map<(b0, f0, f1, c0, c1) -> (b0, c1, c0, f1)>,
|
|
affine_map<(b0, f0, f1, c0, c1) -> (b0, f0, f1)>
|
|
]
|
|
#contraction_trait0 = {
|
|
indexing_maps = #contraction_accesses0,
|
|
iterator_types = ["parallel", "parallel", "parallel", "reduction", "reduction"]
|
|
}
|
|
#contraction_accesses1 = [ // 7, 8, 16, 15
|
|
affine_map<(f0, f1, f2, f3, c0, c1) -> (c0, f0, c1, f2)>,
|
|
// 8, 16, 7, 5
|
|
affine_map<(f0, f1, f2, f3, c0, c1) -> (f1, c1, c0, f3)>,
|
|
// 8, 8, 15, 5
|
|
affine_map<(f0, f1, f2, f3, c0, c1) -> (f0, f1, f2, f3)>
|
|
]
|
|
#contraction_trait1 = {
|
|
indexing_maps = #contraction_accesses1,
|
|
iterator_types = ["parallel", "parallel", "parallel", "parallel", "reduction",
|
|
"reduction"]
|
|
}
|
|
// CHECK-LABEL: @contraction
|
|
func @contraction(%arg0 : vector<7x8x16x15xf32>, %arg1 : vector<8x16x7x5xf32>,
|
|
%arg2 : vector<8x15x5xf32>, %arg3 : vector<8x8x15x5xf32>,
|
|
%arg4 : vector<7x8x16x15xf16>, %arg5 : vector<8x16x7x5xf16>) {
|
|
// Test contraction with batch and contracting dims.
|
|
// CHECK: vector.contract {indexing_maps = [#{{.*}}, #{{.*}}, #{{.*}}], iterator_types = ["parallel", "parallel", "parallel", "reduction", "reduction"]} {{.*}}, {{.*}}, {{.*}} : vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x15x5xf32>
|
|
%0 = vector.contract #contraction_trait0 %arg0, %arg1, %arg2
|
|
: vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x15x5xf32>
|
|
// Test contraction with only contracting dims. In this case the lhs/rhs
|
|
// dimension of size 8 will be considered a parallel dim for lhs/rhs and will
|
|
// appear twice in the output.
|
|
// CHECK: vector.contract {indexing_maps = [#{{.*}}, #{{.*}}, #{{.*}}], iterator_types = ["parallel", "parallel", "parallel", "parallel", "reduction", "reduction"]} {{.*}}, {{.*}}, {{.*}} : vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x8x15x5xf32>
|
|
%1 = vector.contract #contraction_trait1 %arg0, %arg1, %arg3
|
|
: vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x8x15x5xf32>
|
|
// Test contraction with optional vector mask arguments.
|
|
%lhs_mask = vector.constant_mask [7, 8, 16, 15] : vector<7x8x16x15xi1>
|
|
%rhs_mask = vector.constant_mask [8, 16, 7, 5] : vector<8x16x7x5xi1>
|
|
// CHECK: vector.contract {indexing_maps = [#{{.*}}, #{{.*}}, #{{.*}}], iterator_types = ["parallel", "parallel", "parallel", "parallel", "reduction", "reduction"]} {{.*}}, {{.*}}, {{.*}}, {{.*}}, {{.*}} : vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x8x15x5xf32>
|
|
%2 = vector.contract #contraction_trait1 %arg0, %arg1, %arg3, %lhs_mask,
|
|
%rhs_mask
|
|
: vector<7x8x16x15xf32>, vector<8x16x7x5xf32> into vector<8x8x15x5xf32>
|
|
// Test contraction with mixed type.
|
|
// CHECK: vector.contract {indexing_maps = [#{{.*}}, #{{.*}}, #{{.*}}], iterator_types = ["parallel", "parallel", "parallel", "parallel", "reduction", "reduction"]} {{.*}}, {{.*}}, {{.*}} : vector<7x8x16x15xf16>, vector<8x16x7x5xf16> into vector<8x8x15x5xf32>
|
|
%3 = vector.contract #contraction_trait1 %arg4, %arg5, %arg3
|
|
: vector<7x8x16x15xf16>, vector<8x16x7x5xf16> into vector<8x8x15x5xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @create_vector_mask
|
|
func @create_vector_mask() {
|
|
// CHECK: %[[C2:.*]] = constant 2 : index
|
|
%c2 = constant 2 : index
|
|
// CHECK-NEXT: %[[C3:.*]] = constant 3 : index
|
|
%c3 = constant 3 : index
|
|
// CHECK-NEXT: vector.create_mask %[[C3]], %[[C2]] : vector<4x3xi1>
|
|
%0 = vector.create_mask %c3, %c2 : vector<4x3xi1>
|
|
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @constant_vector_mask
|
|
func @constant_vector_mask() {
|
|
// CHECK: vector.constant_mask [3, 2] : vector<4x3xi1>
|
|
%0 = vector.constant_mask [3, 2] : vector<4x3xi1>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @extract_slices
|
|
func @extract_slices(%arg0 : vector<4x2xf32>)
|
|
-> (tuple<vector<2x2xf32>, vector<2x2xf32>>) {
|
|
// CHECK: vector.extract_slices %{{.*}}, [2, 2], [1, 1] : vector<4x2xf32> into tuple<vector<2x2xf32>, vector<2x2xf32>>
|
|
%0 = vector.extract_slices %arg0, [2, 2], [1, 1]
|
|
: vector<4x2xf32> into tuple<vector<2x2xf32>, vector<2x2xf32>>
|
|
%1 = vector.tuple_get %0, 0 : tuple<vector<2x2xf32>, vector<2x2xf32>>
|
|
%2 = vector.tuple_get %0, 1 : tuple<vector<2x2xf32>, vector<2x2xf32>>
|
|
%3 = vector.tuple %1, %2 : vector<2x2xf32>, vector<2x2xf32>
|
|
return %3 : tuple<vector<2x2xf32>, vector<2x2xf32>>
|
|
}
|
|
|
|
// CHECK-LABEL: @insert_slices
|
|
func @insert_slices(%arg0 : tuple<vector<2x2xf32>, vector<2x2xf32>>)
|
|
-> (vector<4x2xf32>) {
|
|
// CHECK: vector.insert_slices %{{.*}}, [2, 2], [1, 1] : tuple<vector<2x2xf32>, vector<2x2xf32>> into vector<4x2xf32>
|
|
%0 = vector.insert_slices %arg0, [2, 2], [1, 1]
|
|
: tuple<vector<2x2xf32>, vector<2x2xf32>> into vector<4x2xf32>
|
|
return %0 : vector<4x2xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @vector_print
|
|
func @vector_print(%arg0: vector<8x4xf32>) {
|
|
// CHECK: vector.print %{{.*}} : vector<8x4xf32>
|
|
vector.print %arg0 : vector<8x4xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @reshape
|
|
func @reshape(%arg0 : vector<3x2x4xf32>) -> (vector<2x3x4xf32>) {
|
|
// CHECK: %[[C2:.*]] = constant 2 : index
|
|
%c2 = constant 2 : index
|
|
// CHECK: %[[C3:.*]] = constant 3 : index
|
|
%c3 = constant 3 : index
|
|
// CHECK: %[[C6:.*]] = constant 6 : index
|
|
%c6 = constant 6 : index
|
|
// CHECK: %[[C9:.*]] = constant 9 : index
|
|
%c9 = constant 9 : index
|
|
// CHECK: vector.reshape %{{.*}}, [%[[C3]], %[[C6]]], [%[[C2]], %[[C9]]], [4] : vector<3x2x4xf32> to vector<2x3x4xf32>
|
|
%1 = vector.reshape %arg0, [%c3, %c6], [%c2, %c9], [4]
|
|
: vector<3x2x4xf32> to vector<2x3x4xf32>
|
|
|
|
return %1 : vector<2x3x4xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @shape_cast
|
|
func @shape_cast(%arg0 : vector<5x1x3x2xf32>,
|
|
%arg1 : tuple<vector<5x4x2xf32>, vector<3x4x2xf32>>,
|
|
%arg2 : vector<8x1xf32>,
|
|
%arg3 : vector<16x1x1xf32>)
|
|
-> (vector<15x2xf32>, tuple<vector<20x2xf32>, vector<12x2xf32>>, vector<8xf32>, vector<16xf32>, vector<16x1xf32>) {
|
|
|
|
// CHECK: vector.shape_cast %{{.*}} : vector<5x1x3x2xf32> to vector<15x2xf32>
|
|
%0 = vector.shape_cast %arg0 : vector<5x1x3x2xf32> to vector<15x2xf32>
|
|
|
|
// CHECK-NEXT: vector.shape_cast %{{.*}} : tuple<vector<5x4x2xf32>, vector<3x4x2xf32>> to tuple<vector<20x2xf32>, vector<12x2xf32>>
|
|
%1 = vector.shape_cast %arg1 : tuple<vector<5x4x2xf32>, vector<3x4x2xf32>> to
|
|
tuple<vector<20x2xf32>, vector<12x2xf32>>
|
|
|
|
// CHECK-NEXT: vector.shape_cast %{{.*}} : vector<8x1xf32> to vector<8xf32>
|
|
%2 = vector.shape_cast %arg2 : vector<8x1xf32> to vector<8xf32>
|
|
|
|
// CHECK-NEXT: vector.shape_cast %{{.*}} : vector<16x1x1xf32> to vector<16xf32>
|
|
%3 = vector.shape_cast %arg3 : vector<16x1x1xf32> to vector<16xf32>
|
|
|
|
// CHECK-NEXT: vector.shape_cast %{{.*}} : vector<16x1x1xf32> to vector<16x1xf32>
|
|
%4 = vector.shape_cast %arg3 : vector<16x1x1xf32> to vector<16x1xf32>
|
|
|
|
return %0, %1, %2, %3, %4 : vector<15x2xf32>, tuple<vector<20x2xf32>, vector<12x2xf32>>, vector<8xf32>, vector<16xf32>, vector<16x1xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @vector_fma
|
|
func @vector_fma(%a: vector<8xf32>, %b: vector<8x4xf32>) {
|
|
// CHECK: vector.fma %{{.*}} : vector<8xf32>
|
|
vector.fma %a, %a, %a : vector<8xf32>
|
|
// CHECK: vector.fma %{{.*}} : vector<8x4xf32>
|
|
vector.fma %b, %b, %b : vector<8x4xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @reduce_fp
|
|
func @reduce_fp(%arg0: vector<16xf32>, %arg1: f32) -> f32 {
|
|
// CHECK: vector.reduction "add", %{{.*}} : vector<16xf32> into f32
|
|
vector.reduction "add", %arg0 : vector<16xf32> into f32
|
|
// CHECK: vector.reduction "add", %{{.*}}, %{{.*}} : vector<16xf32> into f32
|
|
vector.reduction "add", %arg0, %arg1 : vector<16xf32> into f32
|
|
// CHECK: vector.reduction "mul", %{{.*}} : vector<16xf32> into f32
|
|
vector.reduction "mul", %arg0 : vector<16xf32> into f32
|
|
// CHECK: vector.reduction "mul", %{{.*}}, %{{.*}} : vector<16xf32> into f32
|
|
vector.reduction "mul", %arg0, %arg1 : vector<16xf32> into f32
|
|
// CHECK: vector.reduction "min", %{{.*}} : vector<16xf32> into f32
|
|
vector.reduction "min", %arg0 : vector<16xf32> into f32
|
|
// CHECK: %[[X:.*]] = vector.reduction "max", %{{.*}} : vector<16xf32> into f32
|
|
%0 = vector.reduction "max", %arg0 : vector<16xf32> into f32
|
|
// CHECK: return %[[X]] : f32
|
|
return %0 : f32
|
|
}
|
|
|
|
// CHECK-LABEL: @reduce_int
|
|
func @reduce_int(%arg0: vector<16xi32>) -> i32 {
|
|
// CHECK: vector.reduction "add", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "add", %arg0 : vector<16xi32> into i32
|
|
// CHECK: vector.reduction "mul", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "mul", %arg0 : vector<16xi32> into i32
|
|
// CHECK: vector.reduction "min", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "min", %arg0 : vector<16xi32> into i32
|
|
// CHECK: vector.reduction "max", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "max", %arg0 : vector<16xi32> into i32
|
|
// CHECK: vector.reduction "and", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "and", %arg0 : vector<16xi32> into i32
|
|
// CHECK: vector.reduction "or", %{{.*}} : vector<16xi32> into i32
|
|
vector.reduction "or", %arg0 : vector<16xi32> into i32
|
|
// CHECK: %[[X:.*]] = vector.reduction "xor", %{{.*}} : vector<16xi32> into i32
|
|
%0 = vector.reduction "xor", %arg0 : vector<16xi32> into i32
|
|
// CHECK: return %[[X]] : i32
|
|
return %0 : i32
|
|
}
|
|
|
|
// CHECK-LABEL: @transpose_fp
|
|
func @transpose_fp(%arg0: vector<3x7xf32>) -> vector<7x3xf32> {
|
|
// CHECK: %[[X:.*]] = vector.transpose %{{.*}}, [1, 0] : vector<3x7xf32> to vector<7x3xf32>
|
|
%0 = vector.transpose %arg0, [1, 0] : vector<3x7xf32> to vector<7x3xf32>
|
|
// CHECK: return %[[X]] : vector<7x3xf32>
|
|
return %0 : vector<7x3xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @transpose_int
|
|
func @transpose_int(%arg0: vector<11x7x3x2xi32>) -> vector<2x11x7x3xi32> {
|
|
// CHECK: %[[X:.*]] = vector.transpose %{{.*}}, [3, 0, 1, 2] : vector<11x7x3x2xi32> to vector<2x11x7x3xi32>
|
|
%0 = vector.transpose %arg0, [3, 0, 1, 2] : vector<11x7x3x2xi32> to vector<2x11x7x3xi32>
|
|
// CHECK: return %[[X]] : vector<2x11x7x3xi32>
|
|
return %0 : vector<2x11x7x3xi32>
|
|
}
|
|
|
|
// CHECK-LABEL: @flat_transpose_fp
|
|
func @flat_transpose_fp(%arg0: vector<16xf32>) -> vector<16xf32> {
|
|
// CHECK: %[[X:.*]] = vector.flat_transpose %{{.*}} {columns = 4 : i32, rows = 4 : i32} : vector<16xf32> -> vector<16xf32>
|
|
%0 = vector.flat_transpose %arg0 { rows = 4: i32, columns = 4: i32 } : vector<16xf32> -> vector<16xf32>
|
|
// CHECK: return %[[X]] : vector<16xf32>
|
|
return %0 : vector<16xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: @flat_transpose_int
|
|
func @flat_transpose_int(%arg0: vector<16xi32>) -> vector<16xi32> {
|
|
// CHECK: %[[X:.*]] = vector.flat_transpose %{{.*}} {columns = 8 : i32, rows = 2 : i32} : vector<16xi32> -> vector<16xi32>
|
|
%0 = vector.flat_transpose %arg0 { rows = 2: i32, columns = 8: i32 } : vector<16xi32> -> vector<16xi32>
|
|
// CHECK: return %[[X]] : vector<16xi32>
|
|
return %0 : vector<16xi32>
|
|
}
|
|
|
|
// CHECK-LABEL: @masked_load_and_store
|
|
func @masked_load_and_store(%base: memref<?xf32>, %mask: vector<16xi1>, %passthru: vector<16xf32>) {
|
|
// CHECK: %[[X:.*]] = vector.maskedload %{{.*}}, %{{.*}}, %{{.*}} : memref<?xf32>, vector<16xi1>, vector<16xf32> into vector<16xf32>
|
|
%0 = vector.maskedload %base, %mask, %passthru : memref<?xf32>, vector<16xi1>, vector<16xf32> into vector<16xf32>
|
|
// CHECK: vector.maskedstore %{{.*}}, %{{.*}}, %[[X]] : vector<16xi1>, vector<16xf32> into memref<?xf32>
|
|
vector.maskedstore %base, %mask, %0 : vector<16xi1>, vector<16xf32> into memref<?xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @gather_and_scatter
|
|
func @gather_and_scatter(%base: memref<?xf32>, %indices: vector<16xi32>, %mask: vector<16xi1>) {
|
|
// CHECK: %[[X:.*]] = vector.gather %{{.*}}, %{{.*}}, %{{.*}} : (memref<?xf32>, vector<16xi32>, vector<16xi1>) -> vector<16xf32>
|
|
%0 = vector.gather %base, %indices, %mask : (memref<?xf32>, vector<16xi32>, vector<16xi1>) -> vector<16xf32>
|
|
// CHECK: %[[Y:.*]] = vector.gather %{{.*}}, %{{.*}}, %{{.*}}, %[[X]] : (memref<?xf32>, vector<16xi32>, vector<16xi1>, vector<16xf32>) -> vector<16xf32>
|
|
%1 = vector.gather %base, %indices, %mask, %0 : (memref<?xf32>, vector<16xi32>, vector<16xi1>, vector<16xf32>) -> vector<16xf32>
|
|
// CHECK: vector.scatter %{{.*}}, %{{.*}}, %{{.*}}, %[[Y]] : vector<16xi32>, vector<16xi1>, vector<16xf32> into memref<?xf32>
|
|
vector.scatter %base, %indices, %mask, %1 : vector<16xi32>, vector<16xi1>, vector<16xf32> into memref<?xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: @expand_and_compress
|
|
func @expand_and_compress(%base: memref<?xf32>, %mask: vector<16xi1>, %passthru: vector<16xf32>) {
|
|
// CHECK: %[[X:.*]] = vector.expandload %{{.*}}, %{{.*}}, %{{.*}} : memref<?xf32>, vector<16xi1>, vector<16xf32> into vector<16xf32>
|
|
%0 = vector.expandload %base, %mask, %passthru : memref<?xf32>, vector<16xi1>, vector<16xf32> into vector<16xf32>
|
|
// CHECK: vector.compressstore %{{.*}}, %{{.*}}, %[[X]] : memref<?xf32>, vector<16xi1>, vector<16xf32>
|
|
vector.compressstore %base, %mask, %0 : memref<?xf32>, vector<16xi1>, vector<16xf32>
|
|
return
|
|
}
|