2015-12-24 14:33:20 -05:00
|
|
|
/**
|
|
|
|
* @file
|
2016-09-23 12:08:21 -04:00
|
|
|
* @ingroup qxk
|
|
|
|
* @brief QXMutex_init(), QXMutex_lock and QXMutex_unlock() definitions.
|
2015-12-24 14:33:20 -05:00
|
|
|
* @cond
|
|
|
|
******************************************************************************
|
2017-08-21 18:20:16 -04:00
|
|
|
* Last updated for version 5.9.7
|
|
|
|
* Last updated on 2017-08-20
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* Q u a n t u m L e a P s
|
|
|
|
* ---------------------------
|
|
|
|
* innovating embedded systems
|
|
|
|
*
|
|
|
|
* Copyright (C) Quantum Leaps, LLC. All rights reserved.
|
|
|
|
*
|
|
|
|
* This program is open source 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.
|
|
|
|
*
|
|
|
|
* Alternatively, this program may be distributed and modified under the
|
|
|
|
* terms of Quantum Leaps commercial licenses, which expressly supersede
|
|
|
|
* the GNU General Public License and are specifically designed for
|
|
|
|
* licensees interested in retaining the proprietary status of their code.
|
|
|
|
*
|
|
|
|
* This program 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/>.
|
|
|
|
*
|
|
|
|
* Contact information:
|
2017-05-17 13:16:32 -04:00
|
|
|
* https://state-machine.com
|
2015-12-24 14:33:20 -05:00
|
|
|
* mailto:info@state-machine.com
|
|
|
|
******************************************************************************
|
|
|
|
* @endcond
|
|
|
|
*/
|
|
|
|
#define QP_IMPL /* this is QP implementation */
|
|
|
|
#include "qf_port.h" /* QF port */
|
2015-12-31 14:55:40 -05:00
|
|
|
#include "qxk_pkg.h" /* QXK package-scope interface */
|
2015-12-24 14:33:20 -05:00
|
|
|
#include "qassert.h" /* QP embedded systems-friendly assertions */
|
|
|
|
#ifdef Q_SPY /* QS software tracing enabled? */
|
|
|
|
#include "qs_port.h" /* include QS port */
|
|
|
|
#else
|
|
|
|
#include "qs_dummy.h" /* disable the QS software tracing */
|
|
|
|
#endif /* Q_SPY */
|
|
|
|
|
2015-12-31 14:55:40 -05:00
|
|
|
/* protection against including this source file in a wrong project */
|
|
|
|
#ifndef qxk_h
|
|
|
|
#error "Source file included in a project NOT based on the QXK kernel"
|
|
|
|
#endif /* qxk_h */
|
2015-12-24 14:33:20 -05:00
|
|
|
|
|
|
|
Q_DEFINE_THIS_MODULE("qxk_mutex")
|
|
|
|
|
|
|
|
/****************************************************************************/
|
|
|
|
/**
|
|
|
|
* @description
|
2017-08-21 18:20:16 -04:00
|
|
|
* Initialize the QXK priority ceiling mutex.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* @param[in,out] me pointer (see @ref oop)
|
2017-08-21 18:20:16 -04:00
|
|
|
* @param[in] ceiling ceiling priotity of the mutex
|
2016-03-30 18:50:33 -04:00
|
|
|
*
|
2017-08-21 18:20:16 -04:00
|
|
|
* @note The ceiling priority must be unused by any thread. The ceiling
|
|
|
|
* priority must be higher than priority of any thread that uses the
|
|
|
|
* protected resource.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* @usage
|
|
|
|
* @include qxk_mux.c
|
|
|
|
*/
|
2017-08-21 18:20:16 -04:00
|
|
|
void QXMutex_init(QXMutex * const me, uint_fast8_t ceiling) {
|
|
|
|
QF_CRIT_STAT_
|
|
|
|
|
|
|
|
QF_CRIT_ENTRY_();
|
|
|
|
/** @pre the celiling priority of the mutex must:
|
|
|
|
* - not be zero;
|
|
|
|
* - cannot exceed the maximum #QF_MAX_ACTIVE;
|
|
|
|
* - the ceiling priority of the mutex must not be already in use;
|
|
|
|
* (QF requires priority to be **unique**).
|
|
|
|
*/
|
|
|
|
Q_REQUIRE_ID(100, ((uint_fast8_t)0 < ceiling)
|
|
|
|
&& (ceiling <= (uint_fast8_t)QF_MAX_ACTIVE)
|
|
|
|
&& (QF_active_[ceiling] == (QActive *)0));
|
|
|
|
|
|
|
|
me->ceiling = ceiling;
|
|
|
|
me->lockNest = (uint_fast8_t)0;
|
|
|
|
QF_bzero(&me->waitSet, (uint_fast16_t)sizeof(me->waitSet));
|
|
|
|
|
|
|
|
/* reserve the ceiling priority level for this mutex */
|
|
|
|
QF_active_[ceiling] = (QActive *)me;
|
|
|
|
|
|
|
|
QF_CRIT_EXIT_();
|
2015-12-24 14:33:20 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************/
|
|
|
|
/**
|
|
|
|
* @description
|
2017-08-21 18:20:16 -04:00
|
|
|
* Lock the QXK priority ceiling mutex ::QXMutex.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* @param[in,out] me pointer (see @ref oop)
|
2017-08-21 18:20:16 -04:00
|
|
|
* @param[in] nTicks number of clock ticks (at the associated rate)
|
|
|
|
* to wait for the semaphore. The value of
|
|
|
|
* QXTHREAD_NO_TIMEOUT indicates that no timeout will
|
|
|
|
* occur and the semaphore will wait indefinitely.
|
|
|
|
* @returns
|
|
|
|
* 'true' if the mutex has been acquired and 'false' if a timeout occured.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
2016-03-30 18:50:33 -04:00
|
|
|
* @note
|
2017-08-21 18:20:16 -04:00
|
|
|
* The mutex locks are allowed to nest, meaning that the same extended thread
|
|
|
|
* can lock the same mutex multiple times (<= 225). However, each call to
|
|
|
|
* QXMutex_lock() must be ballanced by the matching call to QXMutex_unlock().
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* @usage
|
|
|
|
* @include qxk_mux.c
|
|
|
|
*/
|
2017-08-21 18:20:16 -04:00
|
|
|
bool QXMutex_lock(QXMutex * const me,
|
|
|
|
uint_fast16_t const nTicks)
|
|
|
|
{
|
|
|
|
QXThread *thr;
|
2015-12-24 14:33:20 -05:00
|
|
|
QF_CRIT_STAT_
|
2017-08-21 18:20:16 -04:00
|
|
|
|
2015-12-24 14:33:20 -05:00
|
|
|
QF_CRIT_ENTRY_();
|
2017-08-21 18:20:16 -04:00
|
|
|
thr = (QXThread *)QXK_attr_.curr;
|
2015-12-24 14:33:20 -05:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
/** @pre this function must:
|
|
|
|
* - NOT be called from an ISR;
|
|
|
|
* - be called from an extended thread;
|
|
|
|
* - the thread priority must be below the ceiling of the mutex;
|
|
|
|
* - the thread must NOT be holding a scheduler lock;
|
|
|
|
* - the thread must NOT be already blocked on any object.
|
2016-04-01 10:02:43 -04:00
|
|
|
*/
|
2017-08-21 18:20:16 -04:00
|
|
|
Q_REQUIRE_ID(200, (!QXK_ISR_CONTEXT_()) /* don't call from an ISR! */
|
|
|
|
&& (thr != (QXThread *)0) /* current thread must be extended */
|
|
|
|
&& (thr->super.startPrio < me->ceiling) /* prio below the ceiling */
|
|
|
|
&& (QXK_attr_.lockHolder != thr->super.prio) /* not holding a lock */
|
|
|
|
&& (thr->super.super.temp.obj == (QMState *)0)); /* not blocked */
|
|
|
|
|
|
|
|
/* is the mutex available? */
|
|
|
|
if (me->lockNest == (uint_fast8_t)0) {
|
|
|
|
me->lockNest = (uint_fast8_t)1;
|
|
|
|
|
|
|
|
/* the priority slot must be set to this mutex */
|
|
|
|
Q_ASSERT_ID(210, QF_active_[me->ceiling] == (QActive *)me);
|
2016-03-30 18:50:33 -04:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
/* switch the priority of this thread to the mutex ceiling */
|
|
|
|
thr->super.prio = me->ceiling;
|
|
|
|
QF_active_[me->ceiling] = &thr->super;
|
2016-03-30 18:50:33 -04:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
QPSet_remove(&QXK_attr_.readySet, thr->super.startPrio);
|
|
|
|
QPSet_insert(&QXK_attr_.readySet, thr->super.prio);
|
|
|
|
|
|
|
|
QS_BEGIN_NOCRIT_(QS_MUTEX_LOCK, (void *)0, (void *)0)
|
|
|
|
QS_TIME_(); /* timestamp */
|
|
|
|
QS_2U8_((uint8_t)thr->super.startPrio, /* the start prio */
|
|
|
|
(uint8_t)thr->super.prio); /* the current ceiling */
|
|
|
|
QS_END_NOCRIT_()
|
|
|
|
}
|
|
|
|
/* is the mutex locked by this thread already (nested locking)? */
|
|
|
|
else if (QF_active_[me->ceiling] == &thr->super) {
|
|
|
|
|
|
|
|
/* the nesting level must not exceed 0xFF */
|
|
|
|
Q_ASSERT_ID(220, me->lockNest < (uint_fast8_t)0xFF);
|
|
|
|
|
|
|
|
++me->lockNest;
|
2015-12-24 14:33:20 -05:00
|
|
|
}
|
2017-08-21 18:20:16 -04:00
|
|
|
else { /* the mutex is alredy locked by a different thread */
|
2016-03-30 18:50:33 -04:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
/* the prio slot must be claimed by the thread holding the mutex */
|
|
|
|
Q_ASSERT_ID(230, (QF_active_[me->ceiling] != (QActive *)0));
|
2016-03-30 18:50:33 -04:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
/* remove this thr prio from the ready set (block)
|
|
|
|
* and insert to the waiting set on this mutex */
|
|
|
|
QPSet_remove(&QXK_attr_.readySet, thr->super.prio);
|
|
|
|
QPSet_insert(&me->waitSet, thr->super.prio);
|
|
|
|
|
|
|
|
/* store the blocking object (this mutex) */
|
|
|
|
thr->super.super.temp.obj = (QMState *)me;
|
|
|
|
QXThread_teArm_(thr, (QSignal)QXK_SEMA_SIG, nTicks);
|
|
|
|
|
|
|
|
/* schedule the next thread if multitasking started */
|
|
|
|
(void)QXK_sched_();
|
|
|
|
QF_CRIT_EXIT_();
|
|
|
|
QF_CRIT_EXIT_NOP(); /* BLOCK here */
|
|
|
|
|
|
|
|
QF_CRIT_ENTRY_();
|
|
|
|
/* the blocking object must be this mutex */
|
|
|
|
Q_ASSERT_ID(240, thr->super.super.temp.obj == (QMState *)me);
|
|
|
|
thr->super.super.temp.obj = (QMState const *)0; /* clear */
|
|
|
|
}
|
2015-12-24 14:33:20 -05:00
|
|
|
QF_CRIT_EXIT_();
|
2017-08-21 18:20:16 -04:00
|
|
|
|
|
|
|
/* signal of non-zero means that the time event has not expired */
|
|
|
|
return (bool)(thr->timeEvt.super.sig != (QSignal)0);
|
2015-12-24 14:33:20 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************/
|
|
|
|
/**
|
|
|
|
* @description
|
2017-08-21 18:20:16 -04:00
|
|
|
* Try to lock the QXK priority ceiling mutex ::QXMutex.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
2017-08-21 18:20:16 -04:00
|
|
|
* @param[in,out] me pointer (see @ref oop)
|
2016-03-30 18:50:33 -04:00
|
|
|
*
|
2017-08-21 18:20:16 -04:00
|
|
|
* @returns
|
|
|
|
* 'true' if the mutex was successfully locked and 'false' if the mutex was
|
|
|
|
* unavailable and was NOT locked.
|
2016-03-30 18:50:33 -04:00
|
|
|
*
|
|
|
|
* @note
|
2017-08-21 18:20:16 -04:00
|
|
|
* This function **can** be called from both basic threads (active objects)
|
|
|
|
* and extended threads.
|
2016-09-29 18:08:33 -04:00
|
|
|
*
|
|
|
|
* @note
|
2017-08-21 18:20:16 -04:00
|
|
|
* The mutex locks are allowed to nest, meaning that the same extended thread
|
|
|
|
* can lock the same mutex multiple times (<= 225). However, each successful
|
|
|
|
* call to QXMutex_tryLock() must be ballanced by the matching call to
|
|
|
|
* QXMutex_unlock().
|
|
|
|
*/
|
|
|
|
bool QXMutex_tryLock(QXMutex * const me) {
|
|
|
|
QActive *curr;
|
|
|
|
QF_CRIT_STAT_
|
|
|
|
|
|
|
|
QF_CRIT_ENTRY_();
|
|
|
|
curr = (QActive *)QXK_attr_.curr;
|
|
|
|
if (curr == (QActive *)0) { /* called from a basic thread? */
|
|
|
|
curr = QF_active_[QXK_attr_.actPrio];
|
|
|
|
}
|
|
|
|
|
|
|
|
/** @pre this function must:
|
|
|
|
* - NOT be called from an ISR;
|
|
|
|
* - the QXK kernel must be running;
|
|
|
|
* - the calling thread must be valid;
|
|
|
|
* - the thread priority must be below the ceiling of the mutex;
|
|
|
|
* - the thread must NOT be holding a scheduler lock;
|
|
|
|
*/
|
|
|
|
Q_REQUIRE_ID(300, (!QXK_ISR_CONTEXT_()) /* don't call from an ISR! */
|
|
|
|
&& (QXK_attr_.lockPrio <= (uint_fast8_t)QF_MAX_ACTIVE)
|
|
|
|
&& (curr != (QActive *)0) /* current thread must be valid */
|
|
|
|
&& (curr->startPrio < me->ceiling) /* prio below the ceiling */
|
|
|
|
&& (curr->prio != QXK_attr_.lockHolder)); /* not holding a lock */
|
|
|
|
|
|
|
|
/* is the mutex available? */
|
|
|
|
if (me->lockNest == (uint_fast8_t)0) {
|
|
|
|
me->lockNest = (uint_fast8_t)1;
|
|
|
|
|
|
|
|
/* the priority slot must be set to this mutex */
|
|
|
|
Q_ASSERT_ID(310, QF_active_[me->ceiling] == (QActive *)me);
|
|
|
|
|
|
|
|
/* switch the priority of this thread to the mutex ceiling */
|
|
|
|
curr->prio = me->ceiling;
|
|
|
|
QF_active_[me->ceiling] = curr;
|
|
|
|
|
|
|
|
QPSet_remove(&QXK_attr_.readySet, curr->startPrio);
|
|
|
|
QPSet_insert(&QXK_attr_.readySet, curr->prio);
|
|
|
|
|
|
|
|
QS_BEGIN_NOCRIT_(QS_MUTEX_LOCK, (void *)0, (void *)0)
|
|
|
|
QS_TIME_(); /* timestamp */
|
|
|
|
QS_2U8_((uint8_t)curr->startPrio, /* the start prio */
|
|
|
|
(uint8_t)curr->prio); /* the current ceiling */
|
|
|
|
QS_END_NOCRIT_()
|
|
|
|
}
|
|
|
|
/* is the mutex locked by this thread already (nested locking)? */
|
|
|
|
else if (QF_active_[me->ceiling] == curr) {
|
|
|
|
/* the nesting level must not exceed 0xFF */
|
|
|
|
Q_ASSERT_ID(320, me->lockNest < (uint_fast8_t)0xFF);
|
|
|
|
++me->lockNest;
|
|
|
|
}
|
|
|
|
else { /* the mutex is alredy locked by a different thread */
|
|
|
|
/* the prio slot must be claimed by the thread holding the mutex */
|
|
|
|
Q_ASSERT_ID(330, (QF_active_[me->ceiling] != (QActive *)0));
|
|
|
|
curr = (QActive *)0; /* this means that the mutex is NOT available */
|
|
|
|
}
|
|
|
|
QF_CRIT_EXIT_();
|
|
|
|
|
|
|
|
return (curr != (QActive *)0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************/
|
|
|
|
/**
|
|
|
|
* @description
|
|
|
|
* Unlock the QXK priority ceiling mutex.
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
2017-08-21 18:20:16 -04:00
|
|
|
* @param[in,out] me pointer (see @ref oop)
|
2016-09-29 18:08:33 -04:00
|
|
|
*
|
2017-08-21 18:20:16 -04:00
|
|
|
* @note
|
|
|
|
* This function **can** be called from both basic threads (active objects)
|
|
|
|
* and extended threads.
|
|
|
|
*
|
|
|
|
* @note
|
|
|
|
* The mutex locks are allowed to nest, meaning that the same extended thread
|
|
|
|
* can lock the same mutex multiple times (<= 225). However, each call to
|
|
|
|
* QXMutex_lock() or a _successfull_ call to QXMutex_tryLock() must be
|
|
|
|
* ballanced by the matching call to QXMutex_unlock().
|
2015-12-24 14:33:20 -05:00
|
|
|
*
|
|
|
|
* @usage
|
|
|
|
* @include qxk_mux.c
|
|
|
|
*/
|
2016-04-01 10:02:43 -04:00
|
|
|
void QXMutex_unlock(QXMutex * const me) {
|
2017-08-21 18:20:16 -04:00
|
|
|
QActive *curr;
|
2015-12-24 14:33:20 -05:00
|
|
|
QF_CRIT_STAT_
|
2017-08-21 18:20:16 -04:00
|
|
|
|
2015-12-24 14:33:20 -05:00
|
|
|
QF_CRIT_ENTRY_();
|
2017-08-21 18:20:16 -04:00
|
|
|
curr = (QActive *)QXK_attr_.curr;
|
|
|
|
if (curr == (QActive *)0) { /* called from a basic thread? */
|
|
|
|
curr = QF_active_[QXK_attr_.actPrio];
|
|
|
|
}
|
2015-12-24 14:33:20 -05:00
|
|
|
|
2017-08-21 18:20:16 -04:00
|
|
|
/** @pre this function must:
|
|
|
|
* - NOT be called from an ISR;
|
|
|
|
* - the calling thread must be valid;
|
|
|
|
* - the mutex must be held by this thread;
|
|
|
|
* - the holding thread must have priority equal to the mutex ceiling;
|
|
|
|
* - the mutex must be already locked at least once.
|
2016-04-01 10:02:43 -04:00
|
|
|
*/
|
2017-08-21 18:20:16 -04:00
|
|
|
Q_REQUIRE_ID(400, (!QXK_ISR_CONTEXT_()) /* don't call from an ISR! */
|
|
|
|
&& (curr != (QActive *)0) /* current thread must be valid */
|
|
|
|
&& (curr == QF_active_[me->ceiling]) /* held by this thr */
|
|
|
|
&& (curr->prio == me->ceiling) /* thr prio at the ceiling */
|
|
|
|
&& (me->lockNest > (uint_fast8_t)0)); /* locked at least once */
|
|
|
|
|
|
|
|
/* is this the last nesting level? */
|
|
|
|
if (me->lockNest == (uint_fast8_t)1) {
|
|
|
|
|
|
|
|
/* restore the holding thread's priority to the original */
|
|
|
|
curr->prio = curr->startPrio;
|
|
|
|
|
|
|
|
/* remove the boosted priority and insert the original priority */
|
|
|
|
QPSet_remove(&QXK_attr_.readySet, me->ceiling);
|
|
|
|
QPSet_insert(&QXK_attr_.readySet, curr->startPrio);
|
|
|
|
|
|
|
|
QS_BEGIN_NOCRIT_(QS_MUTEX_UNLOCK, (void *)0, (void *)0)
|
|
|
|
QS_TIME_(); /* timestamp */
|
|
|
|
QS_2U8_((uint8_t)curr->startPrio, /* the start priority */
|
|
|
|
(uint8_t)me->ceiling); /* the mutex ceiling */
|
2017-07-28 22:53:23 -04:00
|
|
|
QS_END_NOCRIT_()
|
2017-08-21 18:20:16 -04:00
|
|
|
|
|
|
|
/* are any other threads waiting for this mutex? */
|
|
|
|
if (QPSet_notEmpty(&me->waitSet)) {
|
|
|
|
uint_fast8_t p;
|
|
|
|
QXThread *thr;
|
|
|
|
|
|
|
|
/* find the highest-priority waiting thread */
|
|
|
|
QPSet_findMax(&me->waitSet, p);
|
|
|
|
thr = (QXThread *)QF_active_[p];
|
|
|
|
|
|
|
|
/* the waiting thread must:
|
|
|
|
* (1) have priority below the ceiling
|
|
|
|
* (2) be extended
|
|
|
|
* (3) not be redy to run
|
|
|
|
* (4) have still the start priority
|
|
|
|
* (5) be blocked on this mutex
|
|
|
|
*/
|
|
|
|
Q_ASSERT_ID(410, (p < me->ceiling)
|
|
|
|
&& (thr != (QXThread *)0) /* extended thread */
|
|
|
|
&& (!QPSet_hasElement(&QXK_attr_.readySet, p))
|
|
|
|
&& (thr->super.prio == thr->super.startPrio)
|
|
|
|
&& (thr->super.super.temp.obj == (QMState *)me));
|
|
|
|
|
|
|
|
/* disarm the internal time event */
|
|
|
|
(void)QXThread_teDisarm_(thr);
|
|
|
|
|
|
|
|
/* this thread is no longer waiting for the mutex */
|
|
|
|
QPSet_remove(&me->waitSet, p);
|
|
|
|
|
|
|
|
/* switch the priority of this thread to the mutex ceiling */
|
|
|
|
thr->super.prio = me->ceiling;
|
|
|
|
QF_active_[me->ceiling] = &thr->super;
|
|
|
|
|
|
|
|
/* make the thread ready to run (at the ceiling prio) */
|
|
|
|
QPSet_insert(&QXK_attr_.readySet, thr->super.prio);
|
|
|
|
|
|
|
|
QS_BEGIN_NOCRIT_(QS_MUTEX_LOCK, (void *)0, (void *)0)
|
|
|
|
QS_TIME_(); /* timestamp */
|
|
|
|
QS_2U8_((uint8_t)thr->super.startPrio, /* start priority */
|
|
|
|
(uint8_t)thr->super.prio); /* ceiling priority */
|
|
|
|
QS_END_NOCRIT_()
|
2015-12-24 14:33:20 -05:00
|
|
|
}
|
2017-08-21 18:20:16 -04:00
|
|
|
else { /* no threads are waiting for this mutex */
|
|
|
|
me->lockNest = (uint_fast8_t)0;
|
|
|
|
|
|
|
|
/* put the mutex at the priority ceiling slot */
|
|
|
|
QF_active_[me->ceiling] = (QActive *)me;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* schedule the next thread if multitasking started */
|
|
|
|
if (QXK_sched_() != (uint_fast8_t)0) {
|
|
|
|
QXK_activate_(); /* activate a basic thread */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else { /* releasing the */
|
|
|
|
--me->lockNest; /* release one level */
|
2015-12-24 14:33:20 -05:00
|
|
|
}
|
|
|
|
QF_CRIT_EXIT_();
|
|
|
|
}
|