Niels,
> From: ni...@lysator.liu.se (Niels Möller)
> Date: Fri, 27 Apr 2018 22:28:39 +0200
>
> ni...@lysator.liu.se (Niels Möller) writes:
>
> > Once we reach qn = dn - 1, keep looping to produce quotient limbs, but
> > also discard one limb of dp in each interation, until we in the final
paul zimmermann writes:
> if you use udiv_qr_3by2 to divide (say) a 6-limb number by a 3-limb number,
> then in the schoolbook loop you might have {n2, n1} = {d1, d0}, in the case
> where n0 is smaller than the next divisor limb d[-1].
>
> If it is the responsibility of the caller to ensure {n2,
Niels,
> From: ni...@lysator.liu.se (Niels Möller)
> Date: Sat, 28 Apr 2018 13:27:36 +0200
> [...]
> Inputs are a two limb normlized divisor, {d1, d0}, d1 >= B/2, and two
> numerator words, {n2, n1}, which must be less than {d1, d0}. [...]
if you use udiv_qr_3by2 to divide (say) a 6-limb n
