mirror of
https://github.com/zephyrproject-rtos/zephyr
synced 2025-08-08 04:05:22 +00:00
There was a somewhat promiscuous pattern in the kernel where IPC mechanisms would do something that might effect the current thread choice, then check _must_switch_threads() (or occasionally __must_switch_threads -- don't ask, the distinction is being replaced by real English words), sometimes _is_in_isr() (but not always, even in contexts where that looks like it would be a mistake), and then call _Swap() if everything is OK, otherwise releasing the irq_lock(). Sometimes this was done directly, sometimes via the inverted test, sometimes (poll, heh) by doing the test when the thread state was modified and then needlessly passing the result up the call stack to the point of the _Swap(). And some places were just calling _reschedule_threads(), which did all this already. Unify all this madness. The old _reschedule_threads() function has split into two variants: _reschedule_yield() and _reschedule_noyield(). The latter is the "normal" one that respects the cooperative priority of the current thread (i.e. it won't switch out even if there is a higher priority thread ready -- the current thread has to pend itself first), the former is used in the handful of places where code was doing a swap unconditionally, just to preserve precise behavior across the refactor. I'm not at all convinced it should exist... Signed-off-by: Andy Ross <andrew.j.ross@intel.com>
178 lines
3.9 KiB
C
178 lines
3.9 KiB
C
/*
|
|
* Copyright (c) 2010-2016 Wind River Systems, Inc.
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
*
|
|
* @brief Kernel semaphore object.
|
|
*
|
|
* The semaphores are of the 'counting' type, i.e. each 'give' operation will
|
|
* increment the internal count by 1, if no thread is pending on it. The 'init'
|
|
* call initializes the count to 'initial_count'. Following multiple 'give'
|
|
* operations, the same number of 'take' operations can be performed without
|
|
* the calling thread having to pend on the semaphore, or the calling task
|
|
* having to poll.
|
|
*/
|
|
|
|
#include <kernel.h>
|
|
#include <kernel_structs.h>
|
|
#include <debug/object_tracing_common.h>
|
|
#include <toolchain.h>
|
|
#include <linker/sections.h>
|
|
#include <wait_q.h>
|
|
#include <misc/dlist.h>
|
|
#include <ksched.h>
|
|
#include <init.h>
|
|
#include <syscall_handler.h>
|
|
#include <kswap.h>
|
|
|
|
extern struct k_sem _k_sem_list_start[];
|
|
extern struct k_sem _k_sem_list_end[];
|
|
|
|
#ifdef CONFIG_OBJECT_TRACING
|
|
|
|
struct k_sem *_trace_list_k_sem;
|
|
|
|
/*
|
|
* Complete initialization of statically defined semaphores.
|
|
*/
|
|
static int init_sem_module(struct device *dev)
|
|
{
|
|
ARG_UNUSED(dev);
|
|
|
|
struct k_sem *sem;
|
|
|
|
for (sem = _k_sem_list_start; sem < _k_sem_list_end; sem++) {
|
|
SYS_TRACING_OBJ_INIT(k_sem, sem);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
SYS_INIT(init_sem_module, PRE_KERNEL_1, CONFIG_KERNEL_INIT_PRIORITY_OBJECTS);
|
|
|
|
#endif /* CONFIG_OBJECT_TRACING */
|
|
|
|
void _impl_k_sem_init(struct k_sem *sem, unsigned int initial_count,
|
|
unsigned int limit)
|
|
{
|
|
__ASSERT(limit != 0, "limit cannot be zero");
|
|
|
|
sem->count = initial_count;
|
|
sem->limit = limit;
|
|
sys_dlist_init(&sem->wait_q);
|
|
#if defined(CONFIG_POLL)
|
|
sys_dlist_init(&sem->poll_events);
|
|
#endif
|
|
|
|
SYS_TRACING_OBJ_INIT(k_sem, sem);
|
|
|
|
_k_object_init(sem);
|
|
}
|
|
|
|
#ifdef CONFIG_USERSPACE
|
|
_SYSCALL_HANDLER(k_sem_init, sem, initial_count, limit)
|
|
{
|
|
_SYSCALL_OBJ_INIT(sem, K_OBJ_SEM);
|
|
_SYSCALL_VERIFY(limit != 0);
|
|
_impl_k_sem_init((struct k_sem *)sem, initial_count, limit);
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
static inline void handle_poll_events(struct k_sem *sem)
|
|
{
|
|
#ifdef CONFIG_POLL
|
|
_handle_obj_poll_events(&sem->poll_events, K_POLL_STATE_SEM_AVAILABLE);
|
|
#endif
|
|
}
|
|
|
|
static inline void increment_count_up_to_limit(struct k_sem *sem)
|
|
{
|
|
sem->count += (sem->count != sem->limit);
|
|
}
|
|
|
|
static void do_sem_give(struct k_sem *sem)
|
|
{
|
|
struct k_thread *thread = _unpend_first_thread(&sem->wait_q);
|
|
|
|
if (thread) {
|
|
(void)_abort_thread_timeout(thread);
|
|
_ready_thread(thread);
|
|
_set_thread_return_value(thread, 0);
|
|
} else {
|
|
increment_count_up_to_limit(sem);
|
|
handle_poll_events(sem);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* This function is meant to be called only by
|
|
* _sys_event_logger_put_non_preemptible(), which itself is really meant to be
|
|
* called only by _sys_k_event_logger_context_switch(), used within a context
|
|
* switch to log the event.
|
|
*
|
|
* WARNING:
|
|
* It must be called with interrupts already locked.
|
|
* It cannot be called for a sempahore part of a group.
|
|
*/
|
|
void _sem_give_non_preemptible(struct k_sem *sem)
|
|
{
|
|
struct k_thread *thread;
|
|
|
|
thread = _unpend_first_thread(&sem->wait_q);
|
|
if (!thread) {
|
|
increment_count_up_to_limit(sem);
|
|
return;
|
|
}
|
|
|
|
_set_thread_return_value(thread, 0);
|
|
}
|
|
|
|
void _impl_k_sem_give(struct k_sem *sem)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
|
|
do_sem_give(sem);
|
|
_reschedule_noyield(key);
|
|
}
|
|
|
|
#ifdef CONFIG_USERSPACE
|
|
_SYSCALL_HANDLER1_SIMPLE_VOID(k_sem_give, K_OBJ_SEM, struct k_sem *);
|
|
#endif
|
|
|
|
int _impl_k_sem_take(struct k_sem *sem, s32_t timeout)
|
|
{
|
|
__ASSERT(!_is_in_isr() || timeout == K_NO_WAIT, "");
|
|
|
|
unsigned int key = irq_lock();
|
|
|
|
if (likely(sem->count > 0)) {
|
|
sem->count--;
|
|
irq_unlock(key);
|
|
return 0;
|
|
}
|
|
|
|
if (timeout == K_NO_WAIT) {
|
|
irq_unlock(key);
|
|
return -EBUSY;
|
|
}
|
|
|
|
_pend_current_thread(&sem->wait_q, timeout);
|
|
|
|
return _Swap(key);
|
|
}
|
|
|
|
#ifdef CONFIG_USERSPACE
|
|
_SYSCALL_HANDLER(k_sem_take, sem, timeout)
|
|
{
|
|
_SYSCALL_OBJ(sem, K_OBJ_SEM);
|
|
return _impl_k_sem_take((struct k_sem *)sem, timeout);
|
|
}
|
|
|
|
_SYSCALL_HANDLER1_SIMPLE_VOID(k_sem_reset, K_OBJ_SEM, struct k_sem *);
|
|
_SYSCALL_HANDLER1_SIMPLE(k_sem_count_get, K_OBJ_SEM, struct k_sem *);
|
|
#endif
|