mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 19:43:32 +00:00
3c61a541bd
This is one of the few POSIX APIs that was missing. It lets you choose a monotonic clock for your condition variables. This might improve perf on some platforms. It might also grant more flexibility with NTP configs. I know Qt is one project that believes it needs this. To introduce this, I needed to change some the *NSYNC APIs, to support passing a clock param. There's also new benchmarks, demonstrating Cosmopolitan's supremacy over many libc implementations when it comes to mutex performance. Cygwin has an alarmingly bad pthread_mutex_t implementation. It is so bad that they would have been significantly better off if they'd used naive spinlocks.
68 lines
3.5 KiB
C
68 lines
3.5 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│ vi: set et ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi │
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2022 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ 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. │
|
|
│ │
|
|
│ 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. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/calls/blockcancel.internal.h"
|
|
#include "libc/errno.h"
|
|
#include "libc/intrin/atomic.h"
|
|
#include "libc/limits.h"
|
|
#include "libc/thread/thread.h"
|
|
#include "third_party/nsync/futex.internal.h"
|
|
|
|
/**
|
|
* Waits for all threads to arrive at barrier.
|
|
*
|
|
* When the barrier is broken, the state becomes reset to what it was
|
|
* when pthread_barrier_init() was called, so that the barrior may be
|
|
* used again in the same way.
|
|
*
|
|
* Unlike pthread_cond_timedwait() this function is not a cancelation
|
|
* point. It is not needed to have cleanup handlers on block cancels.
|
|
*
|
|
* @return 0 on success, `PTHREAD_BARRIER_SERIAL_THREAD` to one lucky
|
|
* thread which was the last arrival, or an errno on error
|
|
* @raise EINVAL if barrier is used incorrectly
|
|
*/
|
|
errno_t pthread_barrier_wait(pthread_barrier_t *barrier) {
|
|
int n;
|
|
|
|
// enter barrier
|
|
atomic_fetch_add_explicit(&barrier->_waiters, 1, memory_order_acq_rel);
|
|
n = atomic_fetch_sub_explicit(&barrier->_counter, 1, memory_order_acq_rel);
|
|
n = n - 1;
|
|
|
|
// this can only happen on invalid usage
|
|
if (n < 0)
|
|
return EINVAL;
|
|
|
|
// reset count and wake waiters if we're last at barrier
|
|
if (!n) {
|
|
atomic_store_explicit(&barrier->_counter, barrier->_count,
|
|
memory_order_release);
|
|
atomic_store_explicit(&barrier->_waiters, 0, memory_order_release);
|
|
nsync_futex_wake_(&barrier->_waiters, INT_MAX, barrier->_pshared);
|
|
return PTHREAD_BARRIER_SERIAL_THREAD;
|
|
}
|
|
|
|
// wait for everyone else to arrive at barrier
|
|
BLOCK_CANCELATION;
|
|
while ((n = atomic_load_explicit(&barrier->_waiters, memory_order_acquire)))
|
|
nsync_futex_wait_(&barrier->_waiters, n, barrier->_pshared, 0, 0);
|
|
ALLOW_CANCELATION;
|
|
|
|
return 0;
|
|
}
|