mirror of
https://sourceware.org/git/glibc.git
synced 2025-11-03 20:53:13 +03:00
5a82c74822
Also, change sources.redhat.com to sourceware.org.
This patch was automatically generated by running the following shell
script, which uses GNU sed, and which avoids modifying files imported
from upstream:
sed -ri '
s,(http|ftp)(://(.*\.)?(gnu|fsf|sourceware)\.org($|[^.]|\.[^a-z])),https\2,g
s,(http|ftp)(://(.*\.)?)sources\.redhat\.com($|[^.]|\.[^a-z]),https\2sourceware.org\4,g
' \
$(find $(git ls-files) -prune -type f \
! -name '*.po' \
! -name 'ChangeLog*' \
! -path COPYING ! -path COPYING.LIB \
! -path manual/fdl-1.3.texi ! -path manual/lgpl-2.1.texi \
! -path manual/texinfo.tex ! -path scripts/config.guess \
! -path scripts/config.sub ! -path scripts/install-sh \
! -path scripts/mkinstalldirs ! -path scripts/move-if-change \
! -path INSTALL ! -path locale/programs/charmap-kw.h \
! -path po/libc.pot ! -path sysdeps/gnu/errlist.c \
! '(' -name configure \
-execdir test -f configure.ac -o -f configure.in ';' ')' \
! '(' -name preconfigure \
-execdir test -f preconfigure.ac ';' ')' \
-print)
and then by running 'make dist-prepare' to regenerate files built
from the altered files, and then executing the following to cleanup:
chmod a+x sysdeps/unix/sysv/linux/riscv/configure
# Omit irrelevant whitespace and comment-only changes,
# perhaps from a slightly-different Autoconf version.
git checkout -f \
sysdeps/csky/configure \
sysdeps/hppa/configure \
sysdeps/riscv/configure \
sysdeps/unix/sysv/linux/csky/configure
# Omit changes that caused a pre-commit check to fail like this:
# remote: *** error: sysdeps/powerpc/powerpc64/ppc-mcount.S: trailing lines
git checkout -f \
sysdeps/powerpc/powerpc64/ppc-mcount.S \
sysdeps/unix/sysv/linux/s390/s390-64/syscall.S
# Omit change that caused a pre-commit check to fail like this:
# remote: *** error: sysdeps/sparc/sparc64/multiarch/memcpy-ultra3.S: last line does not end in newline
git checkout -f sysdeps/sparc/sparc64/multiarch/memcpy-ultra3.S
95 lines
3.0 KiB
C
95 lines
3.0 KiB
C
/* Compute x^2 + y^2 - 1, without large cancellation error.
|
|
Copyright (C) 2012-2019 Free Software Foundation, Inc.
|
|
This file is part of the GNU C Library.
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 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
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with the GNU C Library; if not, see
|
|
<https://www.gnu.org/licenses/>. */
|
|
|
|
#include <math.h>
|
|
#include <math_private.h>
|
|
#include <fenv_private.h>
|
|
#include <mul_split.h>
|
|
#include <stdlib.h>
|
|
|
|
/* Calculate X + Y exactly and store the result in *HI + *LO. It is
|
|
given that |X| >= |Y| and the values are small enough that no
|
|
overflow occurs. */
|
|
|
|
static inline void
|
|
add_split (double *hi, double *lo, double x, double y)
|
|
{
|
|
/* Apply Dekker's algorithm. */
|
|
*hi = x + y;
|
|
*lo = (x - *hi) + y;
|
|
}
|
|
|
|
/* Compare absolute values of floating-point values pointed to by P
|
|
and Q for qsort. */
|
|
|
|
static int
|
|
compare (const void *p, const void *q)
|
|
{
|
|
double pd = fabs (*(const double *) p);
|
|
double qd = fabs (*(const double *) q);
|
|
if (pd < qd)
|
|
return -1;
|
|
else if (pd == qd)
|
|
return 0;
|
|
else
|
|
return 1;
|
|
}
|
|
|
|
/* Return X^2 + Y^2 - 1, computed without large cancellation error.
|
|
It is given that 1 > X >= Y >= epsilon / 2, and that X^2 + Y^2 >=
|
|
0.5. */
|
|
|
|
long double
|
|
__x2y2m1l (long double x, long double y)
|
|
{
|
|
double vals[13];
|
|
SET_RESTORE_ROUND (FE_TONEAREST);
|
|
union ibm_extended_long_double xu, yu;
|
|
xu.ld = x;
|
|
yu.ld = y;
|
|
if (fabs (xu.d[1].d) < 0x1p-500)
|
|
xu.d[1].d = 0.0;
|
|
if (fabs (yu.d[1].d) < 0x1p-500)
|
|
yu.d[1].d = 0.0;
|
|
mul_split (&vals[1], &vals[0], xu.d[0].d, xu.d[0].d);
|
|
mul_split (&vals[3], &vals[2], xu.d[0].d, xu.d[1].d);
|
|
vals[2] *= 2.0;
|
|
vals[3] *= 2.0;
|
|
mul_split (&vals[5], &vals[4], xu.d[1].d, xu.d[1].d);
|
|
mul_split (&vals[7], &vals[6], yu.d[0].d, yu.d[0].d);
|
|
mul_split (&vals[9], &vals[8], yu.d[0].d, yu.d[1].d);
|
|
vals[8] *= 2.0;
|
|
vals[9] *= 2.0;
|
|
mul_split (&vals[11], &vals[10], yu.d[1].d, yu.d[1].d);
|
|
vals[12] = -1.0;
|
|
qsort (vals, 13, sizeof (double), compare);
|
|
/* Add up the values so that each element of VALS has absolute value
|
|
at most equal to the last set bit of the next nonzero
|
|
element. */
|
|
for (size_t i = 0; i <= 11; i++)
|
|
{
|
|
add_split (&vals[i + 1], &vals[i], vals[i + 1], vals[i]);
|
|
qsort (vals + i + 1, 12 - i, sizeof (double), compare);
|
|
}
|
|
/* Now any error from this addition will be small. */
|
|
long double retval = (long double) vals[12];
|
|
for (size_t i = 11; i != (size_t) -1; i--)
|
|
retval += (long double) vals[i];
|
|
return retval;
|
|
}
|