2018-06-20 23:49:43 -07:00
|
|
|
// Copyright 2018 yuzu emulator team
|
|
|
|
// Licensed under GPLv2 or any later version
|
|
|
|
// Refer to the license.txt file included.
|
|
|
|
|
2018-07-31 05:06:09 -07:00
|
|
|
#include <algorithm>
|
|
|
|
#include <vector>
|
|
|
|
|
2018-06-20 23:49:43 -07:00
|
|
|
#include "common/assert.h"
|
|
|
|
#include "common/common_types.h"
|
2018-06-21 00:40:29 -07:00
|
|
|
#include "core/core.h"
|
2018-08-31 09:21:34 -07:00
|
|
|
#include "core/core_cpu.h"
|
2019-03-05 08:54:06 -08:00
|
|
|
#include "core/hle/kernel/address_arbiter.h"
|
2018-06-21 00:40:29 -07:00
|
|
|
#include "core/hle/kernel/errors.h"
|
2018-08-01 19:40:00 -07:00
|
|
|
#include "core/hle/kernel/object.h"
|
2018-06-20 23:49:43 -07:00
|
|
|
#include "core/hle/kernel/process.h"
|
2018-08-31 09:21:34 -07:00
|
|
|
#include "core/hle/kernel/scheduler.h"
|
2018-06-20 23:49:43 -07:00
|
|
|
#include "core/hle/kernel/thread.h"
|
2018-07-31 05:06:09 -07:00
|
|
|
#include "core/hle/result.h"
|
2018-06-20 23:49:43 -07:00
|
|
|
#include "core/memory.h"
|
|
|
|
|
2019-03-05 08:54:06 -08:00
|
|
|
namespace Kernel {
|
|
|
|
namespace {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Wake up num_to_wake (or all) threads in a vector.
|
2019-03-05 09:22:13 -08:00
|
|
|
void WakeThreads(const std::vector<SharedPtr<Thread>>& waiting_threads, s32 num_to_wake) {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Only process up to 'target' threads, unless 'target' is <= 0, in which case process
|
|
|
|
// them all.
|
2018-09-15 06:21:06 -07:00
|
|
|
std::size_t last = waiting_threads.size();
|
2019-03-05 09:22:13 -08:00
|
|
|
if (num_to_wake > 0) {
|
2018-06-21 20:05:34 -07:00
|
|
|
last = num_to_wake;
|
2019-03-05 09:22:13 -08:00
|
|
|
}
|
2018-06-21 20:05:34 -07:00
|
|
|
|
|
|
|
// Signal the waiting threads.
|
2018-09-15 06:21:06 -07:00
|
|
|
for (std::size_t i = 0; i < last; i++) {
|
2018-10-03 15:47:57 -07:00
|
|
|
ASSERT(waiting_threads[i]->GetStatus() == ThreadStatus::WaitArb);
|
2018-06-21 20:05:34 -07:00
|
|
|
waiting_threads[i]->SetWaitSynchronizationResult(RESULT_SUCCESS);
|
2018-10-03 15:47:57 -07:00
|
|
|
waiting_threads[i]->SetArbiterWaitAddress(0);
|
2018-06-21 20:05:34 -07:00
|
|
|
waiting_threads[i]->ResumeFromWait();
|
|
|
|
}
|
|
|
|
}
|
2019-03-05 08:54:06 -08:00
|
|
|
} // Anonymous namespace
|
2018-06-21 20:05:34 -07:00
|
|
|
|
2019-03-05 09:28:10 -08:00
|
|
|
AddressArbiter::AddressArbiter(Core::System& system) : system{system} {}
|
2019-03-05 08:54:06 -08:00
|
|
|
AddressArbiter::~AddressArbiter() = default;
|
|
|
|
|
|
|
|
ResultCode AddressArbiter::SignalToAddress(VAddr address, s32 num_to_wake) {
|
2019-03-05 09:22:13 -08:00
|
|
|
const std::vector<SharedPtr<Thread>> waiting_threads = GetThreadsWaitingOnAddress(address);
|
2018-06-21 20:05:34 -07:00
|
|
|
WakeThreads(waiting_threads, num_to_wake);
|
|
|
|
return RESULT_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2019-03-05 08:54:06 -08:00
|
|
|
ResultCode AddressArbiter::IncrementAndSignalToAddressIfEqual(VAddr address, s32 value,
|
|
|
|
s32 num_to_wake) {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Ensure that we can write to the address.
|
|
|
|
if (!Memory::IsValidVirtualAddress(address)) {
|
|
|
|
return ERR_INVALID_ADDRESS_STATE;
|
|
|
|
}
|
|
|
|
|
2019-03-05 09:22:13 -08:00
|
|
|
if (static_cast<s32>(Memory::Read32(address)) != value) {
|
2018-06-21 20:05:34 -07:00
|
|
|
return ERR_INVALID_STATE;
|
|
|
|
}
|
|
|
|
|
2019-03-05 09:22:13 -08:00
|
|
|
Memory::Write32(address, static_cast<u32>(value + 1));
|
2018-06-21 20:05:34 -07:00
|
|
|
return SignalToAddress(address, num_to_wake);
|
|
|
|
}
|
|
|
|
|
2019-03-05 08:54:06 -08:00
|
|
|
ResultCode AddressArbiter::ModifyByWaitingCountAndSignalToAddressIfEqual(VAddr address, s32 value,
|
|
|
|
s32 num_to_wake) {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Ensure that we can write to the address.
|
|
|
|
if (!Memory::IsValidVirtualAddress(address)) {
|
|
|
|
return ERR_INVALID_ADDRESS_STATE;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get threads waiting on the address.
|
2019-03-05 09:22:13 -08:00
|
|
|
const std::vector<SharedPtr<Thread>> waiting_threads = GetThreadsWaitingOnAddress(address);
|
2018-06-21 20:05:34 -07:00
|
|
|
|
|
|
|
// Determine the modified value depending on the waiting count.
|
|
|
|
s32 updated_value;
|
2018-08-05 13:24:43 -07:00
|
|
|
if (waiting_threads.empty()) {
|
2018-06-21 20:05:34 -07:00
|
|
|
updated_value = value - 1;
|
2018-07-16 19:55:53 -07:00
|
|
|
} else if (num_to_wake <= 0 || waiting_threads.size() <= static_cast<u32>(num_to_wake)) {
|
2018-06-21 20:05:34 -07:00
|
|
|
updated_value = value + 1;
|
|
|
|
} else {
|
|
|
|
updated_value = value;
|
|
|
|
}
|
|
|
|
|
2019-03-05 09:22:13 -08:00
|
|
|
if (static_cast<s32>(Memory::Read32(address)) != value) {
|
2018-06-21 20:05:34 -07:00
|
|
|
return ERR_INVALID_STATE;
|
|
|
|
}
|
|
|
|
|
2019-03-05 09:22:13 -08:00
|
|
|
Memory::Write32(address, static_cast<u32>(updated_value));
|
2018-06-21 20:05:34 -07:00
|
|
|
WakeThreads(waiting_threads, num_to_wake);
|
|
|
|
return RESULT_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2019-03-07 15:34:22 -08:00
|
|
|
ResultCode AddressArbiter::WaitForAddress(VAddr address, ArbitrationType type, s32 value,
|
|
|
|
s64 timeout_ns) {
|
|
|
|
switch (type) {
|
|
|
|
case ArbitrationType::WaitIfLessThan:
|
|
|
|
return WaitForAddressIfLessThan(address, value, timeout_ns, false);
|
|
|
|
case ArbitrationType::DecrementAndWaitIfLessThan:
|
|
|
|
return WaitForAddressIfLessThan(address, value, timeout_ns, true);
|
|
|
|
case ArbitrationType::WaitIfEqual:
|
|
|
|
return WaitForAddressIfEqual(address, value, timeout_ns);
|
|
|
|
default:
|
|
|
|
return ERR_INVALID_ENUM_VALUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-03-05 08:54:06 -08:00
|
|
|
ResultCode AddressArbiter::WaitForAddressIfLessThan(VAddr address, s32 value, s64 timeout,
|
|
|
|
bool should_decrement) {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Ensure that we can read the address.
|
|
|
|
if (!Memory::IsValidVirtualAddress(address)) {
|
|
|
|
return ERR_INVALID_ADDRESS_STATE;
|
|
|
|
}
|
|
|
|
|
2019-03-05 09:22:13 -08:00
|
|
|
const s32 cur_value = static_cast<s32>(Memory::Read32(address));
|
|
|
|
if (cur_value >= value) {
|
2018-06-21 20:05:34 -07:00
|
|
|
return ERR_INVALID_STATE;
|
|
|
|
}
|
2019-03-05 09:22:13 -08:00
|
|
|
|
|
|
|
if (should_decrement) {
|
|
|
|
Memory::Write32(address, static_cast<u32>(cur_value - 1));
|
|
|
|
}
|
|
|
|
|
2018-06-21 20:05:34 -07:00
|
|
|
// Short-circuit without rescheduling, if timeout is zero.
|
|
|
|
if (timeout == 0) {
|
|
|
|
return RESULT_TIMEOUT;
|
|
|
|
}
|
|
|
|
|
2019-03-07 15:34:22 -08:00
|
|
|
return WaitForAddressImpl(address, timeout);
|
2018-06-21 20:05:34 -07:00
|
|
|
}
|
|
|
|
|
2019-03-05 08:54:06 -08:00
|
|
|
ResultCode AddressArbiter::WaitForAddressIfEqual(VAddr address, s32 value, s64 timeout) {
|
2018-06-21 20:05:34 -07:00
|
|
|
// Ensure that we can read the address.
|
|
|
|
if (!Memory::IsValidVirtualAddress(address)) {
|
|
|
|
return ERR_INVALID_ADDRESS_STATE;
|
|
|
|
}
|
|
|
|
// Only wait for the address if equal.
|
2018-06-21 23:47:59 -07:00
|
|
|
if (static_cast<s32>(Memory::Read32(address)) != value) {
|
2018-06-21 20:05:34 -07:00
|
|
|
return ERR_INVALID_STATE;
|
|
|
|
}
|
|
|
|
// Short-circuit without rescheduling, if timeout is zero.
|
|
|
|
if (timeout == 0) {
|
|
|
|
return RESULT_TIMEOUT;
|
|
|
|
}
|
|
|
|
|
2019-03-07 15:34:22 -08:00
|
|
|
return WaitForAddressImpl(address, timeout);
|
2018-06-21 20:05:34 -07:00
|
|
|
}
|
2019-03-05 08:54:06 -08:00
|
|
|
|
2019-03-07 15:34:22 -08:00
|
|
|
ResultCode AddressArbiter::WaitForAddressImpl(VAddr address, s64 timeout) {
|
2019-03-05 09:28:10 -08:00
|
|
|
SharedPtr<Thread> current_thread = system.CurrentScheduler().GetCurrentThread();
|
2019-03-05 08:54:06 -08:00
|
|
|
current_thread->SetArbiterWaitAddress(address);
|
|
|
|
current_thread->SetStatus(ThreadStatus::WaitArb);
|
|
|
|
current_thread->InvalidateWakeupCallback();
|
|
|
|
|
|
|
|
current_thread->WakeAfterDelay(timeout);
|
|
|
|
|
2019-03-05 09:28:10 -08:00
|
|
|
system.CpuCore(current_thread->GetProcessorID()).PrepareReschedule();
|
2019-03-05 08:54:06 -08:00
|
|
|
return RESULT_TIMEOUT;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<SharedPtr<Thread>> AddressArbiter::GetThreadsWaitingOnAddress(VAddr address) const {
|
2019-03-05 09:28:10 -08:00
|
|
|
const auto RetrieveWaitingThreads = [this](std::size_t core_index,
|
|
|
|
std::vector<SharedPtr<Thread>>& waiting_threads,
|
|
|
|
VAddr arb_addr) {
|
|
|
|
const auto& scheduler = system.Scheduler(core_index);
|
2019-03-05 08:54:06 -08:00
|
|
|
const auto& thread_list = scheduler.GetThreadList();
|
|
|
|
|
|
|
|
for (const auto& thread : thread_list) {
|
2019-03-05 09:22:13 -08:00
|
|
|
if (thread->GetArbiterWaitAddress() == arb_addr) {
|
2019-03-05 08:54:06 -08:00
|
|
|
waiting_threads.push_back(thread);
|
2019-03-05 09:22:13 -08:00
|
|
|
}
|
2019-03-05 08:54:06 -08:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Retrieve all threads that are waiting for this address.
|
|
|
|
std::vector<SharedPtr<Thread>> threads;
|
|
|
|
RetrieveWaitingThreads(0, threads, address);
|
|
|
|
RetrieveWaitingThreads(1, threads, address);
|
|
|
|
RetrieveWaitingThreads(2, threads, address);
|
|
|
|
RetrieveWaitingThreads(3, threads, address);
|
|
|
|
|
|
|
|
// Sort them by priority, such that the highest priority ones come first.
|
|
|
|
std::sort(threads.begin(), threads.end(),
|
|
|
|
[](const SharedPtr<Thread>& lhs, const SharedPtr<Thread>& rhs) {
|
|
|
|
return lhs->GetPriority() < rhs->GetPriority();
|
|
|
|
});
|
|
|
|
|
|
|
|
return threads;
|
|
|
|
}
|
|
|
|
} // namespace Kernel
|