spin in recursive mutex lock; use compare exchange for broadcast

This commit is contained in:
Lucas Perlind
2025-09-24 15:54:58 +10:00
committed by janga-perlind
parent eca2758d8b
commit 15b4b9277a
2 changed files with 24 additions and 8 deletions
+13 -5
View File
@@ -19,6 +19,11 @@ enum GrabState {
Grab_Failed = 2, Grab_Failed = 2,
}; };
enum BroadcastWaitState {
Nobody_Waiting = 0,
Someone_Waiting = 1,
};
struct ThreadPool { struct ThreadPool {
gbAllocator threads_allocator; gbAllocator threads_allocator;
Slice<Thread> threads; Slice<Thread> threads;
@@ -54,8 +59,8 @@ gb_internal void thread_pool_destroy(ThreadPool *pool) {
for_array_off(i, 1, pool->threads) { for_array_off(i, 1, pool->threads) {
Thread *t = &pool->threads[i]; Thread *t = &pool->threads[i];
pool->tasks_available.fetch_add(1, std::memory_order_acquire); pool->tasks_available.store(Nobody_Waiting);
futex_broadcast(&pool->tasks_available); futex_broadcast(&t->pool->tasks_available);
thread_join_and_destroy(t); thread_join_and_destroy(t);
} }
@@ -87,9 +92,11 @@ void thread_pool_queue_push(Thread *thread, WorkerTask task) {
thread->queue.bottom.store(bot + 1, std::memory_order_relaxed); thread->queue.bottom.store(bot + 1, std::memory_order_relaxed);
thread->pool->tasks_left.fetch_add(1, std::memory_order_release); thread->pool->tasks_left.fetch_add(1, std::memory_order_release);
thread->pool->tasks_available.fetch_add(1, std::memory_order_relaxed); i32 state = Someone_Waiting;
if (thread->pool->tasks_available.compare_exchange_strong(state, Nobody_Waiting)) {
futex_broadcast(&thread->pool->tasks_available); futex_broadcast(&thread->pool->tasks_available);
} }
}
GrabState thread_pool_queue_take(Thread *thread, WorkerTask *task) { GrabState thread_pool_queue_take(Thread *thread, WorkerTask *task) {
isize bot = thread->queue.bottom.load(std::memory_order_relaxed) - 1; isize bot = thread->queue.bottom.load(std::memory_order_relaxed) - 1;
@@ -230,12 +237,13 @@ gb_internal THREAD_PROC(thread_pool_thread_proc) {
} }
// if we've done all our work, and there's nothing to steal, go to sleep // if we've done all our work, and there's nothing to steal, go to sleep
state = pool->tasks_available.load(std::memory_order_acquire); pool->tasks_available.store(Someone_Waiting);
if (!pool->running) { break; } if (!pool->running) { break; }
futex_wait(&pool->tasks_available, state); futex_wait(&pool->tasks_available, Someone_Waiting);
main_loop_continue:; main_loop_continue:;
} }
return 0; return 0;
} }
+10 -2
View File
@@ -195,7 +195,13 @@ gb_internal void mutex_lock(RecursiveMutex *m) {
// inside the lock // inside the lock
return; return;
} }
futex_wait(&m->owner, prev_owner);
// NOTE(lucas): we are doing spin lock since futex signal is expensive on OSX. The recursive locks are
// very short lived so we don't hit this mega often and I see no perform regression on windows (with
// a performance uplift on OSX).
//futex_wait(&m->owner, prev_owner);
yield_thread();
} }
} }
gb_internal bool mutex_try_lock(RecursiveMutex *m) { gb_internal bool mutex_try_lock(RecursiveMutex *m) {
@@ -216,7 +222,9 @@ gb_internal void mutex_unlock(RecursiveMutex *m) {
return; return;
} }
m->owner.exchange(0, std::memory_order_release); m->owner.exchange(0, std::memory_order_release);
futex_signal(&m->owner); // NOTE(lucas): see comment about spin lock in mutex_lock above
// futex_signal(&m->owner);
// outside the lock // outside the lock
} }