1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
|
/*=============================================================================
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) 2011 William Hart
Copyright (C) 2012 Sebastian Pancratz
******************************************************************************/
#include <stdlib.h>
#include "nmod_poly.h"
#include "mpn_extras.h"
slong _nmod_poly_xgcd(mp_ptr G, mp_ptr S, mp_ptr T,
mp_srcptr A, slong lenA, mp_srcptr B, slong lenB, nmod_t mod)
{
const slong cutoff = FLINT_BIT_COUNT(mod.n) <= 8 ?
NMOD_POLY_SMALL_GCD_CUTOFF : NMOD_POLY_GCD_CUTOFF;
if (lenA < cutoff)
return _nmod_poly_xgcd_euclidean(G, S, T, A, lenA, B, lenB, mod);
else
return _nmod_poly_xgcd_hgcd(G, S, T, A, lenA, B, lenB, mod);
}
void
nmod_poly_xgcd(nmod_poly_t G, nmod_poly_t S, nmod_poly_t T,
const nmod_poly_t A, const nmod_poly_t B)
{
if (A->length < B->length)
{
nmod_poly_xgcd(G, T, S, B, A);
}
else /* lenA >= lenB >= 0 */
{
const slong lenA = A->length, lenB = B->length;
mp_limb_t inv;
if (lenA == 0) /* lenA = lenB = 0 */
{
nmod_poly_zero(G);
nmod_poly_zero(S);
nmod_poly_zero(T);
}
else if (lenB == 0) /* lenA > lenB = 0 */
{
inv = n_invmod(A->coeffs[lenA - 1], A->mod.n);
nmod_poly_scalar_mul_nmod(G, A, inv);
nmod_poly_zero(T);
nmod_poly_set_coeff_ui(S, 0, inv);
S->length = 1;
}
else if (lenB == 1) /* lenA >= lenB = 1 */
{
nmod_poly_fit_length(T, 1);
T->length = 1;
T->coeffs[0] = n_invmod(B->coeffs[0], A->mod.n);
nmod_poly_one(G);
nmod_poly_zero(S);
}
else /* lenA >= lenB >= 2 */
{
mp_ptr g, s, t;
slong lenG;
if (G == A || G == B)
{
g = _nmod_vec_init(FLINT_MIN(lenA, lenB));
}
else
{
nmod_poly_fit_length(G, FLINT_MIN(lenA, lenB));
g = G->coeffs;
}
if (S == A || S == B)
{
s = _nmod_vec_init(lenB - 1);
}
else
{
nmod_poly_fit_length(S, lenB - 1);
s = S->coeffs;
}
if (T == A || T == B)
{
t = _nmod_vec_init(lenA - 1);
}
else
{
nmod_poly_fit_length(T, lenA - 1);
t = T->coeffs;
}
if (lenA >= lenB)
lenG = _nmod_poly_xgcd(g, s, t, A->coeffs, lenA,
B->coeffs, lenB, A->mod);
else
lenG = _nmod_poly_xgcd(g, t, s, B->coeffs, lenB,
A->coeffs, lenA, A->mod);
if (G == A || G == B)
{
flint_free(G->coeffs);
G->coeffs = g;
G->alloc = FLINT_MIN(lenA, lenB);
}
if (S == A || S == B)
{
flint_free(S->coeffs);
S->coeffs = s;
S->alloc = lenB - 1;
}
if (T == A || T == B)
{
flint_free(T->coeffs);
T->coeffs = t;
T->alloc = lenA - 1;
}
G->length = lenG;
S->length = FLINT_MAX(lenB - lenG, 1);
T->length = FLINT_MAX(lenA - lenG, 1);
MPN_NORM(S->coeffs, S->length);
MPN_NORM(T->coeffs, T->length);
if (G->coeffs[lenG - 1] != 1)
{
inv = n_invmod(G->coeffs[lenG - 1], A->mod.n);
nmod_poly_scalar_mul_nmod(G, G, inv);
nmod_poly_scalar_mul_nmod(S, S, inv);
nmod_poly_scalar_mul_nmod(T, T, inv);
}
}
}
}
|