This patch removes the `test-linalg-to-vector-patterns` option from the `-test-linalg-transform-patterns=` test flag. It was only used in one test, where a more specialized transform dialect op can be used instead: * `transform.apply_patterns.linalg.pad_vectorization` While we could preserve `test-linalg-to-vector-patterns`, it's better to rely on finer-grained transformations — this way, we know exactly what is being run and tested. Now that its only use has been removed, it feels natural to delete `test-linalg-to-vector-patterns`.
49 lines
2.1 KiB
MLIR
49 lines
2.1 KiB
MLIR
// RUN: mlir-opt %s -transform-interpreter -test-transform-dialect-erase-schedule \
|
|
// RUN: -one-shot-bufferize="bufferize-function-boundaries" \
|
|
// RUN: -buffer-deallocation-pipeline -convert-bufferization-to-memref \
|
|
// RUN: -convert-linalg-to-loops -convert-scf-to-cf -expand-strided-metadata \
|
|
// RUN: -lower-affine -convert-arith-to-llvm -finalize-memref-to-llvm -convert-func-to-llvm -convert-cf-to-llvm -reconcile-unrealized-casts | \
|
|
// RUN: mlir-runner -e main -entry-point-result=void \
|
|
// RUN: -shared-libs=%mlir_c_runner_utils,%mlir_runner_utils \
|
|
// RUN: | FileCheck %s
|
|
|
|
// TODO: Use TD for vectorization and remove `test-linalg-to-vector-patterns`
|
|
// that's otherwise not required.
|
|
|
|
|
|
func.func @main() {
|
|
%const = arith.constant dense<[[[1.0, 2.0, 3.0], [2.0, 3.0, 4.0]]]> : tensor<1x2x3xf32>
|
|
%dynamic = tensor.cast %const: tensor<1x2x3xf32> to tensor<1x?x3xf32>
|
|
%offset = arith.constant 2 : index
|
|
%cst = arith.constant 2.3 : f32
|
|
%c0 = arith.constant 0 : index
|
|
%out = tensor.pad %dynamic low[%c0, %offset, %c0] high[%c0, %c0, %offset] {
|
|
^bb0(%gen_arg1: index, %gen_arg2: index, %gen_arg3: index):
|
|
tensor.yield %cst : f32
|
|
} : tensor<1x?x3xf32> to tensor<1x?x?xf32>
|
|
%unranked = tensor.cast %out: tensor<1x?x?xf32> to tensor<*xf32>
|
|
call @printMemrefF32(%unranked) : (tensor<*xf32>) -> ()
|
|
|
|
// CHECK: Unranked Memref base@ = {{0x[-9a-f]*}}
|
|
// CHECK-SAME: rank = 3 offset = 0 sizes = [1, 4, 5] strides = [20, 5, 1] data =
|
|
// CHECK-NEXT{LITERAL}: [[[2.3, 2.3, 2.3, 2.3, 2.3],
|
|
// CHECK-NEXT: [2.3, 2.3, 2.3, 2.3, 2.3],
|
|
// CHECK-NEXT: [1, 2, 3, 2.3, 2.3],
|
|
// CHECK-NEXT: [2, 3, 4, 2.3, 2.3]]]
|
|
|
|
return
|
|
}
|
|
|
|
module attributes {transform.with_named_sequence} {
|
|
transform.named_sequence @__transform_main(%arg1: !transform.any_op {transform.readonly}) {
|
|
%func_op = transform.structured.match ops{["func.func"]} in %arg1 : (!transform.any_op) -> !transform.op<"func.func">
|
|
|
|
transform.apply_patterns to %func_op {
|
|
transform.apply_patterns.linalg.pad_vectorization
|
|
} : !transform.op<"func.func">
|
|
transform.yield
|
|
}
|
|
}
|
|
|
|
func.func private @printMemrefF32(%ptr : tensor<*xf32>)
|