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
|
/* Generate mpz_fac_ui 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 "dumbmp.c"
/* sets x=y*(y+2)*(y+4)*....*(y+2*(z-1)) */
void
odd_products (mpz_t x, mpz_t y, int z)
{
mpz_t t;
mpz_init_set (t, y);
mpz_set_ui (x, 1);
for (; z != 0; z--)
{
mpz_mul (x, x, t);
mpz_add_ui (t, t, 2);
}
mpz_clear (t);
return;
}
/* returns 0 on success */
int
gen_consts (int numb, int nail, int limb)
{
mpz_t x, y, z, t;
unsigned long a, b, first = 1;
printf ("/* This file is automatically generated by gen-fac_ui.c */\n\n");
printf ("#if GMP_NUMB_BITS != %d\n", numb);
printf ("Error , error this data is for %d GMP_NUMB_BITS only\n", numb);
printf ("#endif\n");
printf ("#if GMP_LIMB_BITS != %d\n", limb);
printf ("Error , error this data is for %d GMP_LIMB_BITS only\n", limb);
printf ("#endif\n");
printf
("/* This table is 0!,1!,2!,3!,...,n! where n! has <= GMP_NUMB_BITS bits */\n");
printf
("#define ONE_LIMB_FACTORIAL_TABLE CNST_LIMB(0x1),CNST_LIMB(0x1),CNST_LIMB(0x2),");
mpz_init_set_ui (x, 2);
for (b = 3;; b++)
{
mpz_mul_ui (x, x, b); /* so b!=a */
if (mpz_sizeinbase (x, 2) > numb)
break;
if (first)
{
first = 0;
}
else
{
printf ("),");
}
printf ("CNST_LIMB(0x");
mpz_out_str (stdout, 16, x);
}
printf (")\n");
mpz_set_ui (x, 1);
mpz_mul_2exp (x, x, limb + 1); /* x=2^(limb+1) */
mpz_init (y);
mpz_set_ui (y, 10000);
mpz_mul (x, x, y); /* x=2^(limb+1)*10^4 */
mpz_set_ui (y, 27182); /* exp(1)*10^4 */
mpz_tdiv_q (x, x, y); /* x=2^(limb+1)/exp(1) */
printf ("\n/* is 2^(GMP_LIMB_BITS+1)/exp(1) */\n");
printf ("#define FAC2OVERE CNST_LIMB(0x");
mpz_out_str (stdout, 16, x);
printf (")\n");
printf
("\n/* FACMULn is largest odd x such that x*(x+2)*...*(x+2(n-1))<=2^GMP_NUMB_BITS-1 */\n\n");
mpz_init (z);
mpz_init (t);
for (a = 2; a <= 4; a++)
{
mpz_set_ui (x, 1);
mpz_mul_2exp (x, x, numb);
mpz_root (x, x, a);
/* so x is approx sol */
if (mpz_even_p (x))
mpz_sub_ui (x, x, 1);
mpz_set_ui (y, 1);
mpz_mul_2exp (y, y, numb);
mpz_sub_ui (y, y, 1);
/* decrement x until we are <= real sol */
do
{
mpz_sub_ui (x, x, 2);
odd_products (t, x, a);
if (mpz_cmp (t, y) <= 0)
break;
}
while (1);
/* increment x until > real sol */
do
{
mpz_add_ui (x, x, 2);
odd_products (t, x, a);
if (mpz_cmp (t, y) > 0)
break;
}
while (1);
/* dec once to get real sol */
mpz_sub_ui (x, x, 2);
printf ("#define FACMUL%lu CNST_LIMB(0x", a);
mpz_out_str (stdout, 16, x);
printf (")\n");
}
return 0;
}
int
main (int argc, char *argv[])
{
int nail_bits, limb_bits, numb_bits;
if (argc != 3)
{
fprintf (stderr, "Usage: gen-fac_ui limbbits nailbits\n");
exit (1);
}
limb_bits = atoi (argv[1]);
nail_bits = atoi (argv[2]);
numb_bits = limb_bits - nail_bits;
if (limb_bits < 0 || nail_bits < 0 || numb_bits < 0)
{
fprintf (stderr, "Invalid limb/nail bits %d,%d\n", limb_bits,
nail_bits);
exit (1);
}
gen_consts (numb_bits, nail_bits, limb_bits);
return 0;
}
|
