#include <math.h>
#include "arb_poly.h"
void
_arb_poly_mulmid(arb_ptr res,
arb_srcptr poly1, slong len1,
arb_srcptr poly2, slong len2, slong nlo, slong nhi, slong prec)
{
if (len1 <= 7 || len2 <= 7 || nhi <= 7)
{
_arb_poly_mulmid_classical(res, poly1, len1, poly2, len2, nlo, nhi, prec);
}
else
{
slong cutoff;
double p;
if (prec <= 2 * FLINT_BITS)
{
cutoff = 110;
}
else
{
p = log(prec);
cutoff = 10000.0 / (p * p * p);
cutoff = FLINT_MIN(cutoff, 60);
if (poly1 == poly2 && prec >= 256)
cutoff *= 1.25;
if (poly1 == poly2 && prec >= 4096)
cutoff *= 1.25;
cutoff = FLINT_MAX(cutoff, 8);
}
if (2 * FLINT_MIN(len1, len2) <= cutoff || nhi <= cutoff)
_arb_poly_mulmid_classical(res, poly1, len1, poly2, len2, nlo, nhi, prec);
else
_arb_poly_mulmid_block(res, poly1, len1, poly2, len2, nlo, nhi, prec);
}
}
void
arb_poly_mulmid(arb_poly_t res, const arb_poly_t poly1,
const arb_poly_t poly2, slong nlo, slong nhi, slong prec)
{
slong xlen, ylen, zlen;
xlen = poly1->length;
ylen = poly2->length;
if (xlen == 0 || ylen == 0 || nlo >= FLINT_MIN(nhi, xlen + ylen - 1))
{
arb_poly_zero(res);
return;
}
nhi = FLINT_MIN(nhi, xlen + ylen - 1);
zlen = nhi - nlo;
if (res == poly1 || res == poly2)
{
arb_poly_t tmp;
arb_poly_init2(tmp, zlen);
_arb_poly_mulmid(tmp->coeffs, poly1->coeffs, xlen,
poly2->coeffs, ylen, nlo, nhi, prec);
arb_poly_swap(res, tmp);
arb_poly_clear(tmp);
}
else
{
arb_poly_fit_length(res, zlen);
_arb_poly_mulmid(res->coeffs, poly1->coeffs, xlen,
poly2->coeffs, ylen, nlo, nhi, prec);
}
_arb_poly_set_length(res, zlen);
_arb_poly_normalise(res);
}