the modulo in an implicit RS (similar to `maddedu`)
RB, the divisor, remains 64 bit. The instruction is therefore a 128/64
-division, producing a (pair) of 64 bit result(s). Overflow conditions
+division, producing a (pair) of 64 bit result(s), in the same way that
+Intel [idiv](https://www.felixcloutier.com/x86/idiv) works.
+Overflow conditions
are detected in exactly the same fashion as `divdeu`, except that rather
than have `UNDEFINED` behaviour, RT is set to all ones and RS set to all
zeros on overflow.
*Programmer's note: there are no Rc variants of any of these VA-Form
instructions. `cmpi` will need to be used to detect overflow conditions:
the saving in instruction count is that both RT and RS will have already
-been set to useful values needed as part of implementing Knuth's
+been set to useful values (all 1s and all zeros redpectively)
+needed as part of implementing Knuth's
Algorithm D*
For SVP64, given that this instruction is also 3-in 2-out 64-bit registers,