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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/*
Copyright 2012, 2016 Free Software Foundation, Inc.
This file is part of the GNU MP Library test suite.
The GNU MP Library test suite 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 3 of the License,
or (at your option) any later version.
The GNU MP Library test suite 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
the GNU MP Library test suite. If not, see https://www.gnu.org/licenses/. */
#include <assert.h>
#include <limits.h>
#include <stdlib.h>
#include <stdio.h>
#include "testutils.h"
#define GMP_LIMB_BITS (sizeof(mp_limb_t) * CHAR_BIT)
#define COUNT 10000
static void
test_2by1(const mpz_t u)
{
mpz_t m, p, t;
mp_limb_t tl;
mpz_init (p);
assert (mpz_size (u) == 1);
tl = mpn_invert_limb (u->_mp_d[0]);
mpz_roinit_n (t, &tl, 1);
mpz_init_set (m, t);
mpz_setbit (m, GMP_LIMB_BITS);
mpz_mul (p, m, u);
mpz_init (t);
mpz_setbit (t, 2* GMP_LIMB_BITS);
mpz_sub (t, t, p);
/* Should have 0 < B^2 - m u <= u */
if (mpz_sgn (t) <= 0 || mpz_cmp (t, u) > 0)
{
fprintf (stderr, "mpn_invert_limb failed:\n");
dump ("u", u);
dump ("m", m);
dump ("p", p);
dump ("t", t);
abort ();
}
mpz_clear (m);
mpz_clear (p);
mpz_clear (t);
}
static void
test_3by2(const mpz_t u)
{
mpz_t m, p, t;
mp_limb_t tl;
mpz_init (p);
assert (mpz_size (u) == 2);
tl = mpn_invert_3by2 (u->_mp_d[1], u->_mp_d[0]);
mpz_roinit_n (t, &tl, 1);
mpz_init_set (m, t);
mpz_setbit (m, GMP_LIMB_BITS);
mpz_mul (p, m, u);
mpz_init (t);
mpz_setbit (t, 3 * GMP_LIMB_BITS);
mpz_sub (t, t, p);
/* Should have 0 < B^3 - m u <= u */
if (mpz_sgn (t) <= 0 || mpz_cmp (t, u) > 0)
{
fprintf (stderr, "mpn_invert_3by2 failed:\n");
dump ("u", u);
dump ("m", m);
dump ("p", p);
dump ("t", t);
abort ();
}
mpz_clear (m);
mpz_clear (p);
mpz_clear (t);
}
void
testmain (int argc, char **argv)
{
unsigned i;
mpz_t u, m, p, t;
mpz_init (u);
mpz_init (m);
mpz_init (p);
mpz_init (t);
/* These values trigger 32-bit overflow of ql in mpn_invert_3by2. */
if (GMP_LIMB_BITS == 64)
{
mpz_set_str (u, "80007fff3ffe0000", 16);
test_2by1 (u);
mpz_set_str (u, "80007fff3ffe000000000000000003ff", 16);
test_3by2 (u);
}
for (i = 0; i < COUNT; i++)
{
mini_urandomb (u, GMP_LIMB_BITS);
mpz_setbit (u, GMP_LIMB_BITS -1);
test_2by1 (u);
}
for (i = 0; i < COUNT; i++)
{
mini_urandomb (u, 2*GMP_LIMB_BITS);
mpz_setbit (u, 2*GMP_LIMB_BITS -1);
test_3by2 (u);
}
mpz_clear (u);
}
|
