I have now written a wrapper function in mul_fft_full.c which
multiplies two integers. It will fail if the product is too small to
use the FFT (there is an assert for this which hopefully will be on
during testing).
If I have done the calculations correctly it won't work if the product
of the two
Hi
I've created a 2.5 branch in the svn so we can start working on trunk again
Jason
--
You received this message because you are subscribed to the Google Groups
"mpir-devel" group.
To post to this group, send email to mpir-devel@googlegroups.com.
To unsubscribe from this group, send email to
I should also add that our hacked together version was derived from
Niels' original implementation anyway. The main thing I had done was
make it work for xgcd and not just gcd (as GMP had already done with
their version) and later adjust the normalisation so that it could be
used by Pari. I did als
On Thursday 05 January 2012 03:42:28 Bill Hart wrote:
> So sumdiff_n would be defined for all x86_64 machines?
>
sumdiff is already defined on all machines , although only fast if HAVE_NATIVE
, the general sumdiff used is an old one from gmp ment to be used for fft's ,
it just splits it into L1
Jason, those speedups look great. Always good to see things getting faster!
Regarding the GCD code I want to mention that this is the version that
has been in GMP for some time. Their code was neater than ours and
performed slightly better, so I recommended we use their version
instead of the vers
