suyu/src/common/thread.h

102 lines
2.5 KiB
C++
Raw Normal View History

// SPDX-FileCopyrightText: 2013 Dolphin Emulator Project
// SPDX-FileCopyrightText: 2014 Citra Emulator Project
// SPDX-License-Identifier: GPL-2.0-or-later
#pragma once
#include <atomic>
2016-12-11 21:26:23 +00:00
#include <chrono>
#include <condition_variable>
#include <cstddef>
#include <mutex>
#include <thread>
2020-02-08 16:48:57 +00:00
#include "common/common_types.h"
2016-04-14 11:53:05 +00:00
namespace Common {
class Event {
public:
void Set() {
std::scoped_lock lk{mutex};
if (!is_set) {
2014-04-01 22:20:08 +00:00
is_set = true;
2016-04-14 11:53:05 +00:00
condvar.notify_one();
2014-04-01 22:20:08 +00:00
}
}
void Wait() {
std::unique_lock lk{mutex};
condvar.wait(lk, [&] { return is_set.load(); });
2014-04-01 22:20:08 +00:00
is_set = false;
}
2020-02-08 16:48:57 +00:00
bool WaitFor(const std::chrono::nanoseconds& time) {
2019-11-03 07:07:04 +00:00
std::unique_lock lk{mutex};
if (!condvar.wait_for(lk, time, [this] { return is_set.load(); }))
return false;
is_set = false;
return true;
}
2016-12-11 21:26:23 +00:00
template <class Clock, class Duration>
bool WaitUntil(const std::chrono::time_point<Clock, Duration>& time) {
std::unique_lock lk{mutex};
if (!condvar.wait_until(lk, time, [this] { return is_set.load(); }))
2016-12-11 21:26:23 +00:00
return false;
is_set = false;
return true;
}
void Reset() {
std::unique_lock lk{mutex};
// no other action required, since wait loops on the predicate and any lingering signal will
// get cleared on the first iteration
2014-04-01 22:20:08 +00:00
is_set = false;
}
private:
2016-04-14 11:53:05 +00:00
std::condition_variable condvar;
std::mutex mutex;
std::atomic_bool is_set{false};
};
class Barrier {
public:
explicit Barrier(std::size_t count_) : count(count_) {}
2014-04-01 22:20:08 +00:00
/// Blocks until all "count" threads have called Sync()
void Sync() {
std::unique_lock lk{mutex};
const std::size_t current_generation = generation;
2014-04-01 22:20:08 +00:00
2016-04-14 11:53:05 +00:00
if (++waiting == count) {
2016-04-14 11:54:06 +00:00
generation++;
2016-04-14 11:53:05 +00:00
waiting = 0;
condvar.notify_all();
} else {
condvar.wait(lk,
[this, current_generation] { return current_generation != generation; });
2014-04-01 22:20:08 +00:00
}
}
private:
2016-04-14 11:53:05 +00:00
std::condition_variable condvar;
std::mutex mutex;
std::size_t count;
std::size_t waiting = 0;
std::size_t generation = 0; // Incremented once each time the barrier is used
};
enum class ThreadPriority : u32 {
Low = 0,
Normal = 1,
High = 2,
VeryHigh = 3,
};
void SetCurrentThreadPriority(ThreadPriority new_priority);
void SetCurrentThreadName(const char* name);
} // namespace Common