1 /****************************************************************
3 The author of this software is David M. Gay.
5 Copyright (C) 1998 by Lucent Technologies
8 Permission to use, copy, modify, and distribute this software and
9 its documentation for any purpose and without fee is hereby
10 granted, provided that the above copyright notice appear in all
11 copies and that both that the copyright notice and this
12 permission notice and warranty disclaimer appear in supporting
13 documentation, and that the name of Lucent or any of its entities
14 not be used in advertising or publicity pertaining to
15 distribution of the software without specific, written prior
18 LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
19 INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
20 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
21 SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
22 WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
23 IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
24 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
27 ****************************************************************/
29 /* Please send bug reports to
42 gethex(sp, fpi, exp, bp, sign)
43 CONST char **sp; FPI *fpi; Long *exp; Bigint **bp; int sign;
45 gethex( CONST char **sp, FPI *fpi, Long *exp, Bigint **bp, int sign)
49 CONST unsigned char *decpt, *s0, *s, *s1;
50 int esign, havedig, irv, k, n, nbits, up;
51 ULong L, lostbits, *x;
54 unsigned char decimalpoint = *localeconv()->decimal_point;
56 #define decimalpoint '.'
62 s0 = *(CONST unsigned char **)sp + 2;
63 while(s0[havedig] == '0')
69 if (*s == decimalpoint) {
77 return havedig ? STRTOG_Zero : STRTOG_NoNumber;
88 if (*s == decimalpoint && !decpt) {
95 e = -(((Long)(s-decpt)) << 2);
108 if ((n = hexdig[*s]) == 0 || n > 0x19) {
113 while((n = hexdig[*++s]) !=0 && n <= 0x19)
114 e1 = 10*e1 + n - 0x10;
121 for(k = 0; n > 7; n >>= 1)
128 if (*--s1 == decimalpoint)
135 L |= (hexdig[*s1] & 0x0f) << n;
139 b->wds = n = x - b->x;
140 n = 32*n - hi0bits(L);
149 if (x[k>>kshift] & 1 << (k & kmask)) {
151 if (k > 1 && any_on(b,k-1))
158 else if (n < nbits) {
168 return STRTOG_Infinite | STRTOG_Overflow | STRTOG_Inexhi;
172 irv = STRTOG_Denormal;
175 switch (fpi->rounding) {
177 if (n == nbits && (n < 2 || any_on(b,n-1)))
190 return STRTOG_Denormal | STRTOG_Inexhi
196 return STRTOG_Zero | STRTOG_Inexlo | STRTOG_Underflow;
202 lostbits = any_on(b,k);
203 if (x[k>>kshift] & 1 << (k & kmask))
211 switch(fpi->rounding) {
216 && (lostbits & 1) | x[0] & 1)
229 if (irv == STRTOG_Denormal) {
230 if (nbits == fpi->nbits - 1
231 && x[nbits >> kshift] & 1 << (nbits & kmask))
235 || (n = nbits & kmask) !=0
236 && hi0bits(x[k-1]) < 32-n) {
241 irv |= STRTOG_Inexhi;
244 irv |= STRTOG_Inexlo;