Lines Matching defs:__e2

184   int32_t __e2;
188     __e2 = 1 - __DOUBLE_BIAS - __DOUBLE_MANTISSA_BITS - 2;
191     __e2 = static_cast<int32_t>(__ieeeExponent) - __DOUBLE_BIAS - __DOUBLE_MANTISSA_BITS - 2;
210   if (__e2 >= 0) {
212     // This expression is slightly faster than max(0, __log10Pow2(__e2) - 1).
213     const uint32_t __q = __log10Pow2(__e2) - (__e2 > 3);
216     const int32_t __i = -__e2 + static_cast<int32_t>(__q) + __k;
226         // Same as min(__e2 + (~__mm & 1), __pow5Factor(__mm)) >= __q
227         // <=> __e2 + (~__mm & 1) >= __q && __pow5Factor(__mm) >= __q
228         // <=> true && __pow5Factor(__mm) >= __q, since __e2 >= __q.
231         // Same as min(__e2 + 1, __pow5Factor(__mp)) >= __q.
236     // This expression is slightly faster than max(0, __log10Pow5(-__e2) - 1).
237     const uint32_t __q = __log10Pow5(-__e2) - (-__e2 > 1);
238     __e10 = static_cast<int32_t>(__q) + __e2;
239     const int32_t __i = -__e2 - static_cast<int32_t>(__q);
255       // We need to compute min(ntz(__mv), __pow5Factor(__mv) - __e2) >= __q - 1
256       // <=> ntz(__mv) >= __q - 1 && __pow5Factor(__mv) - __e2 >= __q - 1
257       // <=> ntz(__mv) >= __q - 1 (__e2 is negative and -__e2 >= __q)
674   const int32_t __e2 = static_cast<int32_t>(__ieeeExponent) - __DOUBLE_BIAS - __DOUBLE_MANTISSA_BITS;
676   if (__e2 > 0) {
677     // f = __m2 * 2^__e2 >= 2^53 is an integer.
682   if (__e2 < -52) {
687   // Since 2^52 <= __m2 < 2^53 and 0 <= -__e2 <= 52: 1 <= f = __m2 / 2^-__e2 < 2^53.
688   // Test if the lower -__e2 bits of the significand are 0, i.e. whether the fraction is 0.
689   const uint64_t __mask = (1ull << -__e2) - 1;
698   __v->__mantissa = __m2 >> -__e2;