/external/llvm-project/mlir/test/Transforms/ |
D | memref-bound-check.mlir | 49 %idx1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4 + 1)>(%i, %j, %j) 56 %idy1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4)>(%i, %j, %j) 83 %idy = affine.apply affine_map<(d0, d1) -> (d0 floordiv 256)>(%i, %i) 98 %idx1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4 + 1)>(%i, %j, %j) 105 %idy1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4)>(%i, %j, %j) 113 // Tests with nested mod's and floordiv's. 119 %idx0 = affine.apply affine_map<(d0, d1) -> ((d0 mod 1024) floordiv 4)>(%i, %j) 142 %idx0 = affine.apply affine_map<(d0) -> ((d0 mod 147456) floordiv 1152)> (%ii) 143 %idx1 = affine.apply affine_map<(d0) -> (((d0 mod 147456) mod 1152) floordiv 384)> (%ii) 160 (d0 floordiv (2 * 3 * 3 * 128 * 128))> (%a0) [all …]
|
D | normalize-memrefs-ops.mlir | 12 #map0 = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2 floordiv 32, d3 floordiv 64, d2 mod 32, d3 mod 6… 61 #map_tile = affine_map<(d0, d1, d2, d3) -> (d0, d1, d2 floordiv 32, d3 floordiv 32, d2 mod 32, d3 m…
|
D | pipeline-data-transfer.mlir | 67 // CHECK-DAG: [[$FLOOR_MOD_2:#map[0-9]+]] = affine_map<(d0) -> ((d0 floordiv 4) mod 2)> 89 …affine.dma_start %{{.*}}[%{{.*}}], %{{.*}}[(%{{.*}} floordiv 4) mod 2, 0], [[TAG]][(%{{.*}} floord… 91 …affine.dma_start %{{.*}}[%{{.*}}], %{{.*}}[(%{{.*}} floordiv 4) mod 2, 0], [[TAG]][(%{{.*}} floord… 94 // CHECK: affine.dma_wait [[TAG]][(%{{.*}} floordiv 4) mod 2, 0], %{{.*}} : memref<2x1xi32> 99 // CHECK: affine.dma_wait [[TAG]][(%{{.*}} floordiv 4) mod 2, 0], %{{.*}} : memref<2x1xi32> 108 #map1 = affine_map<(d0, d1) -> ((d0 * 2048 + d1 * 256) floordiv 32)> 109 #map2 = affine_map<(d0) -> ((d0 * 2048) floordiv 32)> 202 #map2 = affine_map<(d0) -> ((d0 * 2048) floordiv 32)>
|
D | normalize-memrefs.mlir | 74 …%A = alloc() : memref<64x512xf32, affine_map<(d0, d1) -> (d0 floordiv 8, d1 floordiv 16, d0 mod 8,… 75 …// CHECK: affine.load %{{.*}}[symbol(%arg0) floordiv 8, symbol(%arg0) floordiv 16, symbol(%arg0) m… 76 …d %A[%idx, %idx] : memref<64x512xf32, affine_map<(d0, d1) -> (d0 floordiv 8, d1 floordiv 16, d0 mo… 149 #tile = affine_map < (i)->(i floordiv 4, i mod 4) >
|
D | loop-fusion.mlir | 7 // *) Add a test w/ floordiv/ceildiv/mod when supported in dependence check. 511 // CHECK-DAG: [[$MAP1:#map[0-9]+]] = affine_map<(d0) -> (d0 floordiv 4)> 521 affine.store %v, %out[%i0 floordiv 4, %i0 mod 4] : memref<16x4xf32> 540 // CHECK-DAG: [[$MAP0:#map[0-9]+]] = affine_map<(d0) -> (d0 floordiv 4)> 604 %0 = affine.apply affine_map<(d0) -> (d0 floordiv (2 * 3 * 3 * 16 * 1))>(%a0) 605 %1 = affine.apply affine_map<(d0) -> ((d0 mod 288) floordiv (3 * 3 * 16 * 1))>(%a0) 606 %2 = affine.apply affine_map<(d0) -> (((d0 mod 288) mod 144) floordiv (3 * 16 * 1))>(%a0) 607 %3 = affine.apply affine_map<(d0) -> ((((d0 mod 288) mod 144) mod 48) floordiv (16 * 1))>(%a0) 627 // CHECK-DAG: [[$MAP0:#map[0-9]+]] = affine_map<(d0, d1) -> ((d0 * 9 + d1) floordiv 288)> 628 // CHECK-DAG: [[$MAP1:#map[0-9]+]] = affine_map<(d0, d1) -> (((d0 * 9 + d1) mod 288) floordiv 144)> [all …]
|
/external/llvm-project/mlir/test/IR/ |
D | affine-map.mlir | 102 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1)[s0, s1] -> (d0, d1 floordiv 5)> 103 #map25 = affine_map<(i, j)[s0, s1] -> (i, j floordiv 5)> 120 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1)[s0, s1] -> (d0, d1 floordiv s0, d1 mod s0)> 121 #map34 = affine_map<(i, j)[s0, s1] -> (i, j floordiv s0, j mod s0)> 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)> 141 // CHECK: #map{{[0-9]+}} = affine_map<(d0, d1) -> (d0 - d1 * 2, (d1 * 6) floordiv 4)> 142 #map44 = affine_map<(i, j) -> (i - 2*j, j * 6 floordiv 4)> [all …]
|
D | invalid-affinemap.mlir | 53 #hello_world = affine_map<(i, j) [s0, s1] -> (floordiv i 2, j)> // expected-error {{missing left op… 70 #hello_world = affine_map<(i, j) [s0, s1] -> (i, floordiv j+5)> // expected-error {{missing left op… 85 …affine_map<(i, j) [s0, s1] -> (i, j floordiv i)> // expected-error {{non-affine expression: right …
|
/external/llvm-project/mlir/test/Dialect/Affine/ |
D | simplify-affine-structures.mlir | 140 d3 - (d5 + 97*d0) floordiv 423 >= 0, 141 234* (d0 + d3 mod 5 floordiv 2342) mod 2309 142 + (d0 + 2038*d3) floordiv 208 >= 0, 143 239* (d0 + 2300 * d3) floordiv 2342 146 mod 2038 mod 2390 mod 2039 floordiv 55 >= 0 252 affine.if affine_set<(d0, d1) : (d0 mod 2 - 1 == 0, d0 - 2 * (d0 floordiv 2) == 0)>(%a, %b) { 286 // CHECK-DAG: #[[$map0:.*]] = affine_map<()[s0, s1] -> (-(s1 floordiv s0) + 2)> 287 // CHECK-DAG: #[[$map1:.*]] = affine_map<()[s0, s1] -> (-(s1 floordiv s0) + 42)> 289 // Tests the simplification of a semi-affine expression with a modulo operation on a floordiv and m… 292 …%a = affine.apply affine_map<(d0)[s0] ->((-((d0 floordiv s0) * s0) + s0 * s0) mod s0)> (%arg0)[%ar… [all …]
|
D | canonicalize.mlir | 14 // CHECK-DAG: [[$MAP8:#map[0-9]+]] = affine_map<(d0, d1) -> (d1 + (d0 ceildiv 4) * 4 - (d1 floordiv… 15 …AG: [[$MAP8a:#map[0-9]+]] = affine_map<(d0, d1) -> (d1 + (d0 ceildiv 8) * 8 - (d1 floordiv 8) * 8)> 25 // CHECK-DAG: [[$MAP13B:#map[0-9]+]] = affine_map<(d0) -> ((d0 * 4 - 4) floordiv 3)> 40 …ix_dims_and_symbols_e:#map[0-9]+]] = affine_map<()[s0, s1] -> ((s1 * 4 + s0 * 168 - 4) floordiv 3)> 43 // CHECK-DAG: [[$symbolic_semi_affine:#map[0-9]+]] = affine_map<(d0)[s0] -> (d0 floordiv (s0 + 1))> 211 %d1 = affine.apply affine_map<(d0, d1) -> (d1 floordiv 3)> (%b, %c) 337 %e = affine.apply affine_map<(d0) -> (d0 floordiv 3)> (%c) 348 %e = affine.apply affine_map<(d0) -> (d0 floordiv 3)> (%c) 372 %2 = affine.apply affine_map<(d0)[s0] -> (d0 floordiv s0)> (%i0)[%1] 518 %0 = affine.min affine_map<(d0)[s0] -> (1000, d0 floordiv 4, (s0 mod 5) + 1)> (%c20)[%c3] [all …]
|
D | load-store.mlir | 76 %1 = affine.load %0[(%i0 + symbol(%arg0)) floordiv 3 + 11, 78 affine.store %1, %0[(%i0 + symbol(%arg0)) floordiv 3 + 11, 80 // CHECK: %{{.*}} = affine.load %{{.*}}[(%{{.*}} + symbol(%{{.*}})) floordiv 3 + 11, (%{{.*}} + sym… 81 // CHECK: affine.store %{{.*}}, %{{.*}}[(%{{.*}} + symbol(%{{.*}})) floordiv 3 + 11, (%{{.*}} + sym…
|
D | unroll-jam.mlir | 5 // CHECK-DAG: [[$MAP_DIV_OFFSET:#map[0-9]+]] = affine_map<()[s0] -> (((s0 - 1) floordiv 2) * 2 + 1)> 6 …[[$MAP_MULTI_RES:#map[0-9]+]] = affine_map<()[s0, s1] -> ((s0 floordiv 2) * 2, (s1 floordiv 2) * 2…
|
D | dma.mlir | 102 affine.dma_start %0[(%i0 + symbol(%arg0)) floordiv 3, %i1], 107 // CHECK: affine.dma_start %{{.*}}[(%{{.*}} + symbol(%{{.*}})) floordiv 3, %{{.*}}], %{{.*}}[%{{.*}…
|
D | loop-tiling-parametric.mlir | 69 // CHECK-DAG: [[UBI0:#map[0-9]+]] = affine_map<(d0)[s0, s1, s2] -> (d0 * s2 + s2, s0, 4096 floordiv… 70 // CHECK-DAG: [[UBO0:#map[0-9]+]] = affine_map<()[s0, s1, s2] -> (s0 ceildiv s2, (4096 floordiv s1)… 73 #ub = affine_map<()[s0, s1] -> (s0, 4096 floordiv s1)> 89 …DAG: [[UBI0:#map[0-9]+]] = affine_map<(d0)[s0, s1, s2] -> (d0 * s2 + s2 * 4, s0, 4096 floordiv s1)> 90 // CHECK-DAG: [[UBO0:#map[0-9]+]] = affine_map<()[s0, s1, s2] -> (s0 ceildiv s2, (4096 floordiv s1)… 93 #ub = affine_map<()[s0, s1] -> (s0, 4096 floordiv s1)>
|
D | dma-generate.mlir | 492 #map_acc = affine_map<(d0) -> (d0 floordiv 8)> 514 // CHECK: affine.dma_start %{{.*}}[%{{.*}} floordiv 8], [[BUF]] 522 … = affine_map<(d0, d1) -> ((d0 + d1 * 72) floordiv 2304 + ((((d0 + d1 * 72) mod 2304) mod 1152) mo… 523 …od 2304) floordiv 1152) * 1151 - ((((d0 + d1 * 72) mod 2304) mod 1152) floordiv 9) * 9 - (((((d0 +… 524 #map16 = affine_map<(d0, d1) -> (((((d0 + d1 * 72) mod 2304) mod 1152) floordiv 9) floordiv 8)>
|
/external/llvm-project/mlir/test/Dialect/Affine/SuperVectorize/ |
D | compose_maps.mlir | 76 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 floordiv 3)> } : () -> () 81 // CHECK: Composed map: (d0) -> ((d0 * 4) floordiv 3 + 8) 85 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 floordiv 3)> } : () -> () 98 // CHECK: Composed map: (d0) -> ((d0 * 4 - 4) floordiv 3) 101 "test_affine_map"() { affine_map = affine_map<(d0) -> (d0 floordiv 3)> } : () -> ()
|
/external/tensorflow/tensorflow/python/kernel_tests/ |
D | division_future_test.py | 64 floordiv = x // y 66 check(floordiv, tf_floordiv)
|
D | division_past_test.py | 63 floordiv = x // y 65 check(floordiv, tf_floordiv)
|
D | cwise_ops_binary_test.py | 191 if tf_func not in (_FLOORDIV, math_ops.floordiv, math_ops.zeta, 208 self._compareBoth(x, y + 0.1, np.floor_divide, math_ops.floordiv) 275 self._compareBoth(x, y + 0.1, np.floor_divide, math_ops.floordiv) 322 self._compareBoth(x, y, np.floor_divide, math_ops.floordiv) 333 self._compareBoth(x, y, np.floor_divide, math_ops.floordiv) 356 self._compareBoth(x, y, np.floor_divide, math_ops.floordiv) 429 if tf_func not in (_FLOORDIV, math_ops.floordiv): 457 tf_func in (_FLOORDIV, math_ops.floordiv)): 487 (np.floor_divide, math_ops.floordiv),
|
/external/llvm-project/mlir/test/Dialect/Linalg/ |
D | fold-affine-min-scf.mlir | 54 // semi-affine canonicalizations: `((s0 * 42 - 1) floordiv s0) * s0` 71 // semi-affine canonicalizations: ` -(((s0 * s0 - 1) floordiv s0) * s0)` 119 // (d0)[s0] -> (s0 mod s0, (-((d0 floordiv s0) * s0) + s0 * 42) mod s0) 134 // (d0)[s0] -> (s0 mod s0, (-((d0 floordiv s0) * s0) + s0 * s0) mod s0)
|
/external/tensorflow/tensorflow/python/ops/ragged/ |
D | ragged_operators.py | 73 ragged_tensor.RaggedTensor.__floordiv__ = math_ops.floordiv 74 ragged_tensor.RaggedTensor.__rfloordiv__ = _right(math_ops.floordiv)
|
D | ragged_tensor_test_ops.py | 92 math_ops.floordiv,
|
/external/python/cpython3/Objects/ |
D | floatobject.c | 616 _float_div_mod(double vx, double wx, double *floordiv, double *mod) in _float_div_mod() argument 642 *floordiv = floor(div); in _float_div_mod() 643 if (div - *floordiv > 0.5) { in _float_div_mod() 644 *floordiv += 1.0; in _float_div_mod() 649 *floordiv = copysign(0.0, vx / wx); /* zero w/ sign of vx/wx */ in _float_div_mod() 657 double mod, floordiv; in float_divmod() local 664 _float_div_mod(vx, wx, &floordiv, &mod); in float_divmod() 665 return Py_BuildValue("(dd)", floordiv, mod); in float_divmod() 672 double mod, floordiv; in float_floor_div() local 679 _float_div_mod(vx, wx, &floordiv, &mod); in float_floor_div() [all …]
|
/external/llvm-project/mlir/docs/Dialects/ |
D | Affine.md | 98 | affine-expr `floordiv` integer-literal 110 equal to that result. `floordiv` is a function which maps the result of the 114 usage. The `integer-literal` operand for ceildiv, floordiv, and mod is always 118 parenthesization, (2) negation, (3) modulo, multiplication, floordiv, and 133 allow 'floordiv', 'ceildiv', and 'mod' with respect to positive integer 191 #affine_map42 = affine_map<(d0, d1)[s0] -> (d0, d0 + d1 + s0 floordiv 2)> 198 %b = alloc()[%N] : memref<4x4xf32, affine_map<(d0, d1)[s0] -> (d0, d0 + d1 + s0 floordiv 2)>> 204 `floordiv`, `ceildiv`, and `mod` with respect to symbolic identifiers. 215 | semi-affine-expr `floordiv` symbol-or-const
|
/external/tensorflow/tensorflow/python/lib/core/ |
D | bfloat16.cc | 858 float floordiv; in divmod() local 860 floordiv = std::floor(div); in divmod() 861 if (div - floordiv > 0.5f) { in divmod() 862 floordiv += 1.0f; in divmod() 865 floordiv = std::copysign(0.0f, a / b); in divmod() 867 return {floordiv, mod}; in divmod() 894 float floordiv, mod; in Call() local 895 std::tie(floordiv, mod) = in Call() 897 *reinterpret_cast<bfloat16*>(o0) = bfloat16(floordiv); in Call()
|
/external/python/cpython3/Lib/test/ |
D | test_abstract_numbers.py | 38 self.assertRaises(TypeError, operator.floordiv, c1, c2)
|