mirror of
https://github.com/hrydgard/ppsspp.git
synced 2026-10-15 23:40:29 +02:00
The core and the headless tools no longer use mutexes, condition variables, spinlocks, std::atomic, std::thread or volatile flags. Threads hand off through libretro-common's retro_atomic and rthreads plus a few small pieces on top of them in Common/Thread: Thread, MpscQueue, EventCounter, ParkingLot waits and ReaderGate. Every wait blocks until it's woken; nothing polls on a timer. State that only one thread touches just loses its lock. The PSP filesystem, sceIo and the savedata dialog now belong to the emulation thread: async reads and writes run when they're queued and complete later in emulated time, and the IO and savedata threads are gone. The friend finder only talks to the adhoc server and hands what it gets to the emulation thread. GPU init always runs on the thread that starts the game. The Vulkan render and compile queues, pipeline and render pass caches, delete list and SPIR-V cache, the GL render queue, the software renderer's jit caches, the file loader caches, the web debugger, UPnP, input, savestates, logging and the GE debugger all hand off through queues and atomics. The IR jit's spinning profiler thread goes. A CPU thread with nothing to run now sleeps until work is queued instead of spinning. Headless with --debugger waits for a client while stopped, and ends the run once every client that connected has left. Web server shutdown keeps servicing the CPU queue until the server has finished.
100 lines
2.7 KiB
C++
100 lines
2.7 KiB
C++
#pragma once
|
|
|
|
#include <cstdint>
|
|
|
|
#include <retro_atomic.h>
|
|
#include <rthreads/retro_eventcount.h>
|
|
|
|
// Parking for one-shot and counter waits, keyed by address.
|
|
//
|
|
// The eventcounts live for the whole process, sharded by address, so the object being
|
|
// waited on never owns one. A notifier only hashes the address after publishing, it never
|
|
// dereferences it, so a waiter may free the object the moment its predicate holds.
|
|
// Shards are shared, so a wakeup may be for someone else: callers always loop on their
|
|
// own predicate (the helpers below do).
|
|
|
|
retro_eventcount_t *ParkingLotFor(const void *addr);
|
|
|
|
inline void ParkingLotNotify(const void *addr) {
|
|
retro_eventcount_notify(ParkingLotFor(addr));
|
|
}
|
|
|
|
// Blocks until pred() is true.
|
|
template <class Pred>
|
|
inline void ParkingLotWait(const void *addr, Pred pred) {
|
|
if (pred())
|
|
return;
|
|
retro_eventcount_t *ec = ParkingLotFor(addr);
|
|
for (;;) {
|
|
const int key = retro_eventcount_prepare_wait(ec);
|
|
if (pred()) {
|
|
retro_eventcount_cancel_wait(ec);
|
|
return;
|
|
}
|
|
retro_eventcount_commit_wait(ec, key);
|
|
if (pred())
|
|
return;
|
|
}
|
|
}
|
|
|
|
// A count of events, for "wait until something happened since I last looked". A waiter reads
|
|
// Seen() before it checks its own state, and Wait(seen) returns once Notify() has run since.
|
|
class EventCounter {
|
|
public:
|
|
EventCounter() {
|
|
retro_atomic_int_init(&count_, 0);
|
|
}
|
|
|
|
int Seen() const {
|
|
return retro_atomic_load_acquire_int(const_cast<retro_atomic_int_t *>(&count_));
|
|
}
|
|
|
|
// Any thread, after publishing whatever the waiters look at.
|
|
void Notify() {
|
|
retro_atomic_fetch_add_int(&count_, 1);
|
|
ParkingLotNotify(this);
|
|
}
|
|
|
|
void Wait(int seen) const {
|
|
ParkingLotWait(this, [&] { return Seen() != seen; });
|
|
}
|
|
|
|
private:
|
|
retro_atomic_int_t count_;
|
|
};
|
|
|
|
// Grace period for read-mostly pointers: readers bracket each use with
|
|
// Enter/Exit, a writer unpublishes and then Drain()s before freeing.
|
|
// Readers never wait. Drain waits only for readers already inside.
|
|
struct ReaderGate {
|
|
ReaderGate() {
|
|
retro_atomic_int_init(&readers_, 0);
|
|
retro_atomic_int_init(&draining_, 0);
|
|
}
|
|
|
|
void Enter() {
|
|
retro_atomic_fetch_add_int(&readers_, 1);
|
|
retro_atomic_thread_fence_seq_cst();
|
|
}
|
|
|
|
void Exit() {
|
|
if (retro_atomic_fetch_sub_int(&readers_, 1) == 1) {
|
|
retro_atomic_thread_fence_seq_cst();
|
|
if (retro_atomic_load_relaxed_int(&draining_))
|
|
ParkingLotNotify(this);
|
|
}
|
|
}
|
|
|
|
// Call after unpublishing. Only one drainer at a time.
|
|
void Drain() {
|
|
retro_atomic_store_relaxed_int(&draining_, 1);
|
|
retro_atomic_thread_fence_seq_cst();
|
|
ParkingLotWait(this, [this] { return retro_atomic_load_acquire_int(&readers_) == 0; });
|
|
retro_atomic_store_relaxed_int(&draining_, 0);
|
|
}
|
|
|
|
private:
|
|
retro_atomic_int_t readers_;
|
|
retro_atomic_int_t draining_;
|
|
};
|