Lines Matching refs:__q
90 const uint32_t __q = __value / 5;
95 __value = __q;
142 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI inline uint32_t __mulPow5InvDivPow2(const uint32_t __m, const uint32_t __q, const int32_t __j) {
143 return __mulShift(__m, __FLOAT_POW5_INV_SPLIT[__q], __j);
184 const uint32_t __q = __log10Pow2(__e2);
185 __e10 = static_cast<int32_t>(__q);
186 const int32_t __k = __FLOAT_POW5_INV_BITCOUNT + __pow5bits(static_cast<int32_t>(__q)) - 1;
187 const int32_t __i = -__e2 + static_cast<int32_t>(__q) + __k;
188 __vr = __mulPow5InvDivPow2(__mv, __q, __i);
189 __vp = __mulPow5InvDivPow2(__mp, __q, __i);
190 __vm = __mulPow5InvDivPow2(__mm, __q, __i);
191 if (__q != 0 && (__vp - 1) / 10 <= __vm / 10) {
193 // __q = X - 1 above, except that would require 33 bits for the result, and we've found that
195 const int32_t __l = __FLOAT_POW5_INV_BITCOUNT + __pow5bits(static_cast<int32_t>(__q - 1)) - 1;
196 __lastRemovedDigit = static_cast<uint8_t>(__mulPow5InvDivPow2(__mv, __q - 1,
197 -__e2 + static_cast<int32_t>(__q) - 1 + __l) % 10);
199 if (__q <= 9) {
200 // The largest power of 5 that fits in 24 bits is 5^10, but __q <= 9 seems to be safe as well.
203 __vrIsTrailingZeros = __multipleOfPowerOf5(__mv, __q);
205 __vmIsTrailingZeros = __multipleOfPowerOf5(__mm, __q);
207 __vp -= __multipleOfPowerOf5(__mp, __q);
211 const uint32_t __q = __log10Pow5(-__e2);
212 __e10 = static_cast<int32_t>(__q) + __e2;
213 const int32_t __i = -__e2 - static_cast<int32_t>(__q);
215 int32_t __j = static_cast<int32_t>(__q) - __k;
219 if (__q != 0 && (__vp - 1) / 10 <= __vm / 10) {
220 __j = static_cast<int32_t>(__q) - 1 - (__pow5bits(__i + 1) - __FLOAT_POW5_BITCOUNT);
223 if (__q <= 1) {
224 // {__vr,__vp,__vm} is trailing zeros if {__mv,__mp,__mm} has at least __q trailing 0 bits.
234 } else if (__q < 31) { // TRANSITION(ulfjack): Use a tighter bound here.
235 __vrIsTrailingZeros = __multipleOfPowerOf2(__mv, __q - 1);