mirror of
https://sourceware.org/git/glibc.git
synced 2024-12-25 12:11:10 +00:00
0a7fef0159
2000-10-09 Jakub Jelinek <jakub@redhat.com> * sysdeps/ieee754/ldbl-128/s_nexttoward.c (__nexttoward): If x == y, return y not x. * manual/arith.texi (nextafter): Document it. * sysdeps/ieee754/ldbl-96/s_nexttoward.c: Fix a comment.
99 lines
2.6 KiB
C
99 lines
2.6 KiB
C
/* s_nexttoward.c
|
|
* Conversion from s_nextafter.c by Ulrich Drepper, Cygnus Support,
|
|
* drepper@cygnus.com.
|
|
*/
|
|
|
|
/*
|
|
* ====================================================
|
|
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
|
|
*
|
|
* Developed at SunPro, a Sun Microsystems, Inc. business.
|
|
* Permission to use, copy, modify, and distribute this
|
|
* software is freely granted, provided that this notice
|
|
* is preserved.
|
|
* ====================================================
|
|
*/
|
|
|
|
#if defined(LIBM_SCCS) && !defined(lint)
|
|
static char rcsid[] = "$NetBSD: $";
|
|
#endif
|
|
|
|
/* IEEE functions
|
|
* nexttoward(x,y)
|
|
* return the next machine floating-point number of x in the
|
|
* direction toward y.
|
|
* Special cases:
|
|
*/
|
|
|
|
#include "math.h"
|
|
#include "math_private.h"
|
|
|
|
#ifdef __STDC__
|
|
double __nexttoward(double x, long double y)
|
|
#else
|
|
double __nexttoward(x,y)
|
|
double x;
|
|
long double y;
|
|
#endif
|
|
{
|
|
int32_t hx,ix,iy;
|
|
u_int32_t lx,hy,ly,esy;
|
|
|
|
EXTRACT_WORDS(hx,lx,x);
|
|
GET_LDOUBLE_WORDS(esy,hy,ly,y);
|
|
ix = hx&0x7fffffff; /* |x| */
|
|
iy = esy&0x7fff; /* |y| */
|
|
|
|
if(((ix>=0x7ff00000)&&((ix-0x7ff00000)|lx)!=0) || /* x is nan */
|
|
((iy>=0x7fff)&&((hy|ly)|-(hy|ly))!=0)) /* y is nan */
|
|
return x+y;
|
|
if((long double) x==y) return y; /* x=y, return y */
|
|
if((ix|lx)==0) { /* x == 0 */
|
|
double x2;
|
|
INSERT_WORDS(x,esy&0x8000?0x80000000:0,1);/* return +-minsub */
|
|
x2 = x*x;
|
|
if(x2==x) return x2; else return x; /* raise underflow flag */
|
|
}
|
|
if(hx>=0) { /* x > 0 */
|
|
if (esy>=0x8000||((ix>>20)&0x7ff)>iy-0x3c00
|
|
|| (((ix>>20)&0x7ff)==iy-0x3c00
|
|
&& (((hx<<11)|(lx>>21))>(hy&0x7fffffff)
|
|
|| (((hx<<11)|(lx>>21))==(hy&0x7fffffff)
|
|
&& (lx<<11)>ly)))) { /* x > y, x -= ulp */
|
|
if(lx==0) hx -= 1;
|
|
lx -= 1;
|
|
} else { /* x < y, x += ulp */
|
|
lx += 1;
|
|
if(lx==0) hx += 1;
|
|
}
|
|
} else { /* x < 0 */
|
|
if (esy<0x8000||((ix>>20)&0x7ff)>iy-0x3c00
|
|
|| (((ix>>20)&0x7ff)==iy-0x3c00
|
|
&& (((hx<<11)|(lx>>21))>(hy&0x7fffffff)
|
|
|| (((hx<<11)|(lx>>21))==(hy&0x7fffffff)
|
|
&& (lx<<11)>ly)))) {/* x < y, x -= ulp */
|
|
if(lx==0) hx -= 1;
|
|
lx -= 1;
|
|
} else { /* x > y, x += ulp */
|
|
lx += 1;
|
|
if(lx==0) hx += 1;
|
|
}
|
|
}
|
|
hy = hx&0x7ff00000;
|
|
if(hy>=0x7ff00000) return x+x; /* overflow */
|
|
if(hy<0x00100000) { /* underflow */
|
|
double x2 = x*x;
|
|
if(x2!=x) { /* raise underflow flag */
|
|
INSERT_WORDS(x2,hx,lx);
|
|
return x2;
|
|
}
|
|
}
|
|
INSERT_WORDS(x,hx,lx);
|
|
return x;
|
|
}
|
|
weak_alias (__nexttoward, nexttoward)
|
|
#ifdef NO_LONG_DOUBLE
|
|
strong_alias (__nexttoward, __nexttowardl)
|
|
weak_alias (__nexttoward, nexttowardl)
|
|
#endif
|