Searched refs:qhat (Results 1 - 2 of 2) sorted by relevance
| /third_party/node/deps/v8/src/bigint/ |
| H A D | div-schoolbook.cc | 108 // "v" is the book's name for {divisor}, "qhat" the current quotient digit. in DivideSchoolbook()
130 // {qhat} is the current quotient digit. in DivideSchoolbook()
131 digit_t qhat = std::numeric_limits<digit_t>::max(); in DivideSchoolbook() local
140 qhat = digit_div(ujn, U[j + n - 1], vn1, &rhat); in DivideSchoolbook()
144 // qhat * v_{n-2} > (rhat << kDigitBits) + u_{j+n-2}. in DivideSchoolbook()
147 while (ProductGreaterThan(qhat, vn2, rhat, ujn2)) { in DivideSchoolbook()
148 qhat--; in DivideSchoolbook()
161 if (qhat == 0) { in DivideSchoolbook()
164 MultiplySingle(qhatv, B, qhat); in DivideSchoolbook()
170 qhat in DivideSchoolbook()
[all...] |
| /third_party/python/Modules/_decimal/libmpdec/ |
| H A D | basearith.c | 311 mpd_uint_t d, qhat, rhat, w2[2]; in _mpd_basedivmod() local
342 /* D3: calculate qhat and rhat */ in _mpd_basedivmod()
344 qhat = w2[1] * MPD_RADIX + w2[0]; in _mpd_basedivmod()
347 if (qhat < MPD_RADIX) { in _mpd_basedivmod()
348 _mpd_singlemul(w2, qhat, v[n-2]); in _mpd_basedivmod()
355 qhat -= 1; in _mpd_basedivmod()
365 _mpd_mul_words(&hi, &lo, qhat, v[i]); in _mpd_basedivmod()
377 q[j] = qhat; in _mpd_basedivmod()
|
Completed in 2 milliseconds