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
|
/* Copyright 1996, 2001 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"
#define ADD 1
#define SUB 2
#ifndef METHOD
#define METHOD ADD
#endif
#if METHOD == ADD
#define REFCALL refmpn_add_n
#define TESTCALL mpn_add_n
#endif
#if METHOD == SUB
#define REFCALL refmpn_sub_n
#define TESTCALL mpn_sub_n
#endif
mp_limb_t refmpn_add_n ();
mp_limb_t refmpn_sub_n ();
#define SIZE 100
main (argc, argv)
int argc;
char **argv;
{
mp_size_t alloc_size, max_size, size, i, cumul_size;
mp_ptr s1, s2, dx, dy;
int s1_align, s2_align, d_align;
long pass, n_passes;
mp_limb_t cx, cy;
max_size = SIZE;
n_passes = 1000000;
argc--; argv++;
if (argc)
{
max_size = atol (*argv);
argc--; argv++;
}
alloc_size = max_size + 32;
s1 = malloc (alloc_size * BYTES_PER_MP_LIMB);
s2 = malloc (alloc_size * BYTES_PER_MP_LIMB);
dx = malloc (alloc_size * BYTES_PER_MP_LIMB);
dy = malloc (alloc_size * BYTES_PER_MP_LIMB);
cumul_size = 0;
for (pass = 0; pass < n_passes; pass++)
{
cumul_size += size;
if (cumul_size >= 1000000)
{
cumul_size -= 1000000;
printf ("%d ", pass); fflush (stdout);
}
s1_align = random () % 32;
s2_align = random () % 32;
d_align = random () % 32;
size = random () % max_size + 1;
mpn_random2 (s1 + s1_align, size);
mpn_random2 (s2 + s2_align, size);
for (i = 0; i < alloc_size; i++)
dx[i] = dy[i] = i + 0x9876500;
cx = TESTCALL (dx + d_align, s1 + s1_align, s2 + s2_align, size);
cy = REFCALL (dy + d_align, s1 + s1_align, s2 + s2_align, size);
if (cx != cy || mpn_cmp (dx, dy, alloc_size) != 0)
abort ();
}
printf ("%d passes OK\n", n_passes);
exit (0);
}
mp_limb_t
#if __STDC__
refmpn_add_n (mp_ptr res_ptr,
mp_srcptr s1_ptr, mp_srcptr s2_ptr, mp_size_t size)
#else
refmpn_add_n (res_ptr, s1_ptr, s2_ptr, size)
register mp_ptr res_ptr;
register mp_srcptr s1_ptr;
register mp_srcptr s2_ptr;
mp_size_t size;
#endif
{
register mp_limb_t x, y, cy;
register mp_size_t j;
/* The loop counter and index J goes from -SIZE to -1. This way
the loop becomes faster. */
j = -size;
/* Offset the base pointers to compensate for the negative indices. */
s1_ptr -= j;
s2_ptr -= j;
res_ptr -= j;
cy = 0;
do
{
y = s2_ptr[j];
x = s1_ptr[j];
y += cy; /* add previous carry to one addend */
cy = (y < cy); /* get out carry from that addition */
y = x + y; /* add other addend */
cy = (y < x) + cy; /* get out carry from that add, combine */
res_ptr[j] = y;
}
while (++j != 0);
return cy;
}
mp_limb_t
#if __STDC__
refmpn_sub_n (mp_ptr res_ptr,
mp_srcptr s1_ptr, mp_srcptr s2_ptr, mp_size_t size)
#else
refmpn_sub_n (res_ptr, s1_ptr, s2_ptr, size)
register mp_ptr res_ptr;
register mp_srcptr s1_ptr;
register mp_srcptr s2_ptr;
mp_size_t size;
#endif
{
register mp_limb_t x, y, cy;
register mp_size_t j;
/* The loop counter and index J goes from -SIZE to -1. This way
the loop becomes faster. */
j = -size;
/* Offset the base pointers to compensate for the negative indices. */
s1_ptr -= j;
s2_ptr -= j;
res_ptr -= j;
cy = 0;
do
{
y = s2_ptr[j];
x = s1_ptr[j];
y += cy; /* add previous carry to subtrahend */
cy = (y < cy); /* get out carry from that addition */
y = x - y; /* main subtract */
cy = (y > x) + cy; /* get out carry from the subtract, combine */
res_ptr[j] = y;
}
while (++j != 0);
return cy;
}
|
