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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
|
/* Test mpn_add_1 and mpn_sub_1.
Copyright 2001, 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"
#define M GMP_NUMB_MAX
#define ASIZE 10
#define MAGIC 0x1234
#define SETUP() \
do { \
refmpn_random (got, data[i].size); \
got[data[i].size] = MAGIC; \
} while (0)
#define SETUP_INPLACE() \
do { \
refmpn_copyi (got, data[i].src, data[i].size); \
got[data[i].size] = MAGIC; \
} while (0)
#define VERIFY(name) \
do { \
verify (name, i, data[i].src, data[i].n, \
got_c, data[i].want_c, \
got, data[i].want, data[i].size); \
} while (0)
typedef mp_limb_t (*mpn_aors_1_t)
__GMP_PROTO ((mp_ptr, mp_srcptr, mp_size_t, mp_limb_t));
mpn_aors_1_t fudge __GMP_PROTO ((mpn_aors_1_t));
void
verify (const char *name, int i,
mp_srcptr src, mp_limb_t n,
mp_limb_t got_c, mp_limb_t want_c,
mp_srcptr got, mp_srcptr want, mp_size_t size)
{
if (got[size] != MAGIC)
{
printf ("Overwrite at %s i=%d\n", name, i);
abort ();
}
if (got_c != want_c || ! refmpn_equal_anynail (got, want, size))
{
printf ("Wrong at %s i=%d size=%ld\n", name, i, size);
mpn_trace (" src", src, size);
mpn_trace (" n", &n, (mp_size_t) 1);
mpn_trace (" got", got, size);
mpn_trace (" want", want, size);
mpn_trace (" got c", &got_c, (mp_size_t) 1);
mpn_trace ("want c", &want_c, (mp_size_t) 1);
abort ();
}
}
void
check_add_1 (void)
{
static const struct {
mp_size_t size;
mp_limb_t n;
const mp_limb_t src[ASIZE];
mp_limb_t want_c;
const mp_limb_t want[ASIZE];
} data[] = {
{ 1, 0, { 0 }, 0, { 0 } },
{ 1, 0, { 1 }, 0, { 1 } },
{ 1, 1, { 0 }, 0, { 1 } },
{ 1, 0, { M }, 0, { M } },
{ 1, M, { 0 }, 0, { M } },
{ 1, 1, { 123 }, 0, { 124 } },
{ 1, 1, { M }, 1, { 0 } },
{ 1, M, { 1 }, 1, { 0 } },
{ 1, M, { M }, 1, { M-1 } },
{ 2, 0, { 0, 0 }, 0, { 0, 0 } },
{ 2, 0, { 1, 0 }, 0, { 1, 0 } },
{ 2, 1, { 0, 0 }, 0, { 1, 0 } },
{ 2, 0, { M, 0 }, 0, { M, 0 } },
{ 2, M, { 0, 0 }, 0, { M, 0 } },
{ 2, 1, { M, 0 }, 0, { 0, 1 } },
{ 2, M, { 1, 0 }, 0, { 0, 1 } },
{ 2, M, { M, 0 }, 0, { M-1, 1 } },
{ 2, M, { M, 0 }, 0, { M-1, 1 } },
{ 2, 1, { M, M }, 1, { 0, 0 } },
{ 2, M, { 1, M }, 1, { 0, 0 } },
{ 2, M, { M, M }, 1, { M-1, 0 } },
{ 2, M, { M, M }, 1, { M-1, 0 } },
{ 3, 1, { M, M, M }, 1, { 0, 0, 0 } },
{ 3, M, { 1, M, M }, 1, { 0, 0, 0 } },
{ 3, M, { M, M, M }, 1, { M-1, 0, 0 } },
{ 3, M, { M, M, M }, 1, { M-1, 0, 0 } },
{ 4, 1, { M, M, M, M }, 1, { 0, 0, 0, 0 } },
{ 4, M, { 1, M, M, M }, 1, { 0, 0, 0, 0 } },
{ 4, M, { M, M, M, M }, 1, { M-1, 0, 0, 0 } },
{ 4, M, { M, M, M, M }, 1, { M-1, 0, 0, 0 } },
{ 4, M, { M, 0, M, M }, 0, { M-1, 1, M, M } },
{ 4, M, { M, M-1, M, M }, 0, { M-1, M, M, M } },
{ 4, M, { M, M, 0, M }, 0, { M-1, 0, 1, M } },
{ 4, M, { M, M, M-1, M }, 0, { M-1, 0, M, M } },
};
mp_limb_t got[ASIZE];
mp_limb_t got_c;
int i;
for (i = 0; i < numberof (data); i++)
{
SETUP ();
got_c = mpn_add_1 (got, data[i].src, data[i].size, data[i].n);
VERIFY ("check_add_1 (separate)");
SETUP_INPLACE ();
got_c = mpn_add_1 (got, got, data[i].size, data[i].n);
VERIFY ("check_add_1 (in-place)");
if (data[i].n == 1)
{
SETUP ();
got_c = mpn_add_1 (got, data[i].src, data[i].size, CNST_LIMB(1));
VERIFY ("check_add_1 (separate, const 1)");
SETUP_INPLACE ();
got_c = mpn_add_1 (got, got, data[i].size, CNST_LIMB(1));
VERIFY ("check_add_1 (in-place, const 1)");
}
/* Same again on functions, not inlines. */
SETUP ();
got_c = (*fudge(mpn_add_1)) (got, data[i].src, data[i].size, data[i].n);
VERIFY ("check_add_1 (function, separate)");
SETUP_INPLACE ();
got_c = (*fudge(mpn_add_1)) (got, got, data[i].size, data[i].n);
VERIFY ("check_add_1 (function, in-place)");
}
}
void
check_sub_1 (void)
{
static const struct {
mp_size_t size;
mp_limb_t n;
const mp_limb_t src[ASIZE];
mp_limb_t want_c;
const mp_limb_t want[ASIZE];
} data[] = {
{ 1, 0, { 0 }, 0, { 0 } },
{ 1, 0, { 1 }, 0, { 1 } },
{ 1, 1, { 1 }, 0, { 0 } },
{ 1, 0, { M }, 0, { M } },
{ 1, 1, { M }, 0, { M-1 } },
{ 1, 1, { 123 }, 0, { 122 } },
{ 1, 1, { 0 }, 1, { M } },
{ 1, M, { 0 }, 1, { 1 } },
{ 2, 0, { 0, 0 }, 0, { 0, 0 } },
{ 2, 0, { 1, 0 }, 0, { 1, 0 } },
{ 2, 1, { 1, 0 }, 0, { 0, 0 } },
{ 2, 0, { M, 0 }, 0, { M, 0 } },
{ 2, 1, { M, 0 }, 0, { M-1, 0 } },
{ 2, 1, { 123, 0 }, 0, { 122, 0 } },
{ 2, 1, { 0, 0 }, 1, { M, M } },
{ 2, M, { 0, 0 }, 1, { 1, M } },
{ 3, 0, { 0, 0, 0 }, 0, { 0, 0, 0 } },
{ 3, 0, { 123, 0, 0 }, 0, { 123, 0, 0 } },
{ 3, 1, { 0, 0, 0 }, 1, { M, M, M } },
{ 3, M, { 0, 0, 0 }, 1, { 1, M, M } },
{ 4, 1, { 0, 0, 0, 0 }, 1, { M, M, M, M } },
{ 4, M, { 0, 0, 0, 0 }, 1, { 1, M, M, M } },
{ 4, 1, { 0, 0, 1, 42 }, 0, { M, M, 0, 42 } },
{ 4, M, { 0, 0, 123, 24 }, 0, { 1, M, 122, 24 } },
};
mp_limb_t got[ASIZE];
mp_limb_t got_c;
int i;
for (i = 0; i < numberof (data); i++)
{
SETUP ();
got_c = mpn_sub_1 (got, data[i].src, data[i].size, data[i].n);
VERIFY ("check_sub_1 (separate)");
SETUP_INPLACE ();
got_c = mpn_sub_1 (got, got, data[i].size, data[i].n);
VERIFY ("check_sub_1 (in-place)");
if (data[i].n == 1)
{
SETUP ();
got_c = mpn_sub_1 (got, data[i].src, data[i].size, CNST_LIMB(1));
VERIFY ("check_sub_1 (separate, const 1)");
SETUP_INPLACE ();
got_c = mpn_sub_1 (got, got, data[i].size, CNST_LIMB(1));
VERIFY ("check_sub_1 (in-place, const 1)");
}
/* Same again on functions, not inlines. */
SETUP ();
got_c = (*fudge(mpn_sub_1)) (got, data[i].src, data[i].size, data[i].n);
VERIFY ("check_sub_1 (function, separate)");
SETUP_INPLACE ();
got_c = (*fudge(mpn_sub_1)) (got, got, data[i].size, data[i].n);
VERIFY ("check_sub_1 (function, in-place)");
}
}
/* Try to prevent the optimizer inlining. */
mpn_aors_1_t
fudge (mpn_aors_1_t f)
{
return f;
}
int
main (void)
{
tests_start ();
mp_trace_base = -16;
check_add_1 ();
check_sub_1 ();
tests_end ();
exit (0);
}
|
