about summary refs log tree commit diff
path: root/src
Commit message (Collapse)AuthorAgeFilesLines
* math: erf and erfc cleanupSzabolcs Nagy2013-01-073-297/+207
| | | | | | | | | | | | common part of erf and erfc was put in a separate function which saved some space and the new code is using unsigned arithmetics erfcf had a bug: for some inputs in [7.95,8] the result had more than 60ulp error: in expf(-z*z - 0.5625f) the argument must be exact but not enough lowbits of z were zeroed, -SET_FLOAT_WORD(z, ix&0xfffff000); +SET_FLOAT_WORD(z, ix&0xffffe000); fixed the issue
* __assert_fail(): remove _Noreturn, to get proper stacktracesrofl0r2013-01-041-1/+1
| | | | | | | | for _Noreturn functions, gcc generates code that trashes the stack frame, and so it makes it impossible to inspect the causes of an assert error in gdb. abort() is not affected (i have not yet investigated why).
* math: bessel cleanup (jn.c and jnf.c)Szabolcs Nagy2013-01-012-164/+161
| | | | | | | | | | | | | | | | | | | | | | | | both jn and yn functions had integer overflow issues for large and small n to handle these issues nm1 (== |n|-1) is used instead of n and -n in the code and some loops are changed to make sure the iteration counter does not overflow (another solution could be to use larger integer type or even double but that has more size and runtime cost, on x87 loading int64_t or even uint32_t into an fpu register is more than two times slower than loading int32_t, and using double for n slows down iteration logic) yn(-1,0) now returns inf posix2008 specifies that on overflow and at +-0 all y0,y1,yn functions return -inf, this is not consistent with math when n<0 odd integer in yn (eg. when x->0, yn(-1,x)->inf, but historically yn(-1,0) seems to be special cased and returned -inf) some threshold values in jnf and ynf were fixed that seems to be incorrectly copy-pasted from the double version
* math: bessel cleanup (j1.c and j1f.c)Szabolcs Nagy2013-01-012-187/+138
| | | | | | | | | | | | | | | a common code path in j1 and y1 was factored out so the resulting object code is a bit smaller unsigned int arithmetics is used for bit manipulation j1(-inf) now returns 0 instead of -0 an incorrect threshold in the common code of j1f and y1f got fixed (this caused spurious overflow and underflow exceptions) the else branch in pone and pzero functions are fixed (so code analyzers dont warn about uninitialized values)
* math: bessel cleanup (j0.c and j0f.c)Szabolcs Nagy2013-01-012-203/+161
| | | | | | | | | | | | | a common code path in j0 and y0 was factored out so the resulting object code is smaller unsigned int arithmetics is used for bit manipulation the logic of j0 got a bit simplified (x < 1 case was handled separately with a bit higher precision than now, but there are large errors in other domains anyway so that branch has been removed) some threshold values were adjusted in j0f and y0f
* fix alignment logic in strlcpyRich Felker2012-12-261-1/+1
|
* fix reference to libc struct in static tls init codeRich Felker2012-12-251-1/+1
| | | | | | | libc is the macro, __libc is the internal symbol, but under some configurations on old/broken compilers, the symbol might not actually exist and the libc macro might instead use __libc_loc() to obtain access to the object.
* clean up and fix logic for making mmap fail on invalid/unsupported offsetsRich Felker2012-12-201-3/+7
| | | | | | | | | | | | | | | | | | | | the previous logic was assuming the kernel would give EINVAL when passed an invalid address, but instead with MAP_FIXED it was giving EPERM, as it considered this an attempt to map over kernel memory. instead of trying to get the kernel to do the rigth thing, the new code just handles the error in userspace. I have also cleaned up the code to use a single mask to check for invalid low bits and unsupported high bits, so it's simpler and more clearly correct. the old code was actually wrong for sizeof(long) smaller than sizeof(off_t) but not equal to 4; now it should be correct for all possibilities. for 64-bit systems, the low-bits test is new and extraneous (the kernel should catch the error anyway when the mmap2 syscall is not used), but it's cheap anyway. if this is an issue, the OFF_MASK definition could be tweaked to omit the low bits when SYS_mmap2 is not defined.
* merge a few fixes by sh4rm4Rich Felker2012-12-191-0/+11
|\
| * add inet_network (required for wine)rofl0r2012-12-191-0/+11
| |
* | math: use 0x1p-120f and 0x1p120f for tiny and huge valuesSzabolcs Nagy2012-12-1610-27/+27
| | | | | | | | | | | | | | | | | | | | previously 0x1p-1000 and 0x1p1000 was used for raising inexact exception like x+tiny (when x is big) or x+huge (when x is small) the rational is that these float consts are large enough (0x1p-120 + 1 raises inexact even on ld128 which has 113 mant bits) and float consts maybe smaller or easier to load on some platforms (on i386 this reduced the object file size by 4bytes in some cases)
* | math: tgammal.c fixesSzabolcs Nagy2012-12-161-28/+23
| | | | | | | | | | | | | | | | | | this is not a full rewrite just fixes to the special case logic: +-0 and non-integer x<INT_MIN inputs incorrectly raised invalid exception and for +-0 the return value was wrong so integer test and odd/even test for negative inputs are changed and a useless overflow test was removed
* | math: tanh.c cleanup similar to sinh, coshSzabolcs Nagy2012-12-163-173/+83
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | comments are kept in the double version of the function compared to fdlibm/freebsd we partition the domain into one more part and select different threshold points: now the [log(5/3)/2,log(3)/2] and [log(3)/2,inf] domains should have <1.5ulp error (so only the last bit may be wrong, assuming good exp, expm1) (note that log(3)/2 and log(5/3)/2 are the points where tanh changes resolution: tanh(log(3)/2)=0.5, tanh(log(5/3)/2)=0.25) for some x < log(5/3)/2 (~=0.2554) the error can be >1.5ulp but it should be <2ulp (the freebsd code had some >2ulp errors in [0.255,1]) even with the extra logic the new code produces smaller object files
* | math: sinh.c cleanup similar to the cosh oneSzabolcs Nagy2012-12-163-171/+72
| | | | | | | | comments are kept in the double version of the function
* | math: finished cosh.c cleanupSzabolcs Nagy2012-12-163-142/+49
|/ | | | | | | | | | | | | | | | | changed the algorithm: large input is not special cased (when exp(-x) is small compared to exp(x)) and the threshold values are reevaluated (fdlibm code had a log(2)/2 cutoff for which i could not find justification, log(2) seems to be a better threshold and this was verified empirically) the new code is simpler, makes smaller binaries and should be faster for common cases the old comments were removed as they are no longer true for the new algorithm and the fdlibm copyright was dropped as well because there is no common code or idea with the original anymore except for trivial ones.
* math: x86_64 version of expl, fixed some comments in the i386 versionSzabolcs Nagy2012-12-164-4/+112
|
* math: move x86_64 exp2l implementation to exp2l.s from expl.sSzabolcs Nagy2012-12-163-85/+76
|
* fix breakage in ldd (failure to print library load address)Rich Felker2012-12-151-2/+2
|
* math: fix i386/expl.s with more precise x*log2eSzabolcs Nagy2012-12-142-7/+107
| | | | | | | | | with naive exp2l(x*log2e) the last 12bits of the result was incorrect for x with large absolute value with hi + lo = x*log2e is caluclated to 128 bits precision and then expl(x) = exp2l(hi) + exp2l(hi) * f2xm1(lo) this gives <1.5ulp measured error everywhere in nearest rounding mode
* math: add a non-dummy tgamma implementationSzabolcs Nagy2012-12-122-20/+215
| | | | | | | | | | | | uses the lanczos approximation method with the usual tweaks. same parameters were selected as in boost and python. (avoides some extra work and special casing found in boost so the precision is not that good: measured error is <5ulp for positive x and <10ulp for negative) an alternative lgamma_r implementation is also given in the same file which is simpler and smaller than the current one, but less precise so it's ifdefed out for now.
* math: cosh cleanupSzabolcs Nagy2012-12-123-70/+63
| | | | do fabs by hand, don't check for nan and inf separately
* math: fix comment in __rem_pio2f.cSzabolcs Nagy2012-12-121-2/+2
|
* math: add empty __invtrigl.s to i386 and x86_64Szabolcs Nagy2012-12-122-0/+0
| | | | | __invtrigl is not needed when acosl, asinl, atanl have asm implementations
* math: clean up inverse trigonometric functionsSzabolcs Nagy2012-12-1112-377/+258
| | | | | | | | | | | | | modifications: * avoid unsigned->signed conversions * removed various volatile hacks * use FORCE_EVAL when evaluating only for side-effects * factor out R() rational approximation instead of manual inline * __invtrigl.h now only provides __invtrigl_R, __pio2_hi and __pio2_lo * use 2*pio2_hi, 2*pio2_lo instead of pi_hi, pi_lo otherwise the logic is not changed, long double versions will need a revisit when a genaral long double cleanup happens
* math: rewrite inverse hyperbolic functions to be simpler/smallerSzabolcs Nagy2012-12-119-406/+149
| | | | | | | | | | | | modifications: * avoid unsigned->signed integer conversion * do not handle special cases when they work correctly anyway * more strict threshold values (0x1p26 instead of 0x1p28 etc) * smaller code, cleaner branching logic * same precision as the old code: acosh(x) has up to 2ulp error in [1,1.125] asinh(x) has up to 1.6ulp error in [0.125,0.5], [-0.5,-0.125] atanh(x) has up to 1.7ulp error in [0.125,0.5], [-0.5,-0.125]
* make CMPLX macros available in complex.h in non-c11 mode as wellSzabolcs Nagy2012-12-111-8/+0
|
* fix double errno-decoding in the old-kernel fallback path of pipe2Rich Felker2012-12-111-1/+1
| | | | | this bug seems to have caused any failure by pipe2 on such systems to set errno to 1, rather than the proper error code.
* document self-synchronized destruction issue for stdio lockingRich Felker2012-12-101-0/+10
|
* page-align initial brk value used by malloc in shared libcRich Felker2012-12-071-1/+5
| | | | | | | | | | this change fixes an obscure issue with some nonstandard kernels, where the initial brk syscall returns a pointer just past the end of bss rather than the beginning of a new page. in that case, the dynamic linker has already reclaimed the space between the end of bss and the page end for use by malloc, and memory corruption (allocating the same memory twice) will occur when malloc again claims it on the first call to brk.
* remove __arch_prctl alias for arch_prctlRich Felker2012-12-071-3/+1
| | | | | | | if there's evidence of any use for it, we can add it back later. as far as I can tell, glibc has it only for internal use (and musl uses a direct syscall in that case rather than a function call), not for exposing it to applications.
* move new linux syscall wrapper functions to proper source dirRich Felker2012-12-072-0/+0
|
* fix trailing whitespace issues that crept in here and thereRich Felker2012-12-074-4/+4
|
* fix invalid read in aligned_allocRich Felker2012-12-061-2/+3
| | | | | | in case of mmap-obtained chunks, end points past the end of the mapping and reading it may fault. since the value is not needed until after the conditional, move the access to prevent invalid reads.
* fix sigorset/sigandset: _NSIG/8 is the size in bytesrofl0r2012-12-062-2/+2
|
* sigandset/sigorset: do not check for NULL pointers.rofl0r2012-12-062-10/+0
| | | | | that way it's consistent with existing sig* functions, and saves some code size.
* fixup sigandsetrofl0r2012-12-062-2/+2
|
* add arch_prctl syscall (amd64/x32 only)rofl0r2012-12-061-0/+9
|
* add personality syscallrofl0r2012-12-061-0/+7
|
* add sigandset and sigorset (needed for qemu)rofl0r2012-12-062-0/+34
|
* add obsolete futimesat()rofl0r2012-12-061-0/+9
| | | | | | this function is obsolete, however it's available as a syscall and as such qemu userspace emulation tries to forward it to the host kernel.
* remove fenv saving/loading code from setjmp/longjmp on armRich Felker2012-12-052-4/+0
| | | | | | the issue is identical to the recent commit fixing the mips versions: despite other implementations doing this, it conflicts with the requirements of ISO C and it's a waste of time and code size.
* remove mips setjmp/longjmp code to save/restore fenvRich Felker2012-12-052-5/+1
| | | | | | | | | | | | | | | | | | | | | | nothing in the standard requires or even allows the fenv state to be restored by longjmp. restoring the exception flags is not such a big deal since it's probably valid to clobber them completely, but restoring the rounding mode yields an observable side effect not sanctioned by ISO C. saving/restoring it also wastes a few cycles and 16 bytes of code. as for historical behavior, reportedly SGI IRIX did save/restore fenv, and this is where glibc and uClibc got the behavior from. a few other systems save/restore it too (on archs other than mips), even though this is apparently wrong. further details are documented here: http://www-personal.umich.edu/~williams/archive/computation/setjmp-fpmode.html as musl aims for standards conformance rather than coddling historical programs expecting non-conforming behavior, and as it's unlikely that any historical programs actually depend on the incorrect behavior (such programs would break on other archs, anyway), I'm making the change not to save/restore fenv on mips.
* use alternate argument syntax for restrict with lio_listioRich Felker2012-12-041-1/+1
| | | | | | | for some reason I have not been able to determine, gcc 3.2 rejects the array notation. this seems to be a gcc bug, but since it's easy to work around, let's do the workaround and avoid gratuitously requiring newer compilers.
* fix ordering of shared library ctors with respect to libc initRich Felker2012-11-302-3/+11
| | | | | | | | | | | | | | | previously, shared library constructors were being called before important internal things like the environment (extern char **environ) and hwcap flags (needed for sjlj to work right with float on arm) were initialized in __libc_start_main. rather than trying to have to dynamic linker make sure this stuff all gets initialized right, I've opted to just defer calling shared library constructors until after the main program's entry point is reached. this also fixes the order of ctors to be the exact reverse of dtors, which is a desirable property and possibly even mandated by some languages. the main practical effect of this change is that shared libraries calling getenv from ctors will no longer fail.
* fix some restrict-qualifier mismatches in newly added interfacesRich Felker2012-11-271-2/+2
| | | | | these should have little/no practical impact but they're needed for strict conformance.
* eliminate gdb complaints about missing linux-gate.so.1Rich Felker2012-11-251-1/+2
| | | | | | actually, the hard-coded name should be eliminated too, and replaced by a search for the soname in the headers, but that can be done separately later.
* fix powerpc sigsetjmp asm to match the new jmp_buf size/offsetsRich Felker2012-11-231-2/+2
|
* fix powerpc setjmp/longjmp to save/restore float regs; enlarge/align jmp_bufRich Felker2012-11-232-0/+36
|
* powerpc: handle syscall error in clone.rofl0r2012-11-192-39/+24
| | | | sigsetjmp: store temporaries in jmp_buf rather than on stack.
* fix powerpc asm not to store data in volatile space below stack pointerRich Felker2012-11-182-12/+12
| | | | | | | | | | | it's essential to decrement the stack pointer before writing to new stack space, rather than afterwards. otherwise there is a race condition during which asynchronous code (signals) could clobber the data being stored. it may be possible to optimize the code further using stwu, but I wanted to avoid making any changes to the actual stack layout in this commit. further improvements can be made separately if desired.
generated by cgit-pink 1.4.1 (git 2.36.1) at 2024-11-01 06:40:01 +0000