2020-01-18 11:38:21 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2020-07-03 14:19:50 +03:00
|
|
|
#include <AK/TemporaryChange.h>
|
2020-02-16 03:27:42 +03:00
|
|
|
#include <Kernel/KSyms.h>
|
2019-07-29 13:00:14 +03:00
|
|
|
#include <Kernel/Lock.h>
|
2019-12-01 13:57:20 +03:00
|
|
|
#include <Kernel/Thread.h>
|
2019-07-29 13:00:14 +03:00
|
|
|
|
2020-02-16 03:27:42 +03:00
|
|
|
namespace Kernel {
|
|
|
|
|
2020-04-18 12:21:00 +03:00
|
|
|
static bool modes_conflict(Lock::Mode mode1, Lock::Mode mode2)
|
2019-07-29 13:00:14 +03:00
|
|
|
{
|
2020-04-18 12:21:00 +03:00
|
|
|
if (mode1 == Lock::Mode::Unlocked || mode2 == Lock::Mode::Unlocked)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (mode1 == Lock::Mode::Shared && mode2 == Lock::Mode::Shared)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Lock::lock(Mode mode)
|
|
|
|
{
|
|
|
|
ASSERT(mode != Mode::Unlocked);
|
2019-07-29 13:00:14 +03:00
|
|
|
if (!are_interrupts_enabled()) {
|
2020-03-01 22:45:39 +03:00
|
|
|
klog() << "Interrupts disabled when trying to take Lock{" << m_name << "}";
|
2019-07-29 13:00:14 +03:00
|
|
|
dump_backtrace();
|
2020-07-06 16:27:22 +03:00
|
|
|
Processor::halt();
|
2019-07-29 13:00:14 +03:00
|
|
|
}
|
2020-06-29 00:34:31 +03:00
|
|
|
auto current_thread = Thread::current();
|
2019-07-29 13:00:14 +03:00
|
|
|
for (;;) {
|
2019-10-12 20:17:34 +03:00
|
|
|
bool expected = false;
|
|
|
|
if (m_lock.compare_exchange_strong(expected, true, AK::memory_order_acq_rel)) {
|
2020-07-06 00:46:51 +03:00
|
|
|
do {
|
|
|
|
// FIXME: Do not add new readers if writers are queued.
|
|
|
|
bool modes_dont_conflict = !modes_conflict(m_mode, mode);
|
|
|
|
bool already_hold_exclusive_lock = m_mode == Mode::Exclusive && m_holder == current_thread;
|
|
|
|
if (modes_dont_conflict || already_hold_exclusive_lock) {
|
|
|
|
// We got the lock!
|
|
|
|
if (!already_hold_exclusive_lock)
|
|
|
|
m_mode = mode;
|
|
|
|
m_holder = current_thread;
|
|
|
|
m_times_locked++;
|
|
|
|
m_lock.store(false, AK::memory_order_release);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} while (current_thread->wait_on(m_queue, m_name, nullptr, &m_lock, m_holder) == Thread::BlockResult::NotBlocked);
|
2020-07-03 14:19:50 +03:00
|
|
|
} else if (Processor::current().in_critical()) {
|
|
|
|
// If we're in a critical section and trying to lock, no context
|
|
|
|
// switch will happen, so yield.
|
|
|
|
// The assumption is that if we call this from a critical section
|
|
|
|
// that we DO want to temporarily leave it
|
2020-07-05 23:32:07 +03:00
|
|
|
u32 prev_flags;
|
|
|
|
u32 prev_crit = Processor::current().clear_critical(prev_flags, !Processor::current().in_irq());
|
|
|
|
|
2020-07-03 14:19:50 +03:00
|
|
|
Scheduler::yield();
|
2020-07-05 23:32:07 +03:00
|
|
|
|
|
|
|
// Note, we may now be on a different CPU!
|
|
|
|
Processor::current().restore_critical(prev_crit, prev_flags);
|
2019-07-29 13:00:14 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Lock::unlock()
|
|
|
|
{
|
2020-06-29 00:34:31 +03:00
|
|
|
auto current_thread = Thread::current();
|
2019-07-29 13:00:14 +03:00
|
|
|
for (;;) {
|
2019-10-12 20:17:34 +03:00
|
|
|
bool expected = false;
|
|
|
|
if (m_lock.compare_exchange_strong(expected, true, AK::memory_order_acq_rel)) {
|
2020-04-18 12:21:00 +03:00
|
|
|
ASSERT(m_times_locked);
|
|
|
|
--m_times_locked;
|
|
|
|
|
|
|
|
ASSERT(m_mode != Mode::Unlocked);
|
|
|
|
if (m_mode == Mode::Exclusive)
|
2020-06-29 00:34:31 +03:00
|
|
|
ASSERT(m_holder == current_thread);
|
|
|
|
if (m_holder == current_thread && (m_mode == Mode::Shared || m_times_locked == 0))
|
2020-04-18 12:21:00 +03:00
|
|
|
m_holder = nullptr;
|
|
|
|
|
|
|
|
if (m_times_locked > 0) {
|
2019-10-12 20:17:34 +03:00
|
|
|
m_lock.store(false, AK::memory_order_release);
|
2019-07-29 13:00:14 +03:00
|
|
|
return;
|
|
|
|
}
|
2020-04-18 12:21:00 +03:00
|
|
|
m_mode = Mode::Unlocked;
|
2020-01-12 20:46:41 +03:00
|
|
|
m_queue.wake_one(&m_lock);
|
2019-07-29 13:00:14 +03:00
|
|
|
return;
|
|
|
|
}
|
2019-12-01 13:57:20 +03:00
|
|
|
// I don't know *who* is using "m_lock", so just yield.
|
2020-07-03 14:19:50 +03:00
|
|
|
// The assumption is that if we call this from a critical section
|
|
|
|
// that we DO want to temporarily leave it
|
2020-07-05 23:32:07 +03:00
|
|
|
u32 prev_flags;
|
|
|
|
u32 prev_crit = Processor::current().clear_critical(prev_flags, false);
|
|
|
|
|
2019-12-01 13:57:20 +03:00
|
|
|
Scheduler::yield();
|
2020-07-05 23:32:07 +03:00
|
|
|
|
|
|
|
// Note, we may now be on a different CPU!
|
|
|
|
Processor::current().restore_critical(prev_crit, prev_flags);
|
2019-07-29 13:00:14 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-01-13 00:53:20 +03:00
|
|
|
bool Lock::force_unlock_if_locked()
|
2019-07-29 13:00:14 +03:00
|
|
|
{
|
2020-04-18 12:21:00 +03:00
|
|
|
ASSERT(m_mode != Mode::Shared);
|
2020-07-03 14:19:50 +03:00
|
|
|
ScopedCritical critical;
|
2020-06-29 00:34:31 +03:00
|
|
|
if (m_holder != Thread::current())
|
2020-01-13 00:53:20 +03:00
|
|
|
return false;
|
2020-04-18 12:21:00 +03:00
|
|
|
ASSERT(m_times_locked == 1);
|
2020-01-13 00:53:20 +03:00
|
|
|
m_holder = nullptr;
|
2020-04-18 12:21:00 +03:00
|
|
|
m_mode = Mode::Unlocked;
|
|
|
|
m_times_locked = 0;
|
2020-01-13 00:53:20 +03:00
|
|
|
m_queue.wake_one();
|
|
|
|
return true;
|
2019-07-29 13:00:14 +03:00
|
|
|
}
|
2020-02-16 03:27:42 +03:00
|
|
|
|
Kernel: Allow process with multiple threads to call exec and exit
This allows a process wich has more than 1 thread to call exec, even
from a thread. This kills all the other threads, but it won't wait for
them to finish, just makes sure that they are not in a running/runable
state.
In the case where a thread does exec, the new program PID will be the
thread TID, to keep the PID == TID in the new process.
This introduces a new function inside the Process class,
kill_threads_except_self which is called on exit() too (exit with
multiple threads wasn't properly working either).
Inside the Lock class, there is the need for a new function,
clear_waiters, which removes all the waiters from the
Process::big_lock. This is needed since after a exit/exec, there should
be no other threads waiting for this lock, the threads should be simply
killed. Only queued threads should wait for this lock at this point,
since blocked threads are handled in set_should_die.
2020-02-18 15:28:28 +03:00
|
|
|
void Lock::clear_waiters()
|
|
|
|
{
|
2020-04-18 12:21:00 +03:00
|
|
|
ASSERT(m_mode != Mode::Shared);
|
2020-07-03 14:19:50 +03:00
|
|
|
ScopedCritical critical;
|
Kernel: Allow process with multiple threads to call exec and exit
This allows a process wich has more than 1 thread to call exec, even
from a thread. This kills all the other threads, but it won't wait for
them to finish, just makes sure that they are not in a running/runable
state.
In the case where a thread does exec, the new program PID will be the
thread TID, to keep the PID == TID in the new process.
This introduces a new function inside the Process class,
kill_threads_except_self which is called on exit() too (exit with
multiple threads wasn't properly working either).
Inside the Lock class, there is the need for a new function,
clear_waiters, which removes all the waiters from the
Process::big_lock. This is needed since after a exit/exec, there should
be no other threads waiting for this lock, the threads should be simply
killed. Only queued threads should wait for this lock at this point,
since blocked threads are handled in set_should_die.
2020-02-18 15:28:28 +03:00
|
|
|
m_queue.clear();
|
|
|
|
}
|
|
|
|
|
2020-02-16 03:27:42 +03:00
|
|
|
}
|