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
/*
Copyright (C) 2009 William Hart
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 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "test_helpers.h"
#include "ulong_extras.h"
TEST_FUNCTION_START(n_mod_precomp, state)
{
int i, result;
for (i = 0; i < 100000 * flint_test_multiplier(); i++)
{
ulong 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)
TEST_FUNCTION_FAIL(
"n = %wu, d = %wu, dinv = %g\n"
"r1 = %wu, r2 = %wu\n",
n, d, dpre, r1, r2);
}
TEST_FUNCTION_END(state);
}