mirror of
https://sourceware.org/git/glibc.git
synced 2024-12-21 18:30:05 +00:00
8ed1e7d589
* configure.in: Compute sizeof-long-double. * configure: Regenerated. * config.make.in: Make sizeof-long-double available to sub-makes. In libc/soft-fp/: * soft-fp.h (_FP_ROUND_ZERO): Cast 0 to void before using it as a statement. * sysdeps/powerpc/Makefile (routines): New file. * sysdeps/powerpc/q_*: New files. 2000-03-03 Geoff Keating <geoffk@cygnus.com> * configure.in: Compute sizeof-long-double. * configure: Regenerated. * config.make.in: Make sizeof-long-double available to sub-makes.
58 lines
1.8 KiB
C
58 lines
1.8 KiB
C
/* Software floating-point emulation.
|
|
Helper routine for _q_* routines.
|
|
Simulate exceptions using double arithmetics.
|
|
Copyright (C) 1999, 2000 Free Software Foundation, Inc.
|
|
This file is part of the GNU C Library.
|
|
Contributed by Jakub Jelinek (jj@ultra.linux.cz).
|
|
|
|
The GNU C 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 GNU C 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 GNU C 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 "soft-fp.h"
|
|
|
|
unsigned long long ___q_numbers [] = {
|
|
0x0000000000000000ULL, /* Zero */
|
|
0x0010100000000000ULL, /* Very tiny number */
|
|
0x0010000000000000ULL, /* Minimum normalized number */
|
|
0x7fef000000000000ULL, /* A huge double number */
|
|
};
|
|
|
|
double ___q_simulate_exceptions(int exceptions)
|
|
{
|
|
double d, *p = (double *)___q_numbers;
|
|
if (exceptions & FP_EX_INVALID)
|
|
d = p[0]/p[0];
|
|
if (exceptions & FP_EX_OVERFLOW)
|
|
{
|
|
d = p[3] + p[3];
|
|
exceptions &= ~FP_EX_INEXACT;
|
|
}
|
|
if (exceptions & FP_EX_UNDERFLOW)
|
|
{
|
|
if (exceptions & FP_EX_INEXACT)
|
|
{
|
|
d = p[2] * p[2];
|
|
exceptions &= ~FP_EX_INEXACT;
|
|
}
|
|
else
|
|
d = p[1] - p[2];
|
|
}
|
|
if (exceptions & FP_EX_DIVZERO)
|
|
d = 1.0/p[0];
|
|
if (exceptions & FP_EX_INEXACT)
|
|
d = p[3] - p[2];
|
|
return d;
|
|
}
|