mirror of
https://github.com/QuantumLeaps/qpcpp.git
synced 2025-02-04 06:13:00 +08:00
164 lines
7.0 KiB
C++
164 lines
7.0 KiB
C++
//****************************************************************************
|
|
// Product: QF/C++
|
|
// Last Updated for Version: 5.2.0
|
|
// Date of the Last Update: Dec 02, 2013
|
|
//
|
|
// Q u a n t u m L e a P s
|
|
// ---------------------------
|
|
// innovating embedded systems
|
|
//
|
|
// Copyright (C) 2002-2013 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:
|
|
// Quantum Leaps Web sites: http://www.quantum-leaps.com
|
|
// http://www.state-machine.com
|
|
// e-mail: info@quantum-leaps.com
|
|
//****************************************************************************
|
|
#include "qf_pkg.h"
|
|
#include "qassert.h"
|
|
/// \file
|
|
/// \ingroup qf
|
|
/// \brief QF::tickX_() and QF::noTimeEvtsActiveX() implementation.
|
|
|
|
namespace QP {
|
|
|
|
Q_DEFINE_THIS_MODULE("qf_tick")
|
|
|
|
//............................................................................
|
|
#ifndef Q_SPY
|
|
void QF::tickX_(uint8_t const tickRate) // see NOTE01
|
|
#else
|
|
void QF::tickX_(uint8_t const tickRate, void const * const sender)
|
|
#endif
|
|
{
|
|
QTimeEvt *prev = &timeEvtHead_[tickRate];
|
|
QF_CRIT_STAT_
|
|
|
|
QF_CRIT_ENTRY_();
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_TICK, null_void, null_void)
|
|
QS_TEC_(static_cast<QTimeEvtCtr>(++prev->m_ctr)); // tick ctr
|
|
QS_U8_(tickRate); // tick rate
|
|
QS_END_NOCRIT_()
|
|
|
|
for (;;) {
|
|
QTimeEvt *t = prev->m_next; // advance down the time evt. list
|
|
if (t == null_tevt) { // end of the list?
|
|
if (timeEvtHead_[tickRate].m_act != null_void) {
|
|
Q_ASSERT(prev != null_tevt); // sanity check
|
|
prev->m_next = QF::timeEvtHead_[tickRate].toTimeEvt();
|
|
timeEvtHead_[tickRate].m_act = null_void;
|
|
t = prev->m_next; // switch to the new list
|
|
}
|
|
else {
|
|
break; // all currently armed time evts. processed
|
|
}
|
|
}
|
|
|
|
if (t->m_ctr == tc_0) { // time evt. scheduled for removal?
|
|
prev->m_next = t->m_next;
|
|
t->refCtr_ &= u8_0x7F; // mark as unlinked
|
|
// do NOT advance the prev pointer
|
|
QF_CRIT_EXIT_(); // exit crit. section to reduce latency
|
|
QF_CRIT_EXIT_NOP(); // see NOTE02
|
|
}
|
|
else {
|
|
--t->m_ctr;
|
|
if (t->m_ctr == tc_0) { // is time evt about to expire?
|
|
QActive *act = t->toActive(); // temporary for volatile
|
|
|
|
if (t->m_interval != tc_0) { // periodic time evt?
|
|
t->m_ctr = t->m_interval; // rearm the time event
|
|
prev = t; // advance to this time event
|
|
}
|
|
else { // one-shot time event: automatically disarm
|
|
prev->m_next = t->m_next;
|
|
t->refCtr_ &= u8_0x7F; // mark as unlinked
|
|
// do NOT advance the prev pointer
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_TIMEEVT_AUTO_DISARM,
|
|
QS::priv_.teObjFilter, t)
|
|
QS_OBJ_(t); // this time event object
|
|
QS_OBJ_(act); // the target AO
|
|
QS_U8_(tickRate); // tick rate
|
|
QS_END_NOCRIT_()
|
|
}
|
|
|
|
QS_BEGIN_NOCRIT_(QS_QF_TIMEEVT_POST, QS::priv_.teObjFilter, t)
|
|
QS_TIME_(); // timestamp
|
|
QS_OBJ_(t); // the time event object
|
|
QS_SIG_(t->sig); // signal of this time event
|
|
QS_OBJ_(act); // the target AO
|
|
QS_U8_(tickRate); // tick rate
|
|
QS_END_NOCRIT_()
|
|
|
|
QF_CRIT_EXIT_(); // exit crit. section before posting
|
|
|
|
(void)act->POST(t, sender); // asserts if queue overflows
|
|
}
|
|
else {
|
|
prev = t; // advance to this time event
|
|
QF_CRIT_EXIT_(); // exit crit. section to reduce latency
|
|
QF_CRIT_EXIT_NOP(); // see NOTE02
|
|
}
|
|
}
|
|
QF_CRIT_ENTRY_(); // re-enter crit. section to continue
|
|
}
|
|
QF_CRIT_EXIT_();
|
|
}
|
|
//............................................................................
|
|
bool QF::noTimeEvtsActiveX(uint8_t const tickRate) { // see NOTE03
|
|
Q_REQUIRE(tickRate < static_cast<uint8_t>(QF_MAX_TICK_RATE));
|
|
bool inactive;
|
|
if (timeEvtHead_[tickRate].m_next == null_tevt) {
|
|
inactive = false;
|
|
}
|
|
else if (timeEvtHead_[tickRate].m_act == null_void) {
|
|
inactive = false;
|
|
}
|
|
else {
|
|
inactive = true;
|
|
}
|
|
return inactive;
|
|
}
|
|
|
|
} // namespace QP
|
|
|
|
//****************************************************************************
|
|
// NOTE01:
|
|
// QF::tickX() must always run to completion and never preempt itself.
|
|
// In particular, if QF::tickX() runs in an ISR, the ISR is not allowed to
|
|
// preempt itself. Also, QF_tickX() should not be called from two different
|
|
// ISRs, which potentially could preempt each other.
|
|
//
|
|
// NOTE02:
|
|
// In some QF ports the critical section exit takes effect only on the next
|
|
// machine instruction. If this case, the next instruction is another entry
|
|
// to a critical section, the critical section won't be really exited, but
|
|
// rather the two adjecent critical sections would be merged.
|
|
// The QF_CRIT_EXIT_NOP() macro contains minimal code required to prevent
|
|
// such merging of critical sections in QF ports, in which it can occur.
|
|
//
|
|
// NOTE03:
|
|
// QF::noTimeEvtsActiveX() must be invoked from within a critical section.
|
|
//
|
|
|