FutexQueue.cpp 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. /*
  2. * Copyright (c) 2020, the SerenityOS developers.
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <Kernel/Debug.h>
  7. #include <Kernel/FutexQueue.h>
  8. #include <Kernel/Thread.h>
  9. namespace Kernel {
  10. FutexQueue::FutexQueue() = default;
  11. FutexQueue::~FutexQueue() = default;
  12. bool FutexQueue::should_add_blocker(Thread::Blocker& b, void*)
  13. {
  14. VERIFY(m_lock.is_locked());
  15. VERIFY(b.blocker_type() == Thread::Blocker::Type::Futex);
  16. VERIFY(m_imminent_waits > 0);
  17. m_imminent_waits--;
  18. if (m_was_removed) {
  19. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: should not block thread {}: was removed", this, b.thread());
  20. return false;
  21. }
  22. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: should block thread {}", this, b.thread());
  23. return true;
  24. }
  25. u32 FutexQueue::wake_n_requeue(u32 wake_count, const Function<FutexQueue*()>& get_target_queue, u32 requeue_count, bool& is_empty, bool& is_empty_target)
  26. {
  27. is_empty_target = false;
  28. SpinlockLocker lock(m_lock);
  29. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n_requeue({}, {})", this, wake_count, requeue_count);
  30. u32 did_wake = 0, did_requeue = 0;
  31. unblock_all_blockers_whose_conditions_are_met_locked([&](Thread::Blocker& b, void*, bool& stop_iterating) {
  32. VERIFY(b.blocker_type() == Thread::Blocker::Type::Futex);
  33. auto& blocker = static_cast<Thread::FutexBlocker&>(b);
  34. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n_requeue unblocking {}", this, blocker.thread());
  35. VERIFY(did_wake < wake_count);
  36. if (blocker.unblock()) {
  37. if (++did_wake >= wake_count)
  38. stop_iterating = true;
  39. return true;
  40. }
  41. return false;
  42. });
  43. is_empty = is_empty_and_no_imminent_waits_locked();
  44. if (requeue_count > 0) {
  45. auto blockers_to_requeue = do_take_blockers(requeue_count);
  46. if (!blockers_to_requeue.is_empty()) {
  47. if (auto* target_futex_queue = get_target_queue()) {
  48. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n_requeue requeueing {} blockers to {}", this, blockers_to_requeue.size(), target_futex_queue);
  49. // While still holding m_lock, notify each blocker
  50. for (auto& info : blockers_to_requeue) {
  51. VERIFY(info.blocker->blocker_type() == Thread::Blocker::Type::Futex);
  52. auto& blocker = *static_cast<Thread::FutexBlocker*>(info.blocker);
  53. blocker.begin_requeue();
  54. }
  55. lock.unlock();
  56. did_requeue = blockers_to_requeue.size();
  57. SpinlockLocker target_lock(target_futex_queue->m_lock);
  58. // Now that we have the lock of the target, append the blockers
  59. // and notify them that they completed the move
  60. for (auto& info : blockers_to_requeue) {
  61. VERIFY(info.blocker->blocker_type() == Thread::Blocker::Type::Futex);
  62. auto& blocker = *static_cast<Thread::FutexBlocker*>(info.blocker);
  63. blocker.finish_requeue(*target_futex_queue);
  64. }
  65. target_futex_queue->do_append_blockers(move(blockers_to_requeue));
  66. is_empty_target = target_futex_queue->is_empty_and_no_imminent_waits_locked();
  67. } else {
  68. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n_requeue could not get target queue to requeue {} blockers", this, blockers_to_requeue.size());
  69. do_append_blockers(move(blockers_to_requeue));
  70. }
  71. }
  72. }
  73. return did_wake + did_requeue;
  74. }
  75. u32 FutexQueue::wake_n(u32 wake_count, const Optional<u32>& bitset, bool& is_empty)
  76. {
  77. if (wake_count == 0) {
  78. is_empty = false;
  79. return 0; // should we assert instead?
  80. }
  81. SpinlockLocker lock(m_lock);
  82. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n({})", this, wake_count);
  83. u32 did_wake = 0;
  84. unblock_all_blockers_whose_conditions_are_met_locked([&](Thread::Blocker& b, void*, bool& stop_iterating) {
  85. VERIFY(b.blocker_type() == Thread::Blocker::Type::Futex);
  86. auto& blocker = static_cast<Thread::FutexBlocker&>(b);
  87. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_n unblocking {}", this, blocker.thread());
  88. VERIFY(did_wake < wake_count);
  89. if (bitset.has_value() ? blocker.unblock_bitset(bitset.value()) : blocker.unblock()) {
  90. if (++did_wake >= wake_count)
  91. stop_iterating = true;
  92. return true;
  93. }
  94. return false;
  95. });
  96. is_empty = is_empty_and_no_imminent_waits_locked();
  97. return did_wake;
  98. }
  99. u32 FutexQueue::wake_all(bool& is_empty)
  100. {
  101. SpinlockLocker lock(m_lock);
  102. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_all", this);
  103. u32 did_wake = 0;
  104. unblock_all_blockers_whose_conditions_are_met_locked([&](Thread::Blocker& b, void*, bool&) {
  105. VERIFY(b.blocker_type() == Thread::Blocker::Type::Futex);
  106. auto& blocker = static_cast<Thread::FutexBlocker&>(b);
  107. dbgln_if(FUTEXQUEUE_DEBUG, "FutexQueue @ {}: wake_all unblocking {}", this, blocker.thread());
  108. if (blocker.unblock(true)) {
  109. did_wake++;
  110. return true;
  111. }
  112. return false;
  113. });
  114. is_empty = is_empty_and_no_imminent_waits_locked();
  115. return did_wake;
  116. }
  117. bool FutexQueue::is_empty_and_no_imminent_waits_locked()
  118. {
  119. return m_imminent_waits == 0 && is_empty_locked();
  120. }
  121. bool FutexQueue::queue_imminent_wait()
  122. {
  123. SpinlockLocker lock(m_lock);
  124. if (m_was_removed)
  125. return false;
  126. m_imminent_waits++;
  127. return true;
  128. }
  129. bool FutexQueue::try_remove()
  130. {
  131. SpinlockLocker lock(m_lock);
  132. if (m_was_removed)
  133. return false;
  134. if (!is_empty_and_no_imminent_waits_locked())
  135. return false;
  136. m_was_removed = true;
  137. return true;
  138. }
  139. }