Home
last modified time | relevance | path

Searched refs:ceildiv (Results 1 – 19 of 19) sorted by relevance

/external/llvm-project/mlir/test/Dialect/Affine/SuperVectorize/
Dcompose_maps.mlir27 // CHECK: Composed map: (d0, d1)[s0, s1, s2, s3] -> ((d0 ceildiv s2) * s0, (d1 ceildiv s3) * s1)
28 …"test_affine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> (d0 ceildiv s0, d1 ceildiv s1)> …
40 … Composed map: (d0, d1)[s0, s1, s2, s3, s4, s5] -> ((d0 ceildiv s4) * s4 + d0 mod s2, (d1 ceildiv …
41 …ine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> ((d0 ceildiv s0) * s0, (d1 ceildiv s1) * …
47 // CHECK: Composed map: (d0, d1)[s0, s1] -> (d1 * s1, d0 ceildiv s0)
49 …"test_affine_map"() { affine_map = affine_map<(d0, d1)[s0, s1] -> (d0 * s1, d1 ceildiv s0)> } : ()…
58 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 ceildiv 8)> } : () -> ()
63 // CHECK: Composed map: (d0) -> ((d0 + 6) ceildiv 2)
67 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 ceildiv 8)> } : () -> ()
90 // CHECK: Composed map: (d0) -> ((d0 + 6) ceildiv 8)
[all …]
/external/llvm-project/mlir/test/Dialect/Affine/
Dloop-tiling-parametric.mlir14 // 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)>
43 // CHECK-DAG: [[UBO0:#map[0-9]+]] = affine_map<()[s0] -> (256 ceildiv s0)>
44 // CHECK-DAG: [[UBO1:#map[0-9]+]] = affine_map<()[s0] -> (512 ceildiv s0)>
45 // CHECK-DAG: [[UBO2:#map[0-9]+]] = affine_map<()[s0] -> (1024 ceildiv s0)>
70 …: [[UBO0:#map[0-9]+]] = affine_map<()[s0, s1, s2] -> (s0 ceildiv s2, (4096 floordiv s1) ceildiv s2…
90 …: [[UBO0:#map[0-9]+]] = affine_map<()[s0, s1, s2] -> (s0 ceildiv s2, (4096 floordiv s1) ceildiv s2…
112 // CHECK-DAG: [[UBO1:#map[0-9]+]] = affine_map<()[s0, s1] -> ((s0 + 8) ceildiv s1 + 8)>
113 // CHECK-DAG: [[UBO0:#map[0-9]+]] = affine_map<()[s0] -> (248 ceildiv s0 + 8)>
[all …]
Dsimplify-affine-structures.mlir305 // Tests the simplification of a semi-affine expression with a ceildiv operation and a division of …
308 …p<(d0)[s0] ->((-((d0 floordiv s0) * s0) + s0 * 42 + ((5-5) floordiv s0)) ceildiv s0)> (%arg0)[%ar…
313 …f a semi-affine expression with a nested ceildiv operation and further simplifications after perfo…
316 …%a = affine.apply affine_map<(d0)[s0] ->(((((s0 * 2) ceildiv 4) * 5) + s0 * 42) ceildiv s0)> (%arg…
Dcanonicalize.mlir14 // 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…
20 // CHECK-DAG: [[$MAP11:#map[0-9]+]] = affine_map<(d0) -> ((d0 + 3) ceildiv 3)>
24 // CHECK-DAG: [[$MAP13A:#map[0-9]+]] = affine_map<(d0) -> ((d0 + 6) ceildiv 8)>
39 …$MAP_mix_dims_and_symbols_d:#map[0-9]+]] = affine_map<()[s0, s1] -> ((s1 + s0 * 42 + 6) ceildiv 8)>
131 %x0 = affine.apply affine_map<(d0)[s0] -> (d0 ceildiv s0)> (%i0)[%c4]
133 %x1 = affine.apply affine_map<(d0)[s0] -> (d0 ceildiv s0)> (%i1)[%c8]
191 %x11 = affine.apply affine_map<(d0, d1)[s0, s1] -> (d1 ceildiv s0)>
210 %d0 = affine.apply affine_map<(d0, d1) -> (d0 ceildiv 8)> (%b, %c)
326 %d = affine.apply affine_map<()[s0] -> (s0 ceildiv 8)> ()[%b]
[all …]
Daffine-loop-normalize.mlir74 // 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)>
105 // CHECK-DAG: [[$OUTERUB:#map[0-9]+]] = affine_map<()[s0] -> ((s0 - 2) ceildiv 32)>
134 // CHECK-DAG: [[$INTERUB:#map[0-9]+]] = affine_map<()[s0] -> (s0 ceildiv 32)>
Dmemref-stride-calculation.mlir66 %102 = alloc() : memref<3x4x5xf32, affine_map<(i, j, k)->(i ceildiv 4 + j + k)>>
67 // CHECK: MemRefType memref<3x4x5xf32, affine_map<(d0, d1, d2) -> (d0 ceildiv 4 + d1 + d2)>> cannot…
Dconstant-fold.mlir13 %x1 = affine.apply affine_map<(d0, d1)[S0] -> (128 * (S0 ceildiv 128))>
/external/llvm-project/mlir/test/IR/
Dinvalid-affinemap.mlir56 #hello_world = affine_map<(i, j) [s0, s1] -> (ceildiv i 2, j)> // expected-error {{missing left ope…
73 #hello_world = affine_map<(i, j) [s0, s1] -> (i, ceildiv j+5)> // expected-error {{missing left ope…
82 #hello_world = affine_map<(i, j) [s0, s1] -> (i, j + j ceildiv 128 mod 16 * i - 4)> // expected-err…
88 …fine_map<(i, j) [s0, s1] -> (i, i*2 ceildiv j*5)> // expected-error {{non-affine expression: right…
Daffine-map.mlir105 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1)[s0, s1] -> (d0, d1 ceildiv 5)>
106 #map26 = affine_map<(i, j)[s0, s1] -> (i, j ceildiv 5)>
128 #map36 = affine_map<(i, j) -> (5+3, 2*2, 8-7, 100 floordiv 32, 5 mod 3, 10 ceildiv 3)>
130 #map37 = affine_map<(i, j) -> (5 mod 3 + 2, 5*3 - 4, 128 * (500 ceildiv 128), 40 floordiv 7 * 3)>
138 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1)[s0] -> ((d0 * 5) floordiv 4, (d1 ceildiv 7) mod s0)>
139 #map43 = affine_map<(i, j) [s0] -> ( i * 5 floordiv 4, j ceildiv 7 mod s0)>
152 #map47 = affine_map<(i, j, k) -> (i * 64 ceildiv 64, i * 512 ceildiv 128, 4 * j mod 4, 4*j*4 mod 8,…
154 // floordiv should resolve similarly to ceildiv and be unique'd out.
162 // Floordiv, ceildiv divide by one.
164 #map50 = affine_map<(i, j)[s0] -> ( (i * 2 + 1) ceildiv 1, (j + s0) floordiv 1)>
[all …]
/external/llvm-project/mlir/test/Transforms/
Dmemref-bound-check.mlir50 %idx2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 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)
99 %idx2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4)>(%i, %j, %j)
106 %idy2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4 - 1)>(%i, %j, %j)
120 %idx1 = affine.apply affine_map<(d0, d1) -> ((((d1 mod 128) mod 32) ceildiv 4) * 32)>(%i, %j)
Dconstant-fold.mlir264 %x1 = affine.apply affine_map<(d0, d1)[S0] -> (128 * (S0 ceildiv 128))>
Dloop-fusion.mlir7 // *) Add a test w/ floordiv/ceildiv/mod when supported in dependence check.
/external/llvm-project/mlir/docs/Dialects/
DAffine.md97 | affine-expr `ceildiv` integer-literal
108 `ceildiv` is the ceiling function which maps the result of the division of its
114 usage. The `integer-literal` operand for ceildiv, floordiv, and mod is always
119 ceildiv, and (4) addition and subtraction. All of these operators associate from
133 allow 'floordiv', 'ceildiv', and 'mod' with respect to positive integer
204 `floordiv`, `ceildiv`, and `mod` with respect to symbolic identifiers.
214 | semi-affine-expr `ceildiv` symbol-or-const
/external/llvm-project/mlir/test/Conversion/SCFToGPU/
Dparallel_loop.mlir18 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)>
69 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)>
118 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)>
169 // CHECK: #[[$MAP0:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)>
245 // CHECK: #[[$MAP1:.*]] = affine_map<(d0)[s0, s1] -> ((d0 - s0) ceildiv s1)>
/external/llvm-project/mlir/lib/Parser/
DTokenKinds.def82 TOK_KEYWORD(ceildiv)
/external/llvm-project/mlir/unittests/SDBM/
DSDBMTest.cpp438 auto ceildiv = d1.ceilDiv(c2); in TEST() local
446 EXPECT_FALSE(SDBMExpr::tryConvertAffineExpr(ceildiv).hasValue()); in TEST()
/external/llvm-project/mlir/test/Conversion/AffineToStandard/
Dlower-affine.mlir486 #mapceildiv = affine_map<(i) -> (i ceildiv 42)>
/external/llvm-project/mlir/docs/
DLangRef.md1058 // The allocation size will be (%M ceildiv %B1) * %B1 * (%N ceildiv %B2) * %B2
/external/llvm-project/mlir/docs/Rationale/
DRationale.md231 than `(3 x 57) ceildiv 8 = 22` bytes as can be naively computed from the