Skip to content

Commit d62f395

Browse files
Put back CHECK-LABELs
1 parent 0b00056 commit d62f395

File tree

2 files changed

+30
-30
lines changed

2 files changed

+30
-30
lines changed

mlir/test/Dialect/Linalg/tile-to-forall.mlir

Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -179,27 +179,27 @@ module attributes {transform.with_named_sequence} {
179179

180180
// -----
181181

182-
// CHECK-DAG: #[[MAP0:.+]] = affine_map<()[s0] -> (s0 ceildiv 10)>
183-
// CHECK-DAG: #[[MAP1:.+]] = affine_map<()[s0] -> (s0 ceildiv 20)>
184-
// CHECK-DAG: #[[MAP2:.+]] = affine_map<(d0)[s0] -> (d0 * -10 + s0, 10)>
185-
// CHECK-DAG: #[[MAP3:.+]] = affine_map<(d0)[s0] -> (d0 * -20 + s0, 20)>
186-
// CHECK-DAG: #[[MAP4:.+]] = affine_map<(d0) -> (d0 * 10)>
187-
// CHECK-DAG: #[[MAP5:.+]] = affine_map<(d0) -> (d0 * 20)>
188-
189-
// CHECK: matmul_tile_size_dynamic(
182+
// CHECK-DAG: #[[$map0:.+]] = affine_map<()[s0] -> (s0 ceildiv 10)>
183+
// CHECK-DAG: #[[$map1:.+]] = affine_map<()[s0] -> (s0 ceildiv 20)>
184+
// CHECK-DAG: #[[$map2:.+]] = affine_map<(d0)[s0] -> (d0 * -10 + s0, 10)>
185+
// CHECK-DAG: #[[$map4:.+]] = affine_map<(d0)[s0] -> (d0 * -20 + s0, 20)>
186+
// CHECK-DAG: #[[$map5:.+]] = affine_map<(d0) -> (d0 * 10)>
187+
// CHECK-DAG: #[[$map6:.+]] = affine_map<(d0) -> (d0 * 20)>
188+
189+
// CHECK-LABEL: matmul_tile_size_dynamic(
190190
// CHECK-SAME: %[[A:[0-9a-z]+]]: tensor<?x?xf32>
191191
// CHECK-SAME: %[[B:[0-9a-z]+]]: tensor<?x?xf32>
192192
// CHECK-SAME: %[[C:[0-9a-z]+]]: tensor<?x?xf32>
193193
func.func @matmul_tile_size_dynamic(%A: tensor<?x?xf32>, %B: tensor<?x?xf32>, %C: tensor<?x?xf32>) -> tensor<?x?xf32> {
194194
// CHECK: %[[M:.+]] = tensor.dim %[[A]], %c0 :
195195
// CHECK: %[[N:.+]] = tensor.dim %[[B]], %c1 :
196-
// CHECK: %[[NT0:.+]] = affine.apply #[[MAP0]]()[%[[M]]]
197-
// CHECK: %[[NT1:.+]] = affine.apply #[[MAP1]]()[%[[N]]]
196+
// CHECK: %[[NT0:.+]] = affine.apply #[[$map0]]()[%[[M]]]
197+
// CHECK: %[[NT1:.+]] = affine.apply #[[$map1]]()[%[[N]]]
198198
// CHECK: scf.forall (%[[IV0:.+]], %[[IV1:.+]]) in (%[[NT0]], %[[NT1]]) shared_outs(%[[C_BLK:.*]] = %[[C]])
199-
// CHECK: %[[TS0:.+]] = affine.min #[[MAP2]](%[[IV0]])[%[[M]]]
200-
// CHECK: %[[TS1:.+]] = affine.min #[[MAP3]](%[[IV1]])[%[[N]]]
201-
// CHECK: %[[LB0:.+]] = affine.apply #[[MAP4]](%[[IV0]])
202-
// CHECK: %[[LB1:.+]] = affine.apply #[[MAP5]](%[[IV1]])
199+
// CHECK: %[[TS0:.+]] = affine.min #[[$map2]](%[[IV0]])[%[[M]]]
200+
// CHECK: %[[TS1:.+]] = affine.min #[[$map4]](%[[IV1]])[%[[N]]]
201+
// CHECK: %[[LB0:.+]] = affine.apply #[[$map5]](%[[IV0]])
202+
// CHECK: %[[LB1:.+]] = affine.apply #[[$map6]](%[[IV1]])
203203
// CHECK: tensor.extract_slice %[[A]]
204204
// CHECK: tensor.extract_slice %[[B]]
205205
// CHECK: tensor.extract_slice %[[C_BLK]]
@@ -223,21 +223,21 @@ module attributes {transform.with_named_sequence} {
223223

224224
// Tests that dimension 0 can eliminate affine.min/max, dimension 1 cannot.
225225

226-
// CHECK-DAG: #[[MAP0:.+]] = affine_map<(d0) -> (d0 * -21 + 300, 21)>
227-
// CHECK-DAG: #[[MAP1:.+]] = affine_map<(d0) -> (d0 * 10)>
228-
// CHECK-DAG: #[[MAP2:.+]] = affine_map<(d0) -> (d0 * 21)>
226+
// CHECK-DAG: #[[$map0:.+]] = affine_map<(d0) -> (d0 * -21 + 300, 21)>
227+
// CHECK-DAG: #[[$map2:.+]] = affine_map<(d0) -> (d0 * 10)>
228+
// CHECK-DAG: #[[$map3:.+]] = affine_map<(d0) -> (d0 * 21)>
229229

230-
// CHECK: matmul_tile_size_static(
230+
// CHECK-LABEL: matmul_tile_size_static(
231231
// CHECK-SAME: %[[A:[0-9a-z]+]]: tensor
232232
// CHECK-SAME: %[[B:[0-9a-z]+]]: tensor
233233
// CHECK-SAME: %[[C:[0-9a-z]+]]: tensor
234234
func.func @matmul_tile_size_static(%A: tensor<100x200xf32>, %B: tensor<200x300xf32>, %C: tensor<100x300xf32>) -> tensor<100x300xf32> {
235235
// CHECK: scf.forall (%[[IV0:.+]], %[[IV1:.+]]) in (10, 15) shared_outs(%[[C_BLK:.*]] = %[[C]])
236-
// CHECK: %[[TS:.+]] = affine.min #[[MAP0]](%[[IV1]])
236+
// CHECK: %[[TS:.+]] = affine.min #[[$map0]](%[[IV1]])
237237
// CHECK-NOT: affine.max
238238
// CHECK-NOT: affine.min
239-
// CHECK: %[[LB0:.+]] = affine.apply #[[MAP1]](%[[IV0]])
240-
// CHECK: %[[LB1:.+]] = affine.apply #[[MAP2]](%[[IV1]])
239+
// CHECK: %[[LB0:.+]] = affine.apply #[[$map2]](%[[IV0]])
240+
// CHECK: %[[LB1:.+]] = affine.apply #[[$map3]](%[[IV1]])
241241
// CHECK: %[[tA:.+]] = tensor.extract_slice %[[A]][%[[LB0]], 0] [10, 200] [1, 1] :
242242
// CHECK: %[[tB:.+]] = tensor.extract_slice %[[B]][0, %[[LB1]]] [200, %[[TS]]] [1, 1] :
243243
// CHECK: %[[tC:.+]] = tensor.extract_slice %[[C_BLK]][%[[LB0]], %[[LB1]]] [10, %[[TS]]] [1, 1] :

mlir/test/Interfaces/TilingInterface/tile-using-interface.mlir

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -259,15 +259,15 @@ module attributes {transform.with_named_sequence} {
259259
transform.yield
260260
}
261261
}
262-
// CHECK: #[[MAP_ADD:.+]] = affine_map<(d0, d1) -> (d0 + d1)>
263-
// CHECK: @indexed_semantics
264-
// CHECK: scf.for %[[I0:.+]] = %{{.*}} to %{{.*}} step %{{.*}}
265-
// CHECK: scf.for %[[I1:.+]] = %{{.*}} to %{{.*}} step %{{.*}}
266-
// CHECK: %[[INDEX0:.+]] = linalg.index 0
267-
// CHECK: %[[INDEX0_AMENDED:.+]] = affine.apply #[[MAP_ADD]](%[[INDEX0]], %[[I0]])
268-
// CHECK: %[[INDEX1:.+]] = linalg.index 1
269-
// CHECK: %[[INDEX1_AMENDED:.+]] = affine.apply #[[MAP_ADD]](%[[INDEX1]], %[[I1]])
270-
// CHECK: arith.addi %[[INDEX0_AMENDED]], %[[INDEX1_AMENDED]]
262+
// CHECK: #[[$MAP_ADD:.+]] = affine_map<(d0, d1) -> (d0 + d1)>
263+
// CHECK-LABEL: @indexed_semantics
264+
// CHECK: scf.for %[[I0:.+]] = %{{.*}} to %{{.*}} step %{{.*}}
265+
// CHECK: scf.for %[[I1:.+]] = %{{.*}} to %{{.*}} step %{{.*}}
266+
// CHECK: %[[INDEX0:.+]] = linalg.index 0
267+
// CHECK: %[[INDEX0_AMENDED:.+]] = affine.apply #[[$MAP_ADD]](%[[INDEX0]], %[[I0]])
268+
// CHECK: %[[INDEX1:.+]] = linalg.index 1
269+
// CHECK: %[[INDEX1_AMENDED:.+]] = affine.apply #[[$MAP_ADD]](%[[INDEX1]], %[[I1]])
270+
// CHECK: arith.addi %[[INDEX0_AMENDED]], %[[INDEX1_AMENDED]]
271271

272272
// -----
273273

0 commit comments

Comments
 (0)