jyapayne/musl
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

first commit of the new libm!

Browse source 
thanks to the hard work of Szabolcs Nagy (nsz), identifying the best
(from correctness and license standpoint) implementations from freebsd
and openbsd and cleaning them up! musl should now fully support c99
float and long double math functions, and has near-complete complex
math support. tgmath should also work (fully on gcc-compatible
compilers, and mostly on any c99 compiler).

based largely on commit 0376d44a890fea261506f1fc63833e7a686dca19 from
nsz's libm git repo, with some additions (dummy versions of a few
missing long double complex functions, etc.) by me.

various cleanups still need to be made, including re-adding (if
they're correct) some asm functions that were dropped.
This commit is contained in:
Rich Felker 2012-03-13 01:17:53 -04:00
commit b69f695ace
378 changed files with 20552 additions and 7743 deletions
Download patch file Download diff file Expand all files Collapse all files

70
src/math/modf.c Normal file
View file

@ -0,0 +1,70 @@
/* origin: FreeBSD /usr/src/lib/msun/src/s_modf.c */
/*
* ====================================================
* 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.
* ====================================================
*/
/*
* modf(double x, double *iptr)
* return fraction part of x, and return x's integral part in *iptr.
* Method:
* Bit twiddling.
*
* Exception:
* No exception.
*/
#include "libm.h"
static const double one = 1.0;
double modf(double x, double *iptr)
{
int32_t i0,i1,j0;
uint32_t i;
EXTRACT_WORDS(i0, i1, x);
j0 = ((i0>>20) & 0x7ff) - 0x3ff; /* exponent of x */
if (j0 < 20) { /* integer part in high x */
if (j0 < 0) { /* |x| < 1 */
INSERT_WORDS(*iptr, i0 & 0x80000000, 0); /* *iptr = +-0 */
return x;
}
i = 0x000fffff >> j0;
if (((i0&i)|i1) == 0) { /* x is integral */
uint32_t high;
*iptr = x;
GET_HIGH_WORD(high, x);
INSERT_WORDS(x, high & 0x80000000, 0); /* return +-0 */
return x;
}
INSERT_WORDS(*iptr, i0&~i, 0);
return x - *iptr;
} else if (j0 > 51) { /* no fraction part */
uint32_t high;
if (j0 == 0x400) { /* inf/NaN */
*iptr = x;
return 0.0 / x;
}
*iptr = x*one;
GET_HIGH_WORD(high, x);
INSERT_WORDS(x, high & 0x80000000, 0); /* return +-0 */
return x;
} else { /* fraction part in low x */
i = (uint32_t)0xffffffff >> (j0 - 20);
if ((i1&i) == 0) { /* x is integral */
uint32_t high;
*iptr = x;
GET_HIGH_WORD(high, x);
INSERT_WORDS(x, high & 0x80000000, 0); /* return +-0 */
return x;
}
INSERT_WORDS(*iptr, i0, i1&~i);
return x - *iptr;
}
}