mirror of
https://github.com/QuantumLeaps/qpc.git
synced 2025-01-28 07:03:10 +08:00
304 lines
11 KiB
C
304 lines
11 KiB
C
/**
|
|
* @file
|
|
* @brief QF/C, port to ThreadX
|
|
* @ingroup ports
|
|
* @cond
|
|
******************************************************************************
|
|
* Last updated for version 6.0.4
|
|
* Last updated on 2018-01-09
|
|
*
|
|
* 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:
|
|
* https://state-machine.com
|
|
* mailto:info@state-machine.com
|
|
******************************************************************************
|
|
* @endcond
|
|
*/
|
|
#define QP_IMPL /* this is QP implementation */
|
|
#include "qf_port.h" /* QF port */
|
|
#include "qf_pkg.h"
|
|
#include "qassert.h"
|
|
#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 */
|
|
|
|
Q_DEFINE_THIS_MODULE("qf_port")
|
|
|
|
/*..........................................................................*/
|
|
void QF_init(void) {
|
|
}
|
|
/*..........................................................................*/
|
|
int_t QF_run(void) {
|
|
QF_onStartup();
|
|
return (int_t)0; /* return success */
|
|
}
|
|
/*..........................................................................*/
|
|
void QF_stop(void) {
|
|
QF_onCleanup(); /* cleanup callback */
|
|
}
|
|
/*..........................................................................*/
|
|
static void thread_function(ULONG thread_input) { /* ThreadX signature */
|
|
QActive *act = (QActive *)thread_input;
|
|
|
|
act->osObject = (uint8_t)1; /* enable event-loop (see QActive_stop()) */
|
|
while (act->osObject) { /* event-loop */
|
|
QEvt const *e = QActive_get_(act);
|
|
QHSM_DISPATCH(&act->super, e);
|
|
QF_gc(e); /* check if the event is garbage, and collect it if so */
|
|
}
|
|
|
|
QActive_unsubscribeAll(act); /* unsubscribe from all events */
|
|
QF_remove_(act); /* remove this active object from QF */
|
|
|
|
/* cleanup of the queue and thread must succeed */
|
|
Q_ALLEGE_ID(110, tx_queue_delete(&act->eQueue) == TX_SUCCESS);
|
|
Q_ALLEGE_ID(120, tx_thread_delete(&act->thread) == TX_SUCCESS);
|
|
}
|
|
/*..........................................................................*/
|
|
void QActive_start_(QActive * const me, uint_fast8_t prio,
|
|
QEvt const *qSto[], uint_fast16_t qLen,
|
|
void *stkSto, uint_fast16_t stkSize,
|
|
QEvt const *ie)
|
|
{
|
|
UINT tx_prio; /* ThreadX priority corresponding to the QF priority prio */
|
|
|
|
/* allege that the ThreadX queue is created successfully */
|
|
Q_ALLEGE_ID(210,
|
|
tx_queue_create(&me->eQueue,
|
|
(CHAR *)"AO",
|
|
TX_1_ULONG,
|
|
(VOID *)qSto,
|
|
(ULONG)(qLen * sizeof(ULONG)))
|
|
== TX_SUCCESS);
|
|
|
|
me->prio = prio; /* save the QF priority */
|
|
QF_add_(me); /* make QF aware of this active object */
|
|
QHSM_INIT(&me->super, ie); /* take the top-most initial tran. */
|
|
QS_FLUSH(); /* flush the trace buffer to the host */
|
|
|
|
/* convert QF priority to the ThreadX priority */
|
|
tx_prio = QF_TX_PRIO_OFFSET + QF_MAX_ACTIVE - prio;
|
|
|
|
Q_ALLEGE_ID(220,
|
|
tx_thread_create(
|
|
&me->thread, /* ThreadX thread control block */
|
|
(CHAR *)"AO", /* thread name */
|
|
&thread_function, /* thread function */
|
|
(ULONG)me, /* thread parameter */
|
|
stkSto, /* stack start */
|
|
stkSize, /* stack size in bytes */
|
|
tx_prio, /* ThreadX priority */
|
|
tx_prio, /* preemption threshold disabled (same as priority) */
|
|
TX_NO_TIME_SLICE,
|
|
TX_AUTO_START)
|
|
== TX_SUCCESS);
|
|
}
|
|
/*..........................................................................*/
|
|
void QActive_stop(QActive * const me) {
|
|
me->osObject = (uint8_t)0; /* stop the thread loop */
|
|
}
|
|
/*..........................................................................*/
|
|
#ifndef Q_SPY
|
|
bool QActive_post_(QActive * const me, QEvt const * const e,
|
|
uint_fast16_t const margin)
|
|
#else
|
|
bool QActive_post_(QActive * const me, QEvt const * const e,
|
|
uint_fast16_t const margin, void const * const sender)
|
|
#endif /* Q_SPY */
|
|
{
|
|
uint_fast16_t nFree;
|
|
bool status;
|
|
QF_CRIT_STAT_
|
|
|
|
QF_CRIT_ENTRY_();
|
|
nFree = (uint_fast16_t)me->eQueue.tx_queue_available_storage;
|
|
|
|
if (margin == QF_NO_MARGIN) {
|
|
if (nFree > (QEQueueCtr)0) {
|
|
status = true; /* can post */
|
|
}
|
|
else {
|
|
status = false; /* cannot post */
|
|
Q_ERROR_ID(510); /* must be able to post the event */
|
|
}
|
|
}
|
|
else if (nFree > (QEQueueCtr)margin) {
|
|
status = true; /* can post */
|
|
}
|
|
else {
|
|
status = false; /* cannot post */
|
|
}
|
|
|
|
if (status) { /* can post the event? */
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_ACTIVE_POST_FIFO,
|
|
QS_priv_.locFilter[AO_OBJ], me)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_OBJ_(sender); /* the sender object */
|
|
QS_SIG_(e->sig); /* the signal of the event */
|
|
QS_OBJ_(me); /* this active object (recipient) */
|
|
QS_2U8_(e->poolId_, e->refCtr_); /* pool Id & ref Count */
|
|
QS_EQC_((QEQueueCtr)nFree); /* # free entries available */
|
|
QS_EQC_((QEQueueCtr)0); /* min # free entries (unknown) */
|
|
QS_END_NOCRIT_()
|
|
|
|
if (e->poolId_ != (uint8_t)0) { /* is it a pool event? */
|
|
QF_EVT_REF_CTR_INC_(e); /* increment the reference counter */
|
|
}
|
|
|
|
QF_CRIT_EXIT_();
|
|
|
|
/* posting to the ThreadX message queue must succeed, see NOTE1 */
|
|
Q_ALLEGE_ID(520,
|
|
tx_queue_send(&me->eQueue, (VOID *)&e, TX_NO_WAIT)
|
|
== TX_SUCCESS);
|
|
}
|
|
else {
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_ACTIVE_POST_ATTEMPT,
|
|
QS_priv_.locFilter[AO_OBJ], me)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_OBJ_(sender); /* the sender object */
|
|
QS_SIG_(e->sig); /* the signal of the event */
|
|
QS_OBJ_(me); /* this active object (recipient) */
|
|
QS_2U8_(e->poolId_, e->refCtr_); /* pool Id & ref Count */
|
|
QS_EQC_((QEQueueCtr)nFree); /* # free entries available */
|
|
QS_EQC_((QEQueueCtr)0); /* min # free entries (unknown) */
|
|
QS_END_NOCRIT_()
|
|
|
|
QF_CRIT_EXIT_();
|
|
}
|
|
|
|
return status;
|
|
}
|
|
/*..........................................................................*/
|
|
void QActive_postLIFO_(QActive * const me, QEvt const * const e) {
|
|
QF_CRIT_STAT_
|
|
QF_CRIT_ENTRY_();
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_ACTIVE_POST_LIFO,
|
|
QS_priv_.locFilter[AO_OBJ], me)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_SIG_(e->sig); /* the signal of this event */
|
|
QS_OBJ_(me); /* this active object */
|
|
QS_2U8_(e->poolId_, e->refCtr_); /* pool Id & ref Count */
|
|
/* # free entries */
|
|
QS_EQC_((QEQueueCtr)me->eQueue.tx_queue_available_storage);
|
|
QS_EQC_((QEQueueCtr)0); /* min # free entries (unknown) */
|
|
QS_END_NOCRIT_()
|
|
|
|
if (e->poolId_ != (uint8_t)0) { /* is it a pool event? */
|
|
QF_EVT_REF_CTR_INC_(e); /* increment the reference counter */
|
|
}
|
|
|
|
QF_CRIT_EXIT_();
|
|
|
|
/* LIFO posting must succeed, see NOTE1 */
|
|
Q_ALLEGE_ID(610,
|
|
tx_queue_front_send(&me->eQueue, (VOID *)&e, TX_NO_WAIT)
|
|
== TX_SUCCESS);
|
|
}
|
|
/*..........................................................................*/
|
|
QEvt const *QActive_get_(QActive * const me) {
|
|
QEvt const *e;
|
|
QS_CRIT_STAT_
|
|
|
|
Q_ALLEGE_ID(710,
|
|
tx_queue_receive(&me->eQueue, (VOID *)&e, TX_WAIT_FOREVER)
|
|
== TX_SUCCESS);
|
|
|
|
QS_BEGIN_(QS_QF_ACTIVE_GET, QS_priv_.locFilter[AO_OBJ], me)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_SIG_(e->sig); /* the signal of this event */
|
|
QS_OBJ_(me); /* this active object */
|
|
QS_2U8_(e->poolId_, e->refCtr_); /* pool Id & ref Count */
|
|
/* # free entries */
|
|
QS_EQC_((QEQueueCtr)me->eQueue.tx_queue_available_storage);
|
|
QS_END_()
|
|
|
|
return e;
|
|
}
|
|
|
|
/*..........................................................................*/
|
|
void QFSchedLock_(QFSchedLock * const lockStat, uint_fast8_t prio) {
|
|
UINT tx_err;
|
|
|
|
lockStat->lockHolder = tx_thread_identify();
|
|
|
|
/* this must be thread level, so current TX thread must be valid */
|
|
Q_REQUIRE_ID(800, lockStat->lockHolder != (TX_THREAD *)0);
|
|
|
|
/* change the preemption threshold of the current thread */
|
|
tx_err = tx_thread_preemption_change(lockStat->lockHolder,
|
|
(QF_TX_PRIO_OFFSET + QF_MAX_ACTIVE - prio),
|
|
&lockStat->prevThre);
|
|
|
|
if (tx_err == TX_SUCCESS) {
|
|
QS_CRIT_STAT_
|
|
lockStat->lockPrio = prio;
|
|
|
|
QS_BEGIN_(QS_SCHED_LOCK, (void *)0, (void *)0)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_2U8_((uint8_t)(QF_TX_PRIO_OFFSET + QF_MAX_ACTIVE
|
|
- lockStat->prevThre),
|
|
(uint8_t)prio); /* new lock prio */
|
|
QS_END_()
|
|
}
|
|
else if (tx_err == TX_THRESH_ERROR) {
|
|
/* threshold was greater than (lower prio) than the current prio */
|
|
lockStat->lockPrio = (uint_fast8_t)0; /* threshold not changed */
|
|
}
|
|
else {
|
|
/* no other errors are tolerated */
|
|
Q_ERROR_ID(810);
|
|
}
|
|
}
|
|
|
|
/*..........................................................................*/
|
|
void QFSchedUnlock_(QFSchedLock const * const lockStat) {
|
|
UINT old_thre;
|
|
QS_CRIT_STAT_
|
|
|
|
/* the lock holder must be valid and the scheduler must be locked */
|
|
Q_REQUIRE_ID(900, (lockStat->lockHolder != (TX_THREAD *)0)
|
|
&& (lockStat->lockPrio != (uint_fast8_t)0));
|
|
|
|
QS_BEGIN_(QS_SCHED_LOCK, (void *)0, (void *)0)
|
|
QS_TIME_(); /* timestamp */
|
|
QS_2U8_((uint8_t)lockStat->lockPrio, /* prev lock prio */
|
|
(uint8_t)(QF_TX_PRIO_OFFSET + QF_MAX_ACTIVE
|
|
- lockStat->prevThre)); /* new lock prio */
|
|
QS_END_()
|
|
|
|
/* restore the preemption threshold of the lock holder */
|
|
Q_ALLEGE_ID(910, tx_thread_preemption_change(lockStat->lockHolder,
|
|
lockStat->prevThre,
|
|
&old_thre) == TX_SUCCESS);
|
|
}
|
|
|