#pragma weak __rintf = rintf
#include "libm.h"
static const float xf[] = {
0.0f,
8.3886080000e6f,
-8.3886080000e6f,
1.0f,
-1.0f,
0.5f,
-0.5f,
1.0e30f,
};
#define ZEROF xf[0]
#define TWO_23F xf[1]
#define MTWO_23F xf[2]
#define ONEF xf[3]
#define MONEF xf[4]
#define HALFF xf[5]
#define MHALFF xf[6]
#define HUGEF xf[7]
float
aintf(float x) {
int hx, k;
float y;
hx = *(int *) &x;
k = (hx & ~0x80000000) >> 23;
if (k < 150) {
y = (float) ((int) x);
return (((k - 127) & hx) < 0 ? -y : y);
} else
return (x * ONEF);
}
float
anintf(float x) {
volatile float dummy __unused;
int hx, k, j, ix;
hx = *(int *) &x;
ix = hx & ~0x80000000;
k = ix >> 23;
if (((k - 127) ^ (k - 150)) < 0) {
j = 1 << (149 - k);
k = j + j - 1;
if ((k & hx) != 0)
dummy = HUGEF + x;
*(int *) &x = (hx + j) & ~k;
return (x);
} else if (k <= 126) {
dummy = HUGEF + x;
*(int *) &x = (0x3f800000 & ((125 - k) >> 31)) |
(0x80000000 & hx);
return (x);
} else
return (x * ONEF);
}
int
irintf(float x) {
float v;
int hx, k;
hx = *(int *) &x;
k = (hx & ~0x80000000) >> 23;
v = xf[((k - 150) >> 31) & (1 - (hx >> 31))];
return ((int) ((float) (x + v) - v));
}
int
nintf(float x) {
int hx, ix, k, j, m;
volatile float dummy __unused;
hx = *(int *) &x;
k = (hx & ~0x80000000) >> 23;
if (((k - 126) ^ (k - 150)) < 0) {
ix = (hx & 0x00ffffff) | 0x800000;
m = 149 - k;
j = 1 << m;
if ((ix & (j + j - 1)) != 0)
dummy = HUGEF + x;
hx = hx >> 31;
return ((((ix + j) >> (m + 1)) ^ hx) - hx);
} else
return ((int) x);
}
float
rintf(float x) {
float w, v;
int hx, k;
hx = *(int *) &x;
k = (hx & ~0x80000000) >> 23;
#if defined(FPADD_TRAPS_INCOMPLETE_ON_NAN)
if (k >= 150)
return (x * ONEF);
v = xf[1 - (hx >> 31)];
#else
v = xf[((k - 150) >> 31) & (1 - (hx >> 31))];
#endif
w = (float) (x + v);
if (k < 127 && w == v)
return (ZEROF * x);
else
return (w - v);
}