this could cause problems if the application uses dup2(fd,fileno(f))
to redirect, and the old fd...

if init_malloc returns positive (successful first init), malloc will
retry getting a chunk from ...

we want to keep atomically updated fields (locks and thread count) and
really anything writable ...

this simplifies code and removes a failure case

calling this function on an uninitialized key value is UB, so there is
no need to check that the...

instead of allocating a userspace structure for signal-based timers,
simply use the kernel timer...

the major idea of this patch is not to depend on having the timer
pointer delivered to the signa...

unlocking an unlocked mutex is not UB for robust or error-checking
mutexes, so we must avoid cal...

why does this affect behavior? well, the linker seems to traverse
archive files starting from it...

this roughly halves the cost of pthread_mutex_unlock, at least for
non-robust, normal-type mutex...

cycle-level benchmark on atom cpu showed typical pthread_mutex_lock
call dropping from ~120 cycl...

this allows small programs which only create times, but never delete
them, to use simple_malloc ...

this implementation is superior to the glibc/nptl implementation, in
that it gives true realtime...

- there is no longer any risk of spoofing cancellation requests, since
the cancel flag is set ...

this mainly just caused bloat, but could corrupt errno if a 0-arg
syscall ever failed.

actually this trick also seems to have made the uncontended case slower.

the biggest change in this commit is that stdio now uses readv to fill
the caller's buffer and t...

glibc made the ridiculous choice to use pass-by-register calling
convention for these functions,...

sadly the C language does not specify any such implicit conversion, so
this is not a matter of j...

this commit addresses two issues:

1. a race condition, whereby a cancellation request occurring...

with this patch, the syscallN() functions are no longer needed; a
variadic syscall() macro allow...

this commit shuffles around the location of syscall definitions so
that we can make a syscall() ...

i'm still not sure whether it's a good idea to include or use any of
these, but i'll add them fo...

this commit is part of an effort to make more of busybox work
out-of-the-box.

this implementation is extremely ugly and inefficient, but it avoids a
good deal of code duplica...

some of this code should be cleaned up, e.g. using macros for some of
the bit flags, masks, etc....

if the mutex was previously locked, we can assume pthread_self was
already called at the time of...

the layout has been chosen so that pointer slots 3 and 4 fit between
the integer slots on 32-bit...

this change is necessary to free up one slot in the mutex structure so
that we can use doubly-li...

actually it gets this from time.h if _POSIX_C_SOURCE or any other
feature test macros are define...

for some reason these functions are not shaded by the PS/TPS option in
POSIX, so presumably they...

multiple opens of the same named semaphore must return the same
pointer, and only the last close...

we can avoid blocking signals by simply using a flag to mark that the
thread has exited and prev...

1. any padding in the siginfo struct was not necessarily zero-filled,
so it might have contained...

POSIX allows either behavior, but sigwait is not allowed to fail with
EINTR, so the retry loop w...