Home
last modified time | relevance | path

Searched refs:map1 (Results 1 – 25 of 85) sorted by relevance

1234

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_map_subtract.c520 isl_map_free(map1); in replace_pair_by_empty()
556 return map1; in isl_map_subtract()
559 map1 = isl_map_compute_divs(map1); in isl_map_subtract()
561 if (!map1 || !map2) in isl_map_subtract()
564 map1 = isl_map_remove_empty_parts(map1); in isl_map_subtract()
578 isl_map_free(map1); in isl_map_subtract()
583 isl_map_free(map1); in isl_map_subtract()
700 if (!map1 || !map2) in map_diff_is_empty()
806 if (!map1 || !map2) in map_is_singleton_subset()
808 if (map1->n != 1) in map_is_singleton_subset()
[all …]
H A Disl_map.c1628 map1 = isl_map_copy(map1); in isl_map_align_params_map_map_and_test()
3840 map1 = isl_map_cow(map1); in map_intersect_add_constraint()
3850 map1->p[0] = isl_basic_map_add_ineq(map1->p[0], in map_intersect_add_constraint()
3853 map1->p[0] = isl_basic_map_simplify(map1->p[0]); in map_intersect_add_constraint()
3854 map1->p[0] = isl_basic_map_finalize(map1->p[0]); in map_intersect_add_constraint()
3865 map1 = isl_map_unmark_normalized(map1); in map_intersect_add_constraint()
8294 map1 = map_union_disjoint(map1, map2); in isl_map_union()
8595 map1 = isl_map_reverse(map1); in isl_map_apply_domain()
8596 map1 = isl_map_apply_range(map1, map2); in isl_map_apply_domain()
10528 map1 = isl_map_copy(map1); in isl_map_plain_is_equal()
[all …]
/llvm-project-15.0.7/mlir/lib/Dialect/Utils/
H A DStructuredOpsUtils.cpp20 auto map1 = indexingMaps[1].cast<AffineMapAttr>().getValue(); in isRowMajorMatmul() local
23 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isRowMajorMatmul()
25 map1.getNumInputs() != 3 || map2.getNumInputs() != 3) { in isRowMajorMatmul()
46 auto map1 = indexingMaps[1].cast<AffineMapAttr>().getValue(); in isColumnMajorMatmul() local
49 if (map0.getNumResults() != 2 || map1.getNumResults() != 2 || in isColumnMajorMatmul()
51 map1.getNumInputs() != 3 || map2.getNumInputs() != 3) { in isColumnMajorMatmul()
72 auto map1 = indexingMaps[1].cast<AffineMapAttr>().getValue(); in isRowMajorBatchMatmul() local
75 if (map0.getNumResults() != 3 || map1.getNumResults() != 3 || in isRowMajorBatchMatmul()
77 map1.getNumInputs() != 4 || map2.getNumInputs() != 4) { in isRowMajorBatchMatmul()
/llvm-project-15.0.7/mlir/test/python/ir/
H A Daffine_map.py41 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)
213 map1 = AffineMap.get(3, 3, [d2, d0 + s1 + s2, d1 + s0])
215 replace0 = map1.replace(s0, AffineConstantExpr.get(42), 3, 3)
216 replace1 = map1.replace(s1, AffineConstantExpr.get(42), 3, 3)
217 replace3 = map1.replace(s2, AffineConstantExpr.get(42), 3, 2)
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DIntegerRelationTest.cpp99 IntegerRelation map1 = parseRelationFromSet( in TEST() local
104 map1.applyRange(map2); in TEST()
109 EXPECT_TRUE(map1.isEqual(map3)); in TEST()
113 IntegerRelation map1 = parseRelationFromSet( in TEST() local
121 map1.applyDomain(map2); in TEST()
123 EXPECT_TRUE(map1.isEqual(map3)); in TEST()
/llvm-project-15.0.7/mlir/test/Dialect/Vector/
H A Dvector-reduce-to-contract.mlir40 #map1 = affine_map<(d0, d1, d2) -> (d0, d1)>
66 #map1 = affine_map<(d0, d1, d2) -> (d0, d1)>
95 #map1 = affine_map<(d0, d1, d2, d3) -> (d0, d2, d3)>
112 indexing_maps = [#map0, #map1, #map2],
146 indexing_maps = [#map0, #map1, #map2],
159 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
178 indexing_maps = [#map0, #map1, #map2],
191 #map1 = affine_map<(d0, d1, d2) -> (d0, d1, d2)>
209 indexing_maps = [#map0, #map1, #map2],
226 #map1 = affine_map<(d0, d1) -> (d1, d0)>
[all …]
H A Dvector-dropleadunitdim-transforms.mlir4 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d2, d1)>
11 // CHECK-NEXT: %[[R3:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]…
34 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1) -> (d1, d0)>
41 // CHECK-NEXT: %[[R3:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]…
66 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)>
75 // CHECK-NEXT: %[[R5:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]]…
99 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)>
111 // CHECK-NEXT: %[[R7:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]…
136 // CHECK-DAG: #[[$map1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)>
145 // CHECK-NEXT: %[[R5:.+]] = vector.contract {indexing_maps = [#[[$map0]], #[[$map1]], #[[$map2]…
H A Dvector-transfer-collapse-inner-most-dims.mlir3 #map1 = affine_map<(d0, d1, d2, d3)[s0] -> (d0 * 3072 + s0 + d1 * 8 + d2 + d3)>
4 func.func @contiguous_inner_most_view(%in: memref<1x1x8x1xf32, #map1>) -> vector<1x8x1xf32>{
7 …0, %c0, %c0], %cst {in_bounds = [true, true, true]} : memref<1x1x8x1xf32, #map1>, vector<1x8x1xf32>
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dcompose-subview.mlir5 #map1 = affine_map<(d0, d1) -> (d0 * 1024 + d1 + 3456)>
7 func.func @main(%input: memref<4x1024xf32>) -> memref<1x128xf32, #map1> {
11 … = memref.subview %0[1, 128] [1, 128] [1, 1] : memref<2x256xf32, #map0> to memref<1x128xf32, #map1>
12 return %1 : memref<1x128xf32, #map1>
19 #map1 = affine_map<(d0, d1) -> (d0 * 1024 + d1 + 2688)>
26 … = memref.subview %0[1, 128] [2, 128] [1, 1] : memref<3x256xf32, #map0> to memref<2x128xf32, #map1>
27 %2 = memref.subview %1[1, 33] [1, 10] [1, 1] : memref<2x128xf32, #map1> to memref<1x10xf32, #map2>
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dfill-interface-invalid.mlir14 #map1 = affine_map<(d0) -> (d0)>
19 indexing_maps = [#map0, #map0, #map1],
30 #map1 = affine_map<(d0) -> (d0)>
35 indexing_maps = [#map1, #map1],
H A Dfuse-with-reshape-by-collapsing.mlir16 indexing_maps = [#map0, #map1, #map2, #map3],
230 indexing_maps = [#map0, #map1],
259 indexing_maps = [#map0, #map1, #map0],
280 #map1 = affine_map<(d0, d1, d2, d3) -> (d0)>
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],
498 #map1 = affine_map<(d0, d1, d2, d3) -> ()>
[all …]
H A Dcanonicalize-duplicate-inputs.mlir30 #map1 = affine_map<(d0, d1) -> (d1, d0)>
37 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0], iterator_types = ["parallel", "paralle…
53 #map1 = affine_map<(d0, d1) -> (d1, d0)>
62 …%0 = linalg.generic {indexing_maps = [#map0, #map1, #map0, #map0], iterator_types = ["parallel", "…
99 #map1 = affine_map<(d0, d1, d2) -> (d0, d2, d1)>
105 indexing_maps = [#map0, #map1, #map2, #map3, #map4],
132 #map1 = affine_map<(d0) -> ()>
137 indexing_maps = [#map0, #map1, #map1],
215 #map1 = affine_map<(d0, d1) -> (d1, d0)>
221 indexing_maps = [#map3, #map0, #map0, #map2, #map1, #map1, #map2],
H A Dtransform-op-vectorize.mlir40 #map1 = affine_map<()[s0] -> (-s0 + 7)>
54 %4 = affine.apply #map1()[%0]
60 %6 = affine.apply #map1()[%0]
89 #map1 = affine_map<()[s0] -> (-s0 + 7)>
108 %4 = affine.apply #map1()[%0]
113 %6 = affine.apply #map1()[%0]
H A Dtransform-op-fuse-into-containing.mlir4 #map1 = affine_map<(d0)[s0] -> (d0 * s0)>
21 %3 = affine.apply #map1(%arg3)[%arg0]
55 #map1 = affine_map<(d0)[s0] -> (d0 * s0)>
70 %3 = affine.apply #map1(%arg3)[%arg0]
H A Dfusion-elementwise-ops.mlir46 #map1 = affine_map<(d0, d1) -> ()>
88 #map1 = affine_map<(d0, d1) -> (d1, d0)>
156 #map1 = affine_map<(d0, d1) -> (d0)>
231 indexing_maps = [#map0, #map1, #map1],
263 indexing_maps = [#map0, #map1, #map1],
410 indexing_maps = [#map1, #map1],
448 #map1 = affine_map<(d0) -> (d0)>
458 {indexing_maps = [#map1, #map1],
572 #map1 = affine_map<(d0) -> (0, d0)>
588 {indexing_maps = [#map1, #map2],
[all …]
H A Ddetensorize_while_impure_cf.mlir5 #map1 = affine_map<(i) -> ()>
14 indexing_maps = [#map2, #map1],
20 indexing_maps = [#map1, #map2],
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dmap.h234 __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);
358 __isl_take isl_map *map1,
362 __isl_take isl_map *map1,
382 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
427 __isl_take isl_map *map1,
595 isl_bool isl_map_is_strict_subset(__isl_keep isl_map *map1,
600 isl_bool isl_map_is_disjoint(__isl_keep isl_map *map1,
613 isl_bool isl_map_has_equal_space(__isl_keep isl_map *map1,
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Bufferization/Transforms/
H A Dfinalizing-bufferize.mlir32 // CHECK: #[[$map1:.*]] = affine_map<(d0)[s0] -> (d0 + s0)>
34 // CHECK-SAME: %[[arg:.*]]: memref<?xf32, #[[$map1]]>)
40 #map1 = affine_map<(d0)[s0] -> (d0 + s0)>
41 func.func @dyn_layout_to_no_layout_cast(%m: memref<?xf32, #map1>) -> memref<?xf32> {
42 %0 = bufferization.to_tensor %m : memref<?xf32, #map1>
H A Done-shot-module-bufferize-out-params.mlir10 // CHECK: #[[$map1:.*]] = affine_map<(d0)[s0, s1] -> (d0 * s1 + s0)>
12 // CHECK-SAME: %[[arg0:.*]]: memref<5xf32, #[[$map1]]>,
13 // CHECK-SAME: %[[arg1:.*]]: memref<5xf32, #[[$map1]]>) {
35 // CHECK-BASELINE: #[[$map1:.*]] = affine_map<(d0)[s0, s1] -> (d0 * s1 + s0)>
37 // CHECK-BASELINE-SAME: %[[arg0:.*]]: memref<5xf32, #[[$map1]]>) -> memref<5xf32> {
52 // CHECK: func @main(%[[arg0:.*]]: memref<5xf32, #[[$map1]]>) -> (f32, f32) {
54 // CHECK: %[[casted:.*]] = memref.cast %[[alloc]] : memref<5xf32> to memref<5xf32, #[[$map1]]>
/llvm-project-15.0.7/mlir/test/Integration/Dialect/Linalg/CPU/
H A Dtest-one-shot-bufferize.mlir10 #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-15.0.7/mlir/test/Dialect/SCF/
H A Dparallel-loop-specialization.mlir4 #map1 = affine_map<()[s0, s1] -> (64, s0 - s1)>
13 %b1 = affine.min #map1()[%d1, %outer_i1]
30 // CHECK: [[VAL_11:%.*]] = affine.min #map1(){{\[}}[[VAL_9]], [[VAL_1]]]
/llvm-project-15.0.7/mlir/test/Dialect/Func/
H A Dinvalid.mlir68 #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 {
/llvm-project-15.0.7/mlir/test/Conversion/VectorToGPU/
H A Dvector-to-mma-ops-mma-sync.mlir26 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
118 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
172 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
212 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
250 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
296 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
354 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
425 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
493 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
546 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
[all …]
H A Dvector-to-mma-ops.mlir4 #map1 = affine_map<(d0, d1, d2) -> (d0, d2)>
22 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
40 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
58 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
81 …%19 = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "paral…
105 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
127 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
150 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
169 …%D = vector.contract {indexing_maps = [#map1, #map2, #map3], iterator_types = ["parallel", "parall…
/llvm-project-15.0.7/flang/test/Fir/
H A Daffine-promotion.fir58 // CHECK: affine.for %[[VAL_11:.*]] = %[[VAL_3]] to #map1(){{\[}}%[[VAL_4]]] {
66 // CHECK: affine.for %[[VAL_17:.*]] = %[[VAL_3]] to #map1(){{\[}}%[[VAL_4]]] {
118 // CHECK: %[[VAL_9:.*]] = affine.apply #map1(%[[VAL_8]]){{\[}}%[[VAL_3]], %[[VAL_5]], %[[VAL_3]…
122 // CHECK: %[[VAL_11:.*]] = affine.apply #map1(%[[VAL_10]]){{\[}}%[[VAL_3]], %[[VAL_5]], %[[VAL_…
128 // CHECK: %[[VAL_14:.*]] = affine.apply #map1(%[[VAL_12]]){{\[}}%[[VAL_3]], %[[VAL_5]], %[[VA…

1234