return;
}
if (m_bitlen <= 31) {
- uint32_t hi, lo;
+ uint32_t lo;
hi = x[1] >> 1;
lo = (x[1] << 31) | z;
*
* If a = b*q + r (with 0 <= r < q), we can estimate q by
* doing an Euclidean division on the top words:
- * a0*w+a1 = b0*u + v (with 0 <= v < w)
+ * a0*w+a1 = b0*u + v (with 0 <= v < b0)
* Then the following holds:
* 0 <= u <= w
* u-2 <= q <= u