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 integers is less than about 4000 bits. But the assert gives a more precise condition (which is complex). The new test function is t-mul_fft_full.c. I have also added fft_tuning.h (top level source directory of the flint tree) and there are modifications to the top of mulmod_2expp1.c where the tuning parameters were formerly recorded. The only things remaining to be done now are efficient squaring code and tuning code. I'll do at least one of those tomorrow. I'm sure you can see from fft_tuning.h that tuning will be totally trivial and very fast. Bill. -- 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 mpir-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
