| /llvm-project/mlir/lib/Dialect/Utils/ |
| H A D | StructuredOpsUtils.cpp | 25 AffineMap map1 = cast<AffineMapAttr>(indexingMaps[1]).getValue(); in isRowMajorMatmul() local 28 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isRowMajorMatmul() 30 map1.getNumInputs() != 3 || map2.getNumInputs() != 3) { in isRowMajorMatmul() 51 AffineMap map1 = cast<AffineMapAttr>(indexingMaps[1]).getValue(); in isColumnMajorMatmul() local 54 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isColumnMajorMatmul() 56 map1.getNumInputs() != 3 || map2.getNumInputs() != 3) { in isColumnMajorMatmul() 77 AffineMap map1 = cast<AffineMapAttr>(indexingMaps[1]).getValue(); in isRowMajorBatchMatmul() local 80 if (map0.getNumResults() != 3 || map1.getNumResults() != 3 || in isRowMajorBatchMatmul() 82 map1.getNumInputs() != 4 || map2.getNumInputs() != 4) { in isRowMajorBatchMatmul() 103 AffineMap map1 = cast<AffineMapAttr>(indexingMaps[1]).getValue(); in isVecmat() local [all …]
|
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_map_subtract.c | 514 static __isl_give isl_map *replace_pair_by_empty( __isl_take isl_map *map1, in replace_pair_by_empty() argument 519 space = isl_map_get_space(map1); in replace_pair_by_empty() 520 isl_map_free(map1); in replace_pair_by_empty() 533 __isl_give isl_map *isl_map_subtract( __isl_take isl_map *map1, in isl_map_subtract() argument 540 if (isl_map_align_params_bin(&map1, &map2) < 0) in isl_map_subtract() 542 if (isl_map_check_equal_space(map1, map2) < 0) in isl_map_subtract() 545 equal = isl_map_plain_is_equal(map1, map2); in isl_map_subtract() 549 return replace_pair_by_empty(map1, map2); in isl_map_subtract() 551 disjoint = isl_map_is_disjoint(map1, map2); in isl_map_subtract() 556 return map1; in isl_map_subtract() [all …]
|
| H A D | isl_map.c | 294 isl_bool isl_map_has_equal_params(__isl_keep isl_map *map1, in isl_map_has_equal_params() argument 299 space1 = isl_map_peek_space(map1); in isl_map_has_equal_params() 1607 isl_bool isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1, in isl_map_align_params_map_map_and_test() argument 1609 isl_bool (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2)) in isl_map_align_params_map_map_and_test() argument 1613 if (!map1 || !map2) in isl_map_align_params_map_map_and_test() 1615 if (isl_map_has_equal_params(map1, map2)) in isl_map_align_params_map_map_and_test() 1616 return fn(map1, map2); in isl_map_align_params_map_map_and_test() 1617 if (isl_map_check_named_params(map1) < 0) in isl_map_align_params_map_map_and_test() 1621 map1 = isl_map_copy(map1); in isl_map_align_params_map_map_and_test() 1623 map1 = isl_map_align_params(map1, isl_map_get_space(map2)); in isl_map_align_params_map_map_and_test() [all …]
|
| /llvm-project/mlir/test/python/ir/ |
| H A D | affine_map.py | 41 map1 = AffineMap.get(2, 3, [d1, c2]) 42 print(map1) 60 assert map1 == AffineMap.get(2, 3, [d1, c2]) 129 map1 = AffineMap.get(3, 0, [d2, d0]) 133 print(map1.is_permutation) 135 print(map1.is_projected_permutation) 217 map1 = AffineMap.get(3, 3, [d2, d0 + s1 + s2, d1 + s0]) 219 replace0 = map1.replace(s0, AffineConstantExpr.get(42), 3, 3) 220 replace1 = map1.replace(s1, AffineConstantExpr.get(42), 3, 3) 221 replace3 = map1.replace(s2, AffineConstantExpr.get(42), 3, 2)
|
| /llvm-project/mlir/test/Dialect/Vector/ |
| H A D | vector-reduce-to-contract.mlir | 4 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)> 8 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map0]], #[[$map1]]], 22 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)> 26 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map0]], #[[$map1]]], 40 #map1 = affine_map<(d0, d1, d2) -> (d0, d1)> 43 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d1, d2)> 49 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]], 57 %1 = vector.contract {indexing_maps = [#map0, #map0, #map1], 66 #map1 = affine_map<(d0, d1, d2) -> (d0, d1)> 69 // CHECK-DAG: #[[$map1 [all...] |
| H A D | fold-arith-extf-into-vector-contract.mlir | 5 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d2, d1)> 9 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]], 30 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d2, d1)> 34 // CHECK-NEXT: %[[R:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]],
|
| /llvm-project/mlir/test/Dialect/Linalg/ |
| H A D | fill-interface-invalid.mlir | 14 #map1 = affine_map<(d0) -> (d0)> 19 indexing_maps = [#map0, #map0, #map1], 30 #map1 = affine_map<(d0) -> (d0)> 35 indexing_maps = [#map1, #map1],
|
| H A D | transform-op-specialize-matmul.mlir | 4 #map1 = affine_map<(d0, d1, d2) -> (d2, d1)> 8 … {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "reduction"]} 34 #map1 = affine_map<(d0, d1, d2) -> (d2, d1)> 38 {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "reduction"]} 64 #map1 = affine_map<(d0, d1, d2) -> (d1, d2)> 68 … {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "reduction"]} 94 #map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)> 98 …{indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "parallel", "redu… 123 #map1 = affine_map<(d0, d1, d2, d3) -> (d0, d2, d3)> 127 …{indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "parallel", "redu…
|
| H A D | erase-unused-operands-and-results.mlir | 31 #map1 = affine_map<(d0, d1) -> (d1, d0)> 42 …%5 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types=["parallel","parallel"]… 79 #map1 = affine_map<(d0, d1) -> (d1, d0)> 86 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle… 102 #map1 = affine_map<(d0, d1) -> (d1, d0)> 111 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0, #map0], iterator_types = ["parallel", "… 148 #map1 = affine_map<(d0, d1, d2) -> (d0, d2, d1)> 154 indexing_maps = [#map0, #map1, #map2, #map3, #map4], 181 #map1 = affine_map<(d0) -> ()> 186 indexing_maps = [#map0, #map1, #map1], [all …]
|
| H A D | transform-op-specialize.mlir | 4 #map1 = affine_map<(d0, d1) -> (d0)> 87 #map1 = affine_map<(d0, d1, d2) -> (d0, d1, d2)> 92 indexing_maps = [#map1, #map1], 136 #map1 = affine_map<(d0, d1) -> (d0, d1)> 139 %0 = linalg.generic {indexing_maps = [#map, #map1], iterator_types = ["parallel", "parallel"]} ins(%cst : f32) outs(%arg0 : tensor<7x7xf32>) {
|
| H A D | fuse-with-reshape-by-collapsing.mlir | 7 #map1 = affine_map<(d0, d1, d2, d3, d4, d5, d6, d7) -> (d0, d1, d2)> 17 indexing_maps = [#map0, #map1, #map2, #map3, #map4], 63 #map1 = affine_map<(d0, d1, d2, d3, d4, d5, d6, d7) -> (d0, d1, d2)> 71 indexing_maps = [#map0, #map1, #map2, #map3], 124 #map1 = affine_map<(d0, d1, d2, d3, d4, d5, d6, d7) -> (d5, d6, d0)> 132 indexing_maps = [#map0, #map1, #map2, #map3], 167 #map1 = affine_map<(d0, d1, d2, d3, d4, d5, d6, d7) -> (d5, d6, d0)> 184 indexing_maps = [#map0, #map1, #map2, #map3], 229 #map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3)> 233 indexing_maps = [#map0, #map1], [all...] |
| H A D | fusion-elementwise-ops.mlir | 46 #map1 = affine_map<(d0, d1) -> ()> 56 …%3 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle… 65 …%4 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle… 88 #map1 = affine_map<(d0, d1) -> (d1, d0)> 98 …%3 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle… 122 #map1 = affine_map<(d0, d1) -> (d1, d0)> 132 …%3 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle… 141 …%4 = linalg.generic {indexing_maps = [#map1, #map0, #map0], iterator_types = ["parallel", "paralle… 156 #map1 = affine_map<(d0, d1) -> (d0)> 177 …%5 = linalg.generic {indexing_maps = [#map1, #map0, #map0], iterator_types = ["parallel", "paralle… [all …]
|
| H A D | specialize-generic-ops.mlir | 42 #map1 = affine_map<(d0, d1, d2) -> (d2, d1)> 46 … {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "reduction"]} 64 #map1 = affine_map<(d0, d1, d2, d3) -> (d0, d3, d2)> 68 …{indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "parallel", "parallel", "redu… 112 #map1 = affine_map<(d0, d1) -> (d1)> 116 {indexing_maps = [#map, #map1, #map2], iterator_types = ["parallel", "reduction"]}
|
| H A D | tile-to-forall.mlir | 144 // CHECK-DAG: #[[$map1:.+]] = affine_map<(d0) -> (0, d0)> 155 // CHECK: %[[TS:.+]] = affine.max #[[$map1]](%[[TSMIN]]) 183 // CHECK-DAG: #[[$map1:.+]] = affine_map<()[s0] -> (s0 ceildiv 20)> 197 // CHECK: %[[NT1:.+]] = affine.apply #[[$map1]]()[%[[N]]] 299 // CHECK-DAG: #[[$map1:.+]] = affine_map<()[s0] -> (s0 ceildiv 20)> 316 // CHECK-DAG: %[[NT1:.+]] = affine.apply #[[$map1]]()[%[[N]]] 397 // CHECK-DAG: #[[$map1:.+]] = affine_map<(d0, d1) -> (d1)> 453 // CHECK-DAG: #[[$map1:.+]] = affine_map<()[s0] -> (s0 ceildiv 20)> 469 // CHECK-DAG: %[[NT1:.+]] = affine.apply #map1()[%[[N]]] 521 // CHECK-DAG: #[[$map1 [all...] |
| H A D | transform-op-vectorize.mlir | 80 #map1 = affine_map<()[s0] -> (-s0 + 7)> 94 %4 = affine.apply #map1()[%0] 100 %6 = affine.apply #map1()[%0] 128 #map1 = affine_map<()[s0] -> (-s0 + 7)> 147 %4 = affine.apply #map1()[%0] 152 %6 = affine.apply #map1()[%0]
|
| /llvm-project/mlir/test/Conversion/VectorToGPU/ |
| H A D | vector-to-mma-ops.mlir | 4 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 23 %D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parallel", "reduction"], kind = #vector.kind<add>} %A, %B, %C : vector<16x16xf16>, vector<16x16xf16> into vector<16x16xf16> 31 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 50 %D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parallel", "reduction"], kind = #vector.kind<add>} %A, %B, %cst_0 : vector<16x16xf16>, vector<16x16xf16> into vector<16x16xf16> 58 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 77 %D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parallel", "reduction"], kind = #vector.kind<add>} %A, %B, %C : vector<16x16xf16>, vector<16x16xf16> into vector<16x16xf16> 85 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 109 %19 = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parallel", "reduction"], kind = #vector.kind<add>} %17, %18, %arg18 : vector<16x16xf16>, vector<16x16xf16> into vector<16x16xf16> 119 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 142 %D = vector.contract {indexing_maps = [#map1, #map [all...] |
| H A D | vector-to-mma-ops-mma-sync.mlir | 26 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 92 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall… 119 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 157 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall… 173 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 195 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall… 210 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> 240 …%D0 = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "paral… 248 …%D1 = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "paral… 263 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)> [all …]
|
| /llvm-project/polly/lib/External/isl/include/isl/ |
| H A D | map.h | 234 __isl_give isl_map *isl_map_sum(__isl_take isl_map *map1, 332 __isl_take isl_map *map1, 335 __isl_take isl_map *map1, __isl_take isl_map *map2); 364 __isl_take isl_map *map1, 368 __isl_take isl_map *map1, 388 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1, 395 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1, 398 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1, 402 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1, 406 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1, [all …]
|
| /llvm-project/mlir/test/Dialect/Affine/ |
| H A D | affine-expand-index-ops.mlir | |
| H A D | access-analysis.mlir | 49 #map1 = affine_map<(d0) -> (d0 * 16 + 16)> 60 affine.for %arg4 = #map(%arg1) to #map1(%arg1) { 61 affine.for %arg5 = #map(%arg3) to #map1(%arg3) { 77 affine.for %arg4 = #map(%arg1) to #map1(%arg1) { 79 affine.for %arg6 = #map(%arg3) to #map1(%arg3) {
|
| /llvm-project/mlir/test/Integration/Dialect/Linalg/CPU/ |
| H A D | test-one-shot-bufferize.mlir | 10 #map1 = affine_map<(d0, d1)[s0] -> ((d0 - d1) ceildiv s0)> 21 %8 = affine.apply #map1(%arg3, %c0)[%c2] 38 %8 = affine.apply #map1(%arg3, %c0)[%c2] 60 %12 = affine.apply #map1(%arg3, %c0)[%c2] 62 %14 = affine.apply #map1(%arg3, %c0)[%c2]
|
| /llvm-project/mlir/test/Dialect/SparseTensor/ |
| H A D | constant_index_map.mlir | 5 #map1 = affine_map<(d0) -> (0, d0)> 32 indexing_maps = [#map1, #map1, #map2],
|
| /llvm-project/mlir/test/Dialect/Tensor/ |
| H A D | transform-op-make-loop-independent.mlir | 8 // CHECK: #[[$map1:.*]] = affine_map<(d0)[s0, s1] -> (-d0 + s0 + s1 + 5)> 19 // CHECK: %[[size:.*]] = affine.apply #[[$map1]](%[[iv]])[%[[ub]], %[[dim]]] 45 // CHECK: #[[$map1:.*]] = affine_map<(d0)[s0, s1] -> (-d0 + s0 + s1 + 5)> 57 // CHECK: %[[size:.*]] = affine.apply #[[$map1]](%[[iv]])[%[[ub]], %[[dim]]] 137 // CHECK: #[[$map1:.*]] = affine_map<()[s0, s1] -> (s0 - s1)> 144 // CHECK: %[[empty_sz:.*]] = affine.apply #[[$map1]]()[%[[ub]], %[[lb]]]
|
| /llvm-project/mlir/unittests/Analysis/Presburger/ |
| H A D | PresburgerRelationTest.cpp | 98 PresburgerRelation map1 = parsePresburgerRelationFromPresburgerSet( in TEST() local 111 map1.applyDomain(map2); in TEST() 122 EXPECT_TRUE(map1.isEqual(map3)); in TEST()
|
| /llvm-project/mlir/test/Dialect/Func/ |
| H A D | invalid.mlir | 68 #map1 = affine_map<(i)[j] -> (i+j)> 71 affine.for %i = #map1(%N) to 100 { 79 #map1 = affine_map<(i)[j] -> (i+j)> 82 affine.for %i = #map1(%N, %N)[%N] to 100 {
|