about summary refs log tree commit diff
Commit message (Collapse)AuthorAgeFilesLines
* implement mq_notifyRich Felker2011-06-071-2/+65
|
* add support for POSIX message queues, except mq_notifyRich Felker2011-06-0711-0/+133
|
* use __attribute__((const)) for errno and pthread_self if __GNUC__ is definedRich Felker2011-06-062-0/+6
| | | | | this is not too ugly and should result in significant code size and performance improvements for many programs.
* use volatile pointers for intentional-crash code.Rich Felker2011-06-062-3/+3
|
* fix handling of d_name in struct direntRich Felker2011-06-063-8/+6
| | | | | | | | | | | | basically there are 3 choices for how to implement this variable-size string member: 1. C99 flexible array member: breaks using dirent.h with pre-C99 compiler. 2. old way: length-1 string: generates array bounds warnings in caller. 3. new way: length-NAME_MAX string. no problems, simplifies all code. of course the usable part in the pointer returned by readdir might be shorter than NAME_MAX+1 bytes, but that is allowed by the standard and doesn't hurt anything.
* safety fix for glob's vla usage: disallow patterns longer than PATH_MAXRich Felker2011-06-051-0/+2
| | | | | | | | | | | this actually inadvertently disallows some valid patterns with redundant / or * characters, but it's better than allowing unbounded vla allocation. eventually i'll write code to move the pattern to the stack and eliminate redundancy to ensure that it fits in PATH_MAX at the beginning of glob. this would also allow it to be modified in place for passing to fnmatch rather than copied at each level of recursion.
* eliminate (harmless in this case) vla usage in fnmatch.cRich Felker2011-06-051-1/+1
|
* missing prototypes for mbsnrtowcs and wcsnrtombsRich Felker2011-05-301-0/+6
|
* implement pthread_[sg]etconcurrency.Rich Felker2011-05-303-0/+18
| | | | | | there is a resource limit of 0 bits to store the concurrency level requested. thus any positive level exceeds a resource limit, resulting in EAGAIN. :-)
* implement uselocale function (minimal)Rich Felker2011-05-302-0/+12
|
* add useless, obsolescent function ulimitRich Felker2011-05-291-0/+19
|
* fix backwards posix_spawn file action orderRich Felker2011-05-295-6/+10
|
* add accidentally-omitted file needed for posix_spawn file actionsRich Felker2011-05-281-0/+10
|
* add file actions support to posix_spawnRich Felker2011-05-285-2/+85
|
* posix_spawn: honor POSIX_SPAWN_SETSIGDEF flagRich Felker2011-05-281-1/+3
|
* initial implementation of posix_spawnRich Felker2011-05-2813-0/+218
| | | | | file actions are not yet implemented, but everything else should be mostly complete and roughly correct.
* modernize coding style in sjlj asmRich Felker2011-05-264-35/+35
|
* fix strncat and wcsncat (double null termination)Rich Felker2011-05-223-3/+3
| | | | also modify wcsncpy to use the same loop logic
* fix wcsncpy writing past end of bufferRich Felker2011-05-221-1/+1
|
* fix brk/sbrk behavior to match the real legacy functionsRich Felker2011-05-222-2/+4
|
* release notes for 0.7.10 v0.7.10Rich Felker2011-05-171-0/+25
|
* fix the last known rounding bug in floating point printingRich Felker2011-05-111-3/+4
| | | | | | | | | the observed symptom was that the code was incorrectly rounding up 1.0625 to 1.063 despite the rounding mode being round-to-nearest with ties broken by rounding to even last place. however, the code was just not right in many respects, and i'm surprised it worked as well as it did. this time i tested the values that end up in the variables round, small, and the expression round+small, and all look good.
* eventfd syscall wrapper and read/write wrappersRich Felker2011-05-084-0/+46
|
* optimize out useless default-attribute object in pthread_createRich Felker2011-05-071-7/+7
|
* optimize compound-literal sigset_t's not to contain useless hurd bitsRich Felker2011-05-073-5/+7
|
* overhaul implementation-internal signal protectionsRich Felker2011-05-0713-50/+32
| | | | | | | | | | | | | | | | | | | the new approach relies on the fact that the only ways to create sigset_t objects without invoking UB are to use the sig*set() functions, or from the masks returned by sigprocmask, sigaction, etc. or in the ucontext_t argument to a signal handler. thus, as long as sigfillset and sigaddset avoid adding the "protected" signals, there is no way the application will ever obtain a sigset_t including these bits, and thus no need to add the overhead of checking/clearing them when sigprocmask or sigaction is called. note that the old code actually *failed* to remove the bits from sa_mask when sigaction was called. the new implementations are also significantly smaller, simpler, and faster due to ignoring the useless "GNU HURD signals" 65-1024, which are not used and, if there's any sanity in the world, never will be used.
* reduce some ridiculously large spin countsRich Felker2011-05-062-2/+2
| | | | | | these should be tweaked according to testing. offhand i know 1000 is too low and 5000 is likely to be sufficiently high. consider trying to add futexes to file locking, too...
* remove debug code that was missed in barrier commitRich Felker2011-05-061-1/+0
|
* completely new barrier implementation, addressing major correctness issuesRich Felker2011-05-062-20/+48
| | | | | | | | | | | | | | | | | | | | the previous implementation had at least 2 problems: 1. the case where additional threads reached the barrier before the first wave was finished leaving the barrier was untested and seemed not to be working. 2. threads leaving the barrier continued to access memory within the barrier object after other threads had successfully returned from pthread_barrier_wait. this could lead to memory corruption or crashes if the barrier object had automatic storage in one of the waiting threads and went out of scope before all threads finished returning, or if one thread unmapped the memory in which the barrier object lived. the new implementation avoids both problems by making the barrier state essentially local to the first thread which enters the barrier wait, and forces that thread to be the last to return.
* add SA_NOMASK alias for SA_NODEFER with _GNU_SOURCERich Felker2011-05-051-0/+1
|
* fix fclose return status logic, againRich Felker2011-05-021-1/+2
| | | | | | | | the previous fix was incorrect, as it would prevent f->close(f) from being called if fflush(f) failed. i believe this was the original motivation for using | rather than ||. so now let's just use a second statement to constrain the order of function calls, and to back to using |.
* fix undefined call order in fclose, possible lost output depending on compilerRich Felker2011-05-011-1/+1
| | | | | pcc turned up this bug by calling f->close(f) before fflush(f), resulting in lost output and error on flush.
* workaround for preprocessor bug in pccRich Felker2011-05-011-7/+7
| | | | | | | with this patch, musl compiles and mostly works with pcc 1.0.0. a few tests are still failing and i'm uncertain whether they are due to portability problems in musl, or bugs in pcc, but i suspect the latter.
* minor optimization in puts: use inline putc_unlocked macro for newlineRich Felker2011-05-011-1/+1
|
* avoid crashing when nel==0 is passed to qsortRich Felker2011-04-291-2/+6
|
* use compiler builtins for variadic macros when availableRich Felker2011-04-273-1/+12
| | | | | | | | | | | this slightly cuts down on the degree musl "fights with" gcc, but more importantly, it fixes a critical bug when gcc inlines a variadic function and optimizes out the variadic arguments due to noticing that they were "not used" (by __builtin_va_arg). we leave the old code in place if __GNUC__ >= 3 is false; it seems like it might be necessary at least for tinycc support and perhaps if anyone ever gets around to fixing gcc 2.95.3 enough to make it work..
* correct variadic prototypes for execl* familyRich Felker2011-04-274-18/+21
| | | | | the old versions worked, but conflicted with programs which declared their own prototypes and generated warnings with some versions of gcc.
* replace heap sort with smoothsort implementation by Valentin OchsRich Felker2011-04-272-32/+197
| | | | | | | | | | | | | | Smoothsort is an adaptive variant of heapsort. This version was written by Valentin Ochs (apo) specifically for inclusion in musl. I worked with him to get it working in O(1) memory usage even with giant array element widths, and to optimize it heavily for size and speed. It's still roughly 4 times as large as the old heap sort implementation, but roughly 20 times faster given an almost-sorted array of 1M elements (20 being the base-2 log of 1M), i.e. it really does reduce O(n log n) to O(n) in the mostly-sorted case. It's still somewhat slower than glibc's Introsort for random input, but now considerably faster than glibc when the input is already sorted, or mostly sorted.
* add word-sized ctz function to atomic.hRich Felker2011-04-272-4/+16
| | | | | | strictly speaking this and a few other ops should be factored into asm.h or the file should just be renamed to asm.h, but whatever. clean it up someday.
* function signature fix: add const qualifier to mempcpy src argRich Felker2011-04-262-2/+2
|
* typo in prototype for mempcpyRich Felker2011-04-261-1/+1
|
* prototype for mempcpyRich Felker2011-04-261-0/+1
|
* fix bug in ipv6 parsing that prevented parsing a lone "::"Rich Felker2011-04-251-4/+1
|
* ipv6 parsing code (formerly dummied-out)Rich Felker2011-04-252-8/+62
|
* fix 2 eof-related bugs in scanfRich Felker2011-04-251-3/+4
| | | | | | | | | 1. failed match of literal chars from the format string would always return matching failure rather than input failure at eof, leading to infinite loops in some programs. 2. unread of eof would wrongly adjust the character counts reported by %n, yielding an off-by-one error.
* update release notes to new format, add more v0.7.9Rich Felker2011-04-221-23/+33
|
* fix initial stack alignment in new threads on x86_64Rich Felker2011-04-221-1/+1
|
* update release notes in prep for 0.7.9 releaseRich Felker2011-04-211-3/+12
|
* omit errno update path for syscalls that cannot failRich Felker2011-04-217-7/+7
|
* fix bogus return values for inet_ptonRich Felker2011-04-211-2/+2
|