pqc/external/flint-2.4.3/fq_poly_templates/mullow_classical.c

105 lines
3.4 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) 2008, 2009 William Hart
Copyright (C) 2012 Sebastian Pancratz
Copyright (C) 2013 Mike Hansen
******************************************************************************/
#ifdef T
#include "templates.h"
void
_TEMPLATE(T, poly_mullow_classical) (
TEMPLATE(T, struct) * rop,
const TEMPLATE(T, struct) * op1, slong len1,
const TEMPLATE(T, struct) * op2, slong len2,
slong n, const TEMPLATE(T, ctx_t) ctx)
{
if ((len1 == 1 && len2 == 1) || n == 1)
{
TEMPLATE(T, mul) (rop, op1, op2, ctx);
}
else
{
slong i;
_TEMPLATE3(T, poly_scalar_mul, T)(rop, op1, FLINT_MIN(len1, n),
op2, ctx);
if (n > len1)
_TEMPLATE3(T, poly_scalar_mul, T) (rop + len1,
op2 + 1, n - len1,
op1 + len1 - 1, ctx);
for (i = 0; i < FLINT_MIN(len1, n) - 1; i++)
_TEMPLATE3(T, poly_scalar_addmul, T) (rop + i + 1, op2 + 1,
FLINT_MIN(len2, n - i) - 1,
op1 + i, ctx);
}
}
void
TEMPLATE(T, poly_mullow_classical) (TEMPLATE(T, poly_t) rop,
const TEMPLATE(T, poly_t) op1,
const TEMPLATE(T, poly_t) op2, slong n,
const TEMPLATE(T, ctx_t) ctx)
{
const slong len = op1->length + op2->length - 1;
if (op1->length == 0 || op2->length == 0 || n == 0)
{
TEMPLATE(T, poly_zero) (rop, ctx);
return;
}
if (n > len)
n = len;
if (rop == op1 || rop == op2)
{
TEMPLATE(T, poly_t) t;
TEMPLATE(T, poly_init2) (t, n, ctx);
_TEMPLATE(T, poly_mullow_classical) (t->coeffs, op1->coeffs,
op1->length, op2->coeffs,
op2->length, n, ctx);
TEMPLATE(T, poly_swap) (rop, t, ctx);
TEMPLATE(T, poly_clear) (t, ctx);
}
else
{
TEMPLATE(T, poly_fit_length) (rop, n, ctx);
_TEMPLATE(T, poly_mullow_classical) (rop->coeffs, op1->coeffs,
op1->length, op2->coeffs,
op2->length, n, ctx);
}
_TEMPLATE(T, poly_set_length) (rop, n, ctx);
_TEMPLATE(T, poly_normalise) (rop, ctx);
}
#endif