pqc/external/flint-2.4.3/ulong_extras/test/t-mod_precomp.c

76 lines
2.1 KiB
C
Raw Normal View History

2014-05-18 22:03:37 +00:00
/*=============================================================================
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) 2009 William Hart
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "ulong_extras.h"
int main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("mod_precomp....");
fflush(stdout);
for (i = 0; i < 100000 * flint_test_multiplier(); i++)
{
mp_limb_t bits, d, n, r1, r2;
double dpre;
bits = n_randint(state, FLINT_D_BITS) + 1;
d = n_randtest_bits(state, bits);
if (bits <= (FLINT_BITS/2)) n = n_randtest(state) % (d*d);
else n = n_randtest(state);
/* must have n < 2^(FLINT_BITS - 1) */
if (FLINT_BIT_COUNT(n) == FLINT_BITS)
n >>= 1;
dpre = n_precompute_inverse(d);
r1 = n_mod_precomp(n, d, dpre);
r2 = n%d;
result = (r1 == r2);
if (!result)
{
flint_printf("FAIL:\n");
flint_printf("n = %wu, d = %wu, dinv = %g\n", n, d, dpre);
flint_printf("r1 = %wu, r2 = %wu\n", r1, r2);
abort();
}
}
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return 0;
}