OpenCores
URL https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk

Subversion Repositories openrisc_2011-10-31

[/] [openrisc/] [tags/] [gnu-src/] [newlib-1.18.0/] [newlib-1.18.0-or32-1.0rc1/] [newlib/] [libc/] [stdlib/] [gdtoa-hexnan.c] - Diff between revs 207 and 345

Only display areas with differences | Details | Blame | View Log

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

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.