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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/* Test mpn_perfect_square_p data.
Copyright 2002 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MP Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
#include <stdio.h>
#include <stdlib.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "tests.h"
#include "mpn/perfsqr.h"
#define PERFSQR_MOD_MASK ((CNST_LIMB(1) << PERFSQR_MOD_BITS) - 1)
void
check_mod_2 (mp_limb_t d, mp_limb_t inv, mp_limb_t got_hi, mp_limb_t got_lo)
{
int want[2*GMP_LIMB_BITS], got;
unsigned r, idx;
mp_limb_t q;
ASSERT_ALWAYS (d <= numberof (want));
ASSERT_ALWAYS (((inv * d) & PERFSQR_MOD_MASK) == 1);
ASSERT_ALWAYS (MP_LIMB_T_MAX / d >= PERFSQR_MOD_MASK);
/* the squares mod d */
for (r = 0; r < d; r++)
want[r] = 0;
for (r = 0; r < d; r++)
want[(r*r)%d] = 1;
/* for each remainder mod d, expect the table data to correctly identify
it as a residue or non-residue */
for (r = 0; r < d; r++)
{
/* as per PERFSQR_MOD_IDX */
q = ((r) * (inv)) & PERFSQR_MOD_MASK;
idx = (q * (d)) >> PERFSQR_MOD_BITS;
if (idx >= GMP_LIMB_BITS)
got = (got_hi >> (idx - GMP_LIMB_BITS)) & 1;
else
got = (got_lo >> idx) & 1;
if (got != want[r])
{
printf ("Wrong generated data\n");
printf (" d=%u\n", (unsigned) d);
printf (" r=%u\n", r);
printf (" idx=%u\n", idx);
printf (" got %d\n", got);
printf (" want %d\n", want[r]);
abort ();
}
}
}
/* Check the generated data in perfsqr.h. */
void
check_mod (void)
{
#define PERFSQR_MOD_34(r, up, usize) { r = 0; } /* so r isn't unused */
#define PERFSQR_MOD_PP(r, up, usize) { r = 0; }
#define PERFSQR_MOD_1(r, d, inv, mask) check_mod_2 (d, inv, CNST_LIMB(0), mask)
#define PERFSQR_MOD_2(r, d, inv, mhi, mlo) check_mod_2 (d, inv, mhi, mlo)
PERFSQR_MOD_TEST (dummy, dummy);
}
/* Check PERFSQR_PP, if in use. */
void
check_pp (void)
{
#ifdef PERFSQR_PP
ASSERT_ALWAYS_LIMB (PERFSQR_PP);
ASSERT_ALWAYS_LIMB (PERFSQR_PP_NORM);
ASSERT_ALWAYS_LIMB (PERFSQR_PP_INVERTED);
/* preinv stuff only for nails==0 */
if (GMP_NAIL_BITS == 0)
{
ASSERT_ALWAYS (PERFSQR_PP_NORM
== PERFSQR_PP << refmpn_count_leading_zeros (PERFSQR_PP));
ASSERT_ALWAYS (PERFSQR_PP_INVERTED
== refmpn_invert_limb (PERFSQR_PP_NORM));
}
#endif
}
int
main (void)
{
tests_start ();
check_mod ();
check_pp ();
tests_end ();
exit (0);
}
|
