2018-02-18 20:58:40 +01:00
|
|
|
// Copyright 2018 yuzu emulator team
|
|
|
|
// Licensed under GPLv2 or any later version
|
|
|
|
// Refer to the license.txt file included.
|
|
|
|
|
2018-07-31 14:06:09 +02:00
|
|
|
#include <algorithm>
|
2018-07-19 01:02:47 +02:00
|
|
|
#include <utility>
|
|
|
|
|
2018-07-31 14:06:09 +02:00
|
|
|
#include "common/assert.h"
|
|
|
|
#include "common/logging/log.h"
|
|
|
|
#include "core/arm/arm_interface.h"
|
2018-03-13 22:49:59 +01:00
|
|
|
#include "core/core.h"
|
2018-11-22 06:33:53 +01:00
|
|
|
#include "core/core_cpu.h"
|
2018-10-26 00:42:50 +02:00
|
|
|
#include "core/core_timing.h"
|
2018-10-10 06:42:10 +02:00
|
|
|
#include "core/hle/kernel/kernel.h"
|
2018-02-18 20:58:40 +01:00
|
|
|
#include "core/hle/kernel/process.h"
|
|
|
|
#include "core/hle/kernel/scheduler.h"
|
|
|
|
|
|
|
|
namespace Kernel {
|
|
|
|
|
2018-05-08 04:12:45 +02:00
|
|
|
std::mutex Scheduler::scheduler_mutex;
|
|
|
|
|
2018-09-25 22:00:14 +02:00
|
|
|
Scheduler::Scheduler(Core::ARM_Interface& cpu_core) : cpu_core(cpu_core) {}
|
2018-02-18 20:58:40 +01:00
|
|
|
|
|
|
|
Scheduler::~Scheduler() {
|
|
|
|
for (auto& thread : thread_list) {
|
|
|
|
thread->Stop();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-08-12 18:55:56 +02:00
|
|
|
bool Scheduler::HaveReadyThreads() const {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
2018-02-18 20:58:40 +01:00
|
|
|
return ready_queue.get_first() != nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
Thread* Scheduler::GetCurrentThread() const {
|
|
|
|
return current_thread.get();
|
|
|
|
}
|
|
|
|
|
2018-10-26 00:42:50 +02:00
|
|
|
u64 Scheduler::GetLastContextSwitchTicks() const {
|
|
|
|
return last_context_switch_time;
|
|
|
|
}
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
Thread* Scheduler::PopNextReadyThread() {
|
|
|
|
Thread* next = nullptr;
|
|
|
|
Thread* thread = GetCurrentThread();
|
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
if (thread && thread->GetStatus() == ThreadStatus::Running) {
|
2018-02-18 20:58:40 +01:00
|
|
|
// We have to do better than the current thread.
|
|
|
|
// This call returns null when that's not possible.
|
2018-10-04 00:47:57 +02:00
|
|
|
next = ready_queue.pop_first_better(thread->GetPriority());
|
2018-02-18 20:58:40 +01:00
|
|
|
if (!next) {
|
|
|
|
// Otherwise just keep going with the current thread
|
|
|
|
next = thread;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
next = ready_queue.pop_first();
|
|
|
|
}
|
|
|
|
|
|
|
|
return next;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::SwitchContext(Thread* new_thread) {
|
2018-10-26 00:42:50 +02:00
|
|
|
Thread* const previous_thread = GetCurrentThread();
|
|
|
|
Process* const previous_process = Core::CurrentProcess();
|
|
|
|
|
|
|
|
UpdateLastContextSwitchTime(previous_thread, previous_process);
|
2018-02-18 20:58:40 +01:00
|
|
|
|
|
|
|
// Save context for previous thread
|
|
|
|
if (previous_thread) {
|
2018-10-04 00:47:57 +02:00
|
|
|
cpu_core.SaveContext(previous_thread->GetContext());
|
2018-07-21 02:57:45 +02:00
|
|
|
// Save the TPIDR_EL0 system register in case it was modified.
|
2018-10-04 00:47:57 +02:00
|
|
|
previous_thread->SetTPIDR_EL0(cpu_core.GetTPIDR_EL0());
|
2018-02-18 20:58:40 +01:00
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
if (previous_thread->GetStatus() == ThreadStatus::Running) {
|
2018-02-18 20:58:40 +01:00
|
|
|
// This is only the case when a reschedule is triggered without the current thread
|
|
|
|
// yielding execution (i.e. an event triggered, system core time-sliced, etc)
|
2018-10-04 00:47:57 +02:00
|
|
|
ready_queue.push_front(previous_thread->GetPriority(), previous_thread);
|
|
|
|
previous_thread->SetStatus(ThreadStatus::Ready);
|
2018-02-18 20:58:40 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Load context of new thread
|
|
|
|
if (new_thread) {
|
2018-10-04 00:47:57 +02:00
|
|
|
ASSERT_MSG(new_thread->GetStatus() == ThreadStatus::Ready,
|
2018-02-18 20:58:40 +01:00
|
|
|
"Thread must be ready to become running.");
|
|
|
|
|
|
|
|
// Cancel any outstanding wakeup events for this thread
|
|
|
|
new_thread->CancelWakeupTimer();
|
|
|
|
|
|
|
|
current_thread = new_thread;
|
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
ready_queue.remove(new_thread->GetPriority(), new_thread);
|
|
|
|
new_thread->SetStatus(ThreadStatus::Running);
|
2018-02-18 20:58:40 +01:00
|
|
|
|
2018-10-10 06:42:10 +02:00
|
|
|
auto* const thread_owner_process = current_thread->GetOwnerProcess();
|
2018-10-04 00:47:57 +02:00
|
|
|
if (previous_process != thread_owner_process) {
|
2018-10-10 06:42:10 +02:00
|
|
|
Core::System::GetInstance().Kernel().MakeCurrentProcess(thread_owner_process);
|
2018-09-30 00:47:00 +02:00
|
|
|
SetCurrentPageTable(&Core::CurrentProcess()->VMManager().page_table);
|
2018-02-18 20:58:40 +01:00
|
|
|
}
|
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
cpu_core.LoadContext(new_thread->GetContext());
|
2018-09-25 22:00:14 +02:00
|
|
|
cpu_core.SetTlsAddress(new_thread->GetTLSAddress());
|
|
|
|
cpu_core.SetTPIDR_EL0(new_thread->GetTPIDR_EL0());
|
|
|
|
cpu_core.ClearExclusiveState();
|
2018-02-18 20:58:40 +01:00
|
|
|
} else {
|
|
|
|
current_thread = nullptr;
|
|
|
|
// Note: We do not reset the current process and current page table when idling because
|
|
|
|
// technically we haven't changed processes, our threads are just paused.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-26 00:42:50 +02:00
|
|
|
void Scheduler::UpdateLastContextSwitchTime(Thread* thread, Process* process) {
|
|
|
|
const u64 prev_switch_ticks = last_context_switch_time;
|
|
|
|
const u64 most_recent_switch_ticks = CoreTiming::GetTicks();
|
|
|
|
const u64 update_ticks = most_recent_switch_ticks - prev_switch_ticks;
|
|
|
|
|
|
|
|
if (thread != nullptr) {
|
|
|
|
thread->UpdateCPUTimeTicks(update_ticks);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (process != nullptr) {
|
|
|
|
process->UpdateCPUTimeTicks(update_ticks);
|
|
|
|
}
|
|
|
|
|
|
|
|
last_context_switch_time = most_recent_switch_ticks;
|
|
|
|
}
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
void Scheduler::Reschedule() {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
Thread* cur = GetCurrentThread();
|
|
|
|
Thread* next = PopNextReadyThread();
|
|
|
|
|
|
|
|
if (cur && next) {
|
2018-07-02 18:13:26 +02:00
|
|
|
LOG_TRACE(Kernel, "context switch {} -> {}", cur->GetObjectId(), next->GetObjectId());
|
2018-02-18 20:58:40 +01:00
|
|
|
} else if (cur) {
|
2018-07-02 18:13:26 +02:00
|
|
|
LOG_TRACE(Kernel, "context switch {} -> idle", cur->GetObjectId());
|
2018-02-18 20:58:40 +01:00
|
|
|
} else if (next) {
|
2018-07-02 18:13:26 +02:00
|
|
|
LOG_TRACE(Kernel, "context switch idle -> {}", next->GetObjectId());
|
2018-02-18 20:58:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
SwitchContext(next);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::AddThread(SharedPtr<Thread> thread, u32 priority) {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-07-19 01:02:47 +02:00
|
|
|
thread_list.push_back(std::move(thread));
|
2018-02-18 20:58:40 +01:00
|
|
|
ready_queue.prepare(priority);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::RemoveThread(Thread* thread) {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
thread_list.erase(std::remove(thread_list.begin(), thread_list.end(), thread),
|
|
|
|
thread_list.end());
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::ScheduleThread(Thread* thread, u32 priority) {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
ASSERT(thread->GetStatus() == ThreadStatus::Ready);
|
2018-02-18 20:58:40 +01:00
|
|
|
ready_queue.push_back(priority, thread);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::UnscheduleThread(Thread* thread, u32 priority) {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-10-04 00:47:57 +02:00
|
|
|
ASSERT(thread->GetStatus() == ThreadStatus::Ready);
|
2018-02-18 20:58:40 +01:00
|
|
|
ready_queue.remove(priority, thread);
|
|
|
|
}
|
|
|
|
|
2018-11-22 06:33:53 +01:00
|
|
|
void Scheduler::MoveThreadToBackOfPriorityQueue(Thread* thread, u32 priority) {
|
2018-11-19 05:44:19 +01:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
|
|
|
// Thread is not in queue
|
|
|
|
ASSERT(ready_queue.contains(thread) != -1);
|
|
|
|
|
|
|
|
ready_queue.remove(priority, thread);
|
|
|
|
ready_queue.push_back(priority, thread);
|
|
|
|
}
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
void Scheduler::SetThreadPriority(Thread* thread, u32 priority) {
|
2018-05-08 04:12:45 +02:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
// If thread was ready, adjust queues
|
2018-10-04 00:47:57 +02:00
|
|
|
if (thread->GetStatus() == ThreadStatus::Ready)
|
|
|
|
ready_queue.move(thread, thread->GetPriority(), priority);
|
2018-02-18 20:58:40 +01:00
|
|
|
else
|
|
|
|
ready_queue.prepare(priority);
|
|
|
|
}
|
|
|
|
|
2018-11-22 06:33:53 +01:00
|
|
|
Thread* Scheduler::GetNextSuggestedThread(u32 core) const {
|
2018-11-19 05:44:19 +01:00
|
|
|
std::lock_guard<std::mutex> lock(scheduler_mutex);
|
|
|
|
|
2018-11-22 06:33:53 +01:00
|
|
|
const u32 mask = 1U << core;
|
2018-11-19 05:44:19 +01:00
|
|
|
return ready_queue.get_first_filter(
|
2018-11-22 06:33:53 +01:00
|
|
|
[mask](Thread const* thread) { return (thread->GetAffinityMask() & mask) != 0; });
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::YieldWithoutLoadBalancing(Thread* thread) {
|
|
|
|
ASSERT(thread != nullptr);
|
|
|
|
// Avoid yielding if the thread isn't even running.
|
|
|
|
ASSERT(thread->GetStatus() == ThreadStatus::Running);
|
|
|
|
|
|
|
|
// Sanity check that the priority is valid
|
|
|
|
ASSERT(thread->GetPriority() < THREADPRIO_COUNT);
|
|
|
|
|
|
|
|
// Yield this thread
|
|
|
|
Reschedule();
|
2018-12-02 06:44:40 +01:00
|
|
|
MoveThreadToBackOfPriorityQueue(thread, thread->GetPriority());
|
2018-11-22 06:33:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::YieldWithLoadBalancing(Thread* thread) {
|
|
|
|
ASSERT(thread != nullptr);
|
|
|
|
const auto priority = thread->GetPriority();
|
|
|
|
const auto core = static_cast<u32>(thread->GetProcessorID());
|
|
|
|
|
|
|
|
// Avoid yielding if the thread isn't even running.
|
|
|
|
ASSERT(thread->GetStatus() == ThreadStatus::Running);
|
|
|
|
|
|
|
|
// Sanity check that the priority is valid
|
|
|
|
ASSERT(priority < THREADPRIO_COUNT);
|
|
|
|
|
|
|
|
// Reschedule thread to end of queue.
|
2018-12-02 06:44:40 +01:00
|
|
|
Reschedule();
|
2018-11-22 06:33:53 +01:00
|
|
|
MoveThreadToBackOfPriorityQueue(thread, priority);
|
|
|
|
|
|
|
|
Thread* suggested_thread = nullptr;
|
|
|
|
|
|
|
|
// Search through all of the cpu cores (except this one) for a suggested thread.
|
|
|
|
// Take the first non-nullptr one
|
|
|
|
for (unsigned cur_core = 0; cur_core < Core::NUM_CPU_CORES; ++cur_core) {
|
|
|
|
if (cur_core == core)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
const auto res =
|
|
|
|
Core::System::GetInstance().CpuCore(cur_core).Scheduler().GetNextSuggestedThread(core);
|
|
|
|
if (res != nullptr) {
|
|
|
|
suggested_thread = res;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If a suggested thread was found, queue that for this core
|
|
|
|
if (suggested_thread != nullptr)
|
|
|
|
suggested_thread->ChangeCore(core, suggested_thread->GetAffinityMask());
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::YieldAndWaitForLoadBalancing(Thread* thread) {
|
|
|
|
UNIMPLEMENTED_MSG("Wait for load balancing thread yield type is not implemented!");
|
2018-11-19 05:44:19 +01:00
|
|
|
}
|
|
|
|
|
2018-02-18 20:58:40 +01:00
|
|
|
} // namespace Kernel
|