forked from libtom/libtomfloat
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmpf_get_str.c
499 lines (465 loc) · 13 KB
/
mpf_get_str.c
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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
#include <tomfloat.h>
#include <string.h>
static long get_mp_digits(mp_int * a, int base)
{
double log210;
long bits = mp_count_bits(a);
switch (base) {
case 2:
log210 = 1.0;
break;
case 8:
log210 = 3.0;
break;
case 10:
log210 = 3.321928094887362347870319429489390175865;
break;
case 16:
log210 = 4.0;
break;
default:
log210 = log(bits) / log(2.0);
break;
}
return (long) (round(bits / log210));
}
static int mp_print(mp_int * a)
{
char *str, *s0;
size_t size;
int err;
size = (size_t) (get_mp_digits(a, 10) + 10);
str = malloc(size * sizeof(char));
if (NULL == str) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
size * sizeof(char));
return MP_MEM;
}
s0 = str;
while (--size) {
*s0++ = '\0';
}
if ((err = mp_toradix(a, str, 10)) != MP_OKAY) {
return err;
}
printf("%s\n", str);
free(str);
return MP_OKAY;
}
/* Convert a mp_float into a string. Scientific notation and base 10 only
(for now)
The string gets allocated by the function, freeing is left to the caller.
This is not the fastest way to do it
*/
int mpf_get_str(mp_float * a, char **str, int base)
{
mp_int ret, ten;
mp_float ret2, ten2, anew, log10, loga;
mp_digit grs;
int err, digits, tmpdigits;
int decprec, decexpo;
int sign, signbit;
int rlen;
char *tmp, *s,**s0;
size_t len, offset;
long eps, move;
double d;
// rounding bit
mp_digit c;
if (base != 2 && base != 10 && base != 16) {
fprintf(stderr, "Base must be one of 2, 10, or 16\n");
return MP_VAL;
}
if (base != 10) {
fprintf(stderr, "Base is (temporarily) restricted to 10\n");
return MP_VAL;
}
// number of decimal digits to print
decprec = mpf_getdecimalprecision(a->radix);
// some guard digits
eps = (a->radix) + MP_DIGIT_BIT;
if (mpf_iszero(a)) {
goto print_zero;
}
if ((err = mpf_init_copy(a, &anew)) != MP_OKAY) {
mp_clear(&ret);
return err;
}
if ((err = mpf_normalize_to(&anew, eps)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear(&anew);
return err;
}
if ((err = mpf_init_multi(anew.radix, &log10, &loga, NULL)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear(&anew);
return err;
}
if ((&a->mantissa)->sign == MP_NEG) {
sign = MP_NEG;
anew.mantissa.sign = MP_ZPOS;
} else {
sign = MP_ZPOS;
}
// it must be an integer
if (a->exp >= 0) {
if ((err = mp_init_copy(&ret, &a->mantissa)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
ret.sign = MP_ZPOS;
// TODO: implement the other two bases
if ((err = mp_mul_2d(&ret, (int) a->exp, &ret)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_const_le10(&log10) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_ln(&anew, &loga) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_div(&loga, &log10, &loga) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_floor(&loga, &loga) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_set_double(&loga, &d) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
// exponent is always in base ten
digits = (int) (d);
decexpo = digits;
if ((err = mpf_init(&ret2, eps)) != MP_OKAY) {
mp_clear(&ret);
return err;
}
if ((err = mpf_from_mp_int(&ret, &ret2)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear(&ret2);
return err;
}
if ((err = mpf_init(&ten2, eps)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear(&ret2);
return err;
}
if ((err = mpf_const_d(&ten2, base)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
if ((err = mpf_pow_d(&ten2, digits - decprec, &ten2)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
if ((err = mpf_div(&ret2, &ten2, &ret2)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
if ((err = mpf_normalize_to(&ret2, a->radix)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear(&anew);
return err;
}
if (ret2.exp < 0) {
c = ret2.mantissa.dp[abs(ret2.exp) /
MP_DIGIT_BIT] & (1U << (abs(ret2.exp) % DIGIT_BIT));
if ((err =
mp_div_2d(&ret2.mantissa, abs(ret2.exp), &ret2.mantissa,
NULL)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
// TODO round according to fenv
if (c != 0) {
rlen = mp_count_bits(&ret2.mantissa);
if ((err = mp_add_d(&ret2.mantissa, 1, &ret2.mantissa)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
// rounding may have added one bit
if(rlen < mp_count_bits(&ret)){
if( (err = mp_div_2(&ret,&ret) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
}
}
} else {
if ((err =
mp_mul_2d(&ret2.mantissa, abs(ret2.exp),
&ret2.mantissa)) != MP_OKAY) {
mp_clear(&ret);
mpf_clear_multi(&ret2, &ten2, NULL);
return err;
}
}
mp_exch(&ret2.mantissa, &ret);
mpf_clear_multi(&ret2, &ten2, NULL);
if (mp_iszero(&ret)) {
mp_clear(&ret);
goto print_zero;
}
// We have to allocate memory for the resulting string
// but do not know how much. Finding it out involves a
// lot of guesswork, hence the large amount of angst-allowance
tmpdigits = get_mp_digits(&ret, base) + 5;
// digits in ret + sign + expo.-mark + expo + angst-allowance = 50
*str = malloc((tmpdigits + 50) * sizeof(char));
if (*str == NULL) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
(tmpdigits + 50) * sizeof(char));
mp_clear_multi(&ret, &ten, NULL);
return err;
}
if (sign == MP_NEG) {
ret.sign = MP_NEG;
}
if ((err = mp_get_str(&ret, *str, 0,base)) != MP_OKAY) {
mp_clear_multi(&ret, &ten, NULL);
free(str);
return err;
}
goto print_number;
} else {
// it is not necessarily an integer
if ((err = mp_init_copy(&ret, &anew.mantissa)) != MP_OKAY) {
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
ret.sign = MP_ZPOS;
decexpo = mpf_getdecimalexponent(a->exp);
// TODO: implement the other two bases
if( (err = mpf_const_le10(&log10) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_ln(&anew, &loga) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mpf_div(&loga, &log10, &loga) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
signbit = mpf_signbit(&loga);
if( (err = mpf_set_double(&loga, &d) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
d = fabs(d);
digits = (int) (d);
decexpo = digits;
if( (err = mp_init_set_int(&ten,10L) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mp_expt_d(&ten,digits + decprec,&ten) ) != MP_OKAY){
mp_clear_multi(&ret,&ten,NULL);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if( (err = mp_mul(&ret,&ten,&ret) ) != MP_OKAY){
mp_clear_multi(&ret,&ten,NULL);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
mp_clear(&ten);
// TODO: round according to fenv!
move = -((&anew)->exp);
// We need at least four bits for rounding. The simplest thing is
// to shift "ret" for "move - 4" first to get the bits.
if( (err = mp_div_2d(&ret,move - 4,&ret,NULL) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
// get LSL (last significant limb) and the last 4 bits of it
grs = ret.dp[0] & 0xF;
// round nearest to even
/*
decimal
x0xx down -
1100 up 12
0100 down 4
x101 up 5
x110 up 6
x111 up 7
*/
// 0100 || x0xx
if(grs == 4 || ((grs>>2)&1) == 0){
// just truncate
if( (err = mp_div_2d(&ret,4,&ret,NULL) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
} else {
// adding might carry, save length
rlen = mp_count_bits(&ret);
if( (err = mp_add_d(&ret, 4, &ret) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
if(rlen < mp_count_bits(&ret)){
if( (err = mp_div_2d(&ret,3,&ret,NULL) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
} else {
if( (err = mp_div_2d(&ret,4,&ret,NULL) ) != MP_OKAY){
mp_clear(&ret);
mpf_clear_multi(&anew,&loga,&log10,NULL);
return err;
}
}
}
tmpdigits = get_mp_digits(&ret, base) + 5;
//printf("length ret = %d dec digits = %d\n",mp_count_bits(&ret), (int)(mp_count_bits(&ret)/(log(10)/log(2)) ) );
// digits in ret + sign + expo.-mark + expo + angst-allowance = 50
*str = malloc((tmpdigits + 50) * sizeof(char));
if (*str == NULL) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
(tmpdigits + 50) * sizeof(char));
mp_clear_multi(&ret, &ten, NULL);
return err;
}
//printf("length tmpdigits = %ld\n",tmpdigits + 50);
if (sign == MP_NEG) {
ret.sign = MP_NEG;
}
if ((err = mp_get_str(&ret, *str, 0,base)) != MP_OKAY) {
mp_clear_multi(&ret, &ten, NULL);
free(str);
return err;
}
// round away from zero
if (signbit == MP_NEG) {
digits = -ceil(d);
} else {
digits = floor(d);
}
decexpo = digits;
if (base == 10) {
if (sign == MP_NEG) {
*((*str) + decprec + 1) = '\0';
} else {
*((*str) + decprec) = '\0';
}
}
goto print_number;
}
print_zero:
if (base == 10) {
*str = malloc(6 * sizeof(char));
if (NULL == *str) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
6 * sizeof(char));
}
*str = strcpy(*str, "0.0E0");
} else {
*str = malloc(8 * sizeof(char));
if (NULL == *str) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
8 * sizeof(char));
}
if (base == 16) {
*str = strcpy(*str, "0x0.0P0");
} else {
*str = strcpy(*str, "0b0.0P0");
}
}
return MP_OKAY;
print_number:
// assuming 8 bit char < 4 decimal digits (plus sign, EOS and a.-a.)
tmp = malloc((sizeof(int) * 4 + 3) * sizeof(char));
if (tmp == NULL) {
fprintf(stderr, "malloc failed to allocate %lu bytes\n",
(sizeof(long) * 4 + 3) * sizeof(char));
mp_clear_multi(&ret, &ten, NULL);
free(str);
return err;
}
// TODO: check return of snprintf(3)
snprintf(tmp, (sizeof(int) * 4 + 3) * sizeof(char), "%d", decexpo);
/*
* The digits are allocated, the exponent is allocated, leaves the
* sign, the decimal mark (we do scientific notation only), the
* exponent mark and the EOS; makes 4. So lets take 5 because I
* like the rythm. And don't forget to add 3 more for a prefix.
*/
if (strlen(*str) + strlen(tmp) + 8 >= (tmpdigits + 50) * sizeof(char)) {
// TODO: use realloc() ?
// Bail out. For now.
fprintf(stderr, "Not enough memory allocated for output. Please report\n");
mp_clear_multi(&ret, &ten, NULL);
free(str);
free(tmp);
return err;
}
// a bit of pointer juggling, sorry.
// string length plus EOS
len = strlen(*str) + 1;
// adjust for a sign if necessary
if (ret.sign == MP_NEG) {
offset = 2;
} else {
offset = 1;
}
// move the whole thing by one byte
s = memmove((*str) + 1, *str, len);
// set first digit
*((*str) + 1) = *(s + 1);
// set decimal point
*((*str) + offset) = '.';
// put all together: prefix, exponent mark, and exponent
if (base == 2 || base == 16) {
len = strlen(*str) + 1;
// move the whole thing by two bytes
s = memmove((*str) + 2, *str, len);
if (ret.sign == MP_NEG) {
// set sign
*((*str)) = *s;
// set prefix
*((*str) + 1) = '0';
*((*str) + 2) = (base == 2) ? 'b' : 'x';
} else {
*(*str) = '0';
*((*str) + 1) = (base == 2) ? 'b' : 'x';
}
*str = strcat(*str, "p");
*str = strcat(*str, tmp);
} else {
*str = strcat(*str, "e");
*str = strcat(*str, tmp);
}
mp_clear(&ret);
free(tmp);
return MP_OKAY;
}