yuzu/src/common/thread.h

89 lines
2.3 KiB
C++
Raw Normal View History

2014-12-17 05:38:14 +00:00
// Copyright 2013 Dolphin Emulator Project / 2014 Citra Emulator Project
// Licensed under GPLv2 or any later version
// Refer to the license.txt file included.
#pragma once
2016-12-11 21:26:23 +00:00
#include <chrono>
#include <condition_variable>
#include <cstddef>
#include <mutex>
#include <thread>
2015-06-20 21:45:15 +00:00
#include "common/common_types.h"
2016-04-14 11:53:05 +00:00
namespace Common {
class Event {
public:
Event() : is_set(false) {}
2014-04-01 22:20:08 +00:00
void Set() {
2016-04-14 11:53:05 +00:00
std::lock_guard<std::mutex> 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() {
2016-04-14 11:53:05 +00:00
std::unique_lock<std::mutex> lk(mutex);
condvar.wait(lk, [&] { return is_set; });
2014-04-01 22:20:08 +00:00
is_set = false;
}
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<std::mutex> lk(mutex);
if (!condvar.wait_until(lk, time, [this] { return is_set; }))
return false;
is_set = false;
return true;
}
void Reset() {
2016-04-14 11:53:05 +00:00
std::unique_lock<std::mutex> 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:
bool is_set;
2016-04-14 11:53:05 +00:00
std::condition_variable condvar;
std::mutex mutex;
};
class Barrier {
public:
explicit Barrier(std::size_t count_) : count(count_), waiting(0), generation(0) {}
2014-04-01 22:20:08 +00:00
/// Blocks until all "count" threads have called Sync()
void Sync() {
2016-04-14 11:53:05 +00:00
std::unique_lock<std::mutex> 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;
const std::size_t count;
std::size_t waiting;
std::size_t generation; // Incremented once each time the barrier is used
};
void SetThreadAffinity(std::thread::native_handle_type thread, u32 mask);
void SetCurrentThreadAffinity(u32 mask);
void SwitchCurrentThread(); // On Linux, this is equal to sleep 1ms
void SetCurrentThreadName(const char* name);
} // namespace Common