[Libre-soc-bugs] [Bug 1044] SVP64 implementation of pow(x,y,z)

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=1044

--- Comment #30 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #27)
> > however,
> > because divmod is really slow, running one powmod invocation is a few
> > hundred thousand simulated instructions (powmod calls divmod 256-512 times,
> > divmod loops 256 times, each inner loop is ~20 ops).
> 
> but there is at least a first version, unit tests can be done.

not really, extrapolating from what i recall of divmod's timing, that's like
30hr for one call of the powmod algorithm on one of the fastest modern cpus.

-- 
You are receiving this mail because:
You are on the CC list for the bug.