k_address_arbiter.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335
  1. // Copyright 2021 yuzu Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include "core/arm/exclusive_monitor.h"
  5. #include "core/core.h"
  6. #include "core/hle/kernel/k_address_arbiter.h"
  7. #include "core/hle/kernel/k_scheduler.h"
  8. #include "core/hle/kernel/k_scoped_scheduler_lock_and_sleep.h"
  9. #include "core/hle/kernel/k_thread.h"
  10. #include "core/hle/kernel/k_thread_queue.h"
  11. #include "core/hle/kernel/kernel.h"
  12. #include "core/hle/kernel/svc_results.h"
  13. #include "core/hle/kernel/time_manager.h"
  14. #include "core/memory.h"
  15. namespace Kernel {
  16. KAddressArbiter::KAddressArbiter(Core::System& system_)
  17. : system{system_}, kernel{system.Kernel()} {}
  18. KAddressArbiter::~KAddressArbiter() = default;
  19. namespace {
  20. bool ReadFromUser(Core::System& system, s32* out, VAddr address) {
  21. *out = system.Memory().Read32(address);
  22. return true;
  23. }
  24. bool DecrementIfLessThan(Core::System& system, s32* out, VAddr address, s32 value) {
  25. auto& monitor = system.Monitor();
  26. const auto current_core = system.Kernel().CurrentPhysicalCoreIndex();
  27. // TODO(bunnei): We should disable interrupts here via KScopedInterruptDisable.
  28. // TODO(bunnei): We should call CanAccessAtomic(..) here.
  29. // Load the value from the address.
  30. const s32 current_value = static_cast<s32>(monitor.ExclusiveRead32(current_core, address));
  31. // Compare it to the desired one.
  32. if (current_value < value) {
  33. // If less than, we want to try to decrement.
  34. const s32 decrement_value = current_value - 1;
  35. // Decrement and try to store.
  36. if (!monitor.ExclusiveWrite32(current_core, address, static_cast<u32>(decrement_value))) {
  37. // If we failed to store, try again.
  38. DecrementIfLessThan(system, out, address, value);
  39. }
  40. } else {
  41. // Otherwise, clear our exclusive hold and finish
  42. monitor.ClearExclusive();
  43. }
  44. // We're done.
  45. *out = current_value;
  46. return true;
  47. }
  48. bool UpdateIfEqual(Core::System& system, s32* out, VAddr address, s32 value, s32 new_value) {
  49. auto& monitor = system.Monitor();
  50. const auto current_core = system.Kernel().CurrentPhysicalCoreIndex();
  51. // TODO(bunnei): We should disable interrupts here via KScopedInterruptDisable.
  52. // TODO(bunnei): We should call CanAccessAtomic(..) here.
  53. // Load the value from the address.
  54. const s32 current_value = static_cast<s32>(monitor.ExclusiveRead32(current_core, address));
  55. // Compare it to the desired one.
  56. if (current_value == value) {
  57. // If equal, we want to try to write the new value.
  58. // Try to store.
  59. if (!monitor.ExclusiveWrite32(current_core, address, static_cast<u32>(new_value))) {
  60. // If we failed to store, try again.
  61. UpdateIfEqual(system, out, address, value, new_value);
  62. }
  63. } else {
  64. // Otherwise, clear our exclusive hold and finish.
  65. monitor.ClearExclusive();
  66. }
  67. // We're done.
  68. *out = current_value;
  69. return true;
  70. }
  71. class ThreadQueueImplForKAddressArbiter final : public KThreadQueue {
  72. public:
  73. explicit ThreadQueueImplForKAddressArbiter(KernelCore& kernel_, KAddressArbiter::ThreadTree* t)
  74. : KThreadQueue(kernel_), m_tree(t) {}
  75. void CancelWait(KThread* waiting_thread, ResultCode wait_result,
  76. bool cancel_timer_task) override {
  77. // If the thread is waiting on an address arbiter, remove it from the tree.
  78. if (waiting_thread->IsWaitingForAddressArbiter()) {
  79. m_tree->erase(m_tree->iterator_to(*waiting_thread));
  80. waiting_thread->ClearAddressArbiter();
  81. }
  82. // Invoke the base cancel wait handler.
  83. KThreadQueue::CancelWait(waiting_thread, wait_result, cancel_timer_task);
  84. }
  85. private:
  86. KAddressArbiter::ThreadTree* m_tree;
  87. };
  88. } // namespace
  89. ResultCode KAddressArbiter::Signal(VAddr addr, s32 count) {
  90. // Perform signaling.
  91. s32 num_waiters{};
  92. {
  93. KScopedSchedulerLock sl(kernel);
  94. auto it = thread_tree.nfind_light({addr, -1});
  95. while ((it != thread_tree.end()) && (count <= 0 || num_waiters < count) &&
  96. (it->GetAddressArbiterKey() == addr)) {
  97. // End the thread's wait.
  98. KThread* target_thread = std::addressof(*it);
  99. target_thread->EndWait(ResultSuccess);
  100. ASSERT(target_thread->IsWaitingForAddressArbiter());
  101. target_thread->ClearAddressArbiter();
  102. it = thread_tree.erase(it);
  103. ++num_waiters;
  104. }
  105. }
  106. return ResultSuccess;
  107. }
  108. ResultCode KAddressArbiter::SignalAndIncrementIfEqual(VAddr addr, s32 value, s32 count) {
  109. // Perform signaling.
  110. s32 num_waiters{};
  111. {
  112. KScopedSchedulerLock sl(kernel);
  113. // Check the userspace value.
  114. s32 user_value{};
  115. if (!UpdateIfEqual(system, &user_value, addr, value, value + 1)) {
  116. LOG_ERROR(Kernel, "Invalid current memory!");
  117. return ResultInvalidCurrentMemory;
  118. }
  119. if (user_value != value) {
  120. return ResultInvalidState;
  121. }
  122. auto it = thread_tree.nfind_light({addr, -1});
  123. while ((it != thread_tree.end()) && (count <= 0 || num_waiters < count) &&
  124. (it->GetAddressArbiterKey() == addr)) {
  125. // End the thread's wait.
  126. KThread* target_thread = std::addressof(*it);
  127. target_thread->EndWait(ResultSuccess);
  128. ASSERT(target_thread->IsWaitingForAddressArbiter());
  129. target_thread->ClearAddressArbiter();
  130. it = thread_tree.erase(it);
  131. ++num_waiters;
  132. }
  133. }
  134. return ResultSuccess;
  135. }
  136. ResultCode KAddressArbiter::SignalAndModifyByWaitingCountIfEqual(VAddr addr, s32 value, s32 count) {
  137. // Perform signaling.
  138. s32 num_waiters{};
  139. {
  140. [[maybe_unused]] const KScopedSchedulerLock sl(kernel);
  141. auto it = thread_tree.nfind_light({addr, -1});
  142. // Determine the updated value.
  143. s32 new_value{};
  144. if (count <= 0) {
  145. if (it != thread_tree.end() && it->GetAddressArbiterKey() == addr) {
  146. new_value = value - 2;
  147. } else {
  148. new_value = value + 1;
  149. }
  150. } else {
  151. if (it != thread_tree.end() && it->GetAddressArbiterKey() == addr) {
  152. auto tmp_it = it;
  153. s32 tmp_num_waiters{};
  154. while (++tmp_it != thread_tree.end() && tmp_it->GetAddressArbiterKey() == addr) {
  155. if (tmp_num_waiters++ >= count) {
  156. break;
  157. }
  158. }
  159. if (tmp_num_waiters < count) {
  160. new_value = value - 1;
  161. } else {
  162. new_value = value;
  163. }
  164. } else {
  165. new_value = value + 1;
  166. }
  167. }
  168. // Check the userspace value.
  169. s32 user_value{};
  170. bool succeeded{};
  171. if (value != new_value) {
  172. succeeded = UpdateIfEqual(system, &user_value, addr, value, new_value);
  173. } else {
  174. succeeded = ReadFromUser(system, &user_value, addr);
  175. }
  176. if (!succeeded) {
  177. LOG_ERROR(Kernel, "Invalid current memory!");
  178. return ResultInvalidCurrentMemory;
  179. }
  180. if (user_value != value) {
  181. return ResultInvalidState;
  182. }
  183. while ((it != thread_tree.end()) && (count <= 0 || num_waiters < count) &&
  184. (it->GetAddressArbiterKey() == addr)) {
  185. // End the thread's wait.
  186. KThread* target_thread = std::addressof(*it);
  187. target_thread->EndWait(ResultSuccess);
  188. ASSERT(target_thread->IsWaitingForAddressArbiter());
  189. target_thread->ClearAddressArbiter();
  190. it = thread_tree.erase(it);
  191. ++num_waiters;
  192. }
  193. }
  194. return ResultSuccess;
  195. }
  196. ResultCode KAddressArbiter::WaitIfLessThan(VAddr addr, s32 value, bool decrement, s64 timeout) {
  197. // Prepare to wait.
  198. KThread* cur_thread = kernel.CurrentScheduler()->GetCurrentThread();
  199. ThreadQueueImplForKAddressArbiter wait_queue(kernel, std::addressof(thread_tree));
  200. {
  201. KScopedSchedulerLockAndSleep slp{kernel, cur_thread, timeout};
  202. // Check that the thread isn't terminating.
  203. if (cur_thread->IsTerminationRequested()) {
  204. slp.CancelSleep();
  205. return ResultTerminationRequested;
  206. }
  207. // Read the value from userspace.
  208. s32 user_value{};
  209. bool succeeded{};
  210. if (decrement) {
  211. succeeded = DecrementIfLessThan(system, &user_value, addr, value);
  212. } else {
  213. succeeded = ReadFromUser(system, &user_value, addr);
  214. }
  215. if (!succeeded) {
  216. slp.CancelSleep();
  217. return ResultInvalidCurrentMemory;
  218. }
  219. // Check that the value is less than the specified one.
  220. if (user_value >= value) {
  221. slp.CancelSleep();
  222. return ResultInvalidState;
  223. }
  224. // Check that the timeout is non-zero.
  225. if (timeout == 0) {
  226. slp.CancelSleep();
  227. return ResultTimedOut;
  228. }
  229. // Set the arbiter.
  230. cur_thread->SetAddressArbiter(&thread_tree, addr);
  231. thread_tree.insert(*cur_thread);
  232. // Wait for the thread to finish.
  233. cur_thread->BeginWait(std::addressof(wait_queue));
  234. cur_thread->SetWaitReasonForDebugging(ThreadWaitReasonForDebugging::Arbitration);
  235. }
  236. // Get the result.
  237. return cur_thread->GetWaitResult();
  238. }
  239. ResultCode KAddressArbiter::WaitIfEqual(VAddr addr, s32 value, s64 timeout) {
  240. // Prepare to wait.
  241. KThread* cur_thread = kernel.CurrentScheduler()->GetCurrentThread();
  242. ThreadQueueImplForKAddressArbiter wait_queue(kernel, std::addressof(thread_tree));
  243. {
  244. KScopedSchedulerLockAndSleep slp{kernel, cur_thread, timeout};
  245. // Check that the thread isn't terminating.
  246. if (cur_thread->IsTerminationRequested()) {
  247. slp.CancelSleep();
  248. return ResultTerminationRequested;
  249. }
  250. // Read the value from userspace.
  251. s32 user_value{};
  252. if (!ReadFromUser(system, &user_value, addr)) {
  253. slp.CancelSleep();
  254. return ResultInvalidCurrentMemory;
  255. }
  256. // Check that the value is equal.
  257. if (value != user_value) {
  258. slp.CancelSleep();
  259. return ResultInvalidState;
  260. }
  261. // Check that the timeout is non-zero.
  262. if (timeout == 0) {
  263. slp.CancelSleep();
  264. return ResultTimedOut;
  265. }
  266. // Set the arbiter.
  267. cur_thread->SetAddressArbiter(&thread_tree, addr);
  268. thread_tree.insert(*cur_thread);
  269. // Wait for the thread to finish.
  270. cur_thread->BeginWait(std::addressof(wait_queue));
  271. cur_thread->SetWaitReasonForDebugging(ThreadWaitReasonForDebugging::Arbitration);
  272. }
  273. // Get the result.
  274. return cur_thread->GetWaitResult();
  275. }
  276. } // namespace Kernel