mirror of https://github.com/yuzu-emu/yuzu
338 lines
11 KiB
C++
338 lines
11 KiB
C++
// SPDX-FileCopyrightText: Copyright 2021 yuzu Emulator Project
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
#include "core/arm/exclusive_monitor.h"
|
|
#include "core/core.h"
|
|
#include "core/hle/kernel/k_address_arbiter.h"
|
|
#include "core/hle/kernel/k_scheduler.h"
|
|
#include "core/hle/kernel/k_scoped_scheduler_lock_and_sleep.h"
|
|
#include "core/hle/kernel/k_thread.h"
|
|
#include "core/hle/kernel/k_thread_queue.h"
|
|
#include "core/hle/kernel/k_typed_address.h"
|
|
#include "core/hle/kernel/kernel.h"
|
|
#include "core/hle/kernel/svc_results.h"
|
|
#include "core/memory.h"
|
|
|
|
namespace Kernel {
|
|
|
|
KAddressArbiter::KAddressArbiter(Core::System& system)
|
|
: m_system{system}, m_kernel{system.Kernel()} {}
|
|
KAddressArbiter::~KAddressArbiter() = default;
|
|
|
|
namespace {
|
|
|
|
bool ReadFromUser(KernelCore& kernel, s32* out, KProcessAddress address) {
|
|
*out = GetCurrentMemory(kernel).Read32(GetInteger(address));
|
|
return true;
|
|
}
|
|
|
|
bool DecrementIfLessThan(Core::System& system, s32* out, KProcessAddress address, s32 value) {
|
|
auto& monitor = system.Monitor();
|
|
const auto current_core = system.Kernel().CurrentPhysicalCoreIndex();
|
|
|
|
// NOTE: If scheduler lock is not held here, interrupt disable is required.
|
|
// KScopedInterruptDisable di;
|
|
|
|
// TODO(bunnei): We should call CanAccessAtomic(..) here.
|
|
|
|
// Load the value from the address.
|
|
const s32 current_value =
|
|
static_cast<s32>(monitor.ExclusiveRead32(current_core, GetInteger(address)));
|
|
|
|
// Compare it to the desired one.
|
|
if (current_value < value) {
|
|
// If less than, we want to try to decrement.
|
|
const s32 decrement_value = current_value - 1;
|
|
|
|
// Decrement and try to store.
|
|
if (!monitor.ExclusiveWrite32(current_core, GetInteger(address),
|
|
static_cast<u32>(decrement_value))) {
|
|
// If we failed to store, try again.
|
|
DecrementIfLessThan(system, out, address, value);
|
|
}
|
|
} else {
|
|
// Otherwise, clear our exclusive hold and finish
|
|
monitor.ClearExclusive(current_core);
|
|
}
|
|
|
|
// We're done.
|
|
*out = current_value;
|
|
return true;
|
|
}
|
|
|
|
bool UpdateIfEqual(Core::System& system, s32* out, KProcessAddress address, s32 value,
|
|
s32 new_value) {
|
|
auto& monitor = system.Monitor();
|
|
const auto current_core = system.Kernel().CurrentPhysicalCoreIndex();
|
|
|
|
// NOTE: If scheduler lock is not held here, interrupt disable is required.
|
|
// KScopedInterruptDisable di;
|
|
|
|
// TODO(bunnei): We should call CanAccessAtomic(..) here.
|
|
|
|
// Load the value from the address.
|
|
const s32 current_value =
|
|
static_cast<s32>(monitor.ExclusiveRead32(current_core, GetInteger(address)));
|
|
|
|
// Compare it to the desired one.
|
|
if (current_value == value) {
|
|
// If equal, we want to try to write the new value.
|
|
|
|
// Try to store.
|
|
if (!monitor.ExclusiveWrite32(current_core, GetInteger(address),
|
|
static_cast<u32>(new_value))) {
|
|
// If we failed to store, try again.
|
|
UpdateIfEqual(system, out, address, value, new_value);
|
|
}
|
|
} else {
|
|
// Otherwise, clear our exclusive hold and finish.
|
|
monitor.ClearExclusive(current_core);
|
|
}
|
|
|
|
// We're done.
|
|
*out = current_value;
|
|
return true;
|
|
}
|
|
|
|
class ThreadQueueImplForKAddressArbiter final : public KThreadQueue {
|
|
public:
|
|
explicit ThreadQueueImplForKAddressArbiter(KernelCore& kernel, KAddressArbiter::ThreadTree* t)
|
|
: KThreadQueue(kernel), m_tree(t) {}
|
|
|
|
void CancelWait(KThread* waiting_thread, Result wait_result, bool cancel_timer_task) override {
|
|
// If the thread is waiting on an address arbiter, remove it from the tree.
|
|
if (waiting_thread->IsWaitingForAddressArbiter()) {
|
|
m_tree->erase(m_tree->iterator_to(*waiting_thread));
|
|
waiting_thread->ClearAddressArbiter();
|
|
}
|
|
|
|
// Invoke the base cancel wait handler.
|
|
KThreadQueue::CancelWait(waiting_thread, wait_result, cancel_timer_task);
|
|
}
|
|
|
|
private:
|
|
KAddressArbiter::ThreadTree* m_tree{};
|
|
};
|
|
|
|
} // namespace
|
|
|
|
Result KAddressArbiter::Signal(uint64_t addr, s32 count) {
|
|
// Perform signaling.
|
|
s32 num_waiters{};
|
|
{
|
|
KScopedSchedulerLock sl(m_kernel);
|
|
|
|
auto it = m_tree.nfind_key({addr, -1});
|
|
while ((it != m_tree.end()) && (count <= 0 || num_waiters < count) &&
|
|
(it->GetAddressArbiterKey() == addr)) {
|
|
// End the thread's wait.
|
|
KThread* target_thread = std::addressof(*it);
|
|
target_thread->EndWait(ResultSuccess);
|
|
|
|
ASSERT(target_thread->IsWaitingForAddressArbiter());
|
|
target_thread->ClearAddressArbiter();
|
|
|
|
it = m_tree.erase(it);
|
|
++num_waiters;
|
|
}
|
|
}
|
|
R_SUCCEED();
|
|
}
|
|
|
|
Result KAddressArbiter::SignalAndIncrementIfEqual(uint64_t addr, s32 value, s32 count) {
|
|
// Perform signaling.
|
|
s32 num_waiters{};
|
|
{
|
|
KScopedSchedulerLock sl(m_kernel);
|
|
|
|
// Check the userspace value.
|
|
s32 user_value{};
|
|
R_UNLESS(UpdateIfEqual(m_system, std::addressof(user_value), addr, value, value + 1),
|
|
ResultInvalidCurrentMemory);
|
|
R_UNLESS(user_value == value, ResultInvalidState);
|
|
|
|
auto it = m_tree.nfind_key({addr, -1});
|
|
while ((it != m_tree.end()) && (count <= 0 || num_waiters < count) &&
|
|
(it->GetAddressArbiterKey() == addr)) {
|
|
// End the thread's wait.
|
|
KThread* target_thread = std::addressof(*it);
|
|
target_thread->EndWait(ResultSuccess);
|
|
|
|
ASSERT(target_thread->IsWaitingForAddressArbiter());
|
|
target_thread->ClearAddressArbiter();
|
|
|
|
it = m_tree.erase(it);
|
|
++num_waiters;
|
|
}
|
|
}
|
|
R_SUCCEED();
|
|
}
|
|
|
|
Result KAddressArbiter::SignalAndModifyByWaitingCountIfEqual(uint64_t addr, s32 value, s32 count) {
|
|
// Perform signaling.
|
|
s32 num_waiters{};
|
|
{
|
|
KScopedSchedulerLock sl(m_kernel);
|
|
|
|
auto it = m_tree.nfind_key({addr, -1});
|
|
// Determine the updated value.
|
|
s32 new_value{};
|
|
if (count <= 0) {
|
|
if (it != m_tree.end() && it->GetAddressArbiterKey() == addr) {
|
|
new_value = value - 2;
|
|
} else {
|
|
new_value = value + 1;
|
|
}
|
|
} else {
|
|
if (it != m_tree.end() && it->GetAddressArbiterKey() == addr) {
|
|
auto tmp_it = it;
|
|
s32 tmp_num_waiters{};
|
|
while (++tmp_it != m_tree.end() && tmp_it->GetAddressArbiterKey() == addr) {
|
|
if (tmp_num_waiters++ >= count) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (tmp_num_waiters < count) {
|
|
new_value = value - 1;
|
|
} else {
|
|
new_value = value;
|
|
}
|
|
} else {
|
|
new_value = value + 1;
|
|
}
|
|
}
|
|
|
|
// Check the userspace value.
|
|
s32 user_value{};
|
|
bool succeeded{};
|
|
if (value != new_value) {
|
|
succeeded = UpdateIfEqual(m_system, std::addressof(user_value), addr, value, new_value);
|
|
} else {
|
|
succeeded = ReadFromUser(m_kernel, std::addressof(user_value), addr);
|
|
}
|
|
|
|
R_UNLESS(succeeded, ResultInvalidCurrentMemory);
|
|
R_UNLESS(user_value == value, ResultInvalidState);
|
|
|
|
while ((it != m_tree.end()) && (count <= 0 || num_waiters < count) &&
|
|
(it->GetAddressArbiterKey() == addr)) {
|
|
// End the thread's wait.
|
|
KThread* target_thread = std::addressof(*it);
|
|
target_thread->EndWait(ResultSuccess);
|
|
|
|
ASSERT(target_thread->IsWaitingForAddressArbiter());
|
|
target_thread->ClearAddressArbiter();
|
|
|
|
it = m_tree.erase(it);
|
|
++num_waiters;
|
|
}
|
|
}
|
|
R_SUCCEED();
|
|
}
|
|
|
|
Result KAddressArbiter::WaitIfLessThan(uint64_t addr, s32 value, bool decrement, s64 timeout) {
|
|
// Prepare to wait.
|
|
KThread* cur_thread = GetCurrentThreadPointer(m_kernel);
|
|
KHardwareTimer* timer{};
|
|
ThreadQueueImplForKAddressArbiter wait_queue(m_kernel, std::addressof(m_tree));
|
|
|
|
{
|
|
KScopedSchedulerLockAndSleep slp{m_kernel, std::addressof(timer), cur_thread, timeout};
|
|
|
|
// Check that the thread isn't terminating.
|
|
if (cur_thread->IsTerminationRequested()) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultTerminationRequested);
|
|
}
|
|
|
|
// Read the value from userspace.
|
|
s32 user_value{};
|
|
bool succeeded{};
|
|
if (decrement) {
|
|
succeeded = DecrementIfLessThan(m_system, std::addressof(user_value), addr, value);
|
|
} else {
|
|
succeeded = ReadFromUser(m_kernel, std::addressof(user_value), addr);
|
|
}
|
|
|
|
if (!succeeded) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultInvalidCurrentMemory);
|
|
}
|
|
|
|
// Check that the value is less than the specified one.
|
|
if (user_value >= value) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultInvalidState);
|
|
}
|
|
|
|
// Check that the timeout is non-zero.
|
|
if (timeout == 0) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultTimedOut);
|
|
}
|
|
|
|
// Set the arbiter.
|
|
cur_thread->SetAddressArbiter(std::addressof(m_tree), addr);
|
|
m_tree.insert(*cur_thread);
|
|
|
|
// Wait for the thread to finish.
|
|
wait_queue.SetHardwareTimer(timer);
|
|
cur_thread->BeginWait(std::addressof(wait_queue));
|
|
cur_thread->SetWaitReasonForDebugging(ThreadWaitReasonForDebugging::Arbitration);
|
|
}
|
|
|
|
// Get the result.
|
|
return cur_thread->GetWaitResult();
|
|
}
|
|
|
|
Result KAddressArbiter::WaitIfEqual(uint64_t addr, s32 value, s64 timeout) {
|
|
// Prepare to wait.
|
|
KThread* cur_thread = GetCurrentThreadPointer(m_kernel);
|
|
KHardwareTimer* timer{};
|
|
ThreadQueueImplForKAddressArbiter wait_queue(m_kernel, std::addressof(m_tree));
|
|
|
|
{
|
|
KScopedSchedulerLockAndSleep slp{m_kernel, std::addressof(timer), cur_thread, timeout};
|
|
|
|
// Check that the thread isn't terminating.
|
|
if (cur_thread->IsTerminationRequested()) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultTerminationRequested);
|
|
}
|
|
|
|
// Read the value from userspace.
|
|
s32 user_value{};
|
|
if (!ReadFromUser(m_kernel, std::addressof(user_value), addr)) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultInvalidCurrentMemory);
|
|
}
|
|
|
|
// Check that the value is equal.
|
|
if (value != user_value) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultInvalidState);
|
|
}
|
|
|
|
// Check that the timeout is non-zero.
|
|
if (timeout == 0) {
|
|
slp.CancelSleep();
|
|
R_THROW(ResultTimedOut);
|
|
}
|
|
|
|
// Set the arbiter.
|
|
cur_thread->SetAddressArbiter(std::addressof(m_tree), addr);
|
|
m_tree.insert(*cur_thread);
|
|
|
|
// Wait for the thread to finish.
|
|
wait_queue.SetHardwareTimer(timer);
|
|
cur_thread->BeginWait(std::addressof(wait_queue));
|
|
cur_thread->SetWaitReasonForDebugging(ThreadWaitReasonForDebugging::Arbitration);
|
|
}
|
|
|
|
// Get the result.
|
|
return cur_thread->GetWaitResult();
|
|
}
|
|
|
|
} // namespace Kernel
|