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
|
/* mpfr_print_raw -- print the internal binary representation of a
floating-point number
Copyright (C) 1999 Free Software Foundation.
This file is part of the MPFR Library.
The MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at your
option) any later version.
The MPFR 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 Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with the MPFR Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "mpfr.h"
#include "mpfr-impl.h"
void mpfr_get_str_raw (char *, mpfr_srcptr);
void
#if __STDC__
mpfr_get_str_raw (char *digit_ptr, mpfr_srcptr x)
#else
mpfr_get_str_raw (digit_ptr, x)
char *digit_ptr;
mpfr_srcptr x;
#endif
{
mp_limb_t *mx, wd, t; long ex, sx, k, l, p;
mx = MPFR_MANT(x);
ex = MPFR_EXP(x);
p = MPFR_PREC(x);
/* TODO: utilite de gerer l'infini a ce niveau ? */
if (MPFR_SIGN(x) < 0) { *digit_ptr = '-'; digit_ptr++; }
sprintf(digit_ptr, "0."); digit_ptr += 2;
sx = 1+(p-1)/BITS_PER_MP_LIMB; /* number of significant limbs */
for (k = sx - 1; k >= 0 ; k--)
{
wd = mx[k];
t = ((mp_limb_t)1) << (BITS_PER_MP_LIMB - 1);
for (l = BITS_PER_MP_LIMB - 1; l>=0; l--)
{
if (wd & t)
{ *digit_ptr = '1'; digit_ptr++; }
else
{ *digit_ptr = '0'; digit_ptr++; }
t >>= 1;
if (--p==0) { *digit_ptr = '['; digit_ptr++; }
}
}
sprintf(digit_ptr, "]E%ld", ex);
}
void
#if __STDC__
mpfr_print_raw(mpfr_srcptr x)
#else
mpfr_print_raw(x)
mpfr_srcptr x;
#endif
{
char *str;
unsigned long alloc_size;
if (MPFR_IS_NAN(x)) printf("NaN");
else if (MPFR_IS_INF(x)) {
if (MPFR_SIGN(x) == 1) { printf("Inf"); } else printf("-Inf");
}
else if (!MPFR_NOTZERO(x)) {
if (MPFR_SIGN(x) < 0) printf("-");
printf("0");
}
else {
/* 3 char for sign + 0 + binary point
+ MPFR_ABSSIZE(x) * BITS_PER_MP_LIMB for mantissa
+ 2 for brackets in mantissa
+ 1 for 'E'
+ 11 for exponent (including sign)
= 17 + MPFR_ABSSIZE(x) * BITS_PER_MP_LIMB
*/
alloc_size = 17 + MPFR_ABSSIZE(x) * BITS_PER_MP_LIMB;
str = (char *) (*_mp_allocate_func) (alloc_size * sizeof(char));
if (str == NULL) {
fprintf (stderr, "Error in mpfr_print_raw: no more memory available\n");
exit (1);
}
mpfr_get_str_raw(str, x);
printf("%s", str);
(*_mp_free_func) (str, alloc_size * sizeof(char));
}
}
|