| /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 | 319 uint64_t significand = Double(v).Significand(); local
321 // v = significand * 2^exponent (with significand a 53bit integer).
329 // At most kDoubleSignificandSize bits of the significand are non-zero.
335 // We know that v = significand * 2^exponent.
344 uint64_t dividend = significand;
347 // Let v = f * 2^e with f == significand and e == exponent.
371 significand <<= exponent;
372 FillDigits64(significand, buffer, length)
[all...] |
| /external/chromium_org/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;
148 return DiyFp(Significand() * 2 + 1, Exponent() - 1);
180 // Returns the significand size for a given order of magnitude.
185 // zeroes and their effective significand-size is hence smaller
203 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...] |
| diy-fp.h | 35 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
36 // have the most significant bit of the significand set.
47 // The exponents of both numbers must be the same and the significand of this
48 // must be bigger than the significand of other.
|
| 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...] |
| /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...] |
| diy-fp.h | 35 // with a uint64 significand and an int exponent. Normalized DiyFp numbers will
36 // have the most significant bit of the significand set.
47 // The exponents of both numbers must be the same and the significand of this
48 // must be bigger than the significand of other.
|
| 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...] |
| /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 | 427 // mask significand bits and shift up
428 // significand is 23-bits, so we shift to treat it like 24-bits
429 int significand = (bitValue & 0x007FFFFF) << 1; local
431 if (exponent == 0 && significand == 0) {
444 // significand is 23-bits, so there can be 6 hex digits
448 while ((significand != 0) && ((significand & 0xF) == 0)) {
449 significand >>>= 4;
453 String hexSignificand = Integer.toHexString(significand);
456 if (significand != 0 && fractionDigits > hexSignificand.length())
[all...] |
| Double.java | 420 // mask significand bits and shift up
421 long significand = bitValue & 0x000FFFFFFFFFFFFFL; local
423 if (exponent == 0 && significand == 0) {
436 // significand is 52-bits, so there can be 13 hex digits
440 while ((significand != 0) && ((significand & 0xF) == 0)) {
441 significand >>>= 4;
445 String hexSignificand = Long.toHexString(significand);
448 if (significand != 0 && fractionDigits > hexSignificand.length()) {
458 // significand is 52-bits, so there can be 13 hex digit
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DecimalNumber.cpp | 38 // [<sign>]0.[<zeros>]<significand>
52 // [<sign>]<significand>[<zeros>]
63 // [<sign>]<significand-begin>.<significand-end>
79 // Add the significand
111 // [<sign>]0.[<zeros>]<significand>
131 // [<sign>]<significand>[<zeros>]
145 // [<sign>]<significand-begin>.<significand-end>
170 // Add the significand
[all...] |
| /external/compiler-rt/lib/ |
| fixdfsi.c | 25 // Break a into sign, exponent, significand
30 const rep_t significand = (aAbs & significandMask) | implicitBit; local
34 return sign * (significand >> (significandBits - exponent));
47 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));
|
| adddf3.c | 64 // Extract the exponent and significand from the (possibly swapped) a and b.
80 // implicit significand bit. (If we fell through from the denormal path it
86 // Shift the significand of b by the difference in exponents, with a sticky
130 // need to shift the significand.
140 // 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
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/asm/ |
| sigcontext32.h | 9 unsigned short significand[4]; member in struct:_fpreg
14 unsigned short significand[4]; member in struct:_fpxreg
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| sigcontext32.h | 9 unsigned short significand[4]; member in struct:_fpreg
14 unsigned short significand[4]; member in struct:_fpxreg
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| sigcontext32.h | 9 unsigned short significand[4]; member in struct:_fpreg
14 unsigned short significand[4]; member in struct:_fpxreg
|
| /external/llvm/test/CodeGen/SystemZ/ |
| fp-const-09.ll | 2 ; the significand is set.
|
| /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...] |
