491 lines
10 KiB
C
491 lines
10 KiB
C
/*
|
|
* Copyright (c) 1997-2010, 2012-2015 Wind River Systems, Inc.
|
|
*
|
|
* 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.
|
|
*
|
|
* 3) Neither the name of Wind River Systems nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
*
|
|
* @brief Semaphore kernel services.
|
|
*/
|
|
|
|
#include <microkernel.h>
|
|
#include <toolchain.h>
|
|
#include <sections.h>
|
|
|
|
#include <micro_private.h>
|
|
|
|
/**
|
|
*
|
|
* @brief Common code for signaling a semaphore
|
|
*
|
|
* @return N/A
|
|
*/
|
|
static void signal_semaphore(int n, struct _k_sem_struct *S)
|
|
{
|
|
struct k_args *A, *X, *Y;
|
|
|
|
#ifdef CONFIG_OBJECT_MONITOR
|
|
S->Count += n;
|
|
#endif
|
|
|
|
S->Level += n;
|
|
A = S->Waiters;
|
|
Y = NULL;
|
|
while (A && S->Level) {
|
|
X = A->Forw;
|
|
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Comm == _K_SVC_SEM_WAIT_REQUEST
|
|
|| A->Comm == _K_SVC_SEM_WAIT_REPLY_TIMEOUT)
|
|
#else
|
|
if (A->Comm == _K_SVC_SEM_WAIT_REQUEST)
|
|
#endif
|
|
{
|
|
S->Level--;
|
|
if (Y) {
|
|
Y->Forw = X;
|
|
} else {
|
|
S->Waiters = X;
|
|
}
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.timer) {
|
|
_k_timeout_cancel(A);
|
|
A->Comm = _K_SVC_SEM_WAIT_REPLY;
|
|
} else {
|
|
#endif
|
|
A->Time.rcode = RC_OK;
|
|
_k_state_bit_reset(A->Ctxt.proc, TF_SEMA);
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
}
|
|
#endif
|
|
} else if (A->Comm == _K_SVC_SEM_GROUP_WAIT_REQUEST) {
|
|
S->Level--;
|
|
A->Comm = _K_SVC_SEM_GROUP_WAIT_READY;
|
|
GETARGS(Y);
|
|
*Y = *A;
|
|
SENDARGS(Y);
|
|
Y = A;
|
|
} else {
|
|
Y = A;
|
|
}
|
|
A = X;
|
|
}
|
|
}
|
|
|
|
void _k_sem_group_wait(struct k_args *R)
|
|
{
|
|
struct k_args *A = R->Ctxt.args;
|
|
|
|
FREEARGS(R);
|
|
if (--(A->Args.s1.nsem) == 0) {
|
|
_k_state_bit_reset(A->Ctxt.proc, TF_LIST);
|
|
}
|
|
}
|
|
|
|
void _k_sem_group_wait_cancel(struct k_args *A)
|
|
{
|
|
struct _k_sem_struct *S = (struct _k_sem_struct *)A->Args.s1.sema;
|
|
struct k_args *X = S->Waiters;
|
|
struct k_args *Y = NULL;
|
|
|
|
while (X && (X->Prio <= A->Prio)) {
|
|
if (X->Ctxt.args == A->Ctxt.args) {
|
|
if (Y) {
|
|
Y->Forw = X->Forw;
|
|
} else {
|
|
S->Waiters = X->Forw;
|
|
}
|
|
if (X->Comm == _K_SVC_SEM_GROUP_WAIT_REQUEST
|
|
|| X->Comm == _K_SVC_SEM_GROUP_WAIT_READY) {
|
|
if (X->Comm == _K_SVC_SEM_GROUP_WAIT_READY) {
|
|
/* obtain struct k_args of waiting task */
|
|
|
|
struct k_args *waitTaskArgs = X->Ctxt.args;
|
|
|
|
/*
|
|
* Determine if the wait cancellation request is being
|
|
* processed after the state of the 'Waiters' packet state
|
|
* has been updated to _K_SVC_SEM_GROUP_WAIT_READY, but before
|
|
* the _K_SVC_SEM_GROUP_WAIT_READY packet has been processed.
|
|
* This will occur if a _K_SVC_SEM_GROUP_WAIT_TIMEOUT
|
|
* timer expiry occurs between the update of the packet state
|
|
* and the processing of the WAITMRDY packet.
|
|
*/
|
|
if (unlikely(waitTaskArgs->Args.s1.sema ==
|
|
ENDLIST)) {
|
|
waitTaskArgs->Args.s1.sema = A->Args.s1.sema;
|
|
} else {
|
|
signal_semaphore(1, S);
|
|
}
|
|
}
|
|
|
|
_k_sem_group_wait(X);
|
|
} else {
|
|
FREEARGS(X); /* ERROR */
|
|
}
|
|
FREEARGS(A);
|
|
return;
|
|
} else {
|
|
Y = X;
|
|
X = X->Forw;
|
|
}
|
|
}
|
|
A->Forw = X;
|
|
if (Y) {
|
|
Y->Forw = A;
|
|
} else {
|
|
S->Waiters = A;
|
|
}
|
|
}
|
|
|
|
void _k_sem_group_wait_accept(struct k_args *A)
|
|
{
|
|
struct _k_sem_struct *S = (struct _k_sem_struct *)A->Args.s1.sema;
|
|
struct k_args *X = S->Waiters;
|
|
struct k_args *Y = NULL;
|
|
|
|
while (X && (X->Prio <= A->Prio)) {
|
|
if (X->Ctxt.args == A->Ctxt.args) {
|
|
if (Y) {
|
|
Y->Forw = X->Forw;
|
|
} else {
|
|
S->Waiters = X->Forw;
|
|
}
|
|
if (X->Comm == _K_SVC_SEM_GROUP_WAIT_READY) {
|
|
_k_sem_group_wait(X);
|
|
} else {
|
|
FREEARGS(X); /* ERROR */
|
|
}
|
|
FREEARGS(A);
|
|
return;
|
|
} else {
|
|
Y = X;
|
|
X = X->Forw;
|
|
}
|
|
}
|
|
/* ERROR */
|
|
}
|
|
|
|
void _k_sem_group_wait_timeout(struct k_args *A)
|
|
{
|
|
ksem_t *L;
|
|
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.timer) {
|
|
FREETIMER(A->Time.timer);
|
|
}
|
|
#endif
|
|
|
|
L = A->Args.s1.list;
|
|
while (*L != ENDLIST) {
|
|
struct k_args *R;
|
|
|
|
GETARGS(R);
|
|
R->Prio = A->Prio;
|
|
R->Comm =
|
|
((*L == A->Args.s1.sema) ?
|
|
_K_SVC_SEM_GROUP_WAIT_ACCEPT : _K_SVC_SEM_GROUP_WAIT_CANCEL);
|
|
R->Ctxt.args = A;
|
|
R->Args.s1.sema = *L++;
|
|
SENDARGS(R);
|
|
}
|
|
}
|
|
|
|
void _k_sem_group_ready(struct k_args *R)
|
|
{
|
|
struct k_args *A = R->Ctxt.args;
|
|
|
|
if (A->Args.s1.sema == ENDLIST) {
|
|
A->Args.s1.sema = R->Args.s1.sema;
|
|
A->Comm = _K_SVC_SEM_GROUP_WAIT_TIMEOUT;
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.timer) {
|
|
_k_timeout_cancel(A);
|
|
} else
|
|
#endif
|
|
_k_sem_group_wait_timeout(A);
|
|
}
|
|
FREEARGS(R);
|
|
}
|
|
|
|
void _k_sem_wait_reply(struct k_args *A)
|
|
{
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.timer) {
|
|
FREETIMER(A->Time.timer);
|
|
}
|
|
if (A->Comm == _K_SVC_SEM_WAIT_REPLY_TIMEOUT) {
|
|
REMOVE_ELM(A);
|
|
A->Time.rcode = RC_TIME;
|
|
} else
|
|
#endif
|
|
A->Time.rcode = RC_OK;
|
|
_k_state_bit_reset(A->Ctxt.proc, TF_SEMA);
|
|
}
|
|
|
|
void _k_sem_wait_reply_timeout(struct k_args *A)
|
|
{
|
|
_k_sem_wait_reply(A);
|
|
}
|
|
|
|
void _k_sem_group_wait_request(struct k_args *A)
|
|
{
|
|
struct _k_sem_struct *S = (struct _k_sem_struct *)A->Args.s1.sema;
|
|
struct k_args *X = S->Waiters;
|
|
struct k_args *Y = NULL;
|
|
|
|
while (X && (X->Prio <= A->Prio)) {
|
|
if (X->Ctxt.args == A->Ctxt.args) {
|
|
if (Y) {
|
|
Y->Forw = X->Forw;
|
|
} else {
|
|
S->Waiters = X->Forw;
|
|
}
|
|
if (X->Comm == _K_SVC_SEM_GROUP_WAIT_CANCEL) {
|
|
_k_sem_group_wait(X);
|
|
} else {
|
|
FREEARGS(X); /* ERROR */
|
|
}
|
|
FREEARGS(A);
|
|
return;
|
|
} else {
|
|
Y = X;
|
|
X = X->Forw;
|
|
}
|
|
}
|
|
A->Forw = X;
|
|
if (Y) {
|
|
Y->Forw = A;
|
|
} else {
|
|
S->Waiters = A;
|
|
}
|
|
signal_semaphore(0, S);
|
|
}
|
|
|
|
void _k_sem_group_wait_any(struct k_args *A)
|
|
{
|
|
ksem_t *L;
|
|
|
|
L = A->Args.s1.list;
|
|
A->Args.s1.sema = ENDLIST;
|
|
A->Args.s1.nsem = 0;
|
|
|
|
if (*L == ENDLIST) {
|
|
return;
|
|
}
|
|
|
|
while (*L != ENDLIST) {
|
|
struct k_args *R;
|
|
|
|
GETARGS(R);
|
|
R->Prio = _k_current_task->Prio;
|
|
R->Comm = _K_SVC_SEM_GROUP_WAIT_REQUEST;
|
|
R->Ctxt.args = A;
|
|
R->Args.s1.sema = *L++;
|
|
SENDARGS(R);
|
|
(A->Args.s1.nsem)++;
|
|
}
|
|
|
|
A->Ctxt.proc = _k_current_task;
|
|
_k_state_bit_set(_k_current_task, TF_LIST);
|
|
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.ticks != TICKS_NONE) {
|
|
if (A->Time.ticks == TICKS_UNLIMITED) {
|
|
A->Time.timer = NULL;
|
|
} else {
|
|
A->Comm = _K_SVC_SEM_GROUP_WAIT_TIMEOUT;
|
|
_k_timeout_alloc(A);
|
|
}
|
|
}
|
|
#endif
|
|
}
|
|
|
|
void _k_sem_wait_request(struct k_args *A)
|
|
{
|
|
struct _k_sem_struct *S;
|
|
uint32_t Sid;
|
|
|
|
Sid = A->Args.s1.sema;
|
|
S = (struct _k_sem_struct *)Sid;
|
|
|
|
if (S->Level) {
|
|
S->Level--;
|
|
A->Time.rcode = RC_OK;
|
|
} else if (A->Time.ticks != TICKS_NONE) {
|
|
A->Ctxt.proc = _k_current_task;
|
|
A->Prio = _k_current_task->Prio;
|
|
_k_state_bit_set(_k_current_task, TF_SEMA);
|
|
INSERT_ELM(S->Waiters, A);
|
|
#ifdef CONFIG_SYS_CLOCK_EXISTS
|
|
if (A->Time.ticks == TICKS_UNLIMITED) {
|
|
A->Time.timer = NULL;
|
|
} else {
|
|
A->Comm = _K_SVC_SEM_WAIT_REPLY_TIMEOUT;
|
|
_k_timeout_alloc(A);
|
|
}
|
|
#endif
|
|
return;
|
|
} else {
|
|
A->Time.rcode = RC_FAIL;
|
|
}
|
|
}
|
|
|
|
int _task_sem_take(ksem_t sema, int32_t time)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_WAIT_REQUEST;
|
|
A.Time.ticks = time;
|
|
A.Args.s1.sema = sema;
|
|
KERNEL_ENTRY(&A);
|
|
return A.Time.rcode;
|
|
}
|
|
|
|
ksem_t _task_sem_group_take(ksemg_t group, int32_t time)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_GROUP_WAIT_ANY;
|
|
A.Prio = _k_current_task->Prio;
|
|
A.Time.ticks = time;
|
|
A.Args.s1.list = group;
|
|
KERNEL_ENTRY(&A);
|
|
return A.Args.s1.sema;
|
|
}
|
|
|
|
void _k_sem_signal(struct k_args *A)
|
|
{
|
|
uint32_t Sid = A->Args.s1.sema;
|
|
struct _k_sem_struct *S = (struct _k_sem_struct *)Sid;
|
|
|
|
signal_semaphore(1, S);
|
|
}
|
|
|
|
void _k_sem_group_signal(struct k_args *A)
|
|
{
|
|
ksem_t *L = A->Args.s1.list;
|
|
|
|
while ((A->Args.s1.sema = *L++) != ENDLIST) {
|
|
_k_sem_signal(A);
|
|
}
|
|
}
|
|
|
|
void task_sem_give(ksem_t sema)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_SIGNAL;
|
|
A.Args.s1.sema = sema;
|
|
KERNEL_ENTRY(&A);
|
|
}
|
|
|
|
void task_sem_group_give(ksemg_t group)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_GROUP_SIGNAL;
|
|
A.Args.s1.list = group;
|
|
KERNEL_ENTRY(&A);
|
|
}
|
|
|
|
FUNC_ALIAS(isr_sem_give, fiber_sem_give, void);
|
|
|
|
void isr_sem_give(ksem_t sema, struct cmd_pkt_set *pSet)
|
|
{
|
|
struct k_args *pCommand; /* ptr to command packet */
|
|
|
|
/*
|
|
* The cmdPkt_t data structure was designed to work seamlessly with the
|
|
* struct k_args data structure and it is thus safe (and expected) to typecast
|
|
* the return value of _cmd_pkt_get() to "struct k_args *".
|
|
*/
|
|
|
|
pCommand = (struct k_args *)_cmd_pkt_get(pSet);
|
|
pCommand->Comm = _K_SVC_SEM_SIGNAL;
|
|
pCommand->Args.s1.sema = sema;
|
|
|
|
nano_isr_stack_push(&_k_command_stack, (uint32_t)pCommand);
|
|
}
|
|
|
|
void _k_sem_reset(struct k_args *A)
|
|
{
|
|
uint32_t Sid = A->Args.s1.sema;
|
|
struct _k_sem_struct *S = (struct _k_sem_struct *)Sid;
|
|
|
|
S->Level = 0;
|
|
}
|
|
|
|
void _k_sem_group_reset(struct k_args *A)
|
|
{
|
|
ksem_t *L = A->Args.s1.list;
|
|
|
|
while ((A->Args.s1.sema = *L++) != ENDLIST) {
|
|
_k_sem_reset(A);
|
|
}
|
|
}
|
|
|
|
void task_sem_reset(ksem_t sema)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_RESET;
|
|
A.Args.s1.sema = sema;
|
|
KERNEL_ENTRY(&A);
|
|
}
|
|
|
|
void task_sem_group_reset(ksemg_t group)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_GROUP_RESET;
|
|
A.Args.s1.list = group;
|
|
KERNEL_ENTRY(&A);
|
|
}
|
|
|
|
void _k_sem_inquiry(struct k_args *A)
|
|
{
|
|
struct _k_sem_struct *S;
|
|
uint32_t Sid;
|
|
|
|
Sid = A->Args.s1.sema;
|
|
S = (struct _k_sem_struct *)Sid;
|
|
A->Time.rcode = S->Level;
|
|
}
|
|
|
|
int task_sem_count_get(ksem_t sema)
|
|
{
|
|
struct k_args A;
|
|
|
|
A.Comm = _K_SVC_SEM_INQUIRY;
|
|
A.Args.s1.sema = sema;
|
|
KERNEL_ENTRY(&A);
|
|
return A.Time.rcode;
|
|
}
|