Searched defs:fractionals (Results 1 - 6 of 6) sorted by relevance

/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dfixed-dtoa.cc225 // The given fractionals number represents a fixed-point number with binary
229 // 0 <= fractionals * 2^exponent < 1
236 static void FillFractionals(uint64_t fractionals, int exponent, argument
240 // 'fractionals' is a fixed-point number, with binary point at bit
241 // (-exponent). Inside the function the non-converted remainder of fractionals
245 ASSERT(fractionals >> 56 == 0);
248 if (fractionals == 0) break;
250 // location. This way the fractionals variable will not overflow.
251 // Invariant at the beginning of the loop: fractionals < 2^point.
252 // Initially we have: point <= 64 and fractionals <
377 uint64_t fractionals = significand - (integrals << -exponent); local
[all...]
/external/chromium_org/v8/src/
H A Dfast-dtoa.cc412 // fractionals. We will not write any decimal separator though, but adapt
422 uint64_t fractionals = too_high.f() & (one.f() - 1); local
442 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
462 ASSERT(fractionals < one.f());
465 fractionals *= 10;
469 int digit = static_cast<int>(fractionals >> -one.e());
472 fractionals &= one.f() - 1; // Modulo by one.
474 if (fractionals < unsafe_interval.f()) {
476 unsafe_interval.f(), fractionals, one.f(), unit);
530 uint64_t fractionals local
[all...]
H A Dfixed-dtoa.cc224 // The given fractionals number represents a fixed-point number with binary
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent, argument
239 // 'fractionals' is a fixed-point number, with binary point at bit
240 // (-exponent). Inside the function the non-converted remainder of fractionals
244 ASSERT(fractionals >> 56 == 0);
247 if (fractionals == 0) break;
249 // location. This way the fractionals variable will not overflow.
250 // Invariant at the beginning of the loop: fractionals < 2^point.
251 // Initially we have: point <= 64 and fractionals <
376 uint64_t fractionals = significand - (integrals << -exponent); local
[all...]
/external/v8/src/
H A Dfast-dtoa.cc412 // fractionals. We will not write any decimal separator though, but adapt
422 uint64_t fractionals = too_high.f() & (one.f() - 1); local
442 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
462 ASSERT(fractionals < one.f());
465 fractionals *= 10;
469 int digit = static_cast<int>(fractionals >> -one.e());
472 fractionals &= one.f() - 1; // Modulo by one.
474 if (fractionals < unsafe_interval.f()) {
476 unsafe_interval.f(), fractionals, one.f(), unit);
530 uint64_t fractionals local
[all...]
H A Dfixed-dtoa.cc224 // The given fractionals number represents a fixed-point number with binary
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent, argument
239 // 'fractionals' is a fixed-point number, with binary point at bit
240 // (-exponent). Inside the function the non-converted remainder of fractionals
244 ASSERT(fractionals >> 56 == 0);
247 if (fractionals == 0) break;
249 // location. This way the fractionals variable will not overflow.
250 // Invariant at the beginning of the loop: fractionals < 2^point.
251 // Initially we have: point <= 64 and fractionals <
376 uint64_t fractionals = significand - (integrals << -exponent); local
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...

Completed in 145 milliseconds