This is one sequence IN fft_mfa_truncate_sqrt2.c that ends with entry to
the failing code with n = 0.
void fft_truncate1_twiddle(mp_limb_t ** ii, mp_size_t is,
mp_size_t n, mp_bitcnt_t w, mp_limb_t ** t1, mp_limb_t ** t2,
mp_size_t ws, mp_size_t r, mp_size_t c, mp_size_t rs, mp_size_t trunc)
{
mp_size_t i;
mp_size_t limbs = (w*n)/GMP_LIMB_BITS;
if (trunc == 2*n)
fft_radix2_twiddle(ii, is, n, w, t1, t2, ws, r, c, rs);
else if (trunc <= n)
{
for (i = 0; i < n; i++)
mpn_add_n(ii[i*is], ii[i*is], ii[(i+n)*is], limbs + 1);
fft_truncate1_twiddle(ii, is, n/2, 2*w, t1, t2, ws, r, c, 2*rs,
trunc);
} else
If this is entered with n = 1 and trunk = 0 or 1, the last call above will
have n = 0. This sequence is invoked in my code.
Brian
--
You received this message because you are subscribed to the Google Groups
"mpir-devel" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/mpir-devel/-/jSfeuuvPDNAJ.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/mpir-devel?hl=en.
