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
|
/* Factoring of uintmax_t numbers. Generation of needed tables.
Contributed to the GNU project by Torbjörn Granlund and Niels Möller
Contains code from GNU MP.
Copyright 2012-2015 Free Software Foundation, Inc.
This program 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.
This program 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
this program. If not, see http://www.gnu.org/licenses/. */
#include <config.h>
#include <limits.h>
#include <stdint.h>
#include <inttypes.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
/* Deactivate config.h's "rpl_"-prefixed definitions of these symbols. */
#undef fclose
#undef malloc
#undef strerror
/* An unsigned type that is no narrower than 32 bits and no narrower
than unsigned int. It's best to make it as wide as possible.
For GCC 4.6 and later, use a heuristic to guess whether unsigned
__int128 works on your platform. If this heuristic does not work
for you, please report a bug; in the meantime compile with, e.g.,
-Dwide_uint='unsigned __int128' to override the heuristic. */
#ifndef wide_uint
# if 4 < __GNUC__ + (6 <= __GNUC_MINOR__) && ULONG_MAX >> 31 >> 31 >> 1 != 0
typedef unsigned __int128 wide_uint;
# else
typedef uintmax_t wide_uint;
# endif
#endif
struct prime
{
unsigned p;
wide_uint pinv; /* Inverse mod b = 2^{bitsize of wide_uint} */
wide_uint lim; /* floor ((wide_uint) -1 / p) */
};
static wide_uint _GL_ATTRIBUTE_CONST
binvert (wide_uint a)
{
wide_uint x = 0xf5397db1 >> (4*((a/2) & 0x7));
for (;;)
{
wide_uint y = 2*x - x*x*a;
if (y == x)
return x;
x = y;
}
}
static void
process_prime (struct prime *info, unsigned p)
{
wide_uint max = -1;
info->p = p;
info->pinv = binvert (p);
info->lim = max / p;
}
static void
print_wide_uint (wide_uint n, int nesting, unsigned wide_uint_bits)
{
/* Number of bits per integer literal. 8 is too many, because
uintmax_t is 32 bits on some machines so we cannot shift by 32 bits.
So use 7. */
int hex_digits_per_literal = 7;
int bits_per_literal = hex_digits_per_literal * 4;
unsigned remainder = n & ((1 << bits_per_literal) - 1);
if (n != remainder)
{
int needs_parentheses = n >> bits_per_literal >> bits_per_literal != 0;
if (needs_parentheses)
printf ("(");
print_wide_uint (n >> bits_per_literal, nesting + 1, wide_uint_bits);
if (needs_parentheses)
printf (")\n%*s", nesting + 3, "");
printf (" << %d | ", bits_per_literal);
}
else if (nesting)
{
printf ("(uintmax_t) ");
hex_digits_per_literal
= ((wide_uint_bits - 1) % bits_per_literal) % 4 + 1;
}
printf ("0x%0*xU", hex_digits_per_literal, remainder);
}
static void
output_primes (const struct prime *primes, unsigned nprimes)
{
unsigned i;
unsigned p;
int is_prime;
/* Compute wide_uint_bits by repeated shifting, rather than by
multiplying sizeof by CHAR_BIT, as this works even if the
wide_uint representation has holes. */
unsigned wide_uint_bits = 0;
wide_uint mask = -1;
for (wide_uint_bits = 0; mask; wide_uint_bits++)
mask >>= 1;
puts ("/* Generated file -- DO NOT EDIT */\n");
printf ("#define WIDE_UINT_BITS %u\n", wide_uint_bits);
for (i = 0, p = 2; i < nprimes; i++)
{
unsigned int d8 = i + 8 < nprimes ? primes[i + 8].p - primes[i].p : 0xff;
if (255 < d8) /* this happens at 668221 */
abort ();
printf ("P (%u, %u,\n (", primes[i].p - p, d8);
print_wide_uint (primes[i].pinv, 0, wide_uint_bits);
printf ("),\n UINTMAX_MAX / %u)\n", primes[i].p);
p = primes[i].p;
}
printf ("\n#undef FIRST_OMITTED_PRIME\n");
/* Find next prime */
do
{
p += 2;
for (i = 0, is_prime = 1; is_prime; i++)
{
if (primes[i].p * primes[i].p > p)
break;
if (p * primes[i].pinv <= primes[i].lim)
{
is_prime = 0;
break;
}
}
}
while (!is_prime);
printf ("#define FIRST_OMITTED_PRIME %u\n", p);
}
static void *
xalloc (size_t s)
{
void *p = malloc (s);
if (p)
return p;
fprintf (stderr, "Virtual memory exhausted.\n");
exit (EXIT_FAILURE);
}
int
main (int argc, char **argv)
{
int limit;
char *sieve;
size_t size, i;
struct prime *prime_list;
unsigned nprimes;
if (argc != 2)
{
fprintf (stderr, "Usage: %s LIMIT\n"
"Produces a list of odd primes <= LIMIT\n", argv[0]);
return EXIT_FAILURE;
}
limit = atoi (argv[1]);
if (limit < 3)
return EXIT_SUCCESS;
/* Make limit odd */
if ( !(limit & 1))
limit--;
size = (limit-1)/2;
/* sieve[i] represents 3+2*i */
sieve = xalloc (size);
memset (sieve, 1, size);
prime_list = xalloc (size * sizeof (*prime_list));
nprimes = 0;
for (i = 0; i < size;)
{
unsigned p = 3+2*i;
unsigned j;
process_prime (&prime_list[nprimes++], p);
for (j = (p*p - 3)/2; j < size; j+= p)
sieve[j] = 0;
while (++i < size && sieve[i] == 0)
;
}
output_primes (prime_list, nprimes);
if (ferror (stdout) + fclose (stdout))
{
fprintf (stderr, "write error: %s\n", strerror (errno));
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
