Home
last modified time | relevance | path

Searched refs:significand (Results 1 - 25 of 68) sorted by relevance

123

/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dbignum-dtoa.cc37 static int NormalizedExponent(uint64_t significand, int exponent) { in NormalizedExponent() argument
38 DOUBLE_CONVERSION_ASSERT(significand != 0); in NormalizedExponent()
39 while ((significand & Double::kHiddenBit) == 0) { in NormalizedExponent()
40 significand = significand << 1; in NormalizedExponent()
52 static void InitialScaledStartValues(uint64_t significand,
93 uint64_t significand; in BignumDtoa() local
99 significand = Single(f).Significand(); in BignumDtoa()
103 significand = Double(v).Significand(); in BignumDtoa()
110 bool is_even = (significand in BignumDtoa()
417 InitialScaledStartValuesPositiveExponent( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesPositiveExponent() argument
450 InitialScaledStartValuesNegativeExponentPositivePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentPositivePower() argument
484 InitialScaledStartValuesNegativeExponentNegativePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentNegativePower() argument
568 InitialScaledStartValues(uint64_t significand, int exponent, bool lower_boundary_is_closer, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValues() argument
[all...]
H A Ddiy-fp.h36 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
37 // have the most significant bit of the significand set.
46 DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {} in DiyFp() argument
49 // The exponents of both numbers must be the same and the significand of this
50 // must be greater or equal than the significand of other.
98 uint64_t significand = f_; in Normalize() local
104 while ((significand & k10MSBits) == 0) { in Normalize()
105 significand <<= 10; in Normalize()
108 while ((significand in Normalize()
[all...]
H A Dieee.h125 uint64_t significand = d64 & kSignificandMask; in Significand() local
127 return significand + kHiddenBit; in Significand()
129 return significand; in Significand()
208 // The boundary is closer if the significand is of the form f == 2^p-1 then in LowerBoundaryIsCloser()
222 // Returns the significand size for a given order of magnitude.
227 // leading zeroes and their effective significand-size is hence smaller.
257 uint64_t significand = diy_fp.f(); in DiyFpToUint64() local
259 while (significand > kHiddenBit + kSignificandMask) { in DiyFpToUint64()
260 significand >>= 1; in DiyFpToUint64()
269 while (exponent > kDenormalExponent && (significand in DiyFpToUint64()
324 uint32_t significand = d32 & kSignificandMask; Significand() local
[all...]
H A Dfixed-dtoa.cc316 uint64_t significand = Double(v).Significand(); in FastFixedDtoa() local
318 // v = significand * 2^exponent (with significand a 53bit integer). in FastFixedDtoa()
326 // At most kDoubleSignificandSize bits of the significand are non-zero. in FastFixedDtoa()
332 // We know that v = significand * 2^exponent. in FastFixedDtoa()
341 uint64_t dividend = significand; in FastFixedDtoa()
344 // Let v = f * 2^e with f == significand and e == exponent. in FastFixedDtoa()
368 significand <<= exponent; in FastFixedDtoa()
369 FillDigits64(significand, buffer, length); in FastFixedDtoa()
373 uint64_t integrals = significand >> in FastFixedDtoa()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp51 static int NormalizedExponent(uint64_t significand, int exponent) { in NormalizedExponent() argument
52 DOUBLE_CONVERSION_ASSERT(significand != 0); in NormalizedExponent()
53 while ((significand & Double::kHiddenBit) == 0) { in NormalizedExponent()
54 significand = significand << 1; in NormalizedExponent()
66 static void InitialScaledStartValues(uint64_t significand,
107 uint64_t significand; in BignumDtoa() local
113 significand = Single(f).Significand(); in BignumDtoa()
117 significand = Double(v).Significand(); in BignumDtoa()
124 bool is_even = (significand in BignumDtoa()
431 InitialScaledStartValuesPositiveExponent( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesPositiveExponent() argument
464 InitialScaledStartValuesNegativeExponentPositivePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentPositivePower() argument
498 InitialScaledStartValuesNegativeExponentNegativePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentNegativePower() argument
582 InitialScaledStartValues(uint64_t significand, int exponent, bool lower_boundary_is_closer, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValues() argument
[all...]
H A Ddouble-conversion-diy-fp.h50 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
51 // have the most significant bit of the significand set.
60 DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {} in DiyFp() argument
63 // The exponents of both numbers must be the same and the significand of this
64 // must be greater or equal than the significand of other.
112 uint64_t significand = f_; in Normalize() local
118 while ((significand & k10MSBits) == 0) { in Normalize()
119 significand <<= 10; in Normalize()
122 while ((significand in Normalize()
[all...]
H A Ddouble-conversion-ieee.h139 uint64_t significand = d64 & kSignificandMask; in Significand() local
141 return significand + kHiddenBit; in Significand()
143 return significand; in Significand()
222 // The boundary is closer if the significand is of the form f == 2^p-1 then in LowerBoundaryIsCloser()
236 // Returns the significand size for a given order of magnitude.
241 // leading zeroes and their effective significand-size is hence smaller.
271 uint64_t significand = diy_fp.f(); in DiyFpToUint64() local
273 while (significand > kHiddenBit + kSignificandMask) { in DiyFpToUint64()
274 significand >>= 1; in DiyFpToUint64()
283 while (exponent > kDenormalExponent && (significand in DiyFpToUint64()
338 uint32_t significand = d32 & kSignificandMask; Significand() local
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp51 static int NormalizedExponent(uint64_t significand, int exponent) { in NormalizedExponent() argument
52 DOUBLE_CONVERSION_ASSERT(significand != 0); in NormalizedExponent()
53 while ((significand & Double::kHiddenBit) == 0) { in NormalizedExponent()
54 significand = significand << 1; in NormalizedExponent()
66 static void InitialScaledStartValues(uint64_t significand,
107 uint64_t significand; in BignumDtoa() local
113 significand = Single(f).Significand(); in BignumDtoa()
117 significand = Double(v).Significand(); in BignumDtoa()
124 bool is_even = (significand in BignumDtoa()
431 InitialScaledStartValuesPositiveExponent( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesPositiveExponent() argument
464 InitialScaledStartValuesNegativeExponentPositivePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentPositivePower() argument
498 InitialScaledStartValuesNegativeExponentNegativePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentNegativePower() argument
582 InitialScaledStartValues(uint64_t significand, int exponent, bool lower_boundary_is_closer, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValues() argument
[all...]
H A Ddouble-conversion-diy-fp.h50 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
51 // have the most significant bit of the significand set.
60 DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {} in DiyFp() argument
63 // The exponents of both numbers must be the same and the significand of this
64 // must be greater or equal than the significand of other.
112 uint64_t significand = f_; in Normalize() local
118 while ((significand & k10MSBits) == 0) { in Normalize()
119 significand <<= 10; in Normalize()
122 while ((significand in Normalize()
[all...]
H A Ddouble-conversion-ieee.h139 uint64_t significand = d64 & kSignificandMask; in Significand() local
141 return significand + kHiddenBit; in Significand()
143 return significand; in Significand()
222 // The boundary is closer if the significand is of the form f == 2^p-1 then in LowerBoundaryIsCloser()
236 // Returns the significand size for a given order of magnitude.
241 // leading zeroes and their effective significand-size is hence smaller.
271 uint64_t significand = diy_fp.f(); in DiyFpToUint64() local
273 while (significand > kHiddenBit + kSignificandMask) { in DiyFpToUint64()
274 significand >>= 1; in DiyFpToUint64()
283 while (exponent > kDenormalExponent && (significand in DiyFpToUint64()
338 uint32_t significand = d32 & kSignificandMask; Significand() local
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp51 static int NormalizedExponent(uint64_t significand, int exponent) { in NormalizedExponent() argument
52 DOUBLE_CONVERSION_ASSERT(significand != 0); in NormalizedExponent()
53 while ((significand & Double::kHiddenBit) == 0) { in NormalizedExponent()
54 significand = significand << 1; in NormalizedExponent()
66 static void InitialScaledStartValues(uint64_t significand,
107 uint64_t significand; in BignumDtoa() local
113 significand = Single(f).Significand(); in BignumDtoa()
117 significand = Double(v).Significand(); in BignumDtoa()
124 bool is_even = (significand in BignumDtoa()
431 InitialScaledStartValuesPositiveExponent( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesPositiveExponent() argument
464 InitialScaledStartValuesNegativeExponentPositivePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentPositivePower() argument
498 InitialScaledStartValuesNegativeExponentNegativePower( uint64_t significand, int exponent, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValuesNegativeExponentNegativePower() argument
582 InitialScaledStartValues(uint64_t significand, int exponent, bool lower_boundary_is_closer, int estimated_power, bool need_boundary_deltas, Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus) InitialScaledStartValues() argument
[all...]
H A Ddouble-conversion-diy-fp.h50 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
51 // have the most significant bit of the significand set.
60 DiyFp(const uint64_t significand, const int32_t exponent) : f_(significand), e_(exponent) {} in DiyFp() argument
63 // The exponents of both numbers must be the same and the significand of this
64 // must be greater or equal than the significand of other.
112 uint64_t significand = f_; in Normalize() local
118 while ((significand & k10MSBits) == 0) { in Normalize()
119 significand <<= 10; in Normalize()
122 while ((significand in Normalize()
[all...]
H A Ddouble-conversion-ieee.h139 uint64_t significand = d64 & kSignificandMask; in Significand() local
141 return significand + kHiddenBit; in Significand()
143 return significand; in Significand()
214 // The boundary is closer if the significand is of the form f == 2^p-1 then in LowerBoundaryIsCloser()
228 // Returns the significand size for a given order of magnitude.
233 // leading zeroes and their effective significand-size is hence smaller.
258 uint64_t significand = diy_fp.f(); in DiyFpToUint64() local
260 while (significand > kHiddenBit + kSignificandMask) { in DiyFpToUint64()
261 significand >>= 1; in DiyFpToUint64()
270 while (exponent > kDenormalExponent && (significand in DiyFpToUint64()
325 uint32_t significand = d32 & kSignificandMask; Significand() local
[all...]
/third_party/glslang/SPIRV/
H A Dhex_float.h282 // immediately to the left of the significand.
333 // Returns just the significand bits from the value.
359 uint_type significand = getSignificandBits(); in getNormalizedSignificand() local
361 significand = static_cast<uint_type>(significand << 1); in getNormalizedSignificand()
363 significand &= fraction_encode_mask; in getNormalizedSignificand()
364 return significand; in getNormalizedSignificand()
371 // Note this assumes EVERY significand is normalized, and has an implicit
375 // since subnormals do not have an implicit leading 1 in the significand.
376 // The significand i
382 setFromSignUnbiasedExponentAndNormalizedSignificand( bool negative, int_type exponent, uint_type significand, bool round_denorm_up) setFromSignUnbiasedExponentAndNormalizedSignificand() argument
427 incrementSignificand(uint_type significand, uint_type to_increment, bool* carry) incrementSignificand() argument
492 uint_type significand = getNormalizedSignificand(); getRoundedNormalizedSignificand() local
566 uint_type significand = getSignificandBits(); castTo() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/util/
H A Dhex_float.h328 // immediately to the left of the significand.
378 // Returns just the significand bits from the value.
404 uint_type significand = getSignificandBits(); in getNormalizedSignificand() local
406 significand = static_cast<uint_type>(significand << 1); in getNormalizedSignificand()
408 significand &= fraction_encode_mask; in getNormalizedSignificand()
409 return significand; in getNormalizedSignificand()
416 // Note this assumes EVERY significand is normalized, and has an implicit
420 // since subnormals do not have an implicit leading 1 in the significand.
421 // The significand i
427 setFromSignUnbiasedExponentAndNormalizedSignificand( bool negative, int_type exponent, uint_type significand, bool round_denorm_up) setFromSignUnbiasedExponentAndNormalizedSignificand() argument
472 incrementSignificand(uint_type significand, uint_type to_increment, bool* carry) incrementSignificand() argument
575 uint_type significand = getNormalizedSignificand(); getRoundedNormalizedSignificand() local
649 uint_type significand = getSignificandBits(); castTo() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/
H A Dhex_float.h328 // immediately to the left of the significand.
378 // Returns just the significand bits from the value.
404 uint_type significand = getSignificandBits(); in getNormalizedSignificand() local
406 significand = static_cast<uint_type>(significand << 1); in getNormalizedSignificand()
408 significand &= fraction_encode_mask; in getNormalizedSignificand()
409 return significand; in getNormalizedSignificand()
416 // Note this assumes EVERY significand is normalized, and has an implicit
420 // since subnormals do not have an implicit leading 1 in the significand.
421 // The significand i
427 setFromSignUnbiasedExponentAndNormalizedSignificand( bool negative, int_type exponent, uint_type significand, bool round_denorm_up) setFromSignUnbiasedExponentAndNormalizedSignificand() argument
472 incrementSignificand(uint_type significand, uint_type to_increment, bool* carry) incrementSignificand() argument
575 uint_type significand = getNormalizedSignificand(); getRoundedNormalizedSignificand() local
649 uint_type significand = getSignificandBits(); castTo() local
[all...]
/third_party/spirv-tools/source/util/
H A Dhex_float.h329 // immediately to the left of the significand.
379 // Returns just the significand bits from the value.
405 uint_type significand = getSignificandBits(); in getNormalizedSignificand() local
407 significand = static_cast<uint_type>(significand << 1); in getNormalizedSignificand()
409 significand &= fraction_encode_mask; in getNormalizedSignificand()
410 return significand; in getNormalizedSignificand()
417 // Note this assumes EVERY significand is normalized, and has an implicit
421 // since subnormals do not have an implicit leading 1 in the significand.
422 // The significand i
428 setFromSignUnbiasedExponentAndNormalizedSignificand( bool negative, int_type exponent, uint_type significand, bool round_denorm_up) setFromSignUnbiasedExponentAndNormalizedSignificand() argument
473 incrementSignificand(uint_type significand, uint_type to_increment, bool* carry) incrementSignificand() argument
576 uint_type significand = getNormalizedSignificand(); getRoundedNormalizedSignificand() local
650 uint_type significand = getSignificandBits(); castTo() local
[all...]
/third_party/node/deps/v8/src/base/numbers/
H A Dbignum-dtoa.cc16 static int NormalizedExponent(uint64_t significand, int exponent) { in NormalizedExponent() argument
17 DCHECK_NE(significand, 0); in NormalizedExponent()
18 while ((significand & Double::kHiddenBit) == 0) { in NormalizedExponent()
19 significand = significand << 1; in NormalizedExponent()
65 uint64_t significand = Double(v).Significand(); in BignumDtoa() local
66 bool is_even = (significand & 1) == 0; in BignumDtoa()
68 int normalized_exponent = NormalizedExponent(significand, exponent); in BignumDtoa()
334 // significand size). Then 2^(p-1) <= f < 2^p. in EstimatePower()
389 // If the significand (withou in InitialScaledStartValuesPositiveExponent()
409 uint64_t significand = Double(v).Significand(); InitialScaledStartValuesNegativeExponentPositivePower() local
[all...]
H A Dfixed-dtoa.cc281 uint64_t significand = Double(v).Significand(); in FastFixedDtoa() local
283 // v = significand * 2^exponent (with significand a 53bit integer). in FastFixedDtoa()
291 // At most kDoubleSignificandSize bits of the significand are non-zero. in FastFixedDtoa()
297 // We know that v = significand * 2^exponent. in FastFixedDtoa()
306 uint64_t dividend = significand; in FastFixedDtoa()
309 // Let v = f * 2^e with f == significand and e == exponent. in FastFixedDtoa()
333 significand <<= exponent; in FastFixedDtoa()
334 FillDigits64(significand, buffer, length); in FastFixedDtoa()
338 uint64_t integrals = significand >> in FastFixedDtoa()
[all...]
H A Ddouble.h87 uint64_t significand = d64 & kSignificandMask; in Significand() local
89 return significand + kHiddenBit; in Significand()
91 return significand; in Significand()
155 // Returns the significand size for a given order of magnitude.
160 // zeroes and their effective significand-size is hence smaller.
180 uint64_t significand = diy_fp.f(); local
182 while (significand > kHiddenBit + kSignificandMask) {
183 significand >>= 1;
192 while (exponent > kDenormalExponent && (significand & kHiddenBit) == 0) {
193 significand <<
[all...]
/third_party/musl/libc-test/src/functionalext/supplement/math/math_gtest/
H A Dmath_significand_test.cpp18 * of the significand interface.
25 bool testResult = DoubleUlpCmp(g_significandData[i].expected, significand(g_significandData[i].input), 1); in HWTEST_F()
37 EXPECT_DOUBLE_EQ(0.0, significand(0.0)); in HWTEST_F()
38 EXPECT_DOUBLE_EQ(1.2, significand(1.2)); in HWTEST_F()
39 EXPECT_DOUBLE_EQ(1.53125, significand(12.25)); in HWTEST_F()
/third_party/musl/libc-test/src/functionalext/supplement/math/
H A Dsignificand.c33 double d = significand(0.0); in significand_0100()
44 double d = significand(1.2); in significand_0200()
55 double d = significand(12.25); in significand_0300()
/third_party/optimized-routines/math/test/rtest/
H A Ddotest.c138 mpfr_t significand; in get_mpfr_d() local
164 mpfr_init2(significand, MPFR_PREC); in get_mpfr_d()
165 mpfr_set(significand, x, GMP_RNDN); in get_mpfr_d()
166 exp = mpfr_get_exp(significand); in get_mpfr_d()
167 mpfr_set_exp(significand, 0); in get_mpfr_d()
169 /* Now significand is in [1/2,1), and significand * 2^exp == x. in get_mpfr_d()
176 mpfr_clear(significand); in get_mpfr_d()
184 mpfr_div_2si(significand, x, exp - 21, GMP_RNDN); in get_mpfr_d()
185 mpfr_abs(significand, significan in get_mpfr_d()
202 mpfr_t significand; get_mpfr_f() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DAPFloat.cpp48 /* Assumed in hexadecimal significand parsing, and conversion to
63 /* Number of bits in the significand. This includes the integer
355 structure D. Exponent is appropriate if the significand is
356 treated as an integer, and normalizedExponent if the significand
397 return createError("Invalid character in significand"); in interpretDecimal()
712 significand.parts = new integerPart[count];
717 delete [] significand.parts;
739 for the significand. If double or longer, this is a signalling NaN,
745 integerPart *significand = significandParts();
748 // Set the significand bit
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dpow10_helper_test.cc30 uint64_t significand; // Raw bits of the expected value member
31 int radix; // significand is adjusted by 2^radix
59 // Comment shows difference of significand from the true value. in TEST()
112 std::ldexp(test_case.significand, test_case.radix)) in TEST()
115 std::ldexp(test_case.significand, test_case.radix)); in TEST()

Completed in 26 milliseconds

123