/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...] |
diy-fp.h | 12 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will 13 // have the most significant bit of the significand set. 24 // The exponents of both numbers must be the same and the significand of this 25 // must be bigger than the significand of other.
|
bignum-dtoa.cc | 19 static int NormalizedExponent(uint64_t significand, int exponent) { 20 ASSERT(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...] |
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...] |
/external/fio/lib/ |
ieee754.c | 15 long long sign, exp, significand; local 43 // calculate the binary form (non-float) of the significand data 44 significand = fnorm * ((1LL << significandbits) + 0.5f); 50 return (sign << (bits - 1)) | (exp << (bits-expbits - 1)) | significand; 63 // pull the significand
|
/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...] |
diy-fp.h | 38 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will 39 // have the most significant bit of the significand set. 50 // The exponents of both numbers must be the same and the significand of this 51 // must be bigger than the significand of other.
|
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...] |
/libcore/luni/src/main/java/java/lang/ |
HexStringParser.java | 156 String significand = getNormalizedSignificand(strIntegerPart,strDecimalPart); local 157 if (significand.equals("0")) { 175 if (significand.length() > MAX_SIGNIFICANT_LENGTH) { 176 abandonedNumber = significand.substring(MAX_SIGNIFICANT_LENGTH); 177 significand = significand.substring(0, MAX_SIGNIFICANT_LENGTH); 180 mantissa = Long.parseLong(significand, HEX_RADIX); 277 * Returns the normalized significand after removing the leading zeros. 280 String significand = strIntegerPart + strDecimalPart; local 281 significand = significand.replaceFirst("^0+", "") [all...] |
Float.java | 433 // mask significand bits and shift up 434 // significand is 23-bits, so we shift to treat it like 24-bits 435 int significand = (bitValue & 0x007FFFFF) << 1; local 437 if (exponent == 0 && significand == 0) { 450 // significand is 23-bits, so there can be 6 hex digits 454 while ((significand != 0) && ((significand & 0xF) == 0)) { 455 significand >>>= 4; 459 String hexSignificand = Integer.toHexString(significand); 462 if (significand != 0 && fractionDigits > hexSignificand.length()) [all...] |
Double.java | 426 // mask significand bits and shift up 427 long significand = bitValue & 0x000FFFFFFFFFFFFFL; local 429 if (exponent == 0 && significand == 0) { 442 // significand is 52-bits, so there can be 13 hex digits 446 while ((significand != 0) && ((significand & 0xF) == 0)) { 447 significand >>>= 4; 451 String hexSignificand = Long.toHexString(significand); 454 if (significand != 0 && fractionDigits > hexSignificand.length()) { 464 // significand is 52-bits, so there can be 13 hex digit [all...] |
/external/compiler-rt/lib/builtins/ |
fixdfsi.c | 26 // Break a into sign, exponent, significand 31 const rep_t significand = (aAbs & significandMask) | implicitBit; local 35 return sign * (significand >> (significandBits - exponent)); 48 return sign * (significand << (exponent - significandBits));
|
fixsfsi.c | 23 // Break a into sign, exponent, significand 28 const rep_t significand = (aAbs & significandMask) | implicitBit; local 32 return sign * (significand >> (significandBits - exponent)); 45 return sign * (significand << (exponent - significandBits));
|
fp_add_impl.inc | 59 // Extract the exponent and significand from the (possibly swapped) a and b. 75 // implicit significand bit. (If we fell through from the denormal path it 81 // Shift the significand of b by the difference in exponents, with a sticky 122 // need to shift the significand. 132 // Shift the significand into place, and mask off the implicit bit.
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
s_significand.c | 17 * significand(x) computes just 26 significand(double x) function
|
/external/kernel-headers/original/uapi/asm-x86/asm/ |
sigcontext32.h | 11 unsigned short significand[4]; member in struct:_fpreg 16 unsigned short significand[4]; member in struct:_fpxreg
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/asm/ |
sigcontext32.h | 11 unsigned short significand[4]; member in struct:_fpreg 16 unsigned short significand[4]; member in struct:_fpxreg
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/asm/ |
sigcontext32.h | 11 unsigned short significand[4]; member in struct:_fpreg 16 unsigned short significand[4]; member in struct:_fpxreg
|
/external/llvm/test/CodeGen/SystemZ/ |
fp-const-09.ll | 2 ; the significand is set.
|
/external/llvm/test/CodeGen/X86/ |
misched-aa-mmos.ll | 21 %significand.i18.i = getelementptr inbounds %c1* %temp_rhs, i64 0, i32 1 26 %parts.i.i = bitcast %u1* %significand.i18.i to i64**
|
/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...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/special_functions/ |
fpclassify.hpp | 41 and all significand bits are 0, then the number is zero. 44 and at least one significand bit is 1, then the number is subnormal. 46 If all exponent bits are 1 and all significand bits are 0, 49 If all exponent bits are 1 and at least one significand bit is 1, 58 sign bit + exponent bits + significand bits. 61 sign bit + exponent bits + flag bit + significand bits. 69 but not always all the significand bits. 71 depending on whether all the significand bits are copied or not. 191 a &= traits::exponent | traits::flag | traits::significand; 192 BOOST_MATH_INSTRUMENT_VARIABLE((traits::exponent | traits::flag | traits::significand)); [all...] |
/libcore/luni/src/main/native/ |
cbigint.h | 27 /* IEEE floats consist of: sign bit, exponent field, significand field 28 single: 31 = sign bit, 30..23 = exponent (8 bits), 22..0 = significand (23 bits) 29 double: 63 = sign bit, 62..52 = exponent (11 bits), 51..0 = significand (52 bits)
|
/prebuilts/ndk/4/platforms/android-5/arch-x86/usr/include/asm/ |
sigcontext.h | 21 unsigned short significand[4]; member in struct:_fpreg 26 unsigned short significand[4]; member in struct:_fpxreg
|