2009-08-16 13:07:24 +00:00
|
|
|
/*
|
2011-03-18 18:38:08 +00:00
|
|
|
ChibiOS/RT - Copyright (C) 2006,2007,2008,2009,2010,
|
|
|
|
2011 Giovanni Di Sirio.
|
2009-08-16 13:07:24 +00:00
|
|
|
|
|
|
|
This file is part of ChibiOS/RT.
|
|
|
|
|
|
|
|
ChibiOS/RT is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
ChibiOS/RT is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @file chsem.c
|
|
|
|
* @brief Semaphores code.
|
|
|
|
*
|
2009-08-30 06:59:43 +00:00
|
|
|
* @addtogroup semaphores
|
2010-03-17 16:24:43 +00:00
|
|
|
* @details Semaphores related APIs and services.
|
2010-03-16 19:36:21 +00:00
|
|
|
*
|
|
|
|
* <h2>Operation mode</h2>
|
2010-03-17 16:24:43 +00:00
|
|
|
* Semaphores are a flexible synchronization primitive, ChibiOS/RT
|
|
|
|
* implements semaphores in their "counting semaphores" variant as
|
|
|
|
* defined by Edsger Dijkstra plus several enhancements like:
|
|
|
|
* - Wait operation with timeout.
|
|
|
|
* - Reset operation.
|
|
|
|
* - Atomic wait+signal operation.
|
|
|
|
* - Return message from the wait operation (OK, RESET, TIMEOUT).
|
|
|
|
* .
|
|
|
|
* The binary semaphores variant can be easily implemented using
|
|
|
|
* counting semaphores.<br>
|
|
|
|
* Operations defined for semaphores:
|
2010-03-16 19:36:21 +00:00
|
|
|
* - <b>Signal</b>: The semaphore counter is increased and if the
|
|
|
|
* result is non-positive then a waiting thread is removed from
|
|
|
|
* the semaphore queue and made ready for execution.
|
|
|
|
* - <b>Wait</b>: The semaphore counter is decreased and if the result
|
|
|
|
* becomes negative the thread is queued in the semaphore and
|
|
|
|
* suspended.
|
|
|
|
* - <b>Reset</b>: The semaphore counter is reset to a non-negative
|
|
|
|
* value and all the threads in the queue are released.
|
|
|
|
* .
|
2010-03-17 16:24:43 +00:00
|
|
|
* Semaphores can be used as guards for mutual exclusion zones
|
|
|
|
* (note that mutexes are recommended for this kind of use) but
|
2010-11-11 11:04:05 +00:00
|
|
|
* also have other uses, queues guards and counters for example.<br>
|
2010-03-16 19:36:21 +00:00
|
|
|
* Semaphores usually use a FIFO queuing strategy but it is possible
|
|
|
|
* to make them order threads by priority by enabling
|
2010-09-18 06:48:56 +00:00
|
|
|
* @p CH_USE_SEMAPHORES_PRIORITY in @p chconf.h.
|
|
|
|
* @pre In order to use the semaphore APIs the @p CH_USE_SEMAPHORES
|
2010-03-16 19:36:21 +00:00
|
|
|
* option must be enabled in @p chconf.h.
|
2009-08-16 13:07:24 +00:00
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2009-12-08 17:37:49 +00:00
|
|
|
#include "ch.h"
|
2009-08-16 13:07:24 +00:00
|
|
|
|
2010-09-18 06:48:56 +00:00
|
|
|
#if CH_USE_SEMAPHORES || defined(__DOXYGEN__)
|
2009-08-16 13:07:24 +00:00
|
|
|
|
|
|
|
#if CH_USE_SEMAPHORES_PRIORITY
|
|
|
|
#define sem_insert(tp, qp) prio_insert(tp, qp)
|
|
|
|
#else
|
|
|
|
#define sem_insert(tp, qp) queue_insert(tp, qp)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Initializes a semaphore with the specified counter value.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[out] sp pointer to a @p Semaphore structure
|
|
|
|
* @param[in] n initial value of the semaphore counter. Must be
|
|
|
|
* non-negative.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @init
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
void chSemInit(Semaphore *sp, cnt_t n) {
|
|
|
|
|
|
|
|
chDbgCheck((sp != NULL) && (n >= 0), "chSemInit");
|
|
|
|
|
|
|
|
queue_init(&sp->s_queue);
|
|
|
|
sp->s_cnt = n;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a reset operation on the semaphore.
|
2010-09-18 06:48:56 +00:00
|
|
|
* @post After invoking this function all the threads waiting on the
|
|
|
|
* semaphore, if any, are released and the semaphore counter is set
|
|
|
|
* to the specified, non negative, value.
|
2010-02-06 10:55:53 +00:00
|
|
|
* @note The released threads can recognize they were waked up by a reset
|
|
|
|
* rather than a signal because the @p chSemWait() will return
|
|
|
|
* @p RDY_RESET instead of @p RDY_OK.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
|
|
|
* @param[in] n the new value of the semaphore counter. The value must
|
|
|
|
* be non-negative.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
void chSemReset(Semaphore *sp, cnt_t n) {
|
|
|
|
|
|
|
|
chSysLock();
|
|
|
|
chSemResetI(sp, n);
|
|
|
|
chSchRescheduleS();
|
|
|
|
chSysUnlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a reset operation on the semaphore.
|
2010-09-18 06:48:56 +00:00
|
|
|
* @post After invoking this function all the threads waiting on the
|
|
|
|
* semaphore, if any, are released and the semaphore counter is set
|
|
|
|
* to the specified, non negative, value.
|
|
|
|
* @post This function does not reschedule so a call to a rescheduling
|
|
|
|
* function must be performed before unlocking the kernel. Note that
|
|
|
|
* interrupt handlers always reschedule on exit so an explicit
|
|
|
|
* reschedule must not be performed in ISRs.
|
2010-02-06 10:55:53 +00:00
|
|
|
* @note The released threads can recognize they were waked up by a reset
|
|
|
|
* rather than a signal because the @p chSemWait() will return
|
|
|
|
* @p RDY_RESET instead of @p RDY_OK.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
|
|
|
* @param[in] n the new value of the semaphore counter. The value must
|
|
|
|
* be non-negative.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
void chSemResetI(Semaphore *sp, cnt_t n) {
|
|
|
|
cnt_t cnt;
|
|
|
|
|
|
|
|
chDbgCheck((sp != NULL) && (n >= 0), "chSemResetI");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
|
|
|
"chSemResetI(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
cnt = sp->s_cnt;
|
|
|
|
sp->s_cnt = n;
|
2010-06-02 11:17:33 +00:00
|
|
|
while (++cnt <= 0)
|
2010-01-20 14:39:34 +00:00
|
|
|
chSchReadyI(lifo_remove(&sp->s_queue))->p_u.rdymsg = RDY_RESET;
|
2009-08-16 13:07:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a wait operation on a semaphore.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
2010-09-18 06:48:56 +00:00
|
|
|
* @return A message specifying how the invoking thread has been
|
|
|
|
* released from the semaphore.
|
|
|
|
* @retval RDY_OK if the thread has not stopped on the semaphore or the
|
|
|
|
* semaphore has been signaled.
|
|
|
|
* @retval RDY_RESET if the semaphore has been reset using @p chSemReset().
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
msg_t chSemWait(Semaphore *sp) {
|
|
|
|
msg_t msg;
|
|
|
|
|
|
|
|
chSysLock();
|
|
|
|
msg = chSemWaitS(sp);
|
|
|
|
chSysUnlock();
|
|
|
|
return msg;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a wait operation on a semaphore.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
2010-09-18 06:48:56 +00:00
|
|
|
* @return A message specifying how the invoking thread has been
|
|
|
|
* released from the semaphore.
|
|
|
|
* @retval RDY_OK if the thread has not stopped on the semaphore or the
|
|
|
|
* semaphore has been signaled.
|
|
|
|
* @retval RDY_RESET if the semaphore has been reset using @p chSemReset().
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @sclass
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
msg_t chSemWaitS(Semaphore *sp) {
|
|
|
|
|
|
|
|
chDbgCheck(sp != NULL, "chSemWaitS");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
|
|
|
"chSemWaitS(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
if (--sp->s_cnt < 0) {
|
2010-01-20 14:39:34 +00:00
|
|
|
currp->p_u.wtobjp = sp;
|
2010-02-28 12:47:06 +00:00
|
|
|
sem_insert(currp, &sp->s_queue);
|
2010-01-20 14:39:34 +00:00
|
|
|
chSchGoSleepS(THD_STATE_WTSEM);
|
|
|
|
return currp->p_u.rdymsg;
|
2009-08-16 13:07:24 +00:00
|
|
|
}
|
|
|
|
return RDY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a wait operation on a semaphore with timeout specification.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
|
|
|
* @param[in] time the number of ticks before the operation timeouts,
|
|
|
|
* the following special values are allowed:
|
|
|
|
* - @a TIME_IMMEDIATE immediate timeout.
|
|
|
|
* - @a TIME_INFINITE no timeout.
|
|
|
|
* .
|
2010-09-18 06:48:56 +00:00
|
|
|
* @return A message specifying how the invoking thread has been
|
|
|
|
* released from the semaphore.
|
|
|
|
* @retval RDY_OK if the thread has not stopped on the semaphore or the
|
|
|
|
* semaphore has been signaled.
|
|
|
|
* @retval RDY_RESET if the semaphore has been reset using @p chSemReset().
|
|
|
|
* @retval RDY_TIMEOUT if the semaphore has not been signaled or reset within
|
|
|
|
* the specified timeout.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
msg_t chSemWaitTimeout(Semaphore *sp, systime_t time) {
|
|
|
|
msg_t msg;
|
|
|
|
|
|
|
|
chSysLock();
|
|
|
|
msg = chSemWaitTimeoutS(sp, time);
|
|
|
|
chSysUnlock();
|
|
|
|
return msg;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a wait operation on a semaphore with timeout specification.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
|
|
|
* @param[in] time the number of ticks before the operation timeouts,
|
|
|
|
* the following special values are allowed:
|
|
|
|
* - @a TIME_IMMEDIATE immediate timeout.
|
|
|
|
* - @a TIME_INFINITE no timeout.
|
|
|
|
* .
|
2010-09-18 06:48:56 +00:00
|
|
|
* @return A message specifying how the invoking thread has been
|
|
|
|
* released from the semaphore.
|
|
|
|
* @retval RDY_OK if the thread has not stopped on the semaphore or the
|
|
|
|
* semaphore has been signaled.
|
|
|
|
* @retval RDY_RESET if the semaphore has been reset using @p chSemReset().
|
|
|
|
* @retval RDY_TIMEOUT if the semaphore has not been signaled or reset within
|
|
|
|
* the specified timeout.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @sclass
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
msg_t chSemWaitTimeoutS(Semaphore *sp, systime_t time) {
|
|
|
|
|
|
|
|
chDbgCheck(sp != NULL, "chSemWaitTimeoutS");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
|
|
|
"chSemWaitTimeoutS(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
if (--sp->s_cnt < 0) {
|
|
|
|
if (TIME_IMMEDIATE == time) {
|
|
|
|
sp->s_cnt++;
|
|
|
|
return RDY_TIMEOUT;
|
|
|
|
}
|
2010-01-20 14:39:34 +00:00
|
|
|
currp->p_u.wtobjp = sp;
|
2010-02-28 12:34:11 +00:00
|
|
|
sem_insert(currp, &sp->s_queue);
|
2010-01-20 14:39:34 +00:00
|
|
|
return chSchGoSleepTimeoutS(THD_STATE_WTSEM, time);
|
2009-08-16 13:07:24 +00:00
|
|
|
}
|
|
|
|
return RDY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a signal operation on a semaphore.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
void chSemSignal(Semaphore *sp) {
|
|
|
|
|
|
|
|
chDbgCheck(sp != NULL, "chSemSignal");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
|
|
|
"chSemSignal(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
chSysLock();
|
2010-06-02 11:17:33 +00:00
|
|
|
if (++sp->s_cnt <= 0)
|
2009-08-16 13:07:24 +00:00
|
|
|
chSchWakeupS(fifo_remove(&sp->s_queue), RDY_OK);
|
|
|
|
chSysUnlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs a signal operation on a semaphore.
|
2010-09-18 06:48:56 +00:00
|
|
|
* @post This function does not reschedule so a call to a rescheduling
|
|
|
|
* function must be performed before unlocking the kernel. Note that
|
|
|
|
* interrupt handlers always reschedule on exit so an explicit
|
|
|
|
* reschedule must not be performed in ISRs.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
void chSemSignalI(Semaphore *sp) {
|
|
|
|
|
|
|
|
chDbgCheck(sp != NULL, "chSemSignalI");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
|
|
|
"chSemSignalI(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2010-06-02 11:17:33 +00:00
|
|
|
if (++sp->s_cnt <= 0) {
|
2010-02-06 10:55:53 +00:00
|
|
|
/* note, it is done this way in order to allow a tail call on
|
2009-08-16 13:07:24 +00:00
|
|
|
chSchReadyI().*/
|
|
|
|
Thread *tp = fifo_remove(&sp->s_queue);
|
2010-01-20 14:39:34 +00:00
|
|
|
tp->p_u.rdymsg = RDY_OK;
|
2009-08-16 13:07:24 +00:00
|
|
|
chSchReadyI(tp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-01-02 10:13:43 +00:00
|
|
|
/**
|
2011-04-09 15:10:15 +00:00
|
|
|
* @brief Adds the specified value to the semaphore counter.
|
2011-01-02 10:13:43 +00:00
|
|
|
* @post This function does not reschedule so a call to a rescheduling
|
|
|
|
* function must be performed before unlocking the kernel. Note that
|
|
|
|
* interrupt handlers always reschedule on exit so an explicit
|
|
|
|
* reschedule must not be performed in ISRs.
|
|
|
|
*
|
|
|
|
* @param[in] sp pointer to a @p Semaphore structure
|
2011-04-09 15:10:15 +00:00
|
|
|
* @param[in] n value to be added to the semaphore counter. The value
|
|
|
|
* must be positive.
|
2011-01-02 10:13:43 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2011-04-09 15:10:15 +00:00
|
|
|
void chSemAddCounterI(Semaphore *sp, cnt_t n) {
|
2011-01-02 10:13:43 +00:00
|
|
|
|
2011-04-09 15:10:15 +00:00
|
|
|
chDbgCheck((sp != NULL) && (n > 0), "chSemAddCounterI");
|
2011-01-02 10:13:43 +00:00
|
|
|
|
|
|
|
chDbgAssert(((sp->s_cnt >= 0) && isempty(&sp->s_queue)) ||
|
|
|
|
((sp->s_cnt < 0) && notempty(&sp->s_queue)),
|
2011-04-09 15:10:15 +00:00
|
|
|
"chSemAddCounterI(), #1",
|
2011-01-02 10:13:43 +00:00
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2011-04-09 15:10:15 +00:00
|
|
|
while (n > 0) {
|
|
|
|
if (++sp->s_cnt <= 0)
|
|
|
|
chSchReadyI(fifo_remove(&sp->s_queue))->p_u.rdymsg = RDY_OK;
|
|
|
|
n--;
|
|
|
|
}
|
2011-01-02 10:13:43 +00:00
|
|
|
}
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
#if CH_USE_SEMSW
|
|
|
|
/**
|
2010-02-06 10:55:53 +00:00
|
|
|
* @brief Performs atomic signal and wait operations on two semaphores.
|
2010-09-18 06:48:56 +00:00
|
|
|
* @pre The configuration option @p CH_USE_SEMSW must be enabled in order
|
|
|
|
* to use this function.
|
2009-08-16 13:07:24 +00:00
|
|
|
*
|
2010-02-06 10:55:53 +00:00
|
|
|
* @param[in] sps pointer to a @p Semaphore structure to be signaled
|
|
|
|
* @param[in] spw pointer to a @p Semaphore structure to be wait on
|
2010-09-18 06:48:56 +00:00
|
|
|
* @return A message specifying how the invoking thread has been
|
|
|
|
* released from the semaphore.
|
|
|
|
* @retval RDY_OK if the thread has not stopped on the semaphore or the
|
|
|
|
* semaphore has been signaled.
|
|
|
|
* @retval RDY_RESET if the semaphore has been reset using @p chSemReset().
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2009-08-16 13:07:24 +00:00
|
|
|
*/
|
|
|
|
msg_t chSemSignalWait(Semaphore *sps, Semaphore *spw) {
|
|
|
|
msg_t msg;
|
|
|
|
|
|
|
|
chDbgCheck((sps != NULL) && (spw != NULL), "chSemSignalWait");
|
|
|
|
|
2010-08-28 14:32:56 +00:00
|
|
|
chDbgAssert(((sps->s_cnt >= 0) && isempty(&sps->s_queue)) ||
|
|
|
|
((sps->s_cnt < 0) && notempty(&sps->s_queue)),
|
|
|
|
"chSemSignalWait(), #1",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
|
|
|
chDbgAssert(((spw->s_cnt >= 0) && isempty(&spw->s_queue)) ||
|
|
|
|
((spw->s_cnt < 0) && notempty(&spw->s_queue)),
|
|
|
|
"chSemSignalWait(), #2",
|
|
|
|
"inconsistent semaphore");
|
|
|
|
|
2009-08-16 13:07:24 +00:00
|
|
|
chSysLock();
|
2010-06-02 11:17:33 +00:00
|
|
|
if (++sps->s_cnt <= 0)
|
2010-01-20 14:39:34 +00:00
|
|
|
chSchReadyI(fifo_remove(&sps->s_queue))->p_u.rdymsg = RDY_OK;
|
2009-08-16 13:07:24 +00:00
|
|
|
if (--spw->s_cnt < 0) {
|
2010-02-28 12:43:12 +00:00
|
|
|
Thread *ctp = currp;
|
|
|
|
sem_insert(ctp, &spw->s_queue);
|
|
|
|
ctp->p_u.wtobjp = spw;
|
2010-01-20 14:39:34 +00:00
|
|
|
chSchGoSleepS(THD_STATE_WTSEM);
|
2010-02-28 12:43:12 +00:00
|
|
|
msg = ctp->p_u.rdymsg;
|
2009-08-16 13:07:24 +00:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
chSchRescheduleS();
|
|
|
|
msg = RDY_OK;
|
|
|
|
}
|
|
|
|
chSysUnlock();
|
|
|
|
return msg;
|
|
|
|
}
|
|
|
|
#endif /* CH_USE_SEMSW */
|
|
|
|
|
|
|
|
#endif /* CH_USE_SEMAPHORES */
|
|
|
|
|
|
|
|
/** @} */
|