CodeQL / Analyze (actions) (push) Canceled after 0s
CodeQL / Analyze (python) (push) Canceled after 0s
pre-commit / pre-commit (push) Canceled after 0s
Multi-Arch CI / setup (push) Canceled after 0s
Publish build_manylinux_x86_64 images / publish_build_manylinux_x86_64 (push) Canceled after 0s
Setup (Multi-Arch) / setup (push) Canceled after 0s
Multi-Arch CI / Linux::${{ fromJSON(needs.setup.outputs.linux_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubi10 image / publish_no_rocm_image_ubi10 (push) Canceled after 0s
Multi-Arch CI / Windows::${{ fromJSON(needs.setup.outputs.windows_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Multi-Arch CI / Manifest Diff (push) Canceled after 0s
TheRock Manifest Diff Report / Generate Manifest Diff Report (push) Canceled after 0s
Multi-Arch CI / CI Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_ocl_rt images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_rocgdb images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Unit Tests / Unit Tests :: ubuntu-24.04 (push) Canceled after 0s
Unit Tests / Unit Tests :: windows-2022 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_media (push) Canceled after 0s
Unit Tests / Unit Tests Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_openmpi (push) Canceled after 0s
345 lines
11 KiB
MLIR
345 lines
11 KiB
MLIR
// RUN: mlir-opt %s -transform-interpreter -cse -split-input-file | FileCheck %s
|
|
|
|
!vecA = vector<1x1xf32>
|
|
!vecB = vector<1x64xf32>
|
|
!vecC = vector<1x64xf32>
|
|
#map = affine_map<(d0, d1, d2) -> (d0, d2)>
|
|
#map1 = affine_map<(d0, d1, d2) -> (d2, d1)>
|
|
#map2 = affine_map<(d0, d1, d2) -> (d0, d1)>
|
|
func.func @matmul_outer_product_to_fma(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @matmul_outer_product_to_fma
|
|
// CHECK: vector.broadcast{{.*}}vector<1xf32> to vector<64xf32>
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
// CHECK: vector.shape_cast{{.*}}vector<64xf32> to vector<1x64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<64x1xf32>
|
|
!vecB = vector<1x1xf32>
|
|
!vecC = vector<64x1xf32>
|
|
#map = affine_map<(d0, d1, d2) -> (d0, d2)>
|
|
#map1 = affine_map<(d0, d1, d2) -> (d2, d1)>
|
|
#map2 = affine_map<(d0, d1, d2) -> (d0, d1)>
|
|
func.func @matmul_outer_product_to_fma_bcst_B(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @matmul_outer_product_to_fma_bcst_B
|
|
// CHECK: vector.broadcast
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x1x1xf32>
|
|
!vecB = vector<1x1x64xf32>
|
|
!vecC = vector<1x1x64xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)>
|
|
func.func @batch_matmul_to_fma(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @batch_matmul_to_fma
|
|
// CHECK: vector.broadcast
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x64x1xf32>
|
|
!vecB = vector<1x1x1xf32>
|
|
!vecC = vector<1x64x1xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)>
|
|
func.func @batch_matmul_to_fma_bcst_B(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @batch_matmul_to_fma_bcst_B
|
|
// CHECK: vector.broadcast
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x1x1xf32>
|
|
!vecB = vector<1x1x64xf32>
|
|
!vecC = vector<1x64xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d1, d2)>
|
|
func.func @brgemm_to_fma(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["reduction", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @brgemm_to_fma
|
|
// CHECK: vector.broadcast
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x64x1xf32>
|
|
!vecB = vector<1x1x1xf32>
|
|
!vecC = vector<64x1xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d1, d2)>
|
|
func.func @brgemm_to_fma_bcst_B(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["reduction", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @brgemm_to_fma_bcst_B
|
|
// CHECK: vector.broadcast
|
|
// CHECK: vector.fma{{.*}}vector<64xf32>
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<3x1x1xf32>
|
|
!vecB = vector<3x1x64xf32>
|
|
!vecC = vector<3x1x64xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)>
|
|
func.func @negative_non_unit_batch_dim(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// Batch dimension should've been simplified earlier.
|
|
|
|
// CHECK-LABEL: @negative_non_unit_batch_dim
|
|
// CHECK-NOT: vector.fma
|
|
// CHECK: vector.contract
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<3x1x1xf32>
|
|
!vecB = vector<3x1x64xf32>
|
|
!vecC = vector<1x64xf32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d1, d2)>
|
|
func.func @negative_non_unit_batch_reduce_dim(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["reduction", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// Batch-reduce dimension should've been simplified earlier.
|
|
|
|
// CHECK-LABEL: @negative_non_unit_batch_reduce_dim
|
|
// CHECK-NOT: vector.fma
|
|
// CHECK: vector.contract
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x1xf32>
|
|
!vecB = vector<1x64xf32>
|
|
!vecC = vector<1x64xf32>
|
|
#map = affine_map<(d0, d1, d2) -> (d0, d2)>
|
|
#map1 = affine_map<(d0, d1, d2) -> (d2, d1)>
|
|
#map2 = affine_map<(d0, d1, d2) -> (d0, d1)>
|
|
func.func @negative_invalid_kind(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<mul>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @negative_invalid_kind
|
|
// CHECK-NOT: vector.fma
|
|
// CHECK: vector.contract
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
// -----
|
|
|
|
!vecA = vector<1x1x1xf32>
|
|
!vecB = vector<1x1x64xf32>
|
|
!vecC = vector<1x1x64xi32>
|
|
#map = affine_map<(d0, d1, d2, d3) -> (d0, d1, d3)>
|
|
#map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)>
|
|
#map2 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2)>
|
|
func.func @negative_accumulator_type(
|
|
%arg0: !vecA, %arg1: !vecB, %arg2: !vecC) -> !vecC
|
|
{
|
|
%0 = vector.contract {
|
|
indexing_maps = [#map, #map1, #map2],
|
|
iterator_types = ["parallel", "parallel", "parallel", "reduction"],
|
|
kind = #vector.kind<add>}
|
|
%arg0, %arg1, %arg2
|
|
: !vecA, !vecB into !vecC
|
|
return %0 : !vecC
|
|
}
|
|
|
|
// CHECK-LABEL: @negative_accumulator_type
|
|
// CHECK-NOT: vector.fma
|
|
// CHECK: vector.contract
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.any_op
|
|
transform.apply_patterns to %func {
|
|
transform.apply_patterns.x86.vector_contract_to_fma
|
|
} : !transform.any_op
|
|
transform.yield
|
|
}
|
|
}
|