2020-02-25 02:04:12 +00:00
|
|
|
// Copyright 2020 yuzu Emulator Project
|
|
|
|
// Licensed under GPLv2 or any later version
|
2014-04-09 00:11:21 +01:00
|
|
|
// Refer to the license.txt file included.
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
#include <algorithm>
|
2014-09-03 06:05:45 +01:00
|
|
|
#include <mutex>
|
2017-11-25 13:56:57 +00:00
|
|
|
#include <string>
|
|
|
|
#include <tuple>
|
2019-02-14 17:42:58 +00:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
#include "common/assert.h"
|
2020-02-25 15:12:46 +00:00
|
|
|
#include "common/microprofile.h"
|
|
|
|
#include "core/core_timing.h"
|
2018-07-24 11:03:24 +01:00
|
|
|
#include "core/core_timing_util.h"
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2019-02-12 17:32:15 +00:00
|
|
|
namespace Core::Timing {
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2019-11-27 02:48:56 +00:00
|
|
|
std::shared_ptr<EventType> CreateEvent(std::string name, TimedCallback&& callback) {
|
|
|
|
return std::make_shared<EventType>(std::move(callback), std::move(name));
|
|
|
|
}
|
|
|
|
|
2019-02-14 17:42:58 +00:00
|
|
|
struct CoreTiming::Event {
|
2020-02-25 02:04:12 +00:00
|
|
|
u64 time;
|
2017-11-25 13:56:57 +00:00
|
|
|
u64 fifo_order;
|
2014-04-09 00:11:21 +01:00
|
|
|
u64 userdata;
|
2019-11-27 02:48:56 +00:00
|
|
|
std::weak_ptr<EventType> type;
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2019-02-14 17:42:58 +00:00
|
|
|
// Sort by time, unless the times are the same, in which case sort by
|
|
|
|
// the order added to the queue
|
|
|
|
friend bool operator>(const Event& left, const Event& right) {
|
|
|
|
return std::tie(left.time, left.fifo_order) > std::tie(right.time, right.fifo_order);
|
|
|
|
}
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2019-02-14 17:42:58 +00:00
|
|
|
friend bool operator<(const Event& left, const Event& right) {
|
|
|
|
return std::tie(left.time, left.fifo_order) < std::tie(right.time, right.fifo_order);
|
|
|
|
}
|
|
|
|
};
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
CoreTiming::CoreTiming() {
|
|
|
|
clock =
|
|
|
|
Common::CreateBestMatchingClock(Core::Hardware::BASE_CLOCK_RATE, Core::Hardware::CNTFREQ);
|
|
|
|
}
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
CoreTiming::~CoreTiming() = default;
|
2015-04-28 03:46:19 +01:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::ThreadEntry(CoreTiming& instance) {
|
|
|
|
std::string name = "yuzu:HostTiming";
|
2020-02-25 15:12:46 +00:00
|
|
|
MicroProfileOnThreadCreate(name.c_str());
|
2020-02-25 02:04:12 +00:00
|
|
|
Common::SetCurrentThreadName(name.c_str());
|
|
|
|
instance.on_thread_init();
|
|
|
|
instance.ThreadLoop();
|
|
|
|
}
|
2015-04-28 03:46:19 +01:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::Initialize(std::function<void(void)>&& on_thread_init_) {
|
|
|
|
on_thread_init = std::move(on_thread_init_);
|
2017-11-25 13:56:57 +00:00
|
|
|
event_fifo_id = 0;
|
2019-02-13 02:47:13 +00:00
|
|
|
const auto empty_timed_callback = [](u64, s64) {};
|
2019-11-27 02:48:56 +00:00
|
|
|
ev_lost = CreateEvent("_lost_event", empty_timed_callback);
|
2020-02-25 02:04:12 +00:00
|
|
|
timer_thread = std::make_unique<std::thread>(ThreadEntry, std::ref(*this));
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2019-02-14 17:42:58 +00:00
|
|
|
void CoreTiming::Shutdown() {
|
2020-02-25 02:04:12 +00:00
|
|
|
paused = true;
|
|
|
|
shutting_down = true;
|
|
|
|
event.Set();
|
|
|
|
timer_thread->join();
|
2014-04-09 00:11:21 +01:00
|
|
|
ClearPendingEvents();
|
2020-02-25 02:04:12 +00:00
|
|
|
timer_thread.reset();
|
|
|
|
has_started = false;
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::Pause(bool is_paused) {
|
|
|
|
paused = is_paused;
|
|
|
|
}
|
2019-02-14 17:42:58 +00:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::SyncPause(bool is_paused) {
|
|
|
|
if (is_paused == paused && paused_set == paused) {
|
|
|
|
return;
|
2019-02-14 17:42:58 +00:00
|
|
|
}
|
2020-02-25 02:04:12 +00:00
|
|
|
Pause(is_paused);
|
|
|
|
event.Set();
|
|
|
|
while (paused_set != is_paused)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CoreTiming::IsRunning() const {
|
|
|
|
return !paused_set;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CoreTiming::HasPendingEvents() const {
|
|
|
|
return !(wait_set && event_queue.empty());
|
|
|
|
}
|
|
|
|
|
|
|
|
void CoreTiming::ScheduleEvent(s64 ns_into_future, const std::shared_ptr<EventType>& event_type,
|
|
|
|
u64 userdata) {
|
|
|
|
basic_lock.lock();
|
|
|
|
const u64 timeout = static_cast<u64>(GetGlobalTimeNs().count() + ns_into_future);
|
2019-02-14 17:42:58 +00:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
event_queue.emplace_back(Event{timeout, event_fifo_id++, userdata, event_type});
|
2019-11-27 02:48:56 +00:00
|
|
|
|
2018-08-06 02:15:13 +01:00
|
|
|
std::push_heap(event_queue.begin(), event_queue.end(), std::greater<>());
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.unlock();
|
|
|
|
event.Set();
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2019-11-27 02:48:56 +00:00
|
|
|
void CoreTiming::UnscheduleEvent(const std::shared_ptr<EventType>& event_type, u64 userdata) {
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.lock();
|
2019-02-14 17:42:58 +00:00
|
|
|
const auto itr = std::remove_if(event_queue.begin(), event_queue.end(), [&](const Event& e) {
|
2019-11-27 02:48:56 +00:00
|
|
|
return e.type.lock().get() == event_type.get() && e.userdata == userdata;
|
2017-11-25 13:56:57 +00:00
|
|
|
});
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
// Removing random items breaks the invariant so we have to re-establish it.
|
|
|
|
if (itr != event_queue.end()) {
|
|
|
|
event_queue.erase(itr, event_queue.end());
|
2018-08-06 02:15:13 +01:00
|
|
|
std::make_heap(event_queue.begin(), event_queue.end(), std::greater<>());
|
2014-04-09 00:11:21 +01:00
|
|
|
}
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.unlock();
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::AddTicks(std::size_t core_index, u64 ticks) {
|
|
|
|
ticks_count[core_index] += ticks;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CoreTiming::ResetTicks(std::size_t core_index) {
|
|
|
|
ticks_count[core_index] = 0;
|
2019-02-14 17:42:58 +00:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
u64 CoreTiming::GetCPUTicks() const {
|
|
|
|
return clock->GetCPUCycles();
|
2019-02-14 17:42:58 +00:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
u64 CoreTiming::GetClockTicks() const {
|
|
|
|
return clock->GetClockCycles();
|
2019-02-14 17:42:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void CoreTiming::ClearPendingEvents() {
|
|
|
|
event_queue.clear();
|
|
|
|
}
|
|
|
|
|
2019-11-27 02:48:56 +00:00
|
|
|
void CoreTiming::RemoveEvent(const std::shared_ptr<EventType>& event_type) {
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.lock();
|
2019-11-27 02:48:56 +00:00
|
|
|
|
|
|
|
const auto itr = std::remove_if(event_queue.begin(), event_queue.end(), [&](const Event& e) {
|
|
|
|
return e.type.lock().get() == event_type.get();
|
|
|
|
});
|
2015-01-06 01:17:49 +00:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
// Removing random items breaks the invariant so we have to re-establish it.
|
|
|
|
if (itr != event_queue.end()) {
|
|
|
|
event_queue.erase(itr, event_queue.end());
|
2018-08-06 02:15:13 +01:00
|
|
|
std::make_heap(event_queue.begin(), event_queue.end(), std::greater<>());
|
2014-04-09 00:11:21 +01:00
|
|
|
}
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.unlock();
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
std::optional<u64> CoreTiming::Advance() {
|
|
|
|
advance_lock.lock();
|
|
|
|
basic_lock.lock();
|
|
|
|
global_timer = GetGlobalTimeNs().count();
|
2017-11-25 13:56:57 +00:00
|
|
|
|
|
|
|
while (!event_queue.empty() && event_queue.front().time <= global_timer) {
|
|
|
|
Event evt = std::move(event_queue.front());
|
2018-08-06 02:15:13 +01:00
|
|
|
std::pop_heap(event_queue.begin(), event_queue.end(), std::greater<>());
|
2017-11-25 13:56:57 +00:00
|
|
|
event_queue.pop_back();
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.unlock();
|
2019-11-27 02:48:56 +00:00
|
|
|
|
|
|
|
if (auto event_type{evt.type.lock()}) {
|
|
|
|
event_type->callback(evt.userdata, global_timer - evt.time);
|
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
basic_lock.lock();
|
2015-01-06 01:17:49 +00:00
|
|
|
}
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2017-11-25 13:56:57 +00:00
|
|
|
if (!event_queue.empty()) {
|
2020-02-25 02:04:12 +00:00
|
|
|
const u64 next_time = event_queue.front().time - global_timer;
|
|
|
|
basic_lock.unlock();
|
|
|
|
advance_lock.unlock();
|
|
|
|
return next_time;
|
|
|
|
} else {
|
|
|
|
basic_lock.unlock();
|
|
|
|
advance_lock.unlock();
|
|
|
|
return std::nullopt;
|
2015-01-06 01:17:49 +00:00
|
|
|
}
|
2019-09-10 02:37:29 +01:00
|
|
|
}
|
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
void CoreTiming::ThreadLoop() {
|
|
|
|
has_started = true;
|
|
|
|
while (!shutting_down) {
|
|
|
|
while (!paused) {
|
|
|
|
paused_set = false;
|
|
|
|
const auto next_time = Advance();
|
|
|
|
if (next_time) {
|
|
|
|
std::chrono::nanoseconds next_time_ns = std::chrono::nanoseconds(*next_time);
|
|
|
|
event.WaitFor(next_time_ns);
|
|
|
|
} else {
|
|
|
|
wait_set = true;
|
|
|
|
event.Wait();
|
|
|
|
}
|
|
|
|
wait_set = false;
|
|
|
|
}
|
|
|
|
paused_set = true;
|
2019-09-10 02:37:29 +01:00
|
|
|
}
|
2017-11-25 13:56:57 +00:00
|
|
|
}
|
2013-10-02 00:10:47 +01:00
|
|
|
|
2020-02-25 02:04:12 +00:00
|
|
|
std::chrono::nanoseconds CoreTiming::GetGlobalTimeNs() const {
|
|
|
|
return clock->GetTimeNS();
|
2015-01-06 01:17:49 +00:00
|
|
|
}
|
|
|
|
|
2019-02-14 17:42:58 +00:00
|
|
|
std::chrono::microseconds CoreTiming::GetGlobalTimeUs() const {
|
2020-02-25 02:04:12 +00:00
|
|
|
return clock->GetTimeUS();
|
2013-10-02 00:10:47 +01:00
|
|
|
}
|
|
|
|
|
2019-02-12 17:32:15 +00:00
|
|
|
} // namespace Core::Timing
|