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>
232 lines
4.9 KiB
C
232 lines
4.9 KiB
C
/*
|
|
* Copyright (c) 2010-2016 Wind River Systems, Inc.
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
*
|
|
* @brief dynamic-size QUEUE object.
|
|
*/
|
|
|
|
|
|
#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 <ksched.h>
|
|
#include <misc/slist.h>
|
|
#include <init.h>
|
|
#include <kswap.h>
|
|
|
|
extern struct k_queue _k_queue_list_start[];
|
|
extern struct k_queue _k_queue_list_end[];
|
|
|
|
#ifdef CONFIG_OBJECT_TRACING
|
|
|
|
struct k_queue *_trace_list_k_queue;
|
|
|
|
/*
|
|
* Complete initialization of statically defined queues.
|
|
*/
|
|
static int init_queue_module(struct device *dev)
|
|
{
|
|
ARG_UNUSED(dev);
|
|
|
|
struct k_queue *queue;
|
|
|
|
for (queue = _k_queue_list_start; queue < _k_queue_list_end; queue++) {
|
|
SYS_TRACING_OBJ_INIT(k_queue, queue);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
SYS_INIT(init_queue_module, PRE_KERNEL_1, CONFIG_KERNEL_INIT_PRIORITY_OBJECTS);
|
|
|
|
#endif /* CONFIG_OBJECT_TRACING */
|
|
|
|
void k_queue_init(struct k_queue *queue)
|
|
{
|
|
sys_slist_init(&queue->data_q);
|
|
sys_dlist_init(&queue->wait_q);
|
|
#if defined(CONFIG_POLL)
|
|
sys_dlist_init(&queue->poll_events);
|
|
#endif
|
|
|
|
SYS_TRACING_OBJ_INIT(k_queue, queue);
|
|
}
|
|
|
|
#if !defined(CONFIG_POLL)
|
|
static void prepare_thread_to_run(struct k_thread *thread, void *data)
|
|
{
|
|
_abort_thread_timeout(thread);
|
|
_ready_thread(thread);
|
|
_set_thread_return_value_with_data(thread, 0, data);
|
|
}
|
|
#endif /* CONFIG_POLL */
|
|
|
|
static inline void handle_poll_events(struct k_queue *queue, u32_t state)
|
|
{
|
|
#ifdef CONFIG_POLL
|
|
_handle_obj_poll_events(&queue->poll_events, state);
|
|
#endif
|
|
}
|
|
|
|
void k_queue_cancel_wait(struct k_queue *queue)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
#if !defined(CONFIG_POLL)
|
|
struct k_thread *first_pending_thread;
|
|
|
|
first_pending_thread = _unpend_first_thread(&queue->wait_q);
|
|
|
|
if (first_pending_thread) {
|
|
prepare_thread_to_run(first_pending_thread, NULL);
|
|
}
|
|
#else
|
|
handle_poll_events(queue, K_POLL_STATE_NOT_READY);
|
|
#endif /* !CONFIG_POLL */
|
|
|
|
_reschedule_noyield(key);
|
|
}
|
|
|
|
void k_queue_insert(struct k_queue *queue, void *prev, void *data)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
#if !defined(CONFIG_POLL)
|
|
struct k_thread *first_pending_thread;
|
|
|
|
first_pending_thread = _unpend_first_thread(&queue->wait_q);
|
|
|
|
if (first_pending_thread) {
|
|
prepare_thread_to_run(first_pending_thread, data);
|
|
_reschedule_noyield(key);
|
|
return;
|
|
}
|
|
#endif /* !CONFIG_POLL */
|
|
|
|
sys_slist_insert(&queue->data_q, prev, data);
|
|
|
|
#if defined(CONFIG_POLL)
|
|
handle_poll_events(queue, K_POLL_STATE_DATA_AVAILABLE);
|
|
#endif /* CONFIG_POLL */
|
|
|
|
_reschedule_noyield(key);
|
|
}
|
|
|
|
void k_queue_append(struct k_queue *queue, void *data)
|
|
{
|
|
return k_queue_insert(queue, queue->data_q.tail, data);
|
|
}
|
|
|
|
void k_queue_prepend(struct k_queue *queue, void *data)
|
|
{
|
|
return k_queue_insert(queue, NULL, data);
|
|
}
|
|
|
|
void k_queue_append_list(struct k_queue *queue, void *head, void *tail)
|
|
{
|
|
__ASSERT(head && tail, "invalid head or tail");
|
|
|
|
unsigned int key = irq_lock();
|
|
#if !defined(CONFIG_POLL)
|
|
struct k_thread *thread;
|
|
|
|
while (head && ((thread = _unpend_first_thread(&queue->wait_q)))) {
|
|
prepare_thread_to_run(thread, head);
|
|
head = *(void **)head;
|
|
}
|
|
|
|
if (head) {
|
|
sys_slist_append_list(&queue->data_q, head, tail);
|
|
}
|
|
|
|
#else
|
|
sys_slist_append_list(&queue->data_q, head, tail);
|
|
handle_poll_events(queue, K_POLL_STATE_DATA_AVAILABLE);
|
|
#endif /* !CONFIG_POLL */
|
|
|
|
_reschedule_noyield(key);
|
|
}
|
|
|
|
void k_queue_merge_slist(struct k_queue *queue, sys_slist_t *list)
|
|
{
|
|
__ASSERT(!sys_slist_is_empty(list), "list must not be empty");
|
|
|
|
/*
|
|
* note: this works as long as:
|
|
* - the slist implementation keeps the next pointer as the first
|
|
* field of the node object type
|
|
* - list->tail->next = NULL.
|
|
*/
|
|
k_queue_append_list(queue, list->head, list->tail);
|
|
sys_slist_init(list);
|
|
}
|
|
|
|
#if defined(CONFIG_POLL)
|
|
static void *k_queue_poll(struct k_queue *queue, s32_t timeout)
|
|
{
|
|
struct k_poll_event event;
|
|
int err;
|
|
unsigned int key;
|
|
void *val;
|
|
|
|
k_poll_event_init(&event, K_POLL_TYPE_FIFO_DATA_AVAILABLE,
|
|
K_POLL_MODE_NOTIFY_ONLY, queue);
|
|
|
|
do {
|
|
event.state = K_POLL_STATE_NOT_READY;
|
|
|
|
err = k_poll(&event, 1, timeout);
|
|
if (err) {
|
|
return NULL;
|
|
}
|
|
|
|
__ASSERT_NO_MSG(event.state ==
|
|
K_POLL_STATE_FIFO_DATA_AVAILABLE);
|
|
|
|
/* sys_slist_* aren't threadsafe, so must be always protected by
|
|
* irq_lock.
|
|
*/
|
|
key = irq_lock();
|
|
val = sys_slist_get(&queue->data_q);
|
|
irq_unlock(key);
|
|
} while (!val && timeout == K_FOREVER);
|
|
|
|
return val;
|
|
}
|
|
#endif /* CONFIG_POLL */
|
|
|
|
void *k_queue_get(struct k_queue *queue, s32_t timeout)
|
|
{
|
|
unsigned int key;
|
|
void *data;
|
|
|
|
key = irq_lock();
|
|
|
|
if (likely(!sys_slist_is_empty(&queue->data_q))) {
|
|
data = sys_slist_get_not_empty(&queue->data_q);
|
|
irq_unlock(key);
|
|
return data;
|
|
}
|
|
|
|
if (timeout == K_NO_WAIT) {
|
|
irq_unlock(key);
|
|
return NULL;
|
|
}
|
|
|
|
#if defined(CONFIG_POLL)
|
|
irq_unlock(key);
|
|
|
|
return k_queue_poll(queue, timeout);
|
|
|
|
#else
|
|
_pend_current_thread(&queue->wait_q, timeout);
|
|
|
|
return _Swap(key) ? NULL : _current->base.swap_data;
|
|
#endif /* CONFIG_POLL */
|
|
}
|