pqc/external/flint-2.4.3/fmpq_poly/add.c
2014-05-24 23:16:06 +02:00

155 lines
4.8 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 Sebastian Pancratz
******************************************************************************/
#include <gmp.h>
#include "flint.h"
#include "fmpz.h"
#include "fmpz_vec.h"
#include "fmpq_poly.h"
void _fmpq_poly_add_can(fmpz * rpoly, fmpz_t rden,
const fmpz * poly1, const fmpz_t den1, slong len1,
const fmpz * poly2, const fmpz_t den2, slong len2, int can)
{
slong max = FLINT_MAX(len1, len2);
slong min = FLINT_MIN(len1, len2);
fmpz_t d;
fmpz_init(d);
fmpz_one(d);
if (*den1 != WORD(1) && *den2 != WORD(1))
fmpz_gcd(d, den1, den2);
if (*d == WORD(1))
{
_fmpz_vec_scalar_mul_fmpz(rpoly, poly1, len1, den2);
_fmpz_vec_scalar_addmul_fmpz(rpoly, poly2, min, den1);
if (len1 < len2)
_fmpz_vec_scalar_mul_fmpz(rpoly + min, poly2 + min, max - min, den1);
fmpz_mul(rden, den1, den2);
}
else
{
fmpz_t den11;
fmpz_t den22;
fmpz_init(den11);
fmpz_init(den22);
fmpz_divexact(den11, den1, d);
fmpz_divexact(den22, den2, d);
_fmpz_vec_scalar_mul_fmpz(rpoly, poly1, len1, den22);
_fmpz_vec_scalar_addmul_fmpz(rpoly, poly2, len2, den11);
if (len1 < len2)
_fmpz_vec_scalar_mul_fmpz(rpoly + min, poly2 + min, max - min, den11);
if (_fmpz_vec_is_zero(rpoly, max))
fmpz_one(rden);
else
{
if (can)
{
fmpz_t e;
fmpz_init(e);
_fmpz_vec_content(e, rpoly, max);
if (*e != WORD(1))
fmpz_gcd(e, e, d);
if (*e == WORD(1))
fmpz_mul(rden, den1, den22);
else
{
_fmpz_vec_scalar_divexact_fmpz(rpoly, rpoly, max, e);
fmpz_divexact(den11, den1, e);
fmpz_mul(rden, den11, den22);
}
fmpz_clear(e);
} else
fmpz_mul(rden, den1, den22);
}
fmpz_clear(den11);
fmpz_clear(den22);
}
fmpz_clear(d);
}
void _fmpq_poly_add(fmpz * rpoly, fmpz_t rden,
const fmpz * poly1, const fmpz_t den1, slong len1,
const fmpz * poly2, const fmpz_t den2, slong len2)
{
_fmpq_poly_add_can(rpoly, rden, poly1, den1, len1, poly2, den2, len2, 1);
}
void fmpq_poly_add_can(fmpq_poly_t res, const fmpq_poly_t poly1,
const fmpq_poly_t poly2, int can)
{
slong len1 = poly1->length, len2, max;
if (poly1 == poly2) /* Set res = 2 * poly1 */
{
fmpz_t rem;
fmpz_init(rem);
fmpz_mod_ui(rem, poly1->den, 2);
fmpq_poly_fit_length(res, len1);
_fmpq_poly_set_length(res, len1);
if (*rem == UWORD(0))
{
_fmpz_vec_set(res->coeffs, poly1->coeffs, len1);
fmpz_fdiv_q_2exp(res->den, poly1->den, 1);
}
else
{
_fmpz_vec_scalar_mul_2exp(res->coeffs, poly1->coeffs, len1, 1);
fmpz_set(res->den, poly1->den);
}
fmpz_clear(rem);
return;
}
len2 = poly2->length;
max = FLINT_MAX(len1, len2);
fmpq_poly_fit_length(res, max);
if (res != poly2)
_fmpq_poly_add_can(res->coeffs, res->den,
poly1->coeffs, poly1->den, len1,
poly2->coeffs, poly2->den, len2, can);
else
_fmpq_poly_add_can(res->coeffs, res->den,
poly2->coeffs, poly2->den, len2,
poly1->coeffs, poly1->den, len1, can);
_fmpq_poly_set_length(res, max);
_fmpq_poly_normalise(res);
}
void fmpq_poly_add(fmpq_poly_t res, const fmpq_poly_t poly1,
const fmpq_poly_t poly2)
{
fmpq_poly_add_can(res, poly1, poly2, 1);
}