/external/llvm-project/mlir/test/Dialect/Affine/SuperVectorize/ |
D | compose_maps.mlir | 6 // "test_affine_map"() { affine_map = f } : () -> () 7 // "test_affine_map"() { affine_map = g } : () -> () 8 // "test_affine_map"() { affine_map = h } : () -> () 14 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 - 1)> } : () -> () 15 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 + 1)> } : () -> () 21 "test_affine_map"() { affine_map = affine_map<(d0)[s0] -> (d0 + s0 - 1)> } : () -> () 22 "test_affine_map"() { affine_map = affine_map<(d0)[s0] -> (d0 - s0 + 1)> } : () -> () 28 …"test_affine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> (d0 ceildiv s0, d1 ceildiv s1)> … 29 "test_affine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> (d0 * s0, d1 * s1)> } : () -> () 35 …"test_affine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> (d0 mod s0, d1 mod s1)> } : () -… [all …]
|
D | normalize_maps.mlir | 3 // CHECK-DAG: #[[$ZERO:[a-zA-Z0-9]+]] = affine_map<() -> (0)> 4 // CHECK-DAG: #[[$ID1:[a-zA-Z0-9]+]] = affine_map<(d0) -> (d0)> 5 // CHECK-DAG: #[[$D0TIMES2:[a-zA-Z0-9]+]] = affine_map<(d0) -> (d0 * 2)> 6 // CHECK-DAG: #[[$D0PLUSD1:[a-zA-Z0-9]+]] = affine_map<(d0, d1) -> (d0 + d1)> 7 // CHECK-DAG: #[[$MINSD0PLUSD1:[a-zA-Z0-9]+]] = affine_map<(d0, d1) -> (-d0 + d1)> 8 // CHECK-DAG: #[[$D0MINUSD1:[a-zA-Z0-9]+]] = affine_map<(d0, d1) -> (d0 - d1)> 13 %0 = affine.apply affine_map<(d0) -> (d0)> (%i0) 14 %1 = affine.apply affine_map<(d0) -> (d0)> (%0) 15 %2 = affine.apply affine_map<(d0, d1) -> (d0 + d1)> (%0, %0) 16 %3 = affine.apply affine_map<(d0, d1) -> (d0 - d1)> (%0, %0) [all …]
|
/external/llvm-project/mlir/test/IR/ |
D | affine-map.mlir | 4 // CHECK-NOT: #map{{[0-9]+}} = affine_map<(d0, d1) -> (d0, d1)> 5 #map0 = affine_map<(i, j) -> (i, j)> 7 // CHECK-NOT: #map{{[0-9]+}} = affine_map<(d0, d1)[s0] -> (d0, d1)> 8 #map1 = affine_map<(i, j)[s0] -> (i, j)> 10 // CHECK: #map{{[0-9]+}} = affine_map<() -> (0)> 13 #map2 = affine_map<() -> (0)> 18 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1) -> (d0 + 1, d1 * 4 + 2)> 19 #map3 = affine_map<(i, j) -> (i+1, 4*j + 2)> 21 #map3a = affine_map<(i, j) -> (1+i, 4*j + 2)> 22 #map3b = affine_map<(i, j) -> (2 + 3 - 2*2 + i, 4*j + 2)> [all …]
|
D | invalid-affinemap.mlir | 5 #hello_world = affine_map<(i, j) -> ((), j)> // expected-error {{no expression inside parentheses}} 8 #hello_world = affine_map<(i, j) -> (->, j) // expected-error {{expected affine expression}} 11 #hello_world = affine_map<(i, j) -> (:) // expected-error {{expected affine expression}} 14 #hello_world = affine_map<(i, j) -> (, j)> // expected-error {{expected affine expression}} 17 #hello_world affine_map<(i, j) [s0] -> (i, j)> // expected-error {{expected '=' in attribute alias … 20 #hello_world = affine_map<(i, j) [s0] -> (2*i*, 3*j*i*2 + 5)> // expected-error {{missing right ope… 23 #hello_world = affine_map<(i, j) [s0] -> (i+, i+j+2 + 5)> // expected-error {{missing right operand… 26 #hello_world = affine_map<(i, j) [s0] -> ((s0 + i, j)> // expected-error {{expected ')'}} 29 #hello_world = affine_map<(i, j) [s0] -> (((s0 + (i + j) + 5), j)> // expected-error {{expected ')'… 32 #hello_world = affine_map<(i, j) [s0] -> i + s0, j)> // expected-error {{expected '(' at start of a… [all …]
|
D | memory-ops.mlir | 3 // CHECK: #map = affine_map<(d0, d1)[s0] -> (d0 + s0, d1)> 10 %0 = alloc() : memref<1024x64xf32, affine_map<(d0, d1) -> (d0, d1)>, 1> 17 %1 = alloc(%c0, %c1) : memref<?x?xf32, affine_map<(d0, d1) -> (d0, d1)>, 1> 21 %2 = alloc()[%c0] : memref<2x4xf32, affine_map<(d0, d1)[s0] -> ((d0 + s0), d1)>, 1> 25 %3 = alloc(%c1)[%c0] : memref<2x?xf32, affine_map<(d0, d1)[s0] -> (d0 + s0, d1)>, 1> 41 %0 = alloca() : memref<1024x64xf32, affine_map<(d0, d1) -> (d0, d1)>, 1> 48 %1 = alloca(%c0, %c1) : memref<?x?xf32, affine_map<(d0, d1) -> (d0, d1)>, 1> 52 %2 = alloca()[%c0] : memref<2x4xf32, affine_map<(d0, d1)[s0] -> ((d0 + s0), d1)>, 1> 56 %3 = alloca(%c1)[%c0] : memref<2x?xf32, affine_map<(d0, d1)[s0] -> (d0 + s0, d1)>, 1> 69 %0 = alloc() : memref<1024x64xf32, affine_map<(d0, d1) -> (d0, d1)>, 0> [all …]
|
/external/llvm-project/mlir/test/Dialect/Affine/ |
D | canonicalize.mlir | 4 // CHECK-DAG: [[$MAP0:#map[0-9]+]] = affine_map<(d0) -> (d0 - 1)> 5 // CHECK-DAG: [[$MAP1:#map[0-9]+]] = affine_map<(d0) -> (d0 + 1)> 8 // CHECK-DAG: [[$MAP4:#map[0-9]+]] = affine_map<(d0) -> (d0 - 4)> 9 // CHECK-DAG: [[$MAP4b:#map[0-9]+]] = affine_map<(d0) -> (d0 - 7)> 10 // CHECK-DAG: [[$MAP7:#map[0-9]+]] = affine_map<(d0) -> (d0 * 2 - 3)> 11 // CHECK-DAG: [[$MAP7a:#map[0-9]+]] = affine_map<(d0) -> (d0 * 2 + 1)> 14 // CHECK-DAG: [[$MAP8:#map[0-9]+]] = affine_map<(d0, d1) -> (d1 + (d0 ceildiv 4) * 4 - (d1 floordiv… 15 // CHECK-DAG: [[$MAP8a:#map[0-9]+]] = affine_map<(d0, d1) -> (d1 + (d0 ceildiv 8) * 8 - (d1 floordi… 18 // CHECK-DAG: [[$MAP9:#map[0-9]+]] = affine_map<(d0) -> (d0 + 3)> 19 // CHECK-DAG: [[$MAP10:#map[0-9]+]] = affine_map<(d0) -> (d0 * 3)> [all …]
|
D | memref-stride-calculation.mlir | 18 %11 = alloc() : memref<3x4x5xf32, affine_map<(i, j, k)->(i, j, k)>> 22 %12 = alloc(%0) : memref<3x4x?xf32, affine_map<(i, j, k)->(i, j, k)>> 24 %13 = alloc(%0) : memref<3x?x5xf32, affine_map<(i, j, k)->(i, j, k)>> 26 %14 = alloc(%0) : memref<?x4x5xf32, affine_map<(i, j, k)->(i, j, k)>> 28 %15 = alloc(%0, %0) : memref<?x4x?xf32, affine_map<(i, j, k)->(i, j, k)>> 30 %16 = alloc(%0, %0, %0) : memref<?x?x?xf32, affine_map<(i, j, k)->(i, j, k)>> 33 %21 = alloc()[%0] : memref<3x4x5xf32, affine_map<(i, j, k)[M]->(32 * i + 16 * j + M * k + 1)>> 35 %22 = alloc()[%0] : memref<3x4x5xf32, affine_map<(i, j, k)[M]->(32 * i + M * j + 16 * k + 3)>> 39 %23 = alloc(%0)[%0] : memref<3x?x5xf32, affine_map<(i, j, k)[M]->(M * i + 32 * j + 16 * k + 7)>> 43 %24 = alloc(%0)[%0] : memref<3x?x5xf32, affine_map<(i, j, k)[M]->(M * i + 32 * j + 16 * k + M)>> [all …]
|
D | loop-tiling-parametric.mlir | 10 // CHECK-DAG: [[LBI:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0)> 11 // CHECK-DAG: [[UBI0:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0 + s0, 256)> 12 // CHECK-DAG: [[UBI1:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0 + s0, 512)> 13 // CHECK-DAG: [[UBI2:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0 + s0, 1024)> 14 // CHECK-DAG: [[UBO0:#map[0-9]+]] = affine_map<()[s0] -> (256 ceildiv s0)> 15 // CHECK-DAG: [[UBO1:#map[0-9]+]] = affine_map<()[s0] -> (512 ceildiv s0)> 16 // CHECK-DAG: [[UBO2:#map[0-9]+]] = affine_map<()[s0] -> (1024 ceildiv s0)> 39 // CHECK-DAG: [[LBI:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0)> 40 // CHECK-DAG: [[UBI0:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0 + s0 * 4, 256)> 41 // CHECK-DAG: [[UBI1:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 * s0 + s0 * 3, 512)> [all …]
|
D | loop-tiling.mlir | 7 // CHECK-DAG: [[$UB:#map[0-9]+]] = affine_map<(d0) -> (d0 + 32)> 8 // CHECK-DAG: [[$UB_MIN:#map[0-9]+]] = affine_map<(d0) -> (d0 + 32, 50)> 9 // CHECK-DAG: [[$ID:#map[0-9]+]] = affine_map<(d0) -> (d0)> 10 // CHECK-DAG: [[$ID_PLUS_21:#map[0-9]+]] = affine_map<(d0) -> (d0 + 21)> 60 // CHECK-DAG: [[$IDENTITY:#map[0-9]+]] = affine_map<(d0) -> (d0)> 61 // CHECK-DAG: [[$LB:#map[0-9]+]] = affine_map<()[s0] -> (0, s0)> 62 // CHECK-DAG: [[$UB:#map[0-9]+]] = affine_map<()[s0, s1] -> (s0, 4096 floordiv s1)> 63 // CHECK-DAG: [[$UB_INTRA_TILE:#map[0-9]+]] = affine_map<(d0)[s0, s1] -> (d0 + 32, s0, 4096 floordi… 65 #lb = affine_map<()[s0] -> (0, s0)> 66 #ub = affine_map<()[s0, s1] -> (s0, 4096 floordiv s1)> [all …]
|
D | affine-loop-normalize.mlir | 5 // CHECK-DAG: [[$MAP0:#map[0-9]+]] = affine_map<(d0) -> (d0 * 3)> 6 // CHECK-DAG: [[$MAP1:#map[0-9]+]] = affine_map<(d0) -> (d0 * 2 + 1)> 7 // CHECK-DAG: [[$MAP2:#map[0-9]+]] = affine_map<(d0, d1) -> (d0 + d1)> 48 // CHECK-DAG: [[$IV0:#map[0-9]+]] = affine_map<(d0) -> (d0 * 2 + 2)> 49 // CHECK-DAG: [[$IV1:#map[0-9]+]] = affine_map<(d0) -> (d0 * 3)> 72 // CHECK-DAG: [[$IV00:#map[0-9]+]] = affine_map<(d0) -> (d0 * 32 + 2)> 73 // CHECK-DAG: [[$IV11:#map[0-9]+]] = affine_map<(d0) -> (d0 * 2)> 74 // CHECK-DAG: [[$UB00:#map[0-9]+]] = affine_map<()[s0] -> ((s0 - 2) ceildiv 32)> 75 // CHECK-DAG: [[$UB11:#map[0-9]+]] = affine_map<()[s0] -> (s0 ceildiv 2)> 103 // CHECK-DAG: [[$OUTERIV:#map[0-9]+]] = affine_map<(d0) -> (d0 * 32 + 2)> [all …]
|
/external/llvm-project/mlir/test/Dialect/Linalg/ |
D | drop-unit-extent-dims.mlir | 4 affine_map<(i, j, k, l, m) -> (i, k, m)>, 5 affine_map<(i, j, k, l, m) -> (i, k, j, l, m)> 23 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1, d2) -> (d0, d1)> 24 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2) -> (d2)> 25 // CHECK-DAG: #[[$MAP2:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)> 26 // CHECK-DAG: #[[$MAP3:.*]] = affine_map<(d0, d1, d2) -> (d0, d1, d2)> 27 // CHECK-DAG: #[[$MAP4:.*]] = affine_map<(d0, d1, d2, d3, d4) -> (d0, d1)> 28 // CHECK-DAG: #[[$MAP5:.*]] = affine_map<(d0, d1, d2, d3, d4) -> (d2, d3)> 29 // CHECK-DAG: #[[$MAP6:.*]] = affine_map<(d0, d1, d2, d3, d4) -> (d4)> 40 affine_map<(i, j, k, l, m) -> (i, k, m)>, [all …]
|
D | reshape_linearization_fusion.mlir | 4 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1, d2, d3) -> (d0, d1 * 4 + d2, d3)> 5 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2, d3)> 7 #map0 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2, d3)> 12 %0 = linalg.tensor_reshape %arg0 [affine_map<(i, j, k, l) -> (i)>, 13 affine_map<(i, j, k, l) -> (j, k)>, 14 affine_map<(i, j, k, l) -> (l)>] : 35 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2, d3)> 36 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2, d3) -> (d0, d1 * 20 + d2 * 5 + d3)> 38 #map0 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2, d3)> 51 %1 = linalg.tensor_reshape %0 [affine_map<(i, j, k, l) -> (i)>, [all …]
|
D | canonicalize.mlir | 28 [affine_map<(d0, d1, d2, d3, d4) -> (d0, d1)>, 29 affine_map<(d0, d1, d2, d3, d4) -> (d2)>, 30 affine_map<(d0, d1, d2, d3, d4) -> (d3, d4)>] : 33 [affine_map<(d0, d1, d2) -> (d0, d1)>, 34 affine_map<(d0, d1, d2) -> (d2)>] : 38 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1, d2, d3, d4) -> (d0, d1, d2)> 39 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2, d3, d4) -> (d3, d4)> 50 %0 = linalg.tensor_reshape %arg0 [affine_map<(d0, d1, d2) -> (d0, d1, d2)>] : 63 %0 = linalg.reshape %arg0 [affine_map<(d0, d1, d2) -> (d0, d1, d2)>] : 77 [affine_map<(d0, d1, d2) -> (d0, d1)>, [all …]
|
D | reshape_fusion.mlir | 3 #map0 = affine_map<(d0, d1, d2) -> (d2, d0, d1)> 4 #map1 = affine_map<(d0, d1, d2) -> (d1, d2, d0)> 9 %0 = linalg.tensor_reshape %arg0 [affine_map<(i, j, k, l) -> (i)>, 10 affine_map<(i, j, k, l) -> (j, k)>, 11 affine_map<(i, j, k, l) -> (l)>] : 24 // CHECK-DAG: #[[MAP0:.+]] = affine_map<(d0, d1, d2, d3) -> (d0)> 25 // CHECK-DAG: #[[MAP1:.+]] = affine_map<(d0, d1, d2, d3) -> (d1)> 26 // CHECK-DAG: #[[MAP2:.+]] = affine_map<(d0, d1, d2, d3) -> (d2, d3)> 27 // CHECK-DAG: #[[MAP3:.+]] = affine_map<(d0, d1, d2, d3) -> (d3, d0, d1, d2)> 28 // CHECK-DAG: #[[MAP4:.+]] = affine_map<(d0, d1, d2, d3) -> (d2, d3, d0, d1)> [all …]
|
D | invalid.mlir | 11 func @slice_number_of_indexings(%arg0: memref<?x?xf32, affine_map<(i, j)[off, M]->(off + M * i + j)… 14 ….slice %arg0[%c0] : memref<?x?xf32, affine_map<(i, j)[off, M]->(off + M * i + j)>>, index, memref<… 19 func @slice_rank_vs_range_indices(%arg0: memref<?x?xf32, affine_map<(i, j)[off, M]->(off + M * i + … 22 …arg0[%c0, %c0] : memref<?x?xf32, affine_map<(i, j)[off, M]->(off + M * i + j)>>, index, index, mem… 36 func @yield_parent(%arg0: memref<?xf32, affine_map<(i)[off]->(off + i)>>) { 38 linalg.yield %arg0: memref<?xf32, affine_map<(i)[off]->(off + i)>> 46 indexing_maps = [ affine_map<() -> (0)> ], 56 indexing_maps = [ affine_map<() -> ()> ], 69 indexing_maps = [ affine_map<() -> (0)> ], 79 func @generic_one_d_view(%arg0: memref<?xf32, affine_map<(i)[off]->(off + i)>>) { [all …]
|
D | roundtrip.mlir | 18 // CHECK-DAG: #[[$strided1D:.*]] = affine_map<(d0)[s0] -> (d0 + s0)> 79 // CHECK-DAG: #[[$strided1D:.*]] = affine_map<(d0)[s0] -> (d0 + s0)> 80 // CHECK-DAG: #[[$strided2D:.*]] = affine_map<(d0, d1)[s0, s1] -> (d0 * s1 + s0 + d1)> 113 // CHECK-DAG: #[[$strided1D:.*]] = affine_map<(d0)[s0] -> (d0 + s0)> 125 // CHECK-DAG: #[[$strided3D:.*]] = affine_map<(d0, d1, d2)[s0, s1, s2] -> (d0 * s1 + s0 + d1 * s2 +… 126 // CHECK-DAG: #[[$strided3DT:.*]] = affine_map<(d0, d1, d2)[s0, s1, s2] -> (d2 * s1 + s0 + d1 * s2 … 129 … memref<?x?x?xf32, offset: ?, strides: [?, ?, 1]> to memref<?x?x?xf32, affine_map<(d0, d1, d2)[s0,… 138 // CHECK-DAG: #[[$strided3D:.*]] = affine_map<(d0, d1, d2)[s0, s1, s2] -> (d0 * s1 + s0 + d1 * s2 +… 150 // CHECK-DAG: #[[$strided1D:.*]] = affine_map<(d0)[s0] -> (d0 + s0)> 164 // CHECK-DAG: #[[$strided3D:.*]] = affine_map<(d0, d1, d2)[s0, s1, s2] -> (d0 * s1 + s0 + d1 * s2 +… [all …]
|
D | sparse_invalid.mlir | 5 affine_map<(i) -> (i)>, // a 6 affine_map<(i) -> (i)> // x (out) 30 affine_map<(i) -> (i)>, // a 31 affine_map<(i) -> (i)>, // x (out) 32 affine_map<(i) -> (i)> // y (out) 57 affine_map<(i) -> (i)>, // a 58 affine_map<(i) -> (i)> // x (out) 83 affine_map<(i) -> (i)> // a 103 affine_map<(i) -> (i)>, // a 104 affine_map<(i) -> (i)> // x (out) [all …]
|
D | fold-unit-trip-loops.mlir | 4 affine_map<(i, j, k, l, m) -> (i, k, m)>, 5 affine_map<(i, j, k, l, m) -> (i, k, j, l, m)> 23 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1, d2) -> (d0, 0, d2)> 24 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2) -> (d0, 0, d1, 0, d2)> 32 #map0 = affine_map<(i, j) -> (i, j)> 49 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<() -> (0, 0)> 57 #map0 = affine_map<(i, j) -> (i, j)> 75 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<() -> (0, 0)> 84 affine_map<(d0, d1) -> (d0, d1)>, 85 affine_map<(d0, d1) -> (d1)> [all …]
|
D | fold-affine-min-scf.mlir | 18 %1 = affine.min affine_map<(d0, d1)[] -> (2, d1 - d0)> (%i, %c4) 28 %1 = affine.min affine_map<(d0)[s0] -> (s0 - d0, 2)> (%i)[%c7] 38 %1 = affine.min affine_map<(d0)[s0] -> (2, s0 - d0)> (%i)[%c4] 48 %1 = affine.min affine_map<(d0) -> (1024, 16 - d0)> (%i) 53 // This example should simplify but affine_map is currently missing 61 %ub = affine.apply affine_map<(d0) -> (42 * d0)> (%step) 63 %1 = affine.min affine_map<(d0, d1, d2) -> (d0, d1 - d2)> (%step, %ub, %i) 68 // This example should simplify but affine_map is currently missing 70 // This example should simplify but affine_map is currently missing 78 %ub2 = affine.apply affine_map<(d0)[s0] -> (s0 * d0)> (%step)[%step] [all …]
|
D | fusion-tensor.mlir | 3 // CHECK-DAG: [[$MAP0:#[a-zA-Z0-9_]*]] = affine_map<(d0, d1) -> (d0, d1)> 4 #map0 = affine_map<(d0, d1) -> (d0, d1)> 36 // CHECK-DAG: [[$MAP0:#[a-zA-Z0-9_]*]] = affine_map<(d0, d1) -> (d0, d1)> 37 // CHECK-DAG: [[$MAP1:#[a-zA-Z0-9_]*]] = affine_map<(d0, d1) -> (d1, d0)> 38 #map0 = affine_map<(d0, d1) -> (d0, d1)> 39 #map1 = affine_map<(d0, d1) -> (d1, d0)> 63 // CHECK-DAG: [[$MAP0:#[a-zA-Z0-9_]*]] = affine_map<(d0, d1) -> (d0, d1)> 64 // CHECK-DAG: [[$MAP1:#[a-zA-Z0-9_]*]] = affine_map<(d0, d1) -> (d1, d0)> 65 #map0 = affine_map<(d0, d1) -> (d0, d1)> 66 #map1 = affine_map<(d0, d1) -> (d1, d0)> [all …]
|
D | canonicalize-duplicate-inputs.mlir | 5 #map = affine_map<(d0) -> (d0)> 7 // CHECK: #[[$MAP:.*]] = affine_map<(d0) -> (d0)> 26 #map0 = affine_map<(d0, d1) -> (d0, d1)> 27 #map1 = affine_map<(d0, d1) -> (d1, d0)> 29 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1) -> (d0, d1)> 30 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1) -> (d1, d0)> 47 #map0 = affine_map<(d0, d1) -> (d0, d1)> 48 #map1 = affine_map<(d0, d1) -> (d1, d0)> 50 // CHECK-DAG: #[[$MAP0:.*]] = affine_map<(d0, d1) -> (d0, d1)> 51 // CHECK-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1) -> (d1, d0)> [all …]
|
/external/llvm-project/mlir/test/Conversion/SCFToGPU/ |
D | parallel_loop.mlir | 14 …r = 1, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>}, {processor = 0, map = af… 18 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)> 19 // CHECK: #[[$MAP1:.*]] = affine_map<(d0)[s0, s1] -> (d0 * s0 + s1)> 59 {processor = 4, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>}, 60 {processor = 3, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>} 63 {processor = 1, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>}, 64 {processor = 0, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>} 69 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)> 70 // CHECK: #[[$MAP1:.*]] = affine_map<(d0)[s0, s1] -> (d0 * s0 + s1)> 112 {processor = 1, map = affine_map<(d0) -> (d0)>, bound = affine_map<(d0) -> (d0)>}, [all …]
|
/external/llvm-project/mlir/integration_test/Dialect/Vector/CPU/ |
D | test-contraction.mlir | 7 affine_map<(i) -> (i)>, 8 affine_map<(i) -> (i)>, 9 affine_map<(i) -> ()> 17 affine_map<(i, j) -> (i, j)>, 18 affine_map<(i, j) -> (j)>, 19 affine_map<(i, j) -> (i)> 27 affine_map<(i, j) -> (j, i)>, 28 affine_map<(i, j) -> (j)>, 29 affine_map<(i, j) -> (i)> 37 affine_map<(i, j, k) -> (i, k)>, [all …]
|
/external/llvm-project/mlir/test/Transforms/ |
D | memref-bound-check.mlir | 16 %idx0 = affine.apply affine_map<(d0, d1) -> (d0)>(%i, %j) 17 %idx1 = affine.apply affine_map<(d0, d1) -> (d1)>(%i, %j) 25 %idy = affine.apply affine_map<(d0, d1) -> (10*d0 - d1 + 19)>(%i, %j) 48 %idx0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128 + 1)>(%i, %j, %j) 49 %idx1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4 + 1)>(%i, %j, %j) 50 %idx2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4)>(%i, %j, %j) 55 %idy0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128)>(%i, %j, %j) 56 %idy1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4)>(%i, %j, %j) 57 %idy2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4 - 1)>(%i, %j, %j) 78 %idx0 = affine.apply affine_map<(d0, d1) -> ( 64 * (d0 ceildiv 64))>(%i, %j) [all …]
|
/external/tensorflow/tensorflow/compiler/mlir/xla/experimental/conv_emitter/ |
D | conv_emitter_transforms.cc | 48 builder.getUnknownLoc(), load.getMemRef(), new_affine.affine_map, in CloneWithNewAffineMap() 53 new_affine.affine_map, new_affine.operands); in CloneWithNewAffineMap() 118 BoundAffineMap affine_map = GetBoundAffineMapFrom(owner); in TileLoop() local 119 unsigned new_dim = affine_map.operands.size(); in TileLoop() 120 affine_map.operands.push_back(inner_loop.getInductionVar()); in TileLoop() 122 for (int i = 0; i < affine_map.affine_map.getNumDims(); i++) { in TileLoop() 123 if (affine_map.operands[i] == loop.getInductionVar()) { in TileLoop() 130 affine_map.affine_map = affine_map.affine_map.replaceDimsAndSymbols( in TileLoop() 131 replacements, {}, affine_map.operands.size(), 0); in TileLoop() 132 auto new_op = CloneWithNewAffineMap(owner, affine_map, OpBuilder(owner)); in TileLoop()
|