[libre-riscv-dev] div/mod algorithm written in python

[Luke Kenneth Casson Leighton]

ok have added unit tests which do the inf / nan / zero / random /
permutations coverage, plus set a 20,000 random run going on each of
FP16/32/64.  the FP64 one generates only like 3 values per second so
that's going to take... 2 hours just on its own.

oh!  radix-8 - right!  yes, sorry, not an 8-bit-wide radix
(radix-256), eek!  yes, sorry, with you now, i remember :)

ok yes, hmm, i'll run the current batch (log2_radix=2) and look at
log2_radix=3 next.

i'd like to get this one declared "done" (milestone completed) then
record additional work/improvements needed as separate ones.  on that:
i did a really quick look at trying to reduce the bitwidth, and y'know
what? not going to worry about it.

l.