// RUN: mlir-opt %s -test-linalg-transform-patterns=test-patterns | FileCheck %s // CHECK-DAG: #[[$STRIDED_1D:.*]] = affine_map<(d0)[s0, s1] -> (d0 * s1 + s0)> // Map corresponding to a 2D memory access where the stride along the last dim is known to be 1. // CHECK-DAG: #[[$STRIDED_2D_u_1:.*]] = affine_map<(d0, d1)[s0, s1] -> (d0 * s1 + s0 + d1)> // Map corresponding to a 2D memory access where the stride along all dims are unknown. // CHECK-DAG: #[[$STRIDED_2D:.*]] = affine_map<(d0, d1)[s0, s1, s2] -> (d0 * s1 + s0 + d1 * s2)> // CHECK-DAG: #[[$kn:.*]] = affine_map<(d0, d1, d2) -> (d2, 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, %y: memref, %v: memref) { linalg.dot { __internal_linalg_transform__ = "MEM" } ins(%x, %y: memref, memref) outs(%v: memref) return } // CHECK-LABEL: func @dot // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c1:.*]] = constant 1 : index // CHECK-DAG: %[[c8000:.*]] = constant 8000 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c8000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c1]] { // CHECK: load // CHECK: load // CHECK: load // CHECK: mulf // CHECK: addf // CHECK: store func @matvec(%A: memref, %x: memref, %y: memref) { linalg.matvec ins(%A, %x: memref, memref) outs(%y: memref) return } // CHECK-LABEL: func @matvec // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c5:.*]] = constant 5 : index // CHECK-DAG: %[[c6:.*]] = constant 6 : index // CHECK: scf.parallel {{.*}} step (%[[c5]]) // CHECK: scf.for {{.*}} step %[[c6]] // CHECK: linalg.matvec // CHECK: ins({{.*}}, {{.*}}: memref, memref) // CHECK: outs({{.*}}: memref) func @matmul(%A: memref, %B: memref, %C: memref) { linalg.matmul { __internal_linalg_transform__ = "MEM" } ins(%A, %B: memref, memref) outs(%C: memref) return } // CHECK-LABEL: func @matmul // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c2:.*]] = constant 2 : index // CHECK-DAG: %[[c3:.*]] = constant 3 : index // CHECK-DAG: %[[c4:.*]] = constant 4 : index // CHECK-DAG: %[[c20:.*]] = constant 20 : index // CHECK-DAG: %[[c30:.*]] = constant 30 : index // CHECK-DAG: %[[c40:.*]] = constant 40 : index // CHECK-DAG: %[[c200:.*]] = constant 200 : index // CHECK-DAG: %[[c300:.*]] = constant 300 : index // CHECK-DAG: %[[c400:.*]] = constant 400 : index // CHECK-DAG: %[[c2000:.*]] = constant 2000 : index // CHECK-DAG: %[[c3000:.*]] = constant 3000 : index // CHECK-DAG: %[[c4000:.*]] = constant 4000 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c200]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c300]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c400]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c20]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c30]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c40]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4]] { // CHECK: linalg.matmul // CHECK: ins({{.*}}, {{.*}}: memref, memref) // CHECK: outs({{.*}}: memref) #matmul_accesses = [ 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, args_out = 1, indexing_maps = #matmul_accesses, library_call = "linalg_matmul", iterator_types = ["parallel", "parallel", "reduction"] } func @permute_generic(%A: memref, %B: memref, %C: memref) { linalg.generic #generic_matmul_trait ins(%A, %B : memref, memref) outs(%C : memref) { ^bb(%a: f32, %b: f32, %c: f32): %d = mulf %a, %b: f32 %e = addf %c, %d: f32 linalg.yield %e: f32 } return } // CHECK-LABEL: func @permute_generic // CHECK: linalg.generic { // CHECK-SAME: indexing_maps = [#[[$kn]], #[[$nm]], #[[$km]]], // CHECK-SAME: iterator_types = ["parallel", "reduction", "parallel"], // CHECK-SAME: library_call = "linalg_matmul"} // CHECK: memref, // CHECK-SAME: memref // CHECK-SAME: memref #indexed_matmul_trait = { args_in = 2, args_out = 1, indexing_maps = #matmul_accesses, library_call = "linalg_matmul_indexed", iterator_types = ["parallel", "parallel", "reduction"] } func @permute_generic_indexed( %A: memref, %B: memref, %C: memref) { linalg.indexed_generic #indexed_matmul_trait ins(%A, %B : memref, memref) outs(%C : memref) { ^bb(%i: index, %j: index, %k: index, %a: f32, %b: f32, %c: f32): %d = mulf %a, %b: f32 %e = addf %c, %d: f32 linalg.yield %e: f32 } return } // CHECK-LABEL: func @permute_generic_indexed // CHECK: linalg.indexed_generic { // CHECK-SAME: indexing_maps = [#[[$kn]], #[[$nm]], #[[$km]]], // CHECK-SAME: iterator_types = ["parallel", "reduction", "parallel"], // CHECK-SAME: library_call = "linalg_matmul_indexed"} // CHECK: memref, // CHECK-SAME: memref // CHECK-SAME: memref func @matvec_perm(%A: memref, %x: memref, %y: memref) { linalg.matvec {__internal_linalg_transform__ = "__with_perm__"} ins(%A, %x: memref, memref) outs(%y: memref) return } // CHECK-LABEL: func @matvec_perm // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c5:.*]] = constant 5 : index // CHECK-DAG: %[[c6:.*]] = constant 6 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c6]] // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c5]] // CHECK: linalg.matvec // CHECK: ins({{.*}}, {{.*}}: memref, memref) // CHECK: outs({{.*}}: memref) func @matmul_perm(%A: memref, %B: memref, %C: memref) { linalg.matmul {__internal_linalg_transform__ = "__with_perm__"} ins(%A, %B: memref, memref) outs(%C : memref) return } // CHECK-LABEL: func @matmul_perm // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c20:.*]] = constant 20 : index // CHECK-DAG: %[[c30:.*]] = constant 30 : index // CHECK-DAG: %[[c40:.*]] = constant 40 : index // CHECK-DAG: %[[c200:.*]] = constant 200 : index // CHECK-DAG: %[[c300:.*]] = constant 300 : index // CHECK-DAG: %[[c400:.*]] = constant 400 : index // CHECK-DAG: %[[c2000:.*]] = constant 2000 : index // CHECK-DAG: %[[c3000:.*]] = constant 3000 : index // CHECK-DAG: %[[c4000:.*]] = constant 4000 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c300]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c200]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c400]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c20]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c30]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c40]] { // CHECK: linalg.matmul // CHECK: ins({{.*}}, {{.*}}: memref, memref) // CHECK: outs({{.*}}: memref) func @promote_subview_matmul(%arg0: memref, %arg1: memref, %arg2: memref) { %c2000 = constant 2000 : index %c3000 = constant 3000 : index %c4000 = constant 4000 : index %c0 = constant 0 : index %c1 = constant 1 : index %0 = dim %arg0, %c0 : memref %1 = dim %arg0, %c1 : memref %2 = dim %arg1, %c1 : memref scf.for %arg3 = %c0 to %0 step %c2000 { scf.for %arg4 = %c0 to %2 step %c3000 { scf.for %arg5 = %c0 to %1 step %c4000 { %3 = subview %arg0[%arg3, %arg5][%c2000, %c4000][%c1, %c1] : memref to memref %4 = subview %arg1[%arg5, %arg4][%c4000, %c3000][%c1, %c1] : memref to memref %5 = subview %arg2[%arg3, %arg4][%c2000, %c3000][%c1, %c1] : memref to memref linalg.matmul {__internal_linalg_transform__ = "_promote_views_"} ins(%3, %4: memref, memref) outs(%5: memref) } } } return } // CHECK-LABEL: func @promote_subview_matmul // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c2000:.*]] = constant 2000 : index // CHECK-DAG: %[[c3000:.*]] = constant 3000 : index // CHECK-DAG: %[[c4000:.*]] = constant 4000 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4000]] { // CHECK: %[[s0:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[s1:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[s2:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[a0:.*]] = alloc({{%.*}}) : memref // CHECK: %[[v0:.*]] = std.view %[[a0]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[l0:.*]] = subview %[[v0]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[a1:.*]] = alloc({{%.*}}) : memref // CHECK: %[[v1:.*]] = std.view %[[a1]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[l1:.*]] = subview %[[v1]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[a2:.*]] = alloc({{%.*}}) : memref // CHECK: %[[v2:.*]] = std.view %[[a2]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[l2:.*]] = subview %[[v2]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: linalg.copy(%[[s0]], %[[l0]]) : memref, memref // CHECK: linalg.copy(%[[s1]], %[[l1]]) : memref, memref // CHECK: linalg.copy(%[[s2]], %[[l2]]) : memref, memref // CHECK: linalg.matmul // CHECK-SAME: ins(%[[v0]], %[[v1]] : memref, memref) // CHECK-SAME: outs(%[[v2]] : memref) func @promote_first_subview_matmul(%arg0: memref, %arg1: memref, %arg2: memref) { %c2000 = constant 2000 : index %c3000 = constant 3000 : index %c4000 = constant 4000 : index %c0 = constant 0 : index %c1 = constant 1 : index %0 = dim %arg0, %c0 : memref %1 = dim %arg0, %c1 : memref %2 = dim %arg1, %c1 : memref scf.for %arg3 = %c0 to %0 step %c2000 { scf.for %arg4 = %c0 to %2 step %c3000 { scf.for %arg5 = %c0 to %1 step %c4000 { %3 = std.subview %arg0[%arg3, %arg5][%c2000, %c4000][%c1, %c1] : memref to memref %4 = std.subview %arg1[%arg5, %arg4][%c4000, %c3000][%c1, %c1] : memref to memref %5 = std.subview %arg2[%arg3, %arg4][%c2000, %c3000][%c1, %c1] : memref to memref linalg.matmul {__internal_linalg_transform__ = "_promote_first_view_"} ins(%3, %4: memref, memref) outs(%5: memref) } } } return } // CHECK-LABEL: func @promote_first_subview_matmul // CHECK-DAG: %[[c0:.*]] = constant 0 : index // CHECK-DAG: %[[c2000:.*]] = constant 2000 : index // CHECK-DAG: %[[c3000:.*]] = constant 3000 : index // CHECK-DAG: %[[c4000:.*]] = constant 4000 : index // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c2000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c3000]] { // CHECK: scf.for {{.*}} = %[[c0]] to {{.*}} step %[[c4000]] { // CHECK: %[[s0:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[s1:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[s2:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[a0:.*]] = alloc({{%.*}}) : memref // CHECK: %[[v0:.*]] = std.view %[[a0]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[l0:.*]] = subview %[[v0]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK-NOT: %[[a1:.*]] = alloc({{%.*}}) : memref // CHECK-NOT: %[[v1:.*]] = std.view %[[a1]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK-NOT: %[[l0:.*]] = subview %[[v1]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK-NOT: %[[a2:.*]] = alloc({{%.*}}) : memref // CHECK-NOT: %[[v2:.*]] = std.view %[[a2]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK-NOT: %[[l0:.*]] = subview %[[v2]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: linalg.copy(%[[s0]], %[[l0]]) : memref, memref // CHECK-NOT: linalg.copy(%[[s1]], %[[l1]]) : memref, memref // CHECK-NOT: linalg.copy(%[[s2]], %[[l2]]) : memref, memref^ // CHECK: linalg.matmul // CHECK-SAME: ins(%[[v0]], %[[s1]] : memref, memref) // CHECK-SAME: outs(%[[s2]] : memref) func @aligned_promote_fill(%arg0: memref) { %c2000 = constant 2000 : index %c4000 = constant 4000 : index %c0 = constant 0 : index %c1 = constant 1 : index %cf = constant 1.0 : f32 %3 = std.subview %arg0[%c0, %c0][%c2000, %c4000][%c1, %c1] : memref to memref linalg.fill(%3, %cf) { __internal_linalg_transform__ = "_promote_views_aligned_"} : memref, f32 return } // CHECK-LABEL: func @aligned_promote_fill // CHECK: %[[cf:.*]] = constant {{.*}} : f32 // CHECK: %[[s0:.*]] = subview {{%.*}}[{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[a0:.*]] = alloc({{%.*}}) {alignment = 32 : i64} : memref // CHECK: %[[v0:.*]] = std.view %[[a0]][{{.*}}][{{%.*}}, {{%.*}}] : memref to memref // CHECK: %[[l0:.*]] = subview %[[v0]][{{%.*}}, {{%.*}}] [{{%.*}}, {{%.*}}] : memref to memref // CHECK: linalg.fill(%[[v0]], {{%.*}}) : memref, f32 // CHECK: linalg.copy(%[[s0]], %[[l0]]) : memref, memref // CHECK: linalg.fill(%[[v0]], %[[cf]]) : memref, f32 func @tile_permute_parallel_loop(%arg0: memref, %arg1: memref, %arg2: memref) { linalg.matmul {__internal_linalg_transform__ = "par__with_perm__"} ins(%arg0, %arg1: memref, memref) outs(%arg2: memref) return } // CHECK-LABEL: func @tile_permute_parallel_loop // CHECK-SAME: %[[ARG0:[a-zA-Z0-9_]+]]: memref // CHECK-SAME: %[[ARG1:[a-zA-Z0-9_]+]]: memref // CHECK-SAME: %[[ARG2:[a-zA-Z0-9_]+]]: memref // CHECK-DAG: %[[C16:.*]] = constant 16 : index // CHECK-DAG: %[[C8:.*]] = constant 8 : index // CHECK-DAG: %[[C4:.*]] = constant 4 : index // CHECK-DAG: %[[C0:.*]] = constant 0 : index // CHECK-DAG: %[[D0:.*]] = dim %[[ARG0]], %c0 // CHECK-DAG: %[[D1:.*]] = dim %[[ARG0]], %c1 // CHECK-DAG: %[[D2:.*]] = dim %[[ARG1]], %c1 // CHECK: scf.parallel (%{{.*}}) = (%[[C0]]) to (%[[D2]]) step (%[[C8]]) // CHECK: scf.for %{{.*}} = %[[C0]] to %[[D1]] step %[[C4]] // CHECK: scf.parallel (%{{.*}}) = (%[[C0]]) to (%[[D0]]) step (%[[C16]])