pqc/external/flint-2.4.3/fq_poly_templates/test/t-divrem_basecase.c
2014-05-24 23:16:06 +02:00

275 lines
9.1 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) 2012 Sebastian Pancratz
Copyright (C) 2013 Mike Hansen
******************************************************************************/
#ifdef T
#include "templates.h"
#include <stdio.h>
#include <stdlib.h>
#include "ulong_extras.h"
#include "long_extras.h"
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("divrem_basecase... ");
fflush(stdout);
/* Check q*b + r == a */
for (i = 0; i < 2000; i++)
{
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b, c, q, r;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_init) (c, ctx);
TEMPLATE(T, poly_init) (q, ctx);
TEMPLATE(T, poly_init) (r, ctx);
TEMPLATE(T, poly_randtest) (a, state, n_randint(state, 50), ctx);
TEMPLATE(T, poly_randtest_not_zero) (b, state,
n_randint(state, 50) + 1, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, r, a, b, ctx);
TEMPLATE(T, poly_mul) (c, q, b, ctx);
TEMPLATE(T, poly_add) (c, c, r, ctx);
result = (TEMPLATE(T, poly_equal) (a, c, ctx));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
flint_printf("c = "), TEMPLATE(T, poly_print_pretty) (c, "X", ctx),
flint_printf("\n");
flint_printf("q = "), TEMPLATE(T, poly_print_pretty) (q, "X", ctx),
flint_printf("\n");
flint_printf("r = "), TEMPLATE(T, poly_print_pretty) (r, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, poly_clear) (c, ctx);
TEMPLATE(T, poly_clear) (q, ctx);
TEMPLATE(T, poly_clear) (r, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check aliasing: a and r */
for (i = 0; i < 2000; i++)
{
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b, q, r;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_init) (q, ctx);
TEMPLATE(T, poly_init) (r, ctx);
TEMPLATE(T, poly_randtest) (a, state, n_randint(state, 50), ctx);
TEMPLATE(T, poly_randtest_not_zero) (b, state,
n_randint(state, 50) + 1, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, r, a, b, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, a, a, b, ctx);
result = (TEMPLATE(T, poly_equal) (a, r, ctx));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
flint_printf("q = "), TEMPLATE(T, poly_print_pretty) (q, "X", ctx),
flint_printf("\n");
flint_printf("r = "), TEMPLATE(T, poly_print_pretty) (r, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, poly_clear) (q, ctx);
TEMPLATE(T, poly_clear) (r, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check aliasing: b and r */
for (i = 0; i < 2000; i++)
{
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b, q, r;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_init) (q, ctx);
TEMPLATE(T, poly_init) (r, ctx);
TEMPLATE(T, poly_randtest) (a, state, n_randint(state, 50), ctx);
TEMPLATE(T, poly_randtest_not_zero) (b, state,
n_randint(state, 50) + 1, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, r, a, b, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, b, a, b, ctx);
result = (TEMPLATE(T, poly_equal) (b, r, ctx));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
flint_printf("q = "), TEMPLATE(T, poly_print_pretty) (q, "X", ctx),
flint_printf("\n");
flint_printf("r = "), TEMPLATE(T, poly_print_pretty) (r, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, poly_clear) (q, ctx);
TEMPLATE(T, poly_clear) (r, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check aliasing: a and q */
for (i = 0; i < 2000; i++)
{
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b, q, r;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_init) (q, ctx);
TEMPLATE(T, poly_init) (r, ctx);
TEMPLATE(T, poly_randtest) (a, state, n_randint(state, 50), ctx);
TEMPLATE(T, poly_randtest_not_zero) (b, state,
n_randint(state, 50) + 1, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, r, a, b, ctx);
TEMPLATE(T, poly_divrem_basecase) (a, r, a, b, ctx);
result = (TEMPLATE(T, poly_equal) (a, q, ctx));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
flint_printf("q = "), TEMPLATE(T, poly_print_pretty) (q, "X", ctx),
flint_printf("\n");
flint_printf("r = "), TEMPLATE(T, poly_print_pretty) (r, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, poly_clear) (q, ctx);
TEMPLATE(T, poly_clear) (r, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
/* Check aliasing: b and q */
for (i = 0; i < 2000; i++)
{
TEMPLATE(T, ctx_t) ctx;
TEMPLATE(T, poly_t) a, b, q, r;
TEMPLATE(T, ctx_randtest) (ctx, state);
TEMPLATE(T, poly_init) (a, ctx);
TEMPLATE(T, poly_init) (b, ctx);
TEMPLATE(T, poly_init) (q, ctx);
TEMPLATE(T, poly_init) (r, ctx);
TEMPLATE(T, poly_randtest) (a, state, n_randint(state, 50), ctx);
TEMPLATE(T, poly_randtest_not_zero) (b, state,
n_randint(state, 50) + 1, ctx);
TEMPLATE(T, poly_divrem_basecase) (q, r, a, b, ctx);
TEMPLATE(T, poly_divrem_basecase) (b, r, a, b, ctx);
result = (TEMPLATE(T, poly_equal) (b, q, ctx));
if (!result)
{
flint_printf("FAIL:\n\n");
flint_printf("a = "), TEMPLATE(T, poly_print_pretty) (a, "X", ctx),
flint_printf("\n");
flint_printf("b = "), TEMPLATE(T, poly_print_pretty) (b, "X", ctx),
flint_printf("\n");
flint_printf("q = "), TEMPLATE(T, poly_print_pretty) (q, "X", ctx),
flint_printf("\n");
flint_printf("r = "), TEMPLATE(T, poly_print_pretty) (r, "X", ctx),
flint_printf("\n");
abort();
}
TEMPLATE(T, poly_clear) (a, ctx);
TEMPLATE(T, poly_clear) (b, ctx);
TEMPLATE(T, poly_clear) (q, ctx);
TEMPLATE(T, poly_clear) (r, ctx);
TEMPLATE(T, ctx_clear) (ctx);
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
#endif