Home
last modified time | relevance | path

Searched refs:quotient (Results 1 - 25 of 44) sorted by relevance

12

/third_party/musl/libc-test/src/functionalext/supplement/math/math_gtest/
H A Dmath_remquo_test.cpp39 int quotient; in HWTEST_F() local
40 double result = remquo(15.0, 6.0, &quotient); in HWTEST_F()
41 EXPECT_EQ(2, quotient); in HWTEST_F()
52 int quotient; in HWTEST_F() local
53 EXPECT_TRUE(isnan(remquo(nan(""), 15.0, &quotient))); in HWTEST_F()
54 EXPECT_TRUE(isnan(remquo(11.0, nan(""), &quotient))); in HWTEST_F()
64 int quotient; in HWTEST_F() local
65 EXPECT_TRUE(isnan(remquo(HUGE_VAL, 15.0, &quotient))); in HWTEST_F()
66 EXPECT_TRUE(isnan(remquo(-HUGE_VAL, 11.0, &quotient))); in HWTEST_F()
76 int quotient; in HWTEST_F() local
105 int quotient; HWTEST_F() local
118 int quotient; HWTEST_F() local
130 int quotient; HWTEST_F() local
142 int quotient; HWTEST_F() local
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dgregoimp.cpp37 double quotient; in floorDivide() local
38 quotient = uprv_floor(numerator / denominator); in floorDivide()
39 remainder = (int32_t) (numerator - (quotient * denominator)); in floorDivide()
40 return (int32_t) quotient; in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide() local
48 remainder = dividend - (quotient * divisor); in floorDivide()
50 // is a bug such that the quotient is off by one. If you doubt in floorDivide()
56 double q = quotient; in floorDivide()
57 quotient += (remainder < 0) ? -1 : +1; in floorDivide()
58 if (q == quotient) { in floorDivide()
[all...]
H A Ddouble-conversion-bignum.cpp554 int quotient = this_bigit / other_bigit;
555 RawBigit(used_bigits_ - 1) = this_bigit - other_bigit * quotient;
556 DOUBLE_CONVERSION_ASSERT(quotient < 0x10000);
557 result += static_cast<uint16_t>(quotient);
/third_party/icu/icu4c/source/i18n/
H A Dgregoimp.cpp39 double quotient = uprv_floor(numerator / denominator); in floorDivide() local
44 *remainder = (int32_t) (uprv_floor(numerator) - (quotient * denominator)); in floorDivide()
45 return (int32_t) quotient; in floorDivide()
52 double quotient = floorDivide(dividend, divisor); in floorDivide() local
53 *remainder = dividend - (quotient * divisor); in floorDivide()
55 // is a bug such that the quotient is off by one. If you doubt in floorDivide()
61 double q = quotient; in floorDivide()
62 quotient += (*remainder < 0) ? -1 : +1; in floorDivide()
63 if (q == quotient) { in floorDivide()
75 *remainder = dividend - (quotient * diviso in floorDivide()
[all...]
H A Ddouble-conversion-bignum.cpp555 int quotient = this_bigit / other_bigit;
556 RawBigit(used_bigits_ - 1) = this_bigit - other_bigit * quotient;
557 DOUBLE_CONVERSION_ASSERT(quotient < 0x10000);
558 result += static_cast<uint16_t>(quotient);
/third_party/node/deps/icu-small/source/i18n/
H A Dgregoimp.cpp39 double quotient = uprv_floor(numerator / denominator); in floorDivide() local
45 *remainder = (int32_t) (uprv_floor(numerator) - (quotient * denominator)); in floorDivide()
47 return (int32_t) quotient; in floorDivide()
54 double quotient = floorDivide(dividend, divisor); in floorDivide() local
55 double r = dividend - (quotient * divisor); in floorDivide()
57 // is a bug such that the quotient is off by one. If you doubt in floorDivide()
63 double q = quotient; in floorDivide()
64 quotient += (r < 0) ? -1 : +1; in floorDivide()
65 if (q == quotient) { in floorDivide()
77 r = dividend - (quotient * diviso in floorDivide()
[all...]
H A Ddouble-conversion-bignum.cpp555 int quotient = this_bigit / other_bigit;
556 RawBigit(used_bigits_ - 1) = this_bigit - other_bigit * quotient;
557 DOUBLE_CONVERSION_ASSERT(quotient < 0x10000);
558 result += static_cast<uint16_t>(quotient);
/third_party/protobuf/src/google/protobuf/stubs/
H A Dint128.cc96 uint128 quotient = 0; in DivModImpl() local
98 quotient <<= 1; in DivModImpl()
102 quotient += 1; in DivModImpl()
106 //record the final quotient and remainder in DivModImpl()
107 *quotient_ret = quotient; in DivModImpl()
114 uint128 quotient = 0; in operator /=() local
116 DivModImpl(*this, divisor, &quotient, &remainder); in operator /=()
117 *this = quotient; in operator /=()
121 uint128 quotient = 0; in operator %=() local
123 DivModImpl(*this, divisor, &quotient, in operator %=()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/
H A Dint128.cc73 uint128 quotient = 0; in DivModImpl() local
82 quotient <<= 1; in DivModImpl()
85 quotient |= 1; in DivModImpl()
90 *quotient_ret = quotient; in DivModImpl()
143 uint128 quotient = 0;
145 DivModImpl(lhs, rhs, &quotient, &remainder);
146 return quotient;
150 uint128 quotient = 0;
152 DivModImpl(lhs, rhs, &quotient, &remainder);
265 uint128 quotient
[all...]
/third_party/mesa3d/src/util/
H A Dfast_idiv_by_const.c86 /* The remainder and quotient of our power of 2 divided by d */ in util_compute_fast_udiv_info()
87 uint64_t quotient = initial_power_of_2 / D; in util_compute_fast_udiv_info() local
115 quotient = quotient * 2 + 1; in util_compute_fast_udiv_info()
119 quotient = quotient * 2; in util_compute_fast_udiv_info()
137 down_multiplier = quotient; in util_compute_fast_udiv_info()
144 result.multiplier = quotient + 1; in util_compute_fast_udiv_info()
/third_party/node/deps/v8/src/bigint/
H A Ddigit-arithmetic.h117 // Returns the quotient.
118 // quotient = (high << kDigitBits + low - remainder) / divisor
126 digit_t quotient; in digit_div()
129 // Outputs: {quotient} will be in rax, {rem} in rdx. in digit_div()
130 : "=a"(quotient), "=d"(rem) in digit_div()
135 return quotient; in digit_div()
137 digit_t quotient; in digit_div()
140 // Outputs: {quotient} will be in eax, {rem} in edx. in digit_div()
141 : "=a"(quotient), "=d"(rem) in digit_div()
146 return quotient; in digit_div()
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_idiv.c133 /* Get initial estimate for quotient/remainder, then refine the estimate in emit_udiv()
135 nir_ssa_def *quotient = nir_umul_high(bld, numer, rcp); in emit_udiv() local
136 nir_ssa_def *num_s_remainder = nir_imul(bld, quotient, denom); in emit_udiv()
142 quotient = nir_bcsel(bld, remainder_ge_den, in emit_udiv()
143 nir_iadd_imm(bld, quotient, 1), quotient); in emit_udiv()
154 return nir_bcsel(bld, remainder_ge_den, nir_iadd_imm(bld, quotient, 1), in emit_udiv()
155 quotient); in emit_udiv()
218 /* Get remainder given the quotient */ in convert_instr_small()
/third_party/protobuf/js/binary/
H A Darith.js222 * 64-bit quotient and a 32-bit remainder.
224 * @return {Array<jspb.arith.UInt64>} array of [quotient, remainder],
235 var quotient = new jspb.arith.UInt64(0, 0);
248 // If divisor < remainder, add unit to quotient and subtract divisor from
251 quotient = quotient.add(unit);
259 return [quotient, remainder];
273 var quotient = divResult[0], remainder = divResult[1];
275 num = quotient;
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DGrego.java196 long quotient = ((numerator + 1) / denominator) - 1; in floorDivide()
197 remainder[0] = numerator - (quotient * denominator); in floorDivide()
198 return quotient; in floorDivide()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DGrego.java198 long quotient = ((numerator + 1) / denominator) - 1; in floorDivide()
199 remainder[0] = numerator - (quotient * denominator); in floorDivide()
200 return quotient; in floorDivide()
/third_party/openssl/test/
H A Dbntests.pl68 my $quotient = bn($s{'Quotient'});
74 $b->bmul($quotient);
88 return if $rempassed && $quotient == $a;
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dfixed-dtoa.cc335 // The quotient delivers the first digits, and the remainder fits into a 64 in FastFixedDtoa()
342 uint32_t quotient; in FastFixedDtoa() local
345 // Then need q (quotient) and r (remainder) as follows: in FastFixedDtoa()
356 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
360 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
363 FillDigits32(quotient, buffer, length); in FastFixedDtoa()
H A Dbignum.cc541 int quotient = this_bigit / other_bigit;
542 RawBigit(used_bigits_ - 1) = this_bigit - other_bigit * quotient;
543 DOUBLE_CONVERSION_ASSERT(quotient < 0x10000);
544 result += static_cast<uint16_t>(quotient);
/third_party/node/deps/v8/src/base/numbers/
H A Dfixed-dtoa.cc300 // The quotient delivers the first digits, and the remainder fits into a 64 in FastFixedDtoa()
307 uint32_t quotient; in FastFixedDtoa() local
310 // Then need q (quotient) and r (remainder) as follows: in FastFixedDtoa()
321 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
325 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
328 FillDigits32(quotient, buffer, length); in FastFixedDtoa()
H A Dbignum.cc486 int quotient = this_bigit / other_bigit; in DivideModuloIntBignum() local
487 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; in DivideModuloIntBignum()
488 result += quotient; in DivideModuloIntBignum()
/third_party/node/deps/v8/src/compiler/
H A Dmachine-operator-reducer.cc253 Node* quotient = graph()->NewNode(machine()->Int32MulHigh(), dividend, in Int32Div() local
256 quotient = Int32Add(quotient, dividend); in Int32Div()
258 quotient = Int32Sub(quotient, dividend); in Int32Div()
260 return Int32Add(Word32Sar(quotient, mag.shift), Word32Shr(dividend, 31)); in Int32Div()
273 Node* quotient = graph()->NewNode(machine()->Uint32MulHigh(), dividend, in Uint32Div() local
277 quotient = Word32Shr( in Uint32Div()
278 Int32Add(Word32Shr(Int32Sub(dividend, quotient), 1), quotient), in Uint32Div()
1141 Node* quotient = dividend; ReduceInt32Div() local
1219 Node* quotient = Int32Div(dividend, divisor); ReduceInt32Mod() local
1248 Node* quotient = Uint32Div(dividend, divisor); ReduceUint32Mod() local
[all...]
/third_party/skia/src/codec/
H A DSkBmpStandardCodec.cpp332 int quotient; in decodeIcoMask() local
334 SkTDivMod(srcX, 8, &quotient, &modulus); in decodeIcoMask()
336 uint64_t alphaBit = (this->srcBuffer()[quotient] >> shift) & 0x1; in decodeIcoMask()
/third_party/skia/third_party/externals/abseil-cpp/absl/time/
H A Dclock.cc375 uint64_t quotient = 0;
377 quotient = (a << safe_shift) / scaled_b;
379 return quotient;
/third_party/mbedtls/library/
H A Dbignum.c1295 mbedtls_t_udbl dividend, quotient; in mbedtls_int_div_int() local
1299 mbedtls_mpi_uint d0, d1, q0, q1, rAX, r0, quotient; in mbedtls_int_div_int()
1318 quotient = dividend / d; in mbedtls_int_div_int()
1319 if (quotient > ((mbedtls_t_udbl) 1 << biL) - 1) { in mbedtls_int_div_int()
1320 quotient = ((mbedtls_t_udbl) 1 << biL) - 1; in mbedtls_int_div_int()
1324 *r = (mbedtls_mpi_uint) (dividend - (quotient * d)); in mbedtls_int_div_int()
1327 return (mbedtls_mpi_uint) quotient; in mbedtls_int_div_int()
1352 * Find the first quotient and remainder in mbedtls_int_div_int()
1383 quotient = q1 * radix + q0; in mbedtls_int_div_int()
1385 return quotient; in mbedtls_int_div_int()
[all...]
/third_party/decimal.js/test/modules/
H A Ddiv.js15 var quotient = new Decimal(dividend).div(divisor);
16 T.assertEqual(expected, quotient.isZero() && quotient.isNegative());

Completed in 23 milliseconds

12