2006-06-23 01:59:52 +08:00
|
|
|
/****************************************************************
|
|
|
|
|
|
|
|
The author of this software is David M. Gay.
|
|
|
|
|
|
|
|
Copyright (C) 2000 by Lucent Technologies
|
|
|
|
All Rights Reserved
|
|
|
|
|
|
|
|
Permission to use, copy, modify, and distribute this software and
|
|
|
|
its documentation for any purpose and without fee is hereby
|
|
|
|
granted, provided that the above copyright notice appear in all
|
|
|
|
copies and that both that the copyright notice and this
|
|
|
|
permission notice and warranty disclaimer appear in supporting
|
|
|
|
documentation, and that the name of Lucent or any of its entities
|
|
|
|
not be used in advertising or publicity pertaining to
|
|
|
|
distribution of the software without specific, written prior
|
|
|
|
permission.
|
|
|
|
|
|
|
|
LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
|
|
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
|
|
|
|
IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
|
|
|
|
SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
|
|
|
|
IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
|
|
|
|
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
|
|
|
|
THIS SOFTWARE.
|
|
|
|
|
|
|
|
****************************************************************/
|
|
|
|
|
|
|
|
/* Please send bug reports to
|
|
|
|
David M. Gay
|
|
|
|
Bell Laboratories, Room 2C-463
|
|
|
|
600 Mountain Avenue
|
|
|
|
Murray Hill, NJ 07974-0636
|
|
|
|
U.S.A.
|
|
|
|
dmg@bell-labs.com
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Modified 06-21-2006 by Jeff Johnston to work with newlib. */
|
|
|
|
|
|
|
|
#include <_ansi.h>
|
|
|
|
#include <reent.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "mprec.h"
|
|
|
|
#include "gdtoa.h"
|
|
|
|
|
|
|
|
#ifdef INFNAN_CHECK
|
2015-11-21 01:03:05 +08:00
|
|
|
int
|
|
|
|
_DEFUN (match, (sp, t),
|
|
|
|
_CONST char **sp _AND
|
|
|
|
char *t)
|
|
|
|
{
|
|
|
|
int c, d;
|
|
|
|
_CONST char *s = *sp;
|
|
|
|
|
|
|
|
while( (d = *t++) !=0) {
|
|
|
|
if ((c = *++s) >= 'A' && c <= 'Z')
|
|
|
|
c += 'a' - 'A';
|
|
|
|
if (c != d)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
*sp = s + 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-06-23 01:59:52 +08:00
|
|
|
static void
|
|
|
|
_DEFUN (L_shift, (x, x1, i),
|
|
|
|
__ULong *x _AND
|
|
|
|
__ULong *x1 _AND
|
|
|
|
int i)
|
|
|
|
{
|
|
|
|
int j;
|
|
|
|
|
|
|
|
i = 8 - i;
|
|
|
|
i <<= 2;
|
|
|
|
j = ULbits - i;
|
|
|
|
do {
|
|
|
|
*x |= x[1] << j;
|
|
|
|
x[1] >>= i;
|
|
|
|
} while(++x < x1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
_DEFUN (hexnan, (sp, fpi, x0),
|
|
|
|
_CONST char **sp _AND
|
2013-06-10 23:27:43 +08:00
|
|
|
_CONST FPI *fpi _AND
|
2006-06-23 01:59:52 +08:00
|
|
|
__ULong *x0)
|
|
|
|
{
|
|
|
|
__ULong c, h, *x, *x1, *xe;
|
|
|
|
_CONST char *s;
|
|
|
|
int havedig, hd0, i, nbits;
|
|
|
|
|
|
|
|
nbits = fpi->nbits;
|
|
|
|
x = x0 + (nbits >> kshift);
|
|
|
|
if (nbits & kmask)
|
|
|
|
x++;
|
|
|
|
*--x = 0;
|
|
|
|
x1 = xe = x;
|
|
|
|
havedig = hd0 = i = 0;
|
|
|
|
s = *sp;
|
|
|
|
while((c = *(_CONST unsigned char*)++s)) {
|
2013-06-10 23:27:43 +08:00
|
|
|
if (!(h = __get_hexdig(c))) {
|
2006-06-23 01:59:52 +08:00
|
|
|
if (c <= ' ') {
|
|
|
|
if (hd0 < havedig) {
|
|
|
|
if (x < x1 && i < 8)
|
|
|
|
L_shift(x, x1, i);
|
|
|
|
if (x <= x0) {
|
|
|
|
i = 8;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
hd0 = havedig;
|
|
|
|
*--x = 0;
|
|
|
|
x1 = x;
|
|
|
|
i = 0;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
2008-03-05 02:27:01 +08:00
|
|
|
if (/*(*/ c == ')') {
|
2006-06-23 01:59:52 +08:00
|
|
|
*sp = s + 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return STRTOG_NaN;
|
|
|
|
}
|
|
|
|
havedig++;
|
|
|
|
if (++i > 8) {
|
|
|
|
if (x <= x0)
|
|
|
|
continue;
|
|
|
|
i = 1;
|
|
|
|
*--x = 0;
|
|
|
|
}
|
|
|
|
*x = ((*x << 4) | (h & 0xf));
|
|
|
|
}
|
|
|
|
if (!havedig)
|
|
|
|
return STRTOG_NaN;
|
|
|
|
if (x < x1 && i < 8)
|
|
|
|
L_shift(x, x1, i);
|
|
|
|
if (x > x0) {
|
|
|
|
x1 = x0;
|
|
|
|
do *x1++ = *x++;
|
|
|
|
while(x <= xe);
|
|
|
|
do *x1++ = 0;
|
|
|
|
while(x1 <= xe);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* truncate high-order word if necessary */
|
|
|
|
if ( (i = nbits & (ULbits-1)) !=0)
|
|
|
|
*xe &= ((__ULong)0xffffffff) >> (ULbits - i);
|
|
|
|
}
|
|
|
|
for(x1 = xe;; --x1) {
|
|
|
|
if (*x1 != 0)
|
|
|
|
break;
|
|
|
|
if (x1 == x0) {
|
|
|
|
*x1 = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return STRTOG_NaNbits;
|
|
|
|
}
|
|
|
|
#endif /* INFNAN_CHECK */
|