General mpn_gcd_basecase

[Marco Bodrato]

Ciao,

Il Sab, 31 Agosto 2019 7:07 pm, Torbjörn Granlund ha scritto:
>   > Sounds like the opposite of binary euclid.
>   Sounds more interesting than binary euclid, to me. Because looking at

> I suppose I don't fully understand how to make a table-based binary

Why should you try that if your idea is more interesting? :-)

> the time.  The scaling trick only applies to the submul_1 cases.  The

I think that the scaling trick is interesting, and should be always used.
Does this mean that we should only use submul? Well... let's use submul
only :-)

Please try the attached code. It's based on yours.

I'm not sure if the multiplier is chosen with the best strategy, but it
seems reasonable.

Ĝis,
m

-- 
http://bodrato.it/papers/
-------------- next part --------------
A non-text attachment was scrubbed...
Name: gcd-tgmb.c
Type: text/x-csrc
Size: 3652 bytes
Desc: not available
URL: <https://gmplib.org/list-archives/gmp-devel/attachments/20190901/3c47799e/attachment.bin>