2022-05-27 20:25:46 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
2023-12-08 03:11:56 +00:00
|
|
|
│ vi: set et ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi │
|
2020-06-15 14:18:57 +00:00
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
2022-05-27 20:25:46 +00:00
|
|
|
│ Copyright 2022 Justine Alexandra Roberts Tunney │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2024-07-24 16:48:33 +00:00
|
|
|
#include "libc/calls/blockcancel.internal.h"
|
2022-05-27 20:25:46 +00:00
|
|
|
#include "libc/calls/calls.h"
|
2022-10-16 19:05:08 +00:00
|
|
|
#include "libc/calls/state.internal.h"
|
2024-07-06 06:13:20 +00:00
|
|
|
#include "libc/dce.h"
|
2022-06-13 02:33:42 +00:00
|
|
|
#include "libc/errno.h"
|
2022-09-05 15:26:03 +00:00
|
|
|
#include "libc/intrin/atomic.h"
|
2024-07-20 02:36:25 +00:00
|
|
|
#include "libc/intrin/describeflags.h"
|
|
|
|
#include "libc/intrin/strace.h"
|
2022-09-11 18:02:07 +00:00
|
|
|
#include "libc/intrin/weaken.h"
|
2022-10-16 19:05:08 +00:00
|
|
|
#include "libc/runtime/internal.h"
|
2024-06-29 12:10:15 +00:00
|
|
|
#include "libc/thread/lock.h"
|
2022-09-10 09:56:25 +00:00
|
|
|
#include "libc/thread/thread.h"
|
2024-07-24 08:05:00 +00:00
|
|
|
#include "third_party/nsync/futex.internal.h"
|
2022-09-11 18:02:07 +00:00
|
|
|
#include "third_party/nsync/mu.h"
|
2022-06-19 08:13:03 +00:00
|
|
|
|
2024-07-26 07:44:45 +00:00
|
|
|
static void pthread_mutex_lock_spin(atomic_int *word) {
|
2024-07-06 06:13:20 +00:00
|
|
|
int backoff = 0;
|
2024-09-03 01:21:03 +00:00
|
|
|
if (atomic_exchange_explicit(word, 1, memory_order_acquire)) {
|
|
|
|
LOCKTRACE("acquiring pthread_mutex_lock_spin(%t)...", word);
|
2024-07-26 07:44:45 +00:00
|
|
|
for (;;) {
|
2024-09-03 01:21:03 +00:00
|
|
|
for (;;) {
|
|
|
|
if (!atomic_load_explicit(word, memory_order_relaxed))
|
|
|
|
break;
|
|
|
|
backoff = pthread_delay_np(word, backoff);
|
|
|
|
}
|
|
|
|
if (!atomic_exchange_explicit(word, 1, memory_order_acquire))
|
2024-07-26 07:44:45 +00:00
|
|
|
break;
|
|
|
|
}
|
2022-09-13 06:10:38 +00:00
|
|
|
}
|
2024-07-24 08:05:00 +00:00
|
|
|
}
|
2022-09-13 06:10:38 +00:00
|
|
|
|
2024-07-24 08:05:00 +00:00
|
|
|
// see "take 3" algorithm in "futexes are tricky" by ulrich drepper
|
|
|
|
// slightly improved to attempt acquiring multiple times b4 syscall
|
|
|
|
static void pthread_mutex_lock_drepper(atomic_int *futex, char pshare) {
|
2024-09-03 01:21:03 +00:00
|
|
|
int word = 0;
|
|
|
|
if (atomic_compare_exchange_strong_explicit(
|
|
|
|
futex, &word, 1, memory_order_acquire, memory_order_acquire))
|
|
|
|
return;
|
|
|
|
LOCKTRACE("acquiring pthread_mutex_lock_drepper(%t)...", futex);
|
2024-07-24 08:05:00 +00:00
|
|
|
if (word == 1)
|
|
|
|
word = atomic_exchange_explicit(futex, 2, memory_order_acquire);
|
2024-09-03 06:37:50 +00:00
|
|
|
BLOCK_CANCELATION;
|
2024-07-24 08:05:00 +00:00
|
|
|
while (word > 0) {
|
2024-09-03 06:37:50 +00:00
|
|
|
_weaken(nsync_futex_wait_)(futex, 2, pshare, 0, 0);
|
2024-07-24 08:05:00 +00:00
|
|
|
word = atomic_exchange_explicit(futex, 2, memory_order_acquire);
|
|
|
|
}
|
2024-09-03 06:37:50 +00:00
|
|
|
ALLOW_CANCELATION;
|
2024-07-24 08:05:00 +00:00
|
|
|
}
|
2022-09-10 16:14:40 +00:00
|
|
|
|
2024-07-24 08:05:00 +00:00
|
|
|
static errno_t pthread_mutex_lock_recursive(pthread_mutex_t *mutex,
|
|
|
|
uint64_t word) {
|
|
|
|
uint64_t lock;
|
|
|
|
int backoff = 0;
|
|
|
|
int me = gettid();
|
2024-09-03 01:21:03 +00:00
|
|
|
bool once = false;
|
2024-06-29 12:10:15 +00:00
|
|
|
for (;;) {
|
|
|
|
if (MUTEX_OWNER(word) == me) {
|
|
|
|
if (MUTEX_TYPE(word) != PTHREAD_MUTEX_ERRORCHECK) {
|
|
|
|
if (MUTEX_DEPTH(word) < MUTEX_DEPTH_MAX) {
|
|
|
|
if (atomic_compare_exchange_weak_explicit(
|
|
|
|
&mutex->_word, &word, MUTEX_INC_DEPTH(word),
|
|
|
|
memory_order_relaxed, memory_order_relaxed))
|
|
|
|
return 0;
|
|
|
|
continue;
|
|
|
|
} else {
|
|
|
|
return EAGAIN;
|
|
|
|
}
|
2022-09-13 21:57:38 +00:00
|
|
|
} else {
|
2024-06-29 12:10:15 +00:00
|
|
|
return EDEADLK;
|
2022-09-13 21:57:38 +00:00
|
|
|
}
|
2022-09-10 16:14:40 +00:00
|
|
|
}
|
2024-06-29 12:10:15 +00:00
|
|
|
word = MUTEX_UNLOCK(word);
|
|
|
|
lock = MUTEX_LOCK(word);
|
|
|
|
lock = MUTEX_SET_OWNER(lock, me);
|
|
|
|
if (atomic_compare_exchange_weak_explicit(&mutex->_word, &word, lock,
|
|
|
|
memory_order_acquire,
|
|
|
|
memory_order_relaxed)) {
|
|
|
|
mutex->_pid = __pid;
|
|
|
|
return 0;
|
|
|
|
}
|
2024-09-03 01:21:03 +00:00
|
|
|
if (!once) {
|
|
|
|
LOCKTRACE("acquiring pthread_mutex_lock_recursive(%t)...", mutex);
|
|
|
|
once = true;
|
|
|
|
}
|
2024-07-26 07:44:45 +00:00
|
|
|
for (;;) {
|
|
|
|
word = atomic_load_explicit(&mutex->_word, memory_order_relaxed);
|
|
|
|
if (MUTEX_OWNER(word) == me)
|
|
|
|
break;
|
|
|
|
if (word == MUTEX_UNLOCK(word))
|
|
|
|
break;
|
|
|
|
backoff = pthread_delay_np(mutex, backoff);
|
|
|
|
}
|
2022-06-11 08:59:26 +00:00
|
|
|
}
|
2022-05-27 20:25:46 +00:00
|
|
|
}
|
2024-07-06 06:13:20 +00:00
|
|
|
|
2024-07-24 08:05:00 +00:00
|
|
|
static errno_t pthread_mutex_lock_impl(pthread_mutex_t *mutex) {
|
|
|
|
uint64_t word;
|
|
|
|
|
|
|
|
// get current state of lock
|
|
|
|
word = atomic_load_explicit(&mutex->_word, memory_order_relaxed);
|
|
|
|
|
|
|
|
#if PTHREAD_USE_NSYNC
|
|
|
|
// use superior mutexes if possible
|
|
|
|
if (MUTEX_TYPE(word) == PTHREAD_MUTEX_NORMAL && //
|
|
|
|
MUTEX_PSHARED(word) == PTHREAD_PROCESS_PRIVATE && //
|
|
|
|
_weaken(nsync_mu_lock)) {
|
2024-09-03 01:21:03 +00:00
|
|
|
// on apple silicon we should just put our faith in ulock
|
|
|
|
// otherwise *nsync gets struck down by the eye of sauron
|
|
|
|
if (!IsXnuSilicon()) {
|
|
|
|
_weaken(nsync_mu_lock)((nsync_mu *)mutex);
|
|
|
|
return 0;
|
|
|
|
}
|
2024-07-24 08:05:00 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// handle normal mutexes
|
|
|
|
if (MUTEX_TYPE(word) == PTHREAD_MUTEX_NORMAL) {
|
|
|
|
if (_weaken(nsync_futex_wait_)) {
|
|
|
|
pthread_mutex_lock_drepper(&mutex->_futex, MUTEX_PSHARED(word));
|
|
|
|
} else {
|
2024-07-26 07:44:45 +00:00
|
|
|
pthread_mutex_lock_spin(&mutex->_futex);
|
2024-07-24 08:05:00 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// handle recursive and error checking mutexes
|
|
|
|
return pthread_mutex_lock_recursive(mutex, word);
|
|
|
|
}
|
|
|
|
|
2024-07-06 06:13:20 +00:00
|
|
|
/**
|
|
|
|
* Locks mutex.
|
|
|
|
*
|
|
|
|
* Here's an example of using a normal mutex:
|
|
|
|
*
|
|
|
|
* pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
* pthread_mutex_lock(&lock);
|
|
|
|
* // do work...
|
|
|
|
* pthread_mutex_unlock(&lock);
|
|
|
|
* pthread_mutex_destroy(&lock);
|
|
|
|
*
|
|
|
|
* Cosmopolitan permits succinct notation for normal mutexes:
|
|
|
|
*
|
|
|
|
* pthread_mutex_t lock = {0};
|
|
|
|
* pthread_mutex_lock(&lock);
|
|
|
|
* // do work...
|
|
|
|
* pthread_mutex_unlock(&lock);
|
|
|
|
*
|
|
|
|
* Here's an example of the proper way to do recursive mutexes:
|
|
|
|
*
|
|
|
|
* pthread_mutex_t lock;
|
|
|
|
* pthread_mutexattr_t attr;
|
|
|
|
* pthread_mutexattr_init(&attr);
|
|
|
|
* pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE);
|
|
|
|
* pthread_mutex_init(&lock, &attr);
|
|
|
|
* pthread_mutexattr_destroy(&attr);
|
|
|
|
* pthread_mutex_lock(&lock);
|
|
|
|
* // do work...
|
|
|
|
* pthread_mutex_unlock(&lock);
|
|
|
|
* pthread_mutex_destroy(&lock);
|
|
|
|
*
|
|
|
|
* This function does nothing in vfork() children.
|
|
|
|
*
|
2024-09-03 01:21:03 +00:00
|
|
|
* You can debug locks the acquisition of locks by building your program
|
|
|
|
* with `cosmocc -mdbg` and passing the `--strace` flag to your program.
|
|
|
|
* This will cause a line to be logged each time a mutex or spin lock is
|
|
|
|
* locked or unlocked. When locking, this is printed after the lock gets
|
|
|
|
* acquired. The entry to the lock operation will be logged too but only
|
|
|
|
* if the lock couldn't be immediately acquired. Lock logging works best
|
|
|
|
* when `mutex` refers to a static variable, in which case its name will
|
|
|
|
* be printed in the log.
|
|
|
|
*
|
2024-07-06 06:13:20 +00:00
|
|
|
* @return 0 on success, or error number on failure
|
|
|
|
* @see pthread_spin_lock()
|
|
|
|
* @vforksafe
|
|
|
|
*/
|
|
|
|
errno_t pthread_mutex_lock(pthread_mutex_t *mutex) {
|
2024-09-03 01:21:03 +00:00
|
|
|
if (!__vforked) {
|
|
|
|
errno_t err = pthread_mutex_lock_impl(mutex);
|
|
|
|
LOCKTRACE("pthread_mutex_lock(%t) → %s", mutex, DescribeErrno(err));
|
|
|
|
return err;
|
|
|
|
} else {
|
|
|
|
LOCKTRACE("skipping pthread_mutex_lock(%t) due to vfork", mutex);
|
2024-07-06 06:13:20 +00:00
|
|
|
return 0;
|
2024-09-03 01:21:03 +00:00
|
|
|
}
|
2024-07-06 06:13:20 +00:00
|
|
|
}
|