提交 e7655ed3 编写于 作者: R Rich Felker

internal locks: new owner of contended lock must set waiters flag

this bug probably would have gone unnoticed since it's only used in
the fallback code for systems where priority-inheritance locking
fails. unfortunately this approach results in one spurious wake
syscall on the final unlock, when there are no waiters remaining. the
alternative (possibly better) would be to use broadcast wakes instead
of reflagging the waiter unconditionally, and let each waiter reflag
itself; this saves one syscall at the expense of invoking the
"thundering herd" effect (worse performance degredation) when there
are many waiters.

ideally we would be able to update all of our locks to use an array of
two ints rather than a single int, and use a separate counter system
like proper mutexes use; then we could avoid all spurious wake calls
without resorting to broadcasts. however, it's not clear to me that
priority inheritance futexes support this usage. the kernel sets the
waiters flag for them (just like we're doing now) and i can't tell if
it's safe to bypass the kernel when unlocking just because we know
(from private data, the waiter count) that there are no waiters. this
is something that could be explored in the future.
上级 f34d0ea5
......@@ -4,7 +4,7 @@ void __lock_2(volatile int *l)
{
if (!__syscall(SYS_futex, l, FUTEX_LOCK_PI, 0, 0))
return;
int old, tid = __pthread_self()->tid;
int old, tid = __pthread_self()->tid|INT_MIN;
while ((old = a_cas(l, 0, tid))) {
a_cas(l, old, old|INT_MIN);
__syscall(SYS_futex, l, FUTEX_WAIT, old|INT_MIN, 0);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册