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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
/* mpn_set_str (mp_ptr res_ptr, const char *str, size_t str_len, int base) --
Convert a STR_LEN long base BASE byte string pointed to by STR to a limb
vector pointed to by RES_PTR. Return the number of limbs in RES_PTR.
Contributed to the GNU project by Torbjorn Granlund.
THE FUNCTIONS IN THIS FILE, EXCEPT mpn_set_str, ARE INTERNAL WITH MUTABLE
INTERFACES. IT IS ONLY SAFE TO REACH THEM THROUGH DOCUMENTED INTERFACES.
IN FACT, IT IS ALMOST GUARANTEED THAT THEY WILL CHANGE OR DISAPPEAR IN A
FUTURE GNU MP RELEASE.
Copyright 1991-2017 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 either:
* 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.
or
* the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your option) any
later version.
or both in parallel, as here.
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 General Public License
for more details.
You should have received copies of the GNU General Public License and the
GNU Lesser General Public License along with the GNU MP Library. If not,
see https://www.gnu.org/licenses/. */
/* TODO:
Perhaps do not compute the highest power?
Instead, multiply twice by the 2nd highest power:
_______
|_______| hp
|_______| pow
_______________
|_______________| final result
_______
|_______| hp
|___| pow[-1]
___________
|___________| intermediate result
|___| pow[-1]
_______________
|_______________| final result
Generalizing that idea, perhaps we should make powtab contain successive
cubes, not squares.
*/
#include "gmp-impl.h"
mp_size_t
mpn_set_str (mp_ptr rp, const unsigned char *str, size_t str_len, int base)
{
if (POW2_P (base))
{
/* The base is a power of 2. Read the input string from least to most
significant character/digit. */
const unsigned char *s;
int next_bitpos;
mp_limb_t res_digit;
mp_size_t size;
int bits_per_indigit = mp_bases[base].big_base;
size = 0;
res_digit = 0;
next_bitpos = 0;
for (s = str + str_len - 1; s >= str; s--)
{
int inp_digit = *s;
res_digit |= ((mp_limb_t) inp_digit << next_bitpos) & GMP_NUMB_MASK;
next_bitpos += bits_per_indigit;
if (next_bitpos >= GMP_NUMB_BITS)
{
rp[size++] = res_digit;
next_bitpos -= GMP_NUMB_BITS;
res_digit = inp_digit >> (bits_per_indigit - next_bitpos);
}
}
if (res_digit != 0)
rp[size++] = res_digit;
return size;
}
if (BELOW_THRESHOLD (str_len, SET_STR_PRECOMPUTE_THRESHOLD))
return mpn_bc_set_str (rp, str, str_len, base);
else
{
mp_ptr powtab_mem, tp;
powers_t powtab[GMP_LIMB_BITS];
int chars_per_limb;
powers_t *pt;
size_t n_pows;
mp_size_t size;
mp_size_t un;
TMP_DECL;
TMP_MARK;
chars_per_limb = mp_bases[base].chars_per_limb;
un = str_len / chars_per_limb + 1; /* FIXME: scalar integer division */
/* Allocate one large block for the powers of big_base. */
powtab_mem = TMP_BALLOC_LIMBS (mpn_str_powtab_alloc (un));
n_pows = mpn_compute_powtab (powtab, powtab_mem, un, base);
pt = powtab + n_pows;
tp = TMP_BALLOC_LIMBS (mpn_dc_set_str_itch (un));
size = mpn_dc_set_str (rp, str, str_len, pt, tp);
TMP_FREE;
return size;
}
}
mp_size_t
mpn_dc_set_str (mp_ptr rp, const unsigned char *str, size_t str_len,
const powers_t *powtab, mp_ptr tp)
{
size_t len_lo, len_hi;
mp_limb_t cy;
mp_size_t ln, hn, n, sn;
len_lo = powtab->digits_in_base;
if (str_len <= len_lo)
{
if (BELOW_THRESHOLD (str_len, SET_STR_DC_THRESHOLD))
return mpn_bc_set_str (rp, str, str_len, powtab->base);
else
return mpn_dc_set_str (rp, str, str_len, powtab - 1, tp);
}
len_hi = str_len - len_lo;
ASSERT (len_lo >= len_hi);
if (BELOW_THRESHOLD (len_hi, SET_STR_DC_THRESHOLD))
hn = mpn_bc_set_str (tp, str, len_hi, powtab->base);
else
hn = mpn_dc_set_str (tp, str, len_hi, powtab - 1, rp);
sn = powtab->shift;
if (hn == 0)
{
/* Zero +1 limb here, to avoid reading an allocated but uninitialised
limb in mpn_incr_u below. */
MPN_ZERO (rp, powtab->n + sn + 1);
}
else
{
if (powtab->n > hn)
mpn_mul (rp + sn, powtab->p, powtab->n, tp, hn);
else
mpn_mul (rp + sn, tp, hn, powtab->p, powtab->n);
MPN_ZERO (rp, sn);
}
str = str + str_len - len_lo;
if (BELOW_THRESHOLD (len_lo, SET_STR_DC_THRESHOLD))
ln = mpn_bc_set_str (tp, str, len_lo, powtab->base);
else
ln = mpn_dc_set_str (tp, str, len_lo, powtab - 1, tp + powtab->n + sn + 1);
if (ln != 0)
{
cy = mpn_add_n (rp, rp, tp, ln);
mpn_incr_u (rp + ln, cy);
}
n = hn + powtab->n + sn;
return n - (rp[n - 1] == 0);
}
mp_size_t
mpn_bc_set_str (mp_ptr rp, const unsigned char *str, size_t str_len, int base)
{
mp_size_t size;
size_t i;
long j;
mp_limb_t cy_limb;
mp_limb_t big_base;
int chars_per_limb;
mp_limb_t res_digit;
ASSERT (base >= 2);
ASSERT (base < numberof (mp_bases));
ASSERT (str_len >= 1);
big_base = mp_bases[base].big_base;
chars_per_limb = mp_bases[base].chars_per_limb;
size = 0;
for (i = chars_per_limb; i < str_len; i += chars_per_limb)
{
res_digit = *str++;
if (base == 10)
{ /* This is a common case.
Help the compiler to avoid multiplication. */
for (j = MP_BASES_CHARS_PER_LIMB_10 - 1; j != 0; j--)
res_digit = res_digit * 10 + *str++;
}
else
{
for (j = chars_per_limb - 1; j != 0; j--)
res_digit = res_digit * base + *str++;
}
if (size == 0)
{
if (res_digit != 0)
{
rp[0] = res_digit;
size = 1;
}
}
else
{
#if HAVE_NATIVE_mpn_mul_1c
cy_limb = mpn_mul_1c (rp, rp, size, big_base, res_digit);
#else
cy_limb = mpn_mul_1 (rp, rp, size, big_base);
cy_limb += mpn_add_1 (rp, rp, size, res_digit);
#endif
if (cy_limb != 0)
rp[size++] = cy_limb;
}
}
big_base = base;
res_digit = *str++;
if (base == 10)
{ /* This is a common case.
Help the compiler to avoid multiplication. */
for (j = str_len - (i - MP_BASES_CHARS_PER_LIMB_10) - 1; j > 0; j--)
{
res_digit = res_digit * 10 + *str++;
big_base *= 10;
}
}
else
{
for (j = str_len - (i - chars_per_limb) - 1; j > 0; j--)
{
res_digit = res_digit * base + *str++;
big_base *= base;
}
}
if (size == 0)
{
if (res_digit != 0)
{
rp[0] = res_digit;
size = 1;
}
}
else
{
#if HAVE_NATIVE_mpn_mul_1c
cy_limb = mpn_mul_1c (rp, rp, size, big_base, res_digit);
#else
cy_limb = mpn_mul_1 (rp, rp, size, big_base);
cy_limb += mpn_add_1 (rp, rp, size, res_digit);
#endif
if (cy_limb != 0)
rp[size++] = cy_limb;
}
return size;
}
|