/packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
ieee754.h | 38 uint64_t Significand() const { return u_ & kSignificandMask; } 41 bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; } 42 bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; } 43 bool IsNormal() const { return (u_ & kExponentMask) != 0 || Significand() == 0; } 46 uint64_t IntegerSignificand() const { return IsNormal() ? Significand() | kHiddenBit : Significand(); }
|
strtod.h | 27 inline double FastPath(double significand, int exp) { 31 return significand * internal::Pow10(exp); 33 return significand / internal::Pow10(-exp); 131 uint64_t significand = 0; local 134 if (significand > RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) || 135 (significand == RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) && decimals[i] > '5')) 137 significand = significand * 10u + static_cast<unsigned>(decimals[i] - '0'); 141 significand++; 148 DiyFp v(significand, 0) [all...] |
/external/v8/src/ |
double.h | 39 return DiyFp(Significand(), Exponent()); 45 uint64_t f = Significand(); 67 if (Sign() < 0 && Significand() == 0) { 87 uint64_t Significand() const { 89 uint64_t significand = d64 & kSignificandMask; local 91 return significand + kHiddenBit; 93 return significand; 125 return DiyFp(Significand() * 2 + 1, Exponent() - 1); 157 // Returns the significand size for a given order of magnitude. 162 // zeroes and their effective significand-size is hence smaller 180 uint64_t significand = diy_fp.f(); local [all...] |
bignum-dtoa.cc | 17 static int NormalizedExponent(uint64_t significand, int exponent) { 18 DCHECK(significand != 0); 19 while ((significand & Double::kHiddenBit) == 0) { 20 significand = significand << 1; 71 uint64_t significand = Double(v).Significand(); local 72 bool is_even = (significand & 1) == 0; 74 int normalized_exponent = NormalizedExponent(significand, exponent); 350 // significand size). Then 2^(p-1) <= f < 2^p 429 uint64_t significand = Double(v).Significand(); local 481 uint64_t significand = Double(v).Significand(); local [all...] |
conversions-inl.h | 93 return d.Sign() * static_cast<int32_t>(d.Significand() >> -exponent); 96 return d.Sign() * static_cast<int32_t>(d.Significand() << exponent);
|
fixed-dtoa.cc | 296 uint64_t significand = Double(v).Significand(); local 298 // v = significand * 2^exponent (with significand a 53bit integer). 306 // At most kDoubleSignificandSize bits of the significand are non-zero. 312 // We know that v = significand * 2^exponent. 321 uint64_t dividend = significand; 324 // Let v = f * 2^e with f == significand and e == exponent. 348 significand <<= exponent; 349 FillDigits64(significand, buffer, length) [all...] |
strtod.cc | 21 // (which has a 53bit significand) without loss of precision. 137 uint64_t significand = ReadUint64(buffer, &read_digits); local 139 *result = DiyFp(significand, 0); 142 // Round the significand. 144 significand++; 148 *result = DiyFp(significand, exponent); 295 // See if the double's significand changes if we add/subtract the error. 387 } else if ((Double(guess).Significand() & 1) == 0) {
|
/external/llvm/include/llvm/ADT/ |
APFloat.h | 90 /// signed exponent, and the significand as an array of integer parts. After 93 /// significand is set as an explicit integer bit. For denormals the most 96 /// significant bit of the significand set. The sign of zeroes and infinities 97 /// is significant; the exponent and significand of such numbers is not stored, 100 /// significand are deterministic, although not really meaningful, and preserved 105 /// by encoding Signaling NaNs with the first bit of its trailing significand as 539 /// \name Significand operations. 554 /// Return true if the significand excluding the integral bit is all ones. 556 /// Return true if the significand excluding the integral bit is all zeros. 630 /// The significand must be at least one bit wider than the target precision 634 } significand; member in class:llvm::APFloat [all...] |
/external/v8/test/cctest/ |
test-strtod.cc | 419 if ((d.Significand() & 1) == 0) {
|
/external/llvm/lib/Support/ |
APFloat.cpp | 36 /* Assumed in hexadecimal significand parsing, and conversion to 52 /* Number of bits in the significand. This includes the integer 223 assert(end - begin != 1 && "Significand has no digits"); 237 structure D. Exponent is appropriate if the significand is 238 treated as an integer, and normalizedExponent if the significand 275 assert((*p == 'e' || *p == 'E') && "Invalid character in significand"); 276 assert(p != begin && "Significand has no digits"); 277 assert((dot == end || p - begin != 1) && "Significand has no digits"); 585 significand.parts = new integerPart[count]; 592 delete [] significand.parts [all...] |