[Libre-soc-isa] [Bug 817] Big Integer Math (sv.adde, sv.subfe, sv.madded, 128 by 64-bit -> 64-bit div/rem, maybe more...)

[bugzilla-daemon at libre-soc.org]

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

--- Comment #22 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #20)
> now, question is, does signed-div make any sense?

I think it does because I'm pretty sure it can be used to make a faster 128-bit
signed integer div/rem algorithm.

I couldn't find any decent examples since I think everyone either implements it
in c in terms of u128 div/rem implemented in c (aka slow inefficient because c
doesn't have 128 by 64-bit div), or implements it in terms of an assembly u128
div algorithm with a comment that the algorithm should be optimized more...

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