Memory usage for large multiplications

[Niels Möller]

The below patch changes the interface of mpn_mulmod_bnm1, and reduces
the amount of temporary storage needed for mpn_nussbaumer_mul (used for
large products). Passes make check for me, but there are some missing
pieces,

1. Update of the code for the non-recursive case (marked XXX in the
   patch).

2. Squaring. Rather than doing the analogous changes to mpn_sqrmod_bnm1,
   I'd rather break out the CRT logic to a separate, shared, function.

3. An mpn_sub_nc which should be replacable by some cheaper logic
   (marked FIXME).

Regards,
/Niels

-------------- next part --------------
A non-text attachment was scrubbed...
Name: mulmod_bnm1.patch
Type: text/x-patch
Size: 10476 bytes
Desc: not available
URL: <http://gmplib.org/list-archives/gmp-devel/attachments/20100118/a1473f4e/attachment-0001.bin>
-------------- next part --------------

-- 
Niels M?ller. PGP-encrypted email is preferred. Keyid C0B98E26.
Internet email is subject to wholesale government surveillance.