// Copyright 2020 yuzu Emulator Project // Licensed under GPLv2 or any later version // Refer to the license.txt file included. #include #include #include #include #include "common/assert.h" #include "common/microprofile.h" #include "core/core_timing.h" #include "core/core_timing_util.h" namespace Core::Timing { constexpr u64 MAX_SLICE_LENGTH = 4000; std::shared_ptr CreateEvent(std::string name, TimedCallback&& callback) { return std::make_shared(std::move(callback), std::move(name)); } struct CoreTiming::Event { u64 time; u64 fifo_order; u64 userdata; std::weak_ptr type; // 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); } friend bool operator<(const Event& left, const Event& right) { return std::tie(left.time, left.fifo_order) < std::tie(right.time, right.fifo_order); } }; CoreTiming::CoreTiming() { clock = Common::CreateBestMatchingClock(Core::Hardware::BASE_CLOCK_RATE, Core::Hardware::CNTFREQ); } CoreTiming::~CoreTiming() = default; void CoreTiming::ThreadEntry(CoreTiming& instance) { std::string name = "yuzu:HostTiming"; MicroProfileOnThreadCreate(name.c_str()); Common::SetCurrentThreadName(name.c_str()); instance.on_thread_init(); instance.ThreadLoop(); } void CoreTiming::Initialize(std::function&& on_thread_init_) { on_thread_init = std::move(on_thread_init_); event_fifo_id = 0; ticks = 0; const auto empty_timed_callback = [](u64, s64) {}; ev_lost = CreateEvent("_lost_event", empty_timed_callback); if (is_multicore) { timer_thread = std::make_unique(ThreadEntry, std::ref(*this)); } } void CoreTiming::Shutdown() { paused = true; shutting_down = true; pause_event.Set(); event.Set(); if (timer_thread) { timer_thread->join(); } ClearPendingEvents(); timer_thread.reset(); has_started = false; } void CoreTiming::Pause(bool is_paused) { paused = is_paused; } void CoreTiming::SyncPause(bool is_paused) { if (is_paused == paused && paused_set == paused) { return; } Pause(is_paused); if (timer_thread) { if (!is_paused) { pause_event.Set(); } 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& event_type, u64 userdata) { basic_lock.lock(); const u64 timeout = static_cast(GetGlobalTimeNs().count() + ns_into_future); event_queue.emplace_back(Event{timeout, event_fifo_id++, userdata, event_type}); std::push_heap(event_queue.begin(), event_queue.end(), std::greater<>()); basic_lock.unlock(); event.Set(); } void CoreTiming::UnscheduleEvent(const std::shared_ptr& event_type, u64 userdata) { basic_lock.lock(); const auto itr = std::remove_if(event_queue.begin(), event_queue.end(), [&](const Event& e) { return e.type.lock().get() == event_type.get() && e.userdata == userdata; }); // 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()); std::make_heap(event_queue.begin(), event_queue.end(), std::greater<>()); } basic_lock.unlock(); } void CoreTiming::AddTicks(u64 ticks) { this->ticks += ticks; downcount -= ticks; } void CoreTiming::Idle() { if (!event_queue.empty()) { u64 next_event_time = event_queue.front().time; ticks = nsToCycles(std::chrono::nanoseconds(next_event_time)) + 10U; return; } ticks += 1000U; } void CoreTiming::ResetTicks() { downcount = MAX_SLICE_LENGTH; } u64 CoreTiming::GetCPUTicks() const { if (is_multicore) { return clock->GetCPUCycles(); } return ticks; } u64 CoreTiming::GetClockTicks() const { if (is_multicore) { return clock->GetClockCycles(); } return CpuCyclesToClockCycles(ticks); } void CoreTiming::ClearPendingEvents() { event_queue.clear(); } void CoreTiming::RemoveEvent(const std::shared_ptr& event_type) { basic_lock.lock(); const auto itr = std::remove_if(event_queue.begin(), event_queue.end(), [&](const Event& e) { return e.type.lock().get() == event_type.get(); }); // 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()); std::make_heap(event_queue.begin(), event_queue.end(), std::greater<>()); } basic_lock.unlock(); } std::optional CoreTiming::Advance() { advance_lock.lock(); basic_lock.lock(); global_timer = GetGlobalTimeNs().count(); while (!event_queue.empty() && event_queue.front().time <= global_timer) { Event evt = std::move(event_queue.front()); std::pop_heap(event_queue.begin(), event_queue.end(), std::greater<>()); event_queue.pop_back(); basic_lock.unlock(); if (auto event_type{evt.type.lock()}) { event_type->callback(evt.userdata, global_timer - evt.time); } basic_lock.lock(); global_timer = GetGlobalTimeNs().count(); } if (!event_queue.empty()) { const s64 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; } } void CoreTiming::ThreadLoop() { has_started = true; while (!shutting_down) { while (!paused) { paused_set = false; const auto next_time = Advance(); if (next_time) { if (*next_time > 0) { 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; clock->Pause(true); pause_event.Wait(); clock->Pause(false); } } std::chrono::nanoseconds CoreTiming::GetGlobalTimeNs() const { if (is_multicore) { return clock->GetTimeNS(); } return CyclesToNs(ticks); } std::chrono::microseconds CoreTiming::GetGlobalTimeUs() const { if (is_multicore) { return clock->GetTimeUS(); } return CyclesToUs(ticks); } } // namespace Core::Timing