about summary refs log tree commit diff
path: root/src
Commit message (Collapse)AuthorAgeFilesLines
* fix error returns in gethostby*_r functionsRich Felker2013-02-022-17/+10
| | | | they're supposed to return an error code rather than using errno.
* fix uninitialized map_len being used in munmap failure paths in load_libraryRich Felker2013-02-021-3/+2
| | | | | | this bug seems to have been introduced when the map_library signatures was changed to return the mapping in a temp dso structure instead of into separate variables.
* fix stale locks left behind when pthread_create failsRich Felker2013-02-011-3/+6
| | | | this bug seems to have been around a long time.
* if pthread_create fails, it must not attempt mmap if there is no mappingRich Felker2013-02-011-1/+1
| | | | | this bug was introduced when support for application-provided stacks was originally added.
* pthread stack treatment overhaul for application-provided stacks, etc.Rich Felker2013-02-013-23/+33
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | the main goal of these changes is to address the case where an application provides a stack of size N, but TLS has size M that's a significant portion of the size N (or even larger than N), thus giving the application less stack space than it expected or no stack at all! the new strategy pthread_create now uses is to only put TLS on the application-provided stack if TLS is smaller than 1/8 of the stack size or 2k, whichever is smaller. this ensures that the application always has "close enough" to what it requested, and the threshold is chosen heuristically to make sure "sane" amounts of TLS still end up in the application-provided stack. if TLS does not fit the above criteria, pthread_create uses mmap to obtain space for TLS, but still uses the application-provided stack for actual call frame stack. this is to avoid wasting memory, and for the sake of supporting ugly hacks like garbage collection based on assumptions that the implementation will use the provided stack range. in order for the above heuristics to ever succeed, the amount of TLS space wasted on POSIX TSD (pthread_key_create based) needed to be reduced. otherwise, these changes would preclude any use of pthread_create without mmap, which would have serious memory usage and performance costs for applications trying to create huge numbers of threads using pre-allocated stack space. the new value of PTHREAD_KEYS_MAX is the minimum allowed by POSIX, 128. this should still be plenty more than real-world applications need, especially now that C11/gcc-style TLS is now supported in musl, and most apps and libraries choose to use that instead of POSIX TSD when available. at the same time, PTHREAD_STACK_MIN has been decreased. it was originally set to PAGE_SIZE back when there was no support for TLS or application-provided stacks, and requests smaller than a whole page did not make sense. now, there are two good reasons to support requests smaller than a page: (1) applications could provide pre-allocated stacks smaller than a page, and (2) with smaller stack sizes, stack+TLS+TSD can all fit in one page, making it possible for applications which need huge numbers of threads with minimal stack needs to allocate exactly one page per thread. the new value of PTHREAD_STACK_MIN, 2k, is aligned with the minimum size for sigaltstack.
* make some arrays constrofl0r2013-02-027-8/+8
| | | | this way they'll go into .rodata, decreasing memory pressure.
* replace __wake function with macro that performs direct syscallRich Felker2013-02-012-10/+2
| | | | | | | | | | | this should generate faster and smaller code, especially with inline syscalls. the conditional with cnt is ugly, but thankfully cnt is always a constant anyway so it gets evaluated at compile time. it may be preferable to make separate __wake and __wakeall macros without a count argument. priv flag is not used yet; private futex support still needs to be done at some point in the future.
* fix up minor misplacement of restrict keyword in spawnattr sched stubsRich Felker2013-02-011-2/+2
|
* revert regex "cleanup" that seems unjustified and may break backtrackingRich Felker2013-02-011-0/+3
| | | | | | it's not clear to me at the moment whether the code that was removed (and which is now being re-added) is needed, but it's far from being a no-op, and i don't want to risk breaking regex in this release.
* fix tm_to_time logic for number of days in novemberRich Felker2013-01-261-1/+1
| | | | report/patch by Hiltjo Posthuma <hiltjo@codemadness.org>
* add support for RTLD_NOLOAD to dlopenRich Felker2013-01-231-3/+7
| | | | | | | | based on patch by Pierre Carrier <pierre@gcarrier.fr> that just added the flag constant, but with minimal additional code so that it actually works as documented. this is a nonstandard option but some major software (reportedly, Firefox) uses it and it was easy to add anyway.
* fix regression in dlsym: rejection of special RTLD_* handles as invalidRich Felker2013-01-231-1/+2
|
* fix warning building dynlink.c stub for static libcRich Felker2013-01-161-2/+2
| | | | | struct dso was not defined in this case, and it's not needed in the code that was using it anyway; void pointers work just as well.
* fix bug in dladdr that prevented resolving addresses in the PLTRich Felker2013-01-161-1/+1
|
* remove unused "params" related code from regexSzabolcs Nagy2013-01-152-21/+11
| | | | | some structs and functions had reference to the params feature of tre that is not used by the code anymore
* Merge remote-tracking branch 'nsz/math'Rich Felker2013-01-143-297/+207
|\
| * 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
* | regex: remove an unused local variable from regexecSzabolcs Nagy2013-01-141-3/+0
| | | | | | | | pos_start local variable is not used in tre_tnfa_run_backtrack
* | in crypt_des change unnecessary union keybuf into unsigned char[]Szabolcs Nagy2013-01-131-11/+8
| | | | | | | | | | | | original FreeSec code accessed keybuf as uint32* and uint8* as well (incorrectly), this got fixed with an union, but then it seems the uint32* access is no longer needed so the code can be simplified
* | crypt: fix the prototype of md5_sum, sha256_sum and sha512_sumSzabolcs Nagy2013-01-133-3/+3
| | | | | | | | | | | | the internal sha2 hash sum functions had incorrect array size in the prototype for the message digest argument, fixed by using pointer so it is not misleading
* | fix lio_listio return value in LIO_WAIT modeSzabolcs Nagy2013-01-131-1/+1
| |
* | check for invalid handles in dlsym/dlcloseRich Felker2013-01-101-1/+17
|/ | | | | | | this is wasteful and useless from a standpoint of sane programs, but it is required by the standard, and the current requirements were upheld with the closure of Austin Group issue #639: http://austingroupbugs.net/view.php?id=639
* __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.
generated by cgit-pink 1.4.1 (git 2.36.1) at 2024-11-09 01:26:28 +0000