Summary of what this includes:
initialization:
Copy from nano_init.c, with the following changes:
- the main thread is the continuation of the init thread, but an idle
thread is created as well
- _main() initializes threads in groups and starts the EXE group
- the ready queues are initialized
- the main thread is marked as non-essential once the system init is
done
- a weak main() symbol is provided if the application does not provide a
main() function
scheduler:
Not an exhaustive list, but basically provide primitives for:
- adding/removing a thread to/from a wait queue
- adding/removing a thread to/from the ready queue
- marking thread as ready
- locking/unlocking the scheduler
- instead of locking interrupts
- getting/setting thread priority
- checking what state (coop/preempt) a thread is currenlty running in
- rescheduling threads
- finding what thread is the next to run
- yielding/sleeping/aborting sleep
- finding the current thread
threads:
- Add operationns on threads, such as creating and starting them.
standardized handling of kernel object return codes:
- Kernel objects now cause _Swap() to return the following values:
0 => operation successful
-EAGAIN => operation timed out
-Exxxxx => operation failed for another reason
- The thread's swap_data field can be used to return any additional
information required to complete the operation, such as the actual
result of a successful operation.
timeouts:
- same as nano timeouts, renamed to simply 'timeouts'
- the kernel is still tick-based, but objects take timeout values in
ms for forward compatibility with a tickless kernel.
semaphores:
- Port of the nanokernel semaphores, which have the same basic behaviour
as the microkernel ones. Semaphore groups are not yet implemented.
- These semaphores are enhanced in that they accept an initial count and a
count limit. This allows configuring them as binary semaphores, and also
provisioning them without having to "give" the semaphore multiple times
before using them.
mutexes:
- Straight port of the microkernel mutexes. An init function is added to
allow defining them at runtime.
pipes:
- straight port
timers:
- amalgamation of nano and micro timers, with all functionalities
intact.
events:
- re-implementation, using semaphores and workqueues.
mailboxes:
- straight port
message queues:
- straight port of microkernel FIFOs
memory maps:
- straight port
workqueues:
- Basically, have all APIs follow the k_ naming rule, and use the _timeout
subsystem from the unified kernel directory, and not the _nano_timeout
one.
stacks:
- Port of the nanokernel stacks. They can now have multiple threads
pending on them and threads can wait with a timeout.
LIFOs:
- Straight port of the nanokernel LIFOs.
FIFOs:
- Straight port of the nanokernel FIFOs.
Work by: Dmitriy Korovkin <dmitriy.korovkin@windriver.com>
Peter Mitsis <peter.mitsis@windriver.com>
Allan Stephens <allan.stephens@windriver.com>
Benjamin Walsh <benjamin.walsh@windriver.com>
Change-Id: Id3cadb3694484ab2ca467889cfb029be3cd3a7d6
Signed-off-by: Benjamin Walsh <benjamin.walsh@windriver.com>
217 lines
5.5 KiB
C
217 lines
5.5 KiB
C
/*
|
|
* Copyright (c) 2016 Wind River Systems, Inc.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
* @brief Message queues.
|
|
*/
|
|
|
|
|
|
#include <kernel.h>
|
|
#include <nano_private.h>
|
|
#include <misc/debug/object_tracing_common.h>
|
|
#include <toolchain.h>
|
|
#include <sections.h>
|
|
#include <string.h>
|
|
#include <wait_q.h>
|
|
#include <misc/dlist.h>
|
|
|
|
/**
|
|
* @brief Initialize a message queue.
|
|
*
|
|
* @param q Pointer to the message queue object.
|
|
* @param msg_size Message size, in bytes.
|
|
* @param max_msgs Maximum number of messages that can be queued.
|
|
* @param buffer Pointer to memory area that holds queued messages.
|
|
*
|
|
* @return N/A
|
|
*/
|
|
void k_msgq_init(struct k_msgq *q, uint32_t msg_size, uint32_t max_msgs,
|
|
char *buffer)
|
|
{
|
|
q->msg_size = msg_size;
|
|
q->max_msgs = max_msgs;
|
|
q->buffer_start = buffer;
|
|
q->buffer_end = buffer + (max_msgs * msg_size);
|
|
q->read_ptr = buffer;
|
|
q->write_ptr = buffer;
|
|
q->used_msgs = 0;
|
|
sys_dlist_init(&q->wait_q);
|
|
SYS_TRACING_OBJ_INIT(msgq, q);
|
|
}
|
|
|
|
/**
|
|
* @brief Adds a message to a message queue.
|
|
*
|
|
* @param q Pointer to the message queue object.
|
|
* @param data Pointer to message data area.
|
|
* @param timeout Maximum time (nanoseconds) to wait for operation to complete.
|
|
* Use K_NO_WAIT to return immediately, or K_FOREVER to wait as long as
|
|
* necessary.
|
|
*
|
|
* @return 0 if successful, -ENOMSG if failed immediately or after queue purge,
|
|
* -EAGAIN if timed out
|
|
*/
|
|
int k_msgq_put(struct k_msgq *q, void *data, int32_t timeout)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
struct tcs *pending_thread;
|
|
int result;
|
|
|
|
if (q->used_msgs < q->max_msgs) {
|
|
/* message queue isn't full */
|
|
pending_thread = _unpend_first_thread(&q->wait_q);
|
|
if (pending_thread) {
|
|
/* give message to waiting thread */
|
|
memcpy(pending_thread->swap_data, data, q->msg_size);
|
|
/* wake up waiting thread */
|
|
_set_thread_return_value(pending_thread, 0);
|
|
_timeout_abort(pending_thread);
|
|
_ready_thread(pending_thread);
|
|
if (_must_switch_threads()) {
|
|
_Swap(key);
|
|
return 0;
|
|
}
|
|
} else {
|
|
/* put message in queue */
|
|
memcpy(q->write_ptr, data, q->msg_size);
|
|
q->write_ptr += q->msg_size;
|
|
if (q->write_ptr == q->buffer_end) {
|
|
q->write_ptr = q->buffer_start;
|
|
}
|
|
q->used_msgs++;
|
|
}
|
|
result = 0;
|
|
} else if (timeout == K_NO_WAIT) {
|
|
/* don't wait for message space to become available */
|
|
result = -ENOMSG;
|
|
} else {
|
|
/* wait for put message success, failure, or timeout */
|
|
_pend_current_thread(&q->wait_q, timeout);
|
|
_current->swap_data = data;
|
|
return _Swap(key);
|
|
}
|
|
|
|
irq_unlock(key);
|
|
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* @brief Removes a message from a message queue.
|
|
*
|
|
* @param q Pointer to the message queue object.
|
|
* @param data Pointer to message data area.
|
|
* @param timeout Maximum time (nanoseconds) to wait for operation to complete.
|
|
* Use K_NO_WAIT to return immediately, or K_FOREVER to wait as long as
|
|
* necessary.
|
|
*
|
|
* @return 0 if successful, -ENOMSG if failed immediately, -EAGAIN if timed out
|
|
*/
|
|
int k_msgq_get(struct k_msgq *q, void *data, int32_t timeout)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
struct tcs *pending_thread;
|
|
int result;
|
|
|
|
if (q->used_msgs > 0) {
|
|
/* take first available message from queue */
|
|
memcpy(data, q->read_ptr, q->msg_size);
|
|
q->read_ptr += q->msg_size;
|
|
if (q->read_ptr == q->buffer_end) {
|
|
q->read_ptr = q->buffer_start;
|
|
}
|
|
q->used_msgs--;
|
|
|
|
/* handle first thread waiting to write (if any) */
|
|
pending_thread = _unpend_first_thread(&q->wait_q);
|
|
if (pending_thread) {
|
|
/* add thread's message to queue */
|
|
memcpy(q->write_ptr, pending_thread->swap_data,
|
|
q->msg_size);
|
|
q->write_ptr += q->msg_size;
|
|
if (q->write_ptr == q->buffer_end) {
|
|
q->write_ptr = q->buffer_start;
|
|
}
|
|
q->used_msgs++;
|
|
|
|
/* wake up waiting thread */
|
|
_set_thread_return_value(pending_thread, 0);
|
|
_timeout_abort(pending_thread);
|
|
_ready_thread(pending_thread);
|
|
if (_must_switch_threads()) {
|
|
_Swap(key);
|
|
return 0;
|
|
}
|
|
}
|
|
result = 0;
|
|
} else if (timeout == K_NO_WAIT) {
|
|
/* don't wait for a message to become available */
|
|
result = -ENOMSG;
|
|
} else {
|
|
/* wait for get message success or timeout */
|
|
_pend_current_thread(&q->wait_q, timeout);
|
|
_current->swap_data = data;
|
|
return _Swap(key);
|
|
}
|
|
|
|
irq_unlock(key);
|
|
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* @brief Purge contents of a message queue.
|
|
*
|
|
* Discards all messages currently in the message queue, and cancels
|
|
* any "add message" operations initiated by waiting threads.
|
|
*
|
|
* @param q Pointer to the message queue object.
|
|
*
|
|
* @return N/A
|
|
*/
|
|
void k_msgq_purge(struct k_msgq *q)
|
|
{
|
|
unsigned int key = irq_lock();
|
|
|
|
if (q->used_msgs) {
|
|
/* wake up any threads that are waiting to write */
|
|
while (1) {
|
|
struct tcs *pending_thread =
|
|
_unpend_first_thread(&q->wait_q);
|
|
|
|
if (pending_thread == NULL) {
|
|
break;
|
|
}
|
|
_set_thread_return_value(pending_thread, -ENOMSG);
|
|
_timeout_abort(pending_thread);
|
|
_ready_thread(pending_thread);
|
|
}
|
|
|
|
q->used_msgs = 0;
|
|
q->read_ptr = q->write_ptr;
|
|
|
|
if (_must_switch_threads()) {
|
|
_Swap(key);
|
|
return;
|
|
}
|
|
} else {
|
|
/* queue is empty, so no need to do anything ... */
|
|
}
|
|
|
|
irq_unlock(key);
|
|
}
|