this change is needed to fix a race condition and ensure that it's possible to unlock and destroy or unmap the mutex as soon as pthread_mutex_lock succeeds. POSIX explicitly gives such an example in the rationale and requires an implementation to allow such usage.
32 lines
738 B
C
32 lines
738 B
C
#include "pthread_impl.h"
|
|
|
|
int pthread_mutex_unlock(pthread_mutex_t *m)
|
|
{
|
|
pthread_t self;
|
|
int waiters = m->_m_waiters;
|
|
int cont;
|
|
|
|
if (m->_m_type != PTHREAD_MUTEX_NORMAL) {
|
|
if (!m->_m_lock)
|
|
return EPERM;
|
|
self = __pthread_self();
|
|
if ((m->_m_lock&0x1fffffff) != self->tid)
|
|
return EPERM;
|
|
if ((m->_m_type&3) == PTHREAD_MUTEX_RECURSIVE && --m->_m_count)
|
|
return 0;
|
|
if (m->_m_type >= 4) {
|
|
self->robust_list.pending = &m->_m_next;
|
|
*(void **)m->_m_prev = m->_m_next;
|
|
if (m->_m_next) ((void **)m->_m_next)[-1] = m->_m_prev;
|
|
cont = a_swap(&m->_m_lock, 0);
|
|
self->robust_list.pending = 0;
|
|
goto wake;
|
|
}
|
|
}
|
|
cont = a_swap(&m->_m_lock, 0);
|
|
wake:
|
|
if (waiters || cont<0)
|
|
__wake(&m->_m_lock, 1, 0);
|
|
return 0;
|
|
}
|