diff options
Diffstat (limited to 'mlir/test/Dialect/Linalg/transform-patterns.mlir')
| -rw-r--r-- | mlir/test/Dialect/Linalg/transform-patterns.mlir | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/mlir/test/Dialect/Linalg/transform-patterns.mlir b/mlir/test/Dialect/Linalg/transform-patterns.mlir index 8a08bf850ff..7a57a4ae2a1 100644 --- a/mlir/test/Dialect/Linalg/transform-patterns.mlir +++ b/mlir/test/Dialect/Linalg/transform-patterns.mlir @@ -1,12 +1,12 @@ // RUN: mlir-opt %s -test-linalg-transform-patterns | FileCheck %s -// CHECK-DAG: #[[STRIDED_1D:.*]] = (d0)[s0] -> (d0 + s0) -// CHECK-DAG: #[[STRIDED_2D:.*]] = (d0, d1)[s0, s1] -> (d0 * s1 + s0 + d1) -// CHECK-DAG: #[[mk:.*]] = (d0, d1, d2) -> (d0, d2) -// CHECK-DAG: #[[kn:.*]] = (d0, d1, d2) -> (d2, d1) -// CHECK-DAG: #[[mn:.*]] = (d0, d1, d2) -> (d0, d1) -// CHECK-DAG: #[[nm:.*]] = (d0, d1, d2) -> (d1, d0) -// CHECK-DAG: #[[km:.*]] = (d0, d1, d2) -> (d2, d0) +// CHECK-DAG: #[[STRIDED_1D:.*]] = affine_map<(d0)[s0] -> (d0 + s0)> +// CHECK-DAG: #[[STRIDED_2D:.*]] = affine_map<(d0, d1)[s0, s1] -> (d0 * s1 + s0 + d1)> +// CHECK-DAG: #[[mk:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)> +// CHECK-DAG: #[[kn:.*]] = affine_map<(d0, d1, d2) -> (d2, d1)> +// CHECK-DAG: #[[mn:.*]] = affine_map<(d0, d1, d2) -> (d0, d1)> +// CHECK-DAG: #[[nm:.*]] = affine_map<(d0, d1, d2) -> (d1, d0)> +// CHECK-DAG: #[[km:.*]] = affine_map<(d0, d1, d2) -> (d2, d0)> func @dot(%x: memref<?xf32, offset: ?, strides: [1]>, %y: memref<?xf32, offset: ?, strides: [1]>, @@ -86,8 +86,8 @@ func @matmul(%A: memref<?x?xf32, offset: ?, strides: [?, 1]>, args_in = 1, args_out = 1, indexing_maps = [ - (i, j) -> (i, j), - (i, j) -> (i, j) + affine_map<(i, j) -> (i, j)>, + affine_map<(i, j) -> (i, j)> ], iterator_types = ["parallel", "parallel"] } @@ -168,9 +168,9 @@ func @fusion_test(%A: memref<?x?xf32, offset: ?, strides: [?, 1]>, args_in = 2, args_out = 1, indexing_maps = [ - (m, n, k) -> (m, k), - (m, n, k) -> (k, n), - (m, n, k) -> (m, n) + affine_map<(m, n, k) -> (m, k)>, + affine_map<(m, n, k) -> (k, n)>, + affine_map<(m, n, k) -> (m, n)> ], iterator_types = ["parallel", "parallel", "reduction"], __internal_linalg_transform__ = "_marked_matmul_" @@ -201,9 +201,9 @@ func @fma(%a: f32, %b: f32, %c: f32) -> f32 { return %e: f32 } #matmul_accesses = [ - (m, n, k) -> (m, k), - (m, n, k) -> (k, n), - (m, n, k) -> (m, n) + affine_map<(m, n, k) -> (m, k)>, + affine_map<(m, n, k) -> (k, n)>, + affine_map<(m, n, k) -> (m, n)> ] #generic_matmul_trait = { args_in = 2, |
