address_arbiter.cpp 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  1. // Copyright 2018 yuzu emulator team
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include <algorithm>
  5. #include <vector>
  6. #include "common/assert.h"
  7. #include "common/common_types.h"
  8. #include "core/core.h"
  9. #include "core/core_cpu.h"
  10. #include "core/hle/kernel/address_arbiter.h"
  11. #include "core/hle/kernel/errors.h"
  12. #include "core/hle/kernel/object.h"
  13. #include "core/hle/kernel/process.h"
  14. #include "core/hle/kernel/scheduler.h"
  15. #include "core/hle/kernel/thread.h"
  16. #include "core/hle/result.h"
  17. #include "core/memory.h"
  18. namespace Kernel {
  19. namespace {
  20. // Wake up num_to_wake (or all) threads in a vector.
  21. void WakeThreads(const std::vector<SharedPtr<Thread>>& waiting_threads, s32 num_to_wake) {
  22. // Only process up to 'target' threads, unless 'target' is <= 0, in which case process
  23. // them all.
  24. std::size_t last = waiting_threads.size();
  25. if (num_to_wake > 0) {
  26. last = std::min(last, static_cast<std::size_t>(num_to_wake));
  27. }
  28. // Signal the waiting threads.
  29. for (std::size_t i = 0; i < last; i++) {
  30. ASSERT(waiting_threads[i]->GetStatus() == ThreadStatus::WaitArb);
  31. waiting_threads[i]->SetWaitSynchronizationResult(RESULT_SUCCESS);
  32. waiting_threads[i]->SetArbiterWaitAddress(0);
  33. waiting_threads[i]->ResumeFromWait();
  34. }
  35. }
  36. } // Anonymous namespace
  37. AddressArbiter::AddressArbiter(Core::System& system) : system{system} {}
  38. AddressArbiter::~AddressArbiter() = default;
  39. ResultCode AddressArbiter::SignalToAddress(VAddr address, SignalType type, s32 value,
  40. s32 num_to_wake) {
  41. switch (type) {
  42. case SignalType::Signal:
  43. return SignalToAddressOnly(address, num_to_wake);
  44. case SignalType::IncrementAndSignalIfEqual:
  45. return IncrementAndSignalToAddressIfEqual(address, value, num_to_wake);
  46. case SignalType::ModifyByWaitingCountAndSignalIfEqual:
  47. return ModifyByWaitingCountAndSignalToAddressIfEqual(address, value, num_to_wake);
  48. default:
  49. return ERR_INVALID_ENUM_VALUE;
  50. }
  51. }
  52. ResultCode AddressArbiter::SignalToAddressOnly(VAddr address, s32 num_to_wake) {
  53. const std::vector<SharedPtr<Thread>> waiting_threads = GetThreadsWaitingOnAddress(address);
  54. WakeThreads(waiting_threads, num_to_wake);
  55. return RESULT_SUCCESS;
  56. }
  57. ResultCode AddressArbiter::IncrementAndSignalToAddressIfEqual(VAddr address, s32 value,
  58. s32 num_to_wake) {
  59. // Ensure that we can write to the address.
  60. if (!Memory::IsValidVirtualAddress(address)) {
  61. return ERR_INVALID_ADDRESS_STATE;
  62. }
  63. if (static_cast<s32>(Memory::Read32(address)) != value) {
  64. return ERR_INVALID_STATE;
  65. }
  66. Memory::Write32(address, static_cast<u32>(value + 1));
  67. return SignalToAddressOnly(address, num_to_wake);
  68. }
  69. ResultCode AddressArbiter::ModifyByWaitingCountAndSignalToAddressIfEqual(VAddr address, s32 value,
  70. s32 num_to_wake) {
  71. // Ensure that we can write to the address.
  72. if (!Memory::IsValidVirtualAddress(address)) {
  73. return ERR_INVALID_ADDRESS_STATE;
  74. }
  75. // Get threads waiting on the address.
  76. const std::vector<SharedPtr<Thread>> waiting_threads = GetThreadsWaitingOnAddress(address);
  77. // Determine the modified value depending on the waiting count.
  78. s32 updated_value;
  79. if (waiting_threads.empty()) {
  80. updated_value = value + 1;
  81. } else if (num_to_wake <= 0 || waiting_threads.size() <= static_cast<u32>(num_to_wake)) {
  82. updated_value = value - 1;
  83. } else {
  84. updated_value = value;
  85. }
  86. if (static_cast<s32>(Memory::Read32(address)) != value) {
  87. return ERR_INVALID_STATE;
  88. }
  89. Memory::Write32(address, static_cast<u32>(updated_value));
  90. WakeThreads(waiting_threads, num_to_wake);
  91. return RESULT_SUCCESS;
  92. }
  93. ResultCode AddressArbiter::WaitForAddress(VAddr address, ArbitrationType type, s32 value,
  94. s64 timeout_ns) {
  95. switch (type) {
  96. case ArbitrationType::WaitIfLessThan:
  97. return WaitForAddressIfLessThan(address, value, timeout_ns, false);
  98. case ArbitrationType::DecrementAndWaitIfLessThan:
  99. return WaitForAddressIfLessThan(address, value, timeout_ns, true);
  100. case ArbitrationType::WaitIfEqual:
  101. return WaitForAddressIfEqual(address, value, timeout_ns);
  102. default:
  103. return ERR_INVALID_ENUM_VALUE;
  104. }
  105. }
  106. ResultCode AddressArbiter::WaitForAddressIfLessThan(VAddr address, s32 value, s64 timeout,
  107. bool should_decrement) {
  108. // Ensure that we can read the address.
  109. if (!Memory::IsValidVirtualAddress(address)) {
  110. return ERR_INVALID_ADDRESS_STATE;
  111. }
  112. const s32 cur_value = static_cast<s32>(Memory::Read32(address));
  113. if (cur_value >= value) {
  114. return ERR_INVALID_STATE;
  115. }
  116. if (should_decrement) {
  117. Memory::Write32(address, static_cast<u32>(cur_value - 1));
  118. }
  119. // Short-circuit without rescheduling, if timeout is zero.
  120. if (timeout == 0) {
  121. return RESULT_TIMEOUT;
  122. }
  123. return WaitForAddressImpl(address, timeout);
  124. }
  125. ResultCode AddressArbiter::WaitForAddressIfEqual(VAddr address, s32 value, s64 timeout) {
  126. // Ensure that we can read the address.
  127. if (!Memory::IsValidVirtualAddress(address)) {
  128. return ERR_INVALID_ADDRESS_STATE;
  129. }
  130. // Only wait for the address if equal.
  131. if (static_cast<s32>(Memory::Read32(address)) != value) {
  132. return ERR_INVALID_STATE;
  133. }
  134. // Short-circuit without rescheduling, if timeout is zero.
  135. if (timeout == 0) {
  136. return RESULT_TIMEOUT;
  137. }
  138. return WaitForAddressImpl(address, timeout);
  139. }
  140. ResultCode AddressArbiter::WaitForAddressImpl(VAddr address, s64 timeout) {
  141. SharedPtr<Thread> current_thread = system.CurrentScheduler().GetCurrentThread();
  142. current_thread->SetArbiterWaitAddress(address);
  143. current_thread->SetStatus(ThreadStatus::WaitArb);
  144. current_thread->InvalidateWakeupCallback();
  145. current_thread->WakeAfterDelay(timeout);
  146. system.CpuCore(current_thread->GetProcessorID()).PrepareReschedule();
  147. return RESULT_TIMEOUT;
  148. }
  149. std::vector<SharedPtr<Thread>> AddressArbiter::GetThreadsWaitingOnAddress(VAddr address) const {
  150. const auto RetrieveWaitingThreads = [this](std::size_t core_index,
  151. std::vector<SharedPtr<Thread>>& waiting_threads,
  152. VAddr arb_addr) {
  153. const auto& scheduler = system.Scheduler(core_index);
  154. const auto& thread_list = scheduler.GetThreadList();
  155. for (const auto& thread : thread_list) {
  156. if (thread->GetArbiterWaitAddress() == arb_addr) {
  157. waiting_threads.push_back(thread);
  158. }
  159. }
  160. };
  161. // Retrieve all threads that are waiting for this address.
  162. std::vector<SharedPtr<Thread>> threads;
  163. RetrieveWaitingThreads(0, threads, address);
  164. RetrieveWaitingThreads(1, threads, address);
  165. RetrieveWaitingThreads(2, threads, address);
  166. RetrieveWaitingThreads(3, threads, address);
  167. // Sort them by priority, such that the highest priority ones come first.
  168. std::sort(threads.begin(), threads.end(),
  169. [](const SharedPtr<Thread>& lhs, const SharedPtr<Thread>& rhs) {
  170. return lhs->GetPriority() < rhs->GetPriority();
  171. });
  172. return threads;
  173. }
  174. } // namespace Kernel