Lock.cpp 3.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <Kernel/KSyms.h>
  27. #include <Kernel/Lock.h>
  28. #include <Kernel/Thread.h>
  29. namespace Kernel {
  30. void Lock::lock()
  31. {
  32. ASSERT(!Scheduler::is_active());
  33. if (!are_interrupts_enabled()) {
  34. klog() << "Interrupts disabled when trying to take Lock{" << m_name << "}";
  35. dump_backtrace();
  36. hang();
  37. }
  38. for (;;) {
  39. bool expected = false;
  40. if (m_lock.compare_exchange_strong(expected, true, AK::memory_order_acq_rel)) {
  41. if (!m_holder || m_holder == Thread::current) {
  42. m_holder = Thread::current;
  43. ++m_level;
  44. m_lock.store(false, AK::memory_order_release);
  45. return;
  46. }
  47. Thread::current->wait_on(m_queue, &m_lock, m_holder, m_name);
  48. }
  49. }
  50. }
  51. void Lock::unlock()
  52. {
  53. for (;;) {
  54. bool expected = false;
  55. if (m_lock.compare_exchange_strong(expected, true, AK::memory_order_acq_rel)) {
  56. ASSERT(m_holder == Thread::current);
  57. ASSERT(m_level);
  58. --m_level;
  59. if (m_level) {
  60. m_lock.store(false, AK::memory_order_release);
  61. return;
  62. }
  63. m_holder = nullptr;
  64. m_queue.wake_one(&m_lock);
  65. return;
  66. }
  67. // I don't know *who* is using "m_lock", so just yield.
  68. Scheduler::yield();
  69. }
  70. }
  71. bool Lock::force_unlock_if_locked()
  72. {
  73. InterruptDisabler disabler;
  74. if (m_holder != Thread::current)
  75. return false;
  76. ASSERT(m_level == 1);
  77. ASSERT(m_holder == Thread::current);
  78. m_holder = nullptr;
  79. --m_level;
  80. m_queue.wake_one();
  81. return true;
  82. }
  83. void Lock::clear_waiters()
  84. {
  85. InterruptDisabler disabler;
  86. m_queue.clear();
  87. }
  88. }