Home
last modified time | relevance | path

Searched refs:map0 (Results 1 – 25 of 89) sorted by relevance

1234

/llvm-project-15.0.7/mlir/lib/Dialect/Utils/
H A DStructuredOpsUtils.cpp19 auto map0 = indexingMaps[0].cast<AffineMapAttr>().getValue(); in isRowMajorMatmul() local
23 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isRowMajorMatmul()
24 map2.getNumResults() != 2 || map0.getNumInputs() != 3 || in isRowMajorMatmul()
32 AffineExpr k = map0.getResult(1); in isRowMajorMatmul()
45 auto map0 = indexingMaps[0].cast<AffineMapAttr>().getValue(); in isColumnMajorMatmul() local
49 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isColumnMajorMatmul()
50 map2.getNumResults() != 2 || map0.getNumInputs() != 3 || in isColumnMajorMatmul()
58 AffineExpr k = map0.getResult(0); in isColumnMajorMatmul()
71 auto map0 = indexingMaps[0].cast<AffineMapAttr>().getValue(); in isRowMajorBatchMatmul() local
76 map2.getNumResults() != 3 || map0.getNumInputs() != 4 || in isRowMajorBatchMatmul()
[all …]
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dnormalize-memrefs-ops.mlir12 #map0 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2 floordiv 32, d3 floordiv 64, d2 mod 32, d3 mod 6…
18 func.func @test_norm(%arg0 : memref<1x16x14x14xf32, #map0>) -> () {
19 %0 = memref.alloc() : memref<1x16x14x14xf32, #map0>
20 "test.op_norm"(%arg0, %0) : (memref<1x16x14x14xf32, #map0>, memref<1x16x14x14xf32, #map0>) -> ()
21 memref.dealloc %0 : memref<1x16x14x14xf32, #map0>
33 func.func @test_nonnorm(%arg0 : memref<1x16x14x14xf32, #map0>) -> () {
34 %0 = memref.alloc() : memref<1x16x14x14xf32, #map0>
35 …"test.op_nonnorm"(%arg0, %0) : (memref<1x16x14x14xf32, #map0>, memref<1x16x14x14xf32, #map0>) -> ()
36 memref.dealloc %0 : memref<1x16x14x14xf32, #map0>
49 %0 = memref.alloc() : memref<1x16x14x14xf32, #map0>
[all …]
H A Dcompose-subview.mlir4 #map0 = affine_map<(d0, d1) -> (d0 * 1024 + d1 + 2304)>
10 …%0 = memref.subview %input[2, 256] [2, 256] [1, 1] : memref<4x1024xf32> to memref<2x256xf32, #map0>
11 …%1 = memref.subview %0[1, 128] [1, 128] [1, 1] : memref<2x256xf32, #map0> to memref<1x128xf32, #ma…
18 #map0 = affine_map<(d0, d1) -> (d0 * 1024 + d1 + 1536)>
25 …%0 = memref.subview %input[1, 512] [3, 256] [1, 1] : memref<4x1024xf32> to memref<3x256xf32, #map0>
26 …%1 = memref.subview %0[1, 128] [2, 128] [1, 1] : memref<3x256xf32, #map0> to memref<2x128xf32, #ma…
/llvm-project-15.0.7/mlir/test/Dialect/Vector/
H A Dvector-reduce-to-contract.mlir8 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map0]], #[[$map1]]],
26 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map0]], #[[$map1]]],
39 #map0 = affine_map<(d0, d1, d2) -> (d0, d1, d2)>
57 %1 = vector.contract {indexing_maps = [#map0, #map0, #map1],
83 %1 = vector.contract {indexing_maps = [#map0, #map0, #map1],
112 indexing_maps = [#map0, #map1, #map2],
158 #map0 = affine_map<(d0, d1, d2) -> (d0, d1)>
190 #map0 = affine_map<(d0, d1, d2) -> (d0, d2)>
209 indexing_maps = [#map0, #map1, #map2],
225 #map0 = affine_map<(d0, d1) -> (d1)>
[all …]
H A Dvector-transfer-flatten.mlir65 #map0 = affine_map<(d0, d1, d2, d3)[s0, s1] -> (d0 * s1 + s0 + d1 * 32 + d2 * 4 + d3)>
67 func.func @transfer_read_flattenable_with_dynamic_dims_and_indices(%arg0 : memref<?x?x8x4xi8, #map0…
70 …g1, %arg2, %c0, %c0], %c0_i8 {in_bounds = [true, true]} : memref<?x?x8x4xi8, #map0>, vector<8x4xi8>
89 #map0 = affine_map<(d0, d1, d2, d3)[s0, s1] -> (d0 * s1 + s0 + d1 * 32 + d2 * 4 + d3)>
91 …ynamic_dims_and_indices(%vec : vector<8x4xi8>, %dst : memref<?x?x8x4xi8, #map0>, %arg1 : index, %a…
93 …%dst[%arg1, %arg2, %c0, %c0] {in_bounds = [true, true]} : vector<8x4xi8>, memref<?x?x8x4xi8, #map0>
H A Dvector-transforms.mlir85 // CHECK-NEXT: %[[R1S00:.*]] = vector.contract {indexing_maps = [#map0, #map1, #map2], iterator_typ…
92 // CHECK-NEXT: %[[R2S00:.*]] = vector.contract {indexing_maps = [#map0, #map1, #map2], iterator_typ…
199 // CHECK-NEXT: %[[R1S00:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_typ…
263 // CHECK-NEXT: %[[R0:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
264 // CHECK-NEXT: %[[R1:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
265 // CHECK-NEXT: %[[R2:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
266 // CHECK-NEXT: %[[R3:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
392 // CHECK-NEXT: %[[R0:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
393 // CHECK-NEXT: %[[R1:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
394 // CHECK-NEXT: %[[R2:.*]] = vector.contract {indexing_maps = [#map2, #map3, #map0], iterator_types …
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dfusion-elementwise-ops.mlir14 …%3 = linalg.generic {indexing_maps = [#map0, #map0, #map0], iterator_types = ["parallel", "paralle…
23 …%4 = linalg.generic {indexing_maps = [#map0, #map0, #map0], iterator_types = ["parallel", "paralle…
107 …%4 = linalg.generic {indexing_maps = [#map0, #map0, #map0], iterator_types = ["parallel", "paralle…
196 %1 = linalg.generic {indexing_maps = [#map0, #map0, #map0], iterator_types = []}
206 %2 = linalg.generic {indexing_maps = [#map0, #map0, #map0], iterator_types = []}
291 indexing_maps = [#map0, #map0, #map0],
300 indexing_maps = [#map0, #map0],
342 indexing_maps = [#map0, #map0],
356 indexing_maps = [#map0, #map0, #map0],
396 indexing_maps = [#map0, #map0],
[all …]
H A Dfusion-elementwise-options.mlir3 #map0 = affine_map<(d0, d1) -> (d0, d1)>
5 indexing_maps = [#map0, #map0, #map0],
9 indexing_maps = [#map0, #map0, #map0, #map0],
H A Ddetensorize_if.mlir3 #map0 = affine_map<() -> ()>
6 indexing_maps = [#map0, #map0, #map0],
64 #map0 = affine_map<() -> ()>
67 indexing_maps = [#map0, #map0, #map0],
127 #map0 = affine_map<() -> ()>
130 indexing_maps = [#map0, #map0, #map0],
H A Dfold-unit-trip-loops.mlir33 #map0 = affine_map<(i, j) -> (i, j)>
34 #access = [#map0, #map0]
59 #map0 = affine_map<(i, j) -> (i, j)>
60 #access = [#map0, #map0]
H A Dstandard.mlir3 // CHECK-DAG: #[[$map0:.*]] = affine_map<(d0)[s0] -> (d0 + s0)>
16 // CHECK-SAME: %[[arg0:[a-zA-z0-9]*]]: memref<?xf32, #[[$map0]]>,
17 // CHECK-SAME: %[[arg1:[a-zA-z0-9]*]]: memref<?xf32, #[[$map0]]>,
20 // CHECK-SAME: memref<?xf32, #[[$map0]]> to memref<?xf32, #[[$map6]]>
22 // CHECK-SAME: memref<?xf32, #[[$map0]]> to memref<?xf32, #[[$map6]]>
H A Ddetensorize_trivial.mlir5 #map0 = affine_map<() -> ()>
8 indexing_maps = [#map0, #map0, #map0],
H A Dcanonicalize-duplicate-inputs.mlir29 #map0 = affine_map<(d0, d1) -> (d0, d1)>
37 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle…
52 #map0 = affine_map<(d0, d1) -> (d0, d1)>
62 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0, #map0], iterator_types = ["parallel", "…
98 #map0 = affine_map<(d0, d1, d2) -> (d0, d1, d2)>
105 indexing_maps = [#map0, #map1, #map2, #map3, #map4],
131 #map0 = affine_map<(d0) -> (d0)>
137 indexing_maps = [#map0, #map1, #map1],
214 #map0 = affine_map<(d0, d1) -> (d0, d1)>
221 indexing_maps = [#map3, #map0, #map0, #map2, #map1, #map1, #map2],
H A Ddetensorize_while_pure_cf.mlir3 #map0 = affine_map<() -> ()>
6 indexing_maps = [#map0, #map0, #map0],
H A Dbufferize.mlir3 #map0 = affine_map<(d0) -> (d0)>
28 indexing_maps = [#map0, #map0],
42 #map0 = affine_map<(d0) -> (d0)>
57 indexing_maps = [#map0, #map0],
71 #map0 = affine_map<(d0) -> (d0)>
82 indexing_maps = [#map0, #map0, #map0],
H A Dfuse-with-reshape-by-collapsing.mlir16 indexing_maps = [#map0, #map1, #map2, #map3],
67 indexing_maps = [#map0, #map1, #map2, #map3],
129 indexing_maps = [#map0, #map1, #map2, #map3],
230 indexing_maps = [#map0, #map1],
259 indexing_maps = [#map0, #map1, #map0],
286 indexing_maps = [#map0, #map1, #map2],
313 indexing_maps = [#map0, #map1, #map2],
342 indexing_maps = [#map0, #map1, #map2],
410 indexing_maps = [#map0, #map1, #map1],
449 indexing_maps = [#map0, #map1],
[all …]
H A Dfill-interface-invalid.mlir13 #map0 = affine_map<(d0) -> ()>
19 indexing_maps = [#map0, #map0, #map1],
H A Ddetensorize_while.mlir4 #map0 = affine_map<() -> ()>
7 indexing_maps = [#map0, #map0, #map0],
H A Dreshape_fusion.mlir3 #map0 = affine_map<(d0, d1, d2) -> (d2, d0, d1)>
14 indexing_maps = [#map0, #map1, #map2, #map1],
49 #map0 = affine_map<(d0, d1) -> (d0, d1)>
57 indexing_maps = [#map0, #map0, #map1, #map0],
138 #map0 = affine_map<(d0, d1) -> (d0, d1)>
147 indexing_maps = [#map0, #map0, #map0],
190 indexing_maps = [#map0, #map1, #map1],
233 #map0 = affine_map<(d0, d1) -> (d0, d1)>
239 indexing_maps = [#map0, #map0, #map0],
411 #map0 = affine_map<(d0, d1) -> (d0, d1)>
[all …]
H A Dbubble-up-extract-slice-op.mlir24 // CHECK: %[[GENERIC:.+]] = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_ty…
51 // CHECK: %[[GENERIC:.+]] = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_ty…
78 // CHECK: %[[GENERIC:.+]] = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_ty…
105 // CHECK: %[[GENERIC:.+]] = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_ty…
H A Dtransform-op-fuse-into-containing.mlir3 #map0 = affine_map<()[s0, s1] -> (s0 ceildiv s1)>
17 %1 = affine.apply #map0()[%d0, %arg0]
54 #map0 = affine_map<()[s0] -> (64 ceildiv s0)>
65 %1 = affine.apply #map0()[%arg0]
H A Ddetensorize_while_impure_cf.mlir4 #map0 = affine_map<() -> ()>
9 indexing_maps = [#map0, #map0, #map0],
/llvm-project-15.0.7/mlir/test/IR/
H A Dinvalid-builtin-types.mlir42 #map0 = affine_map<(d0, d1) -> (d0, d1)>
44 func.func @memrefs(memref<2x4xi8, #map0, #map8>) // expected-error {{undefined symbol alias id 'map…
48 #map0 = affine_map<(d0, d1) -> (d0, d1)>
49 func.func @memrefs(memref<2x4xi8, #map0, 1, 2>) // expected-error {{multiple memory spaces specifie…
53 #map0 = affine_map<(d0, d1) -> (d0, d1)>
56 func.func @memrefs(memref<2x4xi8, #map0, 1, #map1>) // expected-error {{expected memory space to be…
62 #map0 = affine_map<(d0, d1) -> (d0, d1)>
63 func.func @memrefs(memref<42xi8, #map0>) // expected-error {{memref layout mismatch between rank an…
/llvm-project-15.0.7/mlir/test/Conversion/SCFToGPU/
H A Dparallel_loop.mlir200 #map0 = affine_map<(d0, d1)[s0, s1] -> (d0 * s1 + s0 + d1)>
206 …func.func @sum(%arg0: memref<?x?xf32, #map0>, %arg1: memref<?x?xf32, #map0>, %arg2: memref<?x?xf32…
211 %0 = memref.dim %arg0, %c0 : memref<?x?xf32, #map0>
212 %1 = memref.dim %arg0, %c1 : memref<?x?xf32, #map0>
214 %2 = memref.dim %arg0, %c0 : memref<?x?xf32, #map0>
217 %4 = memref.dim %arg0, %c1 : memref<?x?xf32, #map0>
220 %7 = memref.dim %arg1, %c0 : memref<?x?xf32, #map0>
222 %9 = memref.dim %arg1, %c1 : memref<?x?xf32, #map0>
224 …%11 = memref.subview %arg1[%arg3, %arg4][%8, %10][%c1, %c1] : memref<?x?xf32, #map0> to memref<?x?…
225 %12 = memref.dim %arg2, %c0 : memref<?x?xf32, #map0>
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/SCF/
H A Dparallel-loop-specialization.mlir3 #map0 = affine_map<()[s0, s1] -> (1024, s0 - s1)>
12 %b0 = affine.min #map0()[%d0, %outer_i0]
29 // CHECK: [[VAL_10:%.*]] = affine.min #map0(){{\[}}[[VAL_8]], [[VAL_0]]]

1234