/*
Copyright (C) 2012 Andres Goens
Copyright (C) 2012 Sebastian Pancratz
Copyright (C) 2013 Mike Hansen
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See .
*/
#include
#include
#include "fq.h"
/* from qadic/ctx_init_conway.c */
extern int flint_conway_polynomials [];
int
_fq_ctx_init_conway(fq_ctx_t ctx, const fmpz_t p, slong d, const char *var)
{
unsigned int position;
if (fmpz_cmp_ui(p, 109987) > 0)
{
return 0;
}
for (position = 0; flint_conway_polynomials[position] != 0; position += 3+flint_conway_polynomials[position+1])
{
/* Different prime? */
if (fmpz_cmp_ui(p, flint_conway_polynomials[position]))
continue;
/* Same degree? */
if (d == flint_conway_polynomials[position+1])
{
fmpz_mod_ctx_t ctxp;
fmpz_mod_poly_t mod;
slong i;
fmpz_mod_ctx_init(ctxp, p);
fmpz_mod_poly_init(mod, ctxp);
/* Copy the polynomial */
for (i = 0; i < d; i++)
{
int coeff = flint_conway_polynomials[position+2+i];
fmpz_mod_poly_set_coeff_ui(mod, i, coeff, ctxp);
}
fmpz_mod_poly_set_coeff_ui(mod, d, 1, ctxp);
fq_ctx_init_modulus(ctx, mod, ctxp, var);
fmpz_mod_poly_clear(mod, ctxp);
fmpz_mod_ctx_clear(ctxp);
return 1;
}
}
return 0;
}
void
fq_ctx_init_conway(fq_ctx_t ctx, const fmpz_t p, slong d, const char *var)
{
int result;
if (fmpz_cmp_ui(p, 109987) > 0)
{
flint_printf("Exception (fq_ctx_init_conway). Conway polynomials \n");
flint_printf("are only available for primes up to 109987.\n");
flint_abort();
}
result = _fq_ctx_init_conway(ctx, p, d, var);
if (!result)
{
flint_printf
("Exception (fq_ctx_init_conway). The polynomial for \n(p,d) = (");
fmpz_print(p);
flint_printf(",%wd) is not present in the database.\n", d);
flint_abort();
}
ctx->is_conway = 1;
}