102 lines
3.1 KiB
C
102 lines
3.1 KiB
C
|
/*=============================================================================
|
||
|
|
|
||
|
|
This file is part of FLINT.
|
||
|
|
|
||
|
|
FLINT is free software; you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation; either version 2 of the License, or
|
||
|
|
(at your option) any later version.
|
||
|
|
|
||
|
|
FLINT is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with FLINT; if not, write to the Free Software
|
||
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||
|
|
|
||
|
|
=============================================================================*/
|
||
|
|
/******************************************************************************
|
||
|
|
|
||
|
|
Copyright (C) 2010 William Hart
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "flint.h"
|
||
|
|
#include "nmod_vec.h"
|
||
|
|
#include "nmod_poly.h"
|
||
|
|
|
||
|
|
void _nmod_poly_mul(mp_ptr res, mp_srcptr poly1, slong len1,
|
||
|
|
mp_srcptr poly2, slong len2, nmod_t mod)
|
||
|
|
{
|
||
|
|
slong bits, bits2;
|
||
|
|
|
||
|
|
if (len1 + len2 <= 6 || len2 <= 2)
|
||
|
|
{
|
||
|
|
_nmod_poly_mul_classical(res, poly1, len1, poly2, len2, mod);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
bits = FLINT_BITS - (slong) mod.norm;
|
||
|
|
bits2 = FLINT_BIT_COUNT(len1);
|
||
|
|
|
||
|
|
if (2 * bits + bits2 <= FLINT_BITS && len1 + len2 < 16)
|
||
|
|
_nmod_poly_mul_classical(res, poly1, len1, poly2, len2, mod);
|
||
|
|
else if (bits * len2 > 2000)
|
||
|
|
_nmod_poly_mul_KS4(res, poly1, len1, poly2, len2, mod);
|
||
|
|
else if (bits * len2 > 200)
|
||
|
|
_nmod_poly_mul_KS2(res, poly1, len1, poly2, len2, mod);
|
||
|
|
else
|
||
|
|
_nmod_poly_mul_KS(res, poly1, len1, poly2, len2, 0, mod);
|
||
|
|
}
|
||
|
|
|
||
|
|
void nmod_poly_mul(nmod_poly_t res, const nmod_poly_t poly1, const nmod_poly_t poly2)
|
||
|
|
{
|
||
|
|
slong len1, len2, len_out;
|
||
|
|
|
||
|
|
len1 = poly1->length;
|
||
|
|
len2 = poly2->length;
|
||
|
|
|
||
|
|
if (len1 == 0 || len2 == 0)
|
||
|
|
{
|
||
|
|
nmod_poly_zero(res);
|
||
|
|
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
len_out = poly1->length + poly2->length - 1;
|
||
|
|
|
||
|
|
if (res == poly1 || res == poly2)
|
||
|
|
{
|
||
|
|
nmod_poly_t temp;
|
||
|
|
|
||
|
|
nmod_poly_init2(temp, poly1->mod.n, len_out);
|
||
|
|
|
||
|
|
if (len1 >= len2)
|
||
|
|
_nmod_poly_mul(temp->coeffs, poly1->coeffs, len1,
|
||
|
|
poly2->coeffs, len2, poly1->mod);
|
||
|
|
else
|
||
|
|
_nmod_poly_mul(temp->coeffs, poly2->coeffs, len2,
|
||
|
|
poly1->coeffs, len1, poly1->mod);
|
||
|
|
|
||
|
|
nmod_poly_swap(temp, res);
|
||
|
|
nmod_poly_clear(temp);
|
||
|
|
} else
|
||
|
|
{
|
||
|
|
nmod_poly_fit_length(res, len_out);
|
||
|
|
|
||
|
|
if (len1 >= len2)
|
||
|
|
_nmod_poly_mul(res->coeffs, poly1->coeffs, len1,
|
||
|
|
poly2->coeffs, len2, poly1->mod);
|
||
|
|
else
|
||
|
|
_nmod_poly_mul(res->coeffs, poly2->coeffs, len2,
|
||
|
|
poly1->coeffs, len1, poly1->mod);
|
||
|
|
}
|
||
|
|
|
||
|
|
res->length = len_out;
|
||
|
|
_nmod_poly_normalise(res);
|
||
|
|
}
|