1/****************************************************************
2
3The author of this software is David M. Gay.
4
5Copyright (C) 1998, 2000 by Lucent Technologies
6All Rights Reserved
7
8Permission to use, copy, modify, and distribute this software and
9its documentation for any purpose and without fee is hereby
10granted, provided that the above copyright notice appear in all
11copies and that both that the copyright notice and this
12permission notice and warranty disclaimer appear in supporting
13documentation, and that the name of Lucent or any of its entities
14not be used in advertising or publicity pertaining to
15distribution of the software without specific, written prior
16permission.
17
18LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
19INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
20IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
21SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
22WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
23IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
24ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
25THIS SOFTWARE.
26
27****************************************************************/
28
| 1/****************************************************************
2
3The author of this software is David M. Gay.
4
5Copyright (C) 1998, 2000 by Lucent Technologies
6All Rights Reserved
7
8Permission to use, copy, modify, and distribute this software and
9its documentation for any purpose and without fee is hereby
10granted, provided that the above copyright notice appear in all
11copies and that both that the copyright notice and this
12permission notice and warranty disclaimer appear in supporting
13documentation, and that the name of Lucent or any of its entities
14not be used in advertising or publicity pertaining to
15distribution of the software without specific, written prior
16permission.
17
18LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
19INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
20IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
21SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
22WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
23IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
24ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
25THIS SOFTWARE.
26
27****************************************************************/
28
|
29/* Please send bug reports to
30 David M. Gay
31 Bell Laboratories, Room 2C-463
32 600 Mountain Avenue
33 Murray Hill, NJ 07974-0636
34 U.S.A.
35 dmg@bell-labs.com
36 */
| 29/* Please send bug reports to David M. Gay (dmg at acm dot org,
30 * with " at " changed at "@" and " dot " changed to "."). */
|
37
38#include "gdtoaimp.h"
39
40#undef _0
41#undef _1
42
43/* one or the other of IEEE_MC68k or IEEE_8087 should be #defined */
44
45#ifdef IEEE_MC68k
46#define _0 0
47#define _1 1
48#define _2 2
49#endif
50#ifdef IEEE_8087
51#define _0 2
52#define _1 1
53#define _2 0
54#endif
55
56 void
57#ifdef KR_headers
58ULtoxL(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
59#else
60ULtoxL(ULong *L, ULong *bits, Long exp, int k)
61#endif
62{
63 switch(k & STRTOG_Retmask) {
64 case STRTOG_NoNumber:
65 case STRTOG_Zero:
66 L[0] = L[1] = L[2] = 0;
67 break;
68
69 case STRTOG_Normal:
70 case STRTOG_Denormal:
71 case STRTOG_NaNbits:
72 L[_0] = (exp + 0x3fff + 63) << 16;
73 L[_1] = bits[1];
74 L[_2] = bits[0];
75 break;
76
77 case STRTOG_Infinite:
78 L[_0] = 0x7fff << 16;
79 L[_1] = L[_2] = 0;
80 break;
81
82 case STRTOG_NaN:
| 31
32#include "gdtoaimp.h"
33
34#undef _0
35#undef _1
36
37/* one or the other of IEEE_MC68k or IEEE_8087 should be #defined */
38
39#ifdef IEEE_MC68k
40#define _0 0
41#define _1 1
42#define _2 2
43#endif
44#ifdef IEEE_8087
45#define _0 2
46#define _1 1
47#define _2 0
48#endif
49
50 void
51#ifdef KR_headers
52ULtoxL(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
53#else
54ULtoxL(ULong *L, ULong *bits, Long exp, int k)
55#endif
56{
57 switch(k & STRTOG_Retmask) {
58 case STRTOG_NoNumber:
59 case STRTOG_Zero:
60 L[0] = L[1] = L[2] = 0;
61 break;
62
63 case STRTOG_Normal:
64 case STRTOG_Denormal:
65 case STRTOG_NaNbits:
66 L[_0] = (exp + 0x3fff + 63) << 16;
67 L[_1] = bits[1];
68 L[_2] = bits[0];
69 break;
70
71 case STRTOG_Infinite:
72 L[_0] = 0x7fff << 16;
73 L[_1] = L[_2] = 0;
74 break;
75
76 case STRTOG_NaN:
|
83 L[_0] = 0x7fff << 16;
84 L[_1] = L[_2] = (ULong)-1;
| 77 L[0] = ld_QNAN0;
78 L[1] = ld_QNAN1;
79 L[2] = ld_QNAN2;
|
85 }
86 if (k & STRTOG_Neg)
87 L[_0] |= 0x80000000L;
88 }
89
90 int
91#ifdef KR_headers
92strtorxL(s, sp, rounding, L) CONST char *s; char **sp; int rounding; void *L;
93#else
94strtorxL(CONST char *s, char **sp, int rounding, void *L)
95#endif
96{
97 static FPI fpi0 = { 64, 1-16383-64+1, 32766 - 16383 - 64 + 1, 1, SI };
98 FPI *fpi, fpi1;
99 ULong bits[2];
100 Long exp;
101 int k;
102
103 fpi = &fpi0;
104 if (rounding != FPI_Round_near) {
105 fpi1 = fpi0;
106 fpi1.rounding = rounding;
107 fpi = &fpi1;
108 }
109 k = strtodg(s, sp, fpi, &exp, bits);
110 ULtoxL((ULong*)L, bits, exp, k);
111 return k;
112 }
| 80 }
81 if (k & STRTOG_Neg)
82 L[_0] |= 0x80000000L;
83 }
84
85 int
86#ifdef KR_headers
87strtorxL(s, sp, rounding, L) CONST char *s; char **sp; int rounding; void *L;
88#else
89strtorxL(CONST char *s, char **sp, int rounding, void *L)
90#endif
91{
92 static FPI fpi0 = { 64, 1-16383-64+1, 32766 - 16383 - 64 + 1, 1, SI };
93 FPI *fpi, fpi1;
94 ULong bits[2];
95 Long exp;
96 int k;
97
98 fpi = &fpi0;
99 if (rounding != FPI_Round_near) {
100 fpi1 = fpi0;
101 fpi1.rounding = rounding;
102 fpi = &fpi1;
103 }
104 k = strtodg(s, sp, fpi, &exp, bits);
105 ULtoxL((ULong*)L, bits, exp, k);
106 return k;
107 }
|