the idiomatic rounding of x is n = x + toint - toint; where toint is either 1/EPSILON (x is non-negative) or 1.5/EPSILON (x may be negative and nearest rounding mode is assumed) and EPSILON is according to the evaluation precision (the type of toint is not very important, because single precision float can represent the 1/EPSILON of ieee binary128). in case of FLT_EVAL_METHOD!=0 this avoids a useless store to double or float precision, and the long double code became cleaner with 1/LDBL_EPSILON instead of ifdefs for toint. __rem_pio2f and __rem_pio2 functions slightly changed semantics: on i386 a double-rounding is avoided so close to half-way cases may get evaluated differently eg. as sin(pi/4-eps) instead of cos(pi/4+eps)
54 lines
917 B
C
54 lines
917 B
C
#include "libm.h"
|
|
|
|
#if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
|
|
long double modfl(long double x, long double *iptr)
|
|
{
|
|
double d;
|
|
long double r;
|
|
|
|
r = modf(x, &d);
|
|
*iptr = d;
|
|
return r;
|
|
}
|
|
#elif (LDBL_MANT_DIG == 64 || LDBL_MANT_DIG == 113) && LDBL_MAX_EXP == 16384
|
|
|
|
static const long double toint = 1/LDBL_EPSILON;
|
|
|
|
long double modfl(long double x, long double *iptr)
|
|
{
|
|
union ldshape u = {x};
|
|
int e = (u.i.se & 0x7fff) - 0x3fff;
|
|
int s = u.i.se >> 15;
|
|
long double absx;
|
|
long double y;
|
|
|
|
/* no fractional part */
|
|
if (e >= LDBL_MANT_DIG-1) {
|
|
*iptr = x;
|
|
if (isnan(x))
|
|
return x;
|
|
return s ? -0.0 : 0.0;
|
|
}
|
|
|
|
/* no integral part*/
|
|
if (e < 0) {
|
|
*iptr = s ? -0.0 : 0.0;
|
|
return x;
|
|
}
|
|
|
|
/* raises spurious inexact */
|
|
absx = s ? -x : x;
|
|
y = absx + toint - toint - absx;
|
|
if (y == 0) {
|
|
*iptr = x;
|
|
return s ? -0.0 : 0.0;
|
|
}
|
|
if (y > 0)
|
|
y -= 1;
|
|
if (s)
|
|
y = -y;
|
|
*iptr = x + y;
|
|
return -y;
|
|
}
|
|
#endif
|