/external/v8/src/ |
double.h | 62 return DiyFp(Significand(), Exponent()); 68 uint64_t f = Significand(); 90 if (Sign() < 0 && Significand() == 0) { 110 uint64_t Significand() const { 112 uint64_t significand = d64 & kSignificandMask; local 114 return significand + kHiddenBit; 116 return significand; 154 return DiyFp(Significand() * 2 + 1, Exponent() - 1); 186 // Returns the significand size for a given order of magnitude. 191 // zeroes and their effective significand-size is hence smaller 209 uint64_t significand = diy_fp.f(); local [all...] |
bignum-dtoa.cc | 42 static int NormalizedExponent(uint64_t significand, int exponent) { 43 ASSERT(significand != 0); 44 while ((significand & Double::kHiddenBit) == 0) { 45 significand = significand << 1; 96 uint64_t significand = Double(v).Significand(); local 97 bool is_even = (significand & 1) == 0; 99 int normalized_exponent = NormalizedExponent(significand, exponent); 375 // significand size). Then 2^(p-1) <= f < 2^p 453 uint64_t significand = Double(v).Significand(); local 505 uint64_t significand = Double(v).Significand(); local [all...] |
conversions-inl.h | 97 return d.Sign() * static_cast<int32_t>(d.Significand() >> -exponent); 100 return d.Sign() * static_cast<int32_t>(d.Significand() << exponent);
|
fixed-dtoa.cc | 318 uint64_t significand = Double(v).Significand(); local 320 // v = significand * 2^exponent (with significand a 53bit integer). 328 // At most kDoubleSignificandSize bits of the significand are non-zero. 334 // We know that v = significand * 2^exponent. 343 uint64_t dividend = significand; 346 // Let v = f * 2^e with f == significand and e == exponent. 370 significand <<= exponent; 371 FillDigits64(significand, buffer, length) [all...] |
strtod.cc | 43 // (which has a 53bit significand) without loss of precision. 158 uint64_t significand = ReadUint64(buffer, &read_digits); local 160 *result = DiyFp(significand, 0); 163 // Round the significand. 165 significand++; 169 *result = DiyFp(significand, exponent); 316 // See if the double's significand changes if we add/subtract the error. 408 } else if ((Double(guess).Significand() & 1) == 0) {
|
/external/llvm/include/llvm/ADT/ |
APFloat.h | 69 a 16-bit signed exponent, and the significand as an array of 72 not denormal the P-th bit of the significand is set as an explicit 76 of the significand set. The sign of zeroes and infinities is 77 significant; the exponent and significand of such numbers is not 80 exponent. For NaNs the sign and significand are deterministic, 378 /* Significand operations. */ 439 /* Significand - the fraction with an explicit integer bit. Must be 441 union Significand 445 } significand; member in class:llvm::APFloat 459 significand is appended to the first one, although it would be wrong t [all...] |
/external/v8/test/cctest/ |
test-strtod.cc | 393 if ((d.Significand() & 1) == 0) {
|
/external/llvm/lib/Support/ |
APFloat.cpp | 29 /* Assumed in hexadecimal significand parsing, and conversion to 46 /* Number of bits in the significand. This includes the integer 233 assert(end - begin != 1 && "Significand has no digits"); 247 structure D. Exponent is appropriate if the significand is 248 treated as an integer, and normalizedExponent if the significand 285 assert((*p == 'e' || *p == 'E') && "Invalid character in significand"); 286 assert(p != begin && "Significand has no digits"); 287 assert((dot == end || p - begin != 1) && "Significand has no digits"); 595 significand.parts = new integerPart[count]; 602 delete [] significand.parts [all...] |