void
fmpz_poly_bit_unpack_unsigned(fmpz_poly_t poly, const fmpz_t f,
mp_bitcnt_t bit_size)
{
slong len;
mpz_t tmp;
if (fmpz_sgn(f) < 0)
{
flint_printf("Exception (fmpz_poly_bit_unpack_unsigned). Expected an unsigned value.\n");
abort();
}
if (bit_size == 0 || fmpz_is_zero(f))
{
fmpz_poly_zero(poly);
return;
}
len = (fmpz_bits(f) + bit_size - 1) / bit_size;
mpz_init2(tmp, bit_size*len);
flint_mpn_zero(tmp->_mp_d, tmp->_mp_alloc);
fmpz_get_mpz(tmp, f);
fmpz_poly_fit_length(poly, len);
_fmpz_poly_bit_unpack_unsigned(poly->coeffs, len, tmp->_mp_d, bit_size);
_fmpz_poly_set_length(poly, len);
_fmpz_poly_normalise(poly);
mpz_clear(tmp);
}
void _fmpz_poly_sqrlow_KS(fmpz * res, const fmpz * poly, long len, long n)
{
int neg;
long bits, limbs, loglen, sign = 0;
mp_limb_t *arr_in, *arr_out;
FMPZ_VEC_NORM(poly, len);
if (len == 0)
{
_fmpz_vec_zero(res, n);
return;
}
neg = (fmpz_sgn(poly + len - 1) > 0) ? 0 : -1;
if (n > 2 * len - 1)
{
_fmpz_vec_zero(res + 2 * len - 1, n - (2 * len - 1));
n = 2 * len - 1;
}
bits = _fmpz_vec_max_bits(poly, len);
if (bits < 0)
{
sign = 1;
bits = - bits;
}
loglen = FLINT_BIT_COUNT(len);
bits = 2 * bits + loglen + sign;
limbs = (bits * len - 1) / FLINT_BITS + 1;
arr_in = flint_calloc(limbs, sizeof(mp_limb_t));
arr_out = flint_malloc((2 * limbs) * sizeof(mp_limb_t));
_fmpz_poly_bit_pack(arr_in, poly, len, bits, neg);
mpn_sqr(arr_out, arr_in, limbs);
if (sign)
_fmpz_poly_bit_unpack(res, n, arr_out, bits, 0);
else
_fmpz_poly_bit_unpack_unsigned(res, n, arr_out, bits);
flint_free(arr_in);
flint_free(arr_out);
}
void
_fmpz_poly_mullow_KS(fmpz * res, const fmpz * poly1, long len1,
const fmpz * poly2, long len2, long n)
{
int neg1, neg2;
long limbs1, limbs2, loglen;
long bits1, bits2, bits;
mp_limb_t *arr1, *arr2, *arr3;
long sign = 0;
FMPZ_VEC_NORM(poly1, len1);
FMPZ_VEC_NORM(poly2, len2);
if (!len1 | !len2)
{
_fmpz_vec_zero(res, n);
return;
}
neg1 = (fmpz_sgn(poly1 + len1 - 1) > 0) ? 0 : -1;
neg2 = (fmpz_sgn(poly2 + len2 - 1) > 0) ? 0 : -1;
if (n > len1 + len2 - 1)
{
_fmpz_vec_zero(res + len1 + len2 - 1, n - (len1 + len2 - 1));
n = len1 + len2 - 1;
}
bits1 = _fmpz_vec_max_bits(poly1, len1);
if (bits1 < 0)
{
sign = 1;
bits1 = -bits1;
}
if (poly1 != poly2)
{
bits2 = _fmpz_vec_max_bits(poly2, len2);
if (bits2 < 0)
{
sign = 1;
bits2 = -bits2;
}
}
else
bits2 = bits1;
loglen = FLINT_BIT_COUNT(FLINT_MIN(len1, len2));
bits = bits1 + bits2 + loglen + sign;
limbs1 = (bits * len1 - 1) / FLINT_BITS + 1;
limbs2 = (bits * len2 - 1) / FLINT_BITS + 1;
if (poly1 == poly2)
{
arr1 = (mp_ptr) flint_calloc(limbs1, sizeof(mp_limb_t));
arr2 = arr1;
_fmpz_poly_bit_pack(arr1, poly1, len1, bits, neg1);
}
else
{
arr1 = (mp_ptr) flint_calloc(limbs1 + limbs2, sizeof(mp_limb_t));
arr2 = arr1 + limbs1;
_fmpz_poly_bit_pack(arr1, poly1, len1, bits, neg1);
_fmpz_poly_bit_pack(arr2, poly2, len2, bits, neg2);
}
arr3 = (mp_ptr) flint_malloc((limbs1 + limbs2) * sizeof(mp_limb_t));
if (limbs1 == limbs2)
mpn_mul_n(arr3, arr1, arr2, limbs1);
else if (limbs1 > limbs2)
mpn_mul(arr3, arr1, limbs1, arr2, limbs2);
else
mpn_mul(arr3, arr2, limbs2, arr1, limbs1);
if (sign)
_fmpz_poly_bit_unpack(res, n, arr3, bits, neg1 ^ neg2);
else
_fmpz_poly_bit_unpack_unsigned(res, n, arr3, bits);
flint_free(arr1);
flint_free(arr3);
}
