Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:fractionals (Results 1 - 5 of 5) sorted by null

/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
fixed-dtoa.cc	223 // The given fractionals number represents a fixed-point number with binary 227 // 0 <= fractionals * 2^exponent < 1 234 static void FillFractionals(uint64_t fractionals, int exponent, 238 // 'fractionals' is a fixed-point number, with binary point at bit 239 // (-exponent). Inside the function the non-converted remainder of fractionals 243 ASSERT(fractionals >> 56 == 0); 246 if (fractionals == 0) break; 248 // location. This way the fractionals variable will not overflow. 249 // Invariant at the beginning of the loop: fractionals < 2^point. 250 // Initially we have: point <= 64 and fractionals < 2^5 375 uint64_t fractionals = significand - (integrals << -exponent); local     [all...]
/external/chromium_org/v8/src/
fast-dtoa.cc	412 // 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 = w.f() & (one.f() - 1) local     [all...]
fixed-dtoa.cc	224 // 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, 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 < 2^5 376 uint64_t fractionals = significand - (integrals << -exponent); local     [all...]
/external/v8/src/
fast-dtoa.cc	412 // 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 = w.f() & (one.f() - 1) local     [all...]
fixed-dtoa.cc	224 // 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, 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 < 2^5 376 uint64_t fractionals = significand - (integrals << -exponent); local     [all...]

Completed in 194 milliseconds