| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | support GLOB_PERIOD flag (GNU extension) to glob function•••patch by sh4rm4
| Rich Felker | 2012-01-22 | 1 | -1/+2 |
| * | use prlimit syscall for getrlimit/setrlimit•••this allows the full range of 64-bit limit arguments even on 32-bit
systems. fallback to the old syscalls on old kernels that don't
support prlimit.
| Rich Felker | 2012-01-20 | 2 | -4/+14 |
| * | add prlimit syscall wrapper | Rich Felker | 2012-01-20 | 1 | -0/+8 |
| * | fix dynamic linker not to depend on DYNAMIC ptr in 0th entry of GOT•••this fixes an issue using gold instead of gnu ld for linking. it also
should eliminate the need of the startup code to even load/pass the
got address to the dynamic linker.
based on patch submitted by sh4rm4 with minor cosmetic changes.
further cleanup will follow.
| Rich Felker | 2012-01-20 | 1 | -3/+12 |
| * | alias basename to glibc name for it, to meet abi goals•••note that regardless of the name used, basename is always conformant.
it never takes on the bogus gnu behavior, unlike glibc where basename
is nonconformant when declared manually without including libgen.h.
| Rich Felker | 2012-01-18 | 1 | -0/+3 |
| * | fix char signedness bug in dynlinker hash function•••this only affects non-ascii symbol names, which are probably not in
use anyway..
| Rich Felker | 2012-01-17 | 1 | -1/+2 |
| * | fix broken reboot wrapper (syscall needs extra silly magic arguments...) | Rich Felker | 2011-12-23 | 1 | -1/+1 |
| * | fix issue with excessive mremap syscalls on realloc•••CHUNK_SIZE macro was defined incorrectly and shaving off at least one
significant bit in the size of mmapped chunks, resulting in the test
for oldlen==newlen always failing and incurring a syscall. fortunately
i don't think this issue caused any other observable behavior; the
definition worked correctly for all non-mmapped chunks where its
correctness matters more, since their lengths are always multiples of
the alignment.
| Rich Felker | 2011-11-16 | 1 | -4/+2 |
| * | fix signed overflows at most-negative values in ato(i|l|ll)•••patch by Pascal Cuoq (with minor tweaks to comments)
| Rich Felker | 2011-11-10 | 3 | -6/+9 |
| * | report sem value overflows in sem_post•••this is not required by the standard, but it's nicer than corrupting
the state and rather inexpensive.
| Rich Felker | 2011-10-26 | 1 | -0/+4 |
| * | support vfork on i386 | Rich Felker | 2011-10-14 | 1 | -0/+14 |
| * | make available a namespace-safe vfork, if supported•••this may be useful to posix_spawn..?
| Rich Felker | 2011-10-14 | 1 | -1/+4 |
| * | add dummy __cxa_finalize•••musl's dynamic linker does not support unloading dsos, so there's
nothing for this function to do. adding the symbol in case anything
depends on its presence..
| Rich Felker | 2011-10-14 | 1 | -0/+4 |
| * | support __cxa_atexit, and registering atexit functions from atexit handlers•••mildly tested; may have bugs. the locking should be updated not to use
spinlocks but that's outside the scope of this one module.
| Rich Felker | 2011-10-14 | 1 | -7/+26 |
| * | simplify atexit and fflush-on-exit handling | Rich Felker | 2011-10-14 | 3 | -9/+12 |
| * | fix F_GETOWN return value handling•••the fcntl syscall can return a negative value when the command is
F_GETOWN, and this is not an error code but an actual value. thus we
must special-case it and avoid calling __syscall_ret to set errno.
this fix is better than the glibc fix (using F_GETOWN_EX) which only
works on newer kernels and is more complex.
| Rich Felker | 2011-10-09 | 1 | -0/+1 |
| * | fix typo in arm clone() asm | Rich Felker | 2011-10-09 | 1 | -1/+1 |
| * | recovering ownerdead robust mutex must reset recursive lock count | Rich Felker | 2011-10-03 | 1 | -0/+1 |
| * | simplify robust mutex unlock code path•••right now it's questionable whether this change is an improvement or
not, but if we later want to support priority inheritance mutexes, it
will be important to have the code paths unified like this to avoid
major code duplication.
| Rich Felker | 2011-10-03 | 1 | -4/+4 |
| * | fix crash if pthread_mutex_unlock is called without ever locking•••this is valid for error-checking mutexes; otherwise it invokes UB and
would be justified in crashing.
| Rich Felker | 2011-10-03 | 1 | -1/+1 |
| * | use count=0 instead of 1 for recursive mutex with only one lock reference•••this simplifies the code paths slightly, but perhaps what's nicer is
that it makes recursive mutexes fully reentrant, i.e. locking and
unlocking from a signal handler works even if the interrupted code was
in the middle of locking or unlocking.
| Rich Felker | 2011-10-03 | 2 | -4/+2 |
| * | sysconf for PTHREAD_KEYS_MAX | Rich Felker | 2011-10-03 | 1 | -1/+1 |
| * | synchronize cond var destruction with exiting waits | Rich Felker | 2011-10-02 | 3 | -0/+12 |
| * | fix failure-to-wake in rwlock unlock•••a reader unlocking the lock need only wake one waiter (necessarily a
writer, but a writer unlocking the lock must wake all waiters
(necessarily readers). if it only wakes one, the remainder can remain
blocked indefinitely, or at least until the first reader unlocks (in
which case the whole lock becomes serialized and behaves as a mutex
rather than a read lock).
| Rich Felker | 2011-10-01 | 1 | -1/+1 |
| * | dlsym entry point for arm | Rich Felker | 2011-10-01 | 1 | -0/+6 |
| * | dynamic linker entry point for arm•••mildly tested, seems to work
| Rich Felker | 2011-10-01 | 1 | -0/+14 |
| * | fix various bugs in path and error handling in execvp/fexecve | Rich Felker | 2011-09-29 | 2 | -18/+29 |
| * | don't crash on null strings in printf•••passing null pointer for %s is UB but lots of broken programs do it anyway
| Rich Felker | 2011-09-28 | 1 | -1/+1 |
| * | fix excessive/insufficient wakes in __vm_unlock•••there is no need to send a wake when the lock count does not hit zero,
but when it does, all waiters must be woken (since all with the same
sign are eligible to obtain the lock).
| Rich Felker | 2011-09-28 | 1 | -3/+3 |
| * | make getmntent_r discard long lines when it returns error, not seek back•••seeking back can be performed by the caller, but if the caller doesn't
expect it, it will result in an infinite loop of failures.
| Rich Felker | 2011-09-28 | 1 | -2/+1 |
| * | improve pshared barriers•••eliminate the sequence number field and instead use the counter as the
futex because of the way the lock is held, sequence numbers are
completely useless, and this frees up a field in the barrier structure
to be used as a waiter count for the count futex, which lets us avoid
some syscalls in the best case.
as of now, self-synchronized destruction and unmapping should be fully
safe. before any thread can return from the barrier, all threads in
the barrier have obtained the vm lock, and each holds a shared lock on
the barrier. the barrier memory is not inspected after the shared lock
count reaches 0, nor after the vm lock is released.
| Rich Felker | 2011-09-28 | 2 | -12/+14 |
| * | next step making barrier self-sync'd destruction safe•••i think this works, but it can be simplified. (next step)
| Rich Felker | 2011-09-28 | 2 | -6/+18 |
| * | barrier destroy must also wait for threads in other processes exiting barrier•••the vm lock only waits for threads in the same process exiting.
actually this fix is not enough, but it's a start...
| Rich Felker | 2011-09-28 | 1 | -0/+2 |
| * | stupid typo (caused by rather ugly spelling in POSIX..) in aio | Rich Felker | 2011-09-28 | 1 | -1/+1 |
| * | correctly handle the degenerate barrier in the pshared case | Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | fix crash in pthread_cond_wait mutex-locked check•••it was assuming the result of the condition it was supposed to be
checking for, i.e. that the thread ptr had already been initialized by
pthread_mutex_lock. use the slower call to be safe.
| Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | fix crash in pthread_testcancel if pthread_self has not been called | Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | improve/debloat mutex unlock error checking in pthread_cond_wait•••we're not required to check this except for error-checking mutexes,
but it doesn't hurt. the new test is actually simpler/lighter, and it
also eliminates the need to later check that pthread_mutex_unlock
succeeds.
| Rich Felker | 2011-09-27 | 1 | -3/+3 |
| * | check mutex owner in pthread_cond_wait•••when used with error-checking mutexes, pthread_cond_wait is required
to fail with EPERM if the mutex is not locked by the caller.
previously we relied on pthread_mutex_unlock to generate the error,
but this is not valid, since in the case of such invalid usage the
internal state of the cond variable has already been potentially
corrupted (due to access outside the control of the mutex). thus, we
have to check first.
| Rich Felker | 2011-09-27 | 1 | -0/+3 |
| * | fix pshared barrier wrong return value.•••i set the return value but then never used it... oops!
| Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | convert the barrier pshared option back to 0/1 values when getting it | Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | improve error handling in mntent stuff...•••not sure if this is correct/ideal. it needs further attention.
| Rich Felker | 2011-09-27 | 1 | -2/+9 |
| * | fix missing va_end in prctl syscall wrapper | Rich Felker | 2011-09-27 | 1 | -0/+1 |
| * | fix clobbering of errno in get(pw|gr)([ug]id|nam) by fclose | Rich Felker | 2011-09-27 | 2 | -0/+12 |
| * | process-shared barrier support, based on discussion with bdonlan•••this implementation is rather heavy-weight, but it's the first
solution i've found that's actually correct. all waiters actually wait
twice at the barrier so that they can synchronize exit, and they hold
a "vm lock" that prevents changes to virtual memory mappings (and
blocks pthread_barrier_destroy) until all waiters are finished
inspecting the barrier.
thus, it is safe for any thread to destroy and/or unmap the barrier's
memory as soon as pthread_barrier_wait returns, without further
synchronization.
| Rich Felker | 2011-09-27 | 7 | -16/+102 |
| * | fix incorrect allocation failure check in pthread_create•••mmap returns MAP_FAILED not 0 because some idiot thought the ability
to mmap the null pointer page would be a good idea...
| Rich Felker | 2011-09-27 | 1 | -1/+1 |
| * | another cond var fix: requeue count race condition•••lock out new waiters during the broadcast. otherwise the wait count
added to the mutex might be lower than the actual number of waiters
moved, and wakeups may be lost.
this issue could also be solved by temporarily setting the mutex
waiter count higher than any possible real count, then relying on the
kernel to tell us how many waiters were requeued, and updating the
counts afterwards. however the logic is more complex, and i don't
really trust the kernel. the solution here is also nice in that it
replaces some atomic cas loops with simple non-atomic ops under lock.
| Rich Felker | 2011-09-26 | 2 | -15/+13 |
| * | fix lost signals in cond vars•••due to moving waiters from the cond var to the mutex in bcast, these
waiters upon wakeup would steal slots in the count from newer waiters
that had not yet been signaled, preventing the signal function from
taking any action.
to solve the problem, we simply use two separate waiter counts, and so
that the original "total" waiters count is undisturbed by broadcast
and still available for signal.
| Rich Felker | 2011-09-26 | 3 | -14/+17 |
| * | cleanup various minor issues reported by nsz•••the changes to syscall_ret are mostly no-ops in the generated code,
just cleanup of type issues and removal of some implementation-defined
behavior. the one exception is the change in the comparison value,
which is fixed so that 0xf...f000 (which in principle could be a valid
return value for mmap, although probably never in reality) is not
treated as an error return.
| Rich Felker | 2011-09-26 | 4 | -7/+8 |
| * | redo cond vars again, use sequence numbers•••testing revealed that the old implementation, while correct, was
giving way too many spurious wakeups due to races changing the value
of the condition futex. in a test program with 5 threads receiving
broadcast signals, the number of returns from pthread_cond_wait was
roughly 3 times what it should have been (2 spurious wakeups for every
legitimate wakeup). moreover, the magnitude of this effect seems to
grow with the number of threads.
the old implementation may also have had some nasty race conditions
with reuse of the cond var with a new mutex.
the new implementation is based on incrementing a sequence number with
each signal event. this sequence number has nothing to do with the
number of threads intended to be woken; it's only used to provide a
value for the futex wait to avoid deadlock. in theory there is a
danger of race conditions due to the value wrapping around after 2^32
signals. it would be nice to eliminate that, if there's a way.
testing showed no spurious wakeups (though they are of course
possible) with the new implementation, as well as slightly improved
performance.
| Rich Felker | 2011-09-26 | 4 | -48/+52 |
