/*
Copyright (C) 2009 William Hart
Copyright (C) 2011 Fredrik Johansson
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
#include "flint.h"
#include "nmod_vec.h"
#include "nmod_poly.h"
#include "ulong_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("powmod_mpz_binexp....");
fflush(stdout);
/* Aliasing of res and a */
for (i = 0; i < 25 * flint_test_multiplier(); i++)
{
nmod_poly_t a, res1, t, f;
mp_limb_t n;
ulong exp;
mpz_t expz;
n = n_randtest_prime(state, 0);
exp = n_randlimb(state);
flint_mpz_init_set_ui(expz, exp);
nmod_poly_init(a, n);
nmod_poly_init(f, n);
nmod_poly_init(res1, n);
nmod_poly_init(t, n);
nmod_poly_randtest(a, state, n_randint(state, 50));
do {
nmod_poly_randtest(f, state, n_randint(state, 50));
} while (nmod_poly_is_zero(f));
nmod_poly_powmod_mpz_binexp(res1, a, expz, f);
nmod_poly_powmod_mpz_binexp(a, a, expz, f);
result = (nmod_poly_equal(res1, a));
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a:\n"); nmod_poly_print(a), flint_printf("\n\n");
flint_printf("f:\n"); nmod_poly_print(f), flint_printf("\n\n");
flint_printf("res1:\n"); nmod_poly_print(res1), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(f);
nmod_poly_clear(res1);
nmod_poly_clear(t);
mpz_clear(expz);
}
/* Aliasing of res and f */
for (i = 0; i < 25 * flint_test_multiplier(); i++)
{
nmod_poly_t a, res1, t, f;
mp_limb_t n;
ulong exp;
mpz_t expz;
n = n_randtest_prime(state, 0);
exp = n_randlimb(state);
flint_mpz_init_set_ui(expz, exp);
nmod_poly_init(a, n);
nmod_poly_init(f, n);
nmod_poly_init(res1, n);
nmod_poly_init(t, n);
nmod_poly_randtest(a, state, n_randint(state, 50));
do {
nmod_poly_randtest(f, state, n_randint(state, 50));
} while (nmod_poly_is_zero(f));
nmod_poly_powmod_mpz_binexp(res1, a, expz, f);
nmod_poly_powmod_mpz_binexp(f, a, expz, f);
result = (nmod_poly_equal(res1, f));
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a:\n"); nmod_poly_print(a), flint_printf("\n\n");
flint_printf("f:\n"); nmod_poly_print(f), flint_printf("\n\n");
flint_printf("res1:\n"); nmod_poly_print(res1), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(f);
nmod_poly_clear(res1);
nmod_poly_clear(t);
mpz_clear(expz);
}
/* No aliasing */
for (i = 0; i < 50 * flint_test_multiplier(); i++)
{
nmod_poly_t a, res1, res2, t, f;
mp_limb_t n;
ulong exp;
mpz_t expz;
n = n_randtest_prime(state, 0);
exp = n_randlimb(state);
nmod_poly_init(a, n);
nmod_poly_init(f, n);
nmod_poly_init(res1, n);
nmod_poly_init(res2, n);
nmod_poly_init(t, n);
nmod_poly_randtest(a, state, n_randint(state, 50));
do {
nmod_poly_randtest(f, state, n_randint(state, 50));
} while (nmod_poly_is_zero(f));
flint_mpz_init_set_ui(expz, exp);
nmod_poly_powmod_mpz_binexp(res1, a, expz, f);
nmod_poly_powmod_ui_binexp(res2, a, exp, f);
result = (nmod_poly_equal(res1, res2));
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("a:\n"); nmod_poly_print(a), flint_printf("\n\n");
flint_printf("f:\n"); nmod_poly_print(f), flint_printf("\n\n");
flint_printf("res1:\n"); nmod_poly_print(res1), flint_printf("\n\n");
flint_printf("res2:\n"); nmod_poly_print(res2), flint_printf("\n\n");
abort();
}
nmod_poly_clear(a);
nmod_poly_clear(f);
nmod_poly_clear(res1);
nmod_poly_clear(res2);
nmod_poly_clear(t);
mpz_clear(expz);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}