/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
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 // leading zeroes and their effective significand-size is hence smaller 218 uint64_t significand = diy_fp.f(); local [all...] |
bignum-dtoa.cc | 41 static int NormalizedExponent(uint64_t significand, int exponent) { 42 ASSERT(significand != 0); 43 while ((significand & Double::kHiddenBit) == 0) { 44 significand = significand << 1; 95 uint64_t significand = Double(v).Significand(); local 96 bool is_even = (significand & 1) == 0; 98 int normalized_exponent = NormalizedExponent(significand, exponent); 374 // significand size). Then 2^(p-1) <= f < 2^p 452 uint64_t significand = Double(v).Significand(); local 504 uint64_t significand = Double(v).Significand(); local [all...] |
fixed-dtoa.cc | 317 uint64_t significand = Double(v).Significand(); local 319 // v = significand * 2^exponent (with significand a 53bit integer). 327 // At most kDoubleSignificandSize bits of the significand are non-zero. 333 // We know that v = significand * 2^exponent. 342 uint64_t dividend = significand; 345 // Let v = f * 2^e with f == significand and e == exponent. 369 significand <<= exponent; 370 FillDigits64(significand, buffer, length) [all...] |
strtod.cc | 44 // (which has a 53bit significand) without loss of precision. 159 uint64_t significand = ReadUint64(buffer, &read_digits); local 161 *result = DiyFp(significand, 0); 164 // Round the significand. 166 significand++; 170 *result = DiyFp(significand, exponent); 315 // See if the double's significand changes if we add/subtract the error. 407 } else if ((Double(guess).Significand() & 1) == 0) {
|
/external/chromium_org/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 | 19 static int NormalizedExponent(uint64_t significand, int exponent) { 20 DCHECK(significand != 0); 21 while ((significand & Double::kHiddenBit) == 0) { 22 significand = significand << 1; 73 uint64_t significand = Double(v).Significand(); local 74 bool is_even = (significand & 1) == 0; 76 int normalized_exponent = NormalizedExponent(significand, exponent); 352 // significand size). Then 2^(p-1) <= f < 2^p 431 uint64_t significand = Double(v).Significand(); local 483 uint64_t significand = Double(v).Significand(); local [all...] |
conversions-inl.h | 92 return d.Sign() * static_cast<int32_t>(d.Significand() >> -exponent); 95 return d.Sign() * static_cast<int32_t>(d.Significand() << exponent);
|
fixed-dtoa.cc | 295 uint64_t significand = Double(v).Significand(); local 297 // v = significand * 2^exponent (with significand a 53bit integer). 305 // At most kDoubleSignificandSize bits of the significand are non-zero. 311 // We know that v = significand * 2^exponent. 320 uint64_t dividend = significand; 323 // Let v = f * 2^e with f == significand and e == exponent. 347 significand <<= exponent; 348 FillDigits64(significand, buffer, length) [all...] |
strtod.cc | 22 // (which has a 53bit significand) without loss of precision. 138 uint64_t significand = ReadUint64(buffer, &read_digits); local 140 *result = DiyFp(significand, 0); 143 // Round the significand. 145 significand++; 149 *result = DiyFp(significand, exponent); 296 // See if the double's significand changes if we add/subtract the error. 388 } 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 466 /// \name Significand operations. 481 /// Return true if the significand excluding the integral bit is all ones. 483 /// Return true if the significand excluding the integral bit is all zeros. 557 /// The significand must be at least one bit wider than the target precision 561 } significand; member in class:llvm::APFloat [all...] |
/external/chromium_org/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 53 /* Number of bits in the significand. This includes the integer 221 assert(end - begin != 1 && "Significand has no digits"); 235 structure D. Exponent is appropriate if the significand is 236 treated as an integer, and normalizedExponent if the significand 273 assert((*p == 'e' || *p == 'E') && "Invalid character in significand"); 274 assert(p != begin && "Significand has no digits"); 275 assert((dot == end || p - begin != 1) && "Significand has no digits"); 583 significand.parts = new integerPart[count]; 590 delete [] significand.parts [all...] |