mirror of
https://github.com/fluencelabs/musl
synced 2025-07-02 16:12:02 +00:00
* faster, smaller, cleaner implementation than the bit hacks of fdlibm * use arithmetics like y=(double)(x+0x1p52)-0x1p52, which is an integer neighbor of x in all rounding modes (0<=x<0x1p52) and only use bithacks when that's faster and smaller (for float it usually is) * the code assumes standard excess precision handling for casts * long double code supports both ld80 and ld128 * nearbyint is not changed (it is a wrapper around rint)
21 lines
331 B
C
21 lines
331 B
C
#include <math.h>
|
|
#include <stdint.h>
|
|
|
|
float rintf(float x)
|
|
{
|
|
union {float f; uint32_t i;} u = {x};
|
|
int e = u.i>>23 & 0xff;
|
|
int s = u.i>>31;
|
|
float_t y;
|
|
|
|
if (e >= 0x7f+23)
|
|
return x;
|
|
if (s)
|
|
y = (float)(x - 0x1p23f) + 0x1p23f;
|
|
else
|
|
y = (float)(x + 0x1p23f) - 0x1p23f;
|
|
if (y == 0)
|
|
return s ? -0.0f : 0.0f;
|
|
return y;
|
|
}
|