RTOS/rtems
1
0
Fork 0
forked from Imagelibrary/rtems
Code Pull Requests Activity

score: Make FIFO thread queue ops public

Browse Source 
Update #4232.
This commit is contained in:
Sebastian Huber
2021-02-05 14:13:31 +01:00
parent 5861e42567
commit cc2a237129
3 changed files with 144 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
cpukit/headers.am
View File

@@ -416,6 +416,7 @@ include_rtems_score_HEADERS += include/rtems/score/threadimpl.h
include_rtems_score_HEADERS += include/rtems/score/threadmp.h
include_rtems_score_HEADERS += include/rtems/score/threadq.h
include_rtems_score_HEADERS += include/rtems/score/threadqimpl.h
include_rtems_score_HEADERS += include/rtems/score/threadqops.h
include_rtems_score_HEADERS += include/rtems/score/timecounter.h
include_rtems_score_HEADERS += include/rtems/score/timecounterimpl.h
include_rtems_score_HEADERS += include/rtems/score/timespec.h

134
cpukit/include/rtems/score/threadqops.h Normal file
View File

@@ -0,0 +1,134 @@
/* SPDX-License-Identifier: BSD-2-Clause */
/**
* @file
*
* @ingroup RTEMSScoreThreadQueue
*
* @brief This header file provides interfaces related to thread queue
* operations.
*/
/*
* Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de)
*
* 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 OWNER 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.
*/
#ifndef _RTEMS_SCORE_THREADQOPS_H
#define _RTEMS_SCORE_THREADQOPS_H
#include <rtems/score/threadq.h>
#ifdef __cplusplus
extern "C" {
#endif
/**
* @addtogroup RTEMSScoreThreadQueue
*
* @{
*/
/**
* @brief Initializes the priority actions so that no actions are performed.
*
* @param queue is unused.
*
* @param[out] priority_actions is initialized so that no actions are
* performed.
*/
void _Thread_queue_Do_nothing_priority_actions(
Thread_queue_Queue *queue,
Priority_Actions *priority_actions
);
/**
* @brief Enqueues the thread to the FIFO thread queue.
*
* @param[in, out] queue is the thread queue.
*
* @param[in, out] the_thread is the thread to enqueue.
*
* @param[in, out] queue_context is the thread queue context.
*/
void _Thread_queue_FIFO_enqueue(
Thread_queue_Queue *queue,
Thread_Control *the_thread,
Thread_queue_Context *queue_context
);
/**
* @brief Extracts the thread from the FIFO thread queue.
*
* @param[in, out] queue is the thread queue.
*
* @param[in, out] the_thread is the thread to extract.
*
* @param[in, out] queue_context is the thread queue context.
*/
void _Thread_queue_FIFO_extract(
Thread_queue_Queue *queue,
Thread_Control *the_thread,
Thread_queue_Context *queue_context
);
/**
* @brief Surrenders the thread queue to the first thread on the FIFO thread
* queue.
*
* @param[in, out] queue is the thread queue.
*
* @param[in, out] heads are heads of the thread queue.
*
* @param previous_owner is unused.
*
* @param[in, out] queue_context is the thread queue context.
*
* @return Returns the first thread on the thread queue according to the queue
* order.
*/
Thread_Control *_Thread_queue_FIFO_surrender(
Thread_queue_Queue *queue,
Thread_queue_Heads *heads,
Thread_Control *previous_owner,
Thread_queue_Context *queue_context
);
/**
* @brief Gets the first thread on the FIFO thread queue.
*
* @param[in, out] queue is the thread queue.
*
* @param[in, out] the_thread is the thread to extract.
*
* @param[in, out] queue_context is the thread queue context.
*/
Thread_Control *_Thread_queue_FIFO_first( const Thread_queue_Heads *heads );
/** @} */
#ifdef __cplusplus
}
#endif
#endif /* _RTEMS_SCORE_THREADQOPS_H */

17
cpukit/score/src/threadqops.c
View File

@@ -1,5 +1,5 @@
/*
* Copyright (c) 2015, 2016 embedded brains GmbH. All rights reserved.
* Copyright (c) 2015, 2021 embedded brains GmbH. All rights reserved.
*
* embedded brains GmbH
* Dornierstr. 4
@@ -16,6 +16,7 @@
#include "config.h"
#endif
#include <rtems/score/threadqops.h>
#include <rtems/score/threadimpl.h>
#include <rtems/score/assert.h>
#include <rtems/score/chainimpl.h>
@@ -38,7 +39,7 @@
Queue \
)
static void _Thread_queue_Do_nothing_priority_actions(
void _Thread_queue_Do_nothing_priority_actions(
Thread_queue_Queue *queue,
Priority_Actions *priority_actions
)
@@ -187,7 +188,7 @@ static void _Thread_queue_FIFO_do_extract(
_Chain_Extract_unprotected( &scheduler_node->Wait.Priority.Node.Node.Chain );
}
static void _Thread_queue_FIFO_enqueue(
void _Thread_queue_FIFO_enqueue(
Thread_queue_Queue *queue,
Thread_Control *the_thread,
Thread_queue_Context *queue_context
@@ -202,7 +203,7 @@ static void _Thread_queue_FIFO_enqueue(
);
}
static void _Thread_queue_FIFO_extract(
void _Thread_queue_FIFO_extract(
Thread_queue_Queue *queue,
Thread_Control *the_thread,
Thread_queue_Context *queue_context
@@ -218,9 +219,7 @@ static void _Thread_queue_FIFO_extract(
);
}
static Thread_Control *_Thread_queue_FIFO_first(
const Thread_queue_Heads *heads
)
Thread_Control *_Thread_queue_FIFO_first( const Thread_queue_Heads *heads )
{
const Chain_Control *fifo;
const Chain_Node *first;
@@ -234,7 +233,7 @@ static Thread_Control *_Thread_queue_FIFO_first(
return _Scheduler_Node_get_owner( scheduler_node );
}
static Thread_Control *_Thread_queue_FIFO_surrender(
Thread_Control *_Thread_queue_FIFO_surrender(
Thread_queue_Queue *queue,
Thread_queue_Heads *heads,
Thread_Control *previous_owner,
@@ -243,6 +242,8 @@ static Thread_Control *_Thread_queue_FIFO_surrender(
{
Thread_Control *first;
(void) previous_owner;
first = _Thread_queue_FIFO_first( heads );
_Thread_queue_Queue_extract(
queue,