qep_hsm.cpp

Go to the documentation of this file.

//$file${src::qf::qep_hsm.cpp} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
//
// Model: qpcpp.qm
// File:  ${src::qf::qep_hsm.cpp}
//
// This code has been generated by QM 7.0.0 <www.state-machine.com/qm>.
// DO NOT EDIT THIS FILE MANUALLY. All your changes will be lost.
//
// Copyright (C) 2005 Quantum Leaps, LLC. All rights reserved.
//
//                    Q u a n t u m  L e a P s
//                    ------------------------
//                    Modern Embedded Software
//
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-QL-commercial
//
// The QP/C++ software is dual-licensed under the terms of the open-source
// GNU General Public License (GPL) or under the terms of one of the closed-
// source Quantum Leaps commercial licenses.
//
// Redistributions in source code must retain this top-level comment block.
// Plagiarizing this software to sidestep the license obligations is illegal.
//
// NOTE:
// The GPL does NOT permit the incorporation of this code into proprietary
// programs. Please contact Quantum Leaps for commercial licensing options,
// which expressly supersede the GPL and are designed explicitly for
// closed-source distribution.
//
// Quantum Leaps contact information:
// <www.state-machine.com/licensing>
// <info@state-machine.com>
//
//$endhead${src::qf::qep_hsm.cpp} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
#define QP_IMPL             // this is QP implementation
#include "qp_port.hpp"      // QP port
#include "qp_pkg.hpp"       // QP package-scope interface
#include "qsafe.h"          // QP Functional Safety (FuSa) Subsystem
#ifdef Q_SPY                // QS software tracing enabled?
    #include "qs_port.hpp"  // QS port
    #include "qs_pkg.hpp"   // QS facilities for pre-defined trace records
#else
    #include "qs_dummy.hpp" // disable the QS software tracing
#endif // Q_SPY
 
//============================================================================
//! @cond INTERNAL
 
// unnamed namespace for local definitions with internal linkage
namespace {
Q_DEFINE_THIS_MODULE("qep_hsm")
 
// immutable events corresponding to the reserved signals.
static QP::QEvt const l_reservedEvt_[4] {
    QP::QEvt(static_cast<QP::QSignal>(QP::QHsm::Q_EMPTY_SIG)),
    QP::QEvt(static_cast<QP::QSignal>(QP::QHsm::Q_ENTRY_SIG)),
    QP::QEvt(static_cast<QP::QSignal>(QP::QHsm::Q_EXIT_SIG)),
    QP::QEvt(static_cast<QP::QSignal>(QP::QHsm::Q_INIT_SIG))
};
 
// maximum depth of state nesting in a QHsm (including the top level)
// must be >= 3
static constexpr std::int_fast8_t QHSM_MAX_NEST_DEPTH_ {6};
 
} // unnamed namespace
 
// helper macro to handle reserved event in an QHsm
#define QHSM_RESERVED_EVT_(state_, sig_) \
    ((*(state_))(this, &l_reservedEvt_[(sig_)]))
 
// helper macro to trace state entry
#define QS_STATE_ENTRY_(state_, qsId_)         \
    QS_CRIT_ENTRY();                           \
    QS_MEM_SYS();                              \
    QS_BEGIN_PRE(QS_QEP_STATE_ENTRY, (qsId_)) \
        QS_OBJ_PRE(this);                     \
        QS_FUN_PRE(state_);                   \
    QS_END_PRE()                              \
    QS_MEM_APP();                              \
    QS_CRIT_EXIT()
 
// helper macro to trace state exit
#define QS_STATE_EXIT_(state_, qsId_)          \
    QS_CRIT_ENTRY();                           \
    QS_MEM_SYS();                              \
    QS_BEGIN_PRE(QS_QEP_STATE_EXIT, (qsId_))  \
        QS_OBJ_PRE(this);                     \
        QS_FUN_PRE(state_);                   \
    QS_END_PRE()                              \
    QS_MEM_APP();                              \
    QS_CRIT_EXIT()
 
//! @endcond
 
//============================================================================
 
//$skip${QP_VERSION} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
// Check for the minimum required QP version
#if (QP_VERSION < 730U) || (QP_VERSION != ((QP_RELEASE^4294967295U)%0x2710U))
#error qpcpp version 7.3.0 or higher required
#endif
//$endskip${QP_VERSION} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
//$define${QEP::versionStr[]} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
namespace QP {
 
} // namespace QP
//$enddef${QEP::versionStr[]} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 
//$define${QEP::QHsm} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
namespace QP {
 
//${QEP::QHsm} ...............................................................
 
//${QEP::QHsm::QHsm} .........................................................
QHsm::QHsm(QStateHandler const initial) noexcept
: QAsm()
{
    m_state.fun = Q_STATE_CAST(&top);
    m_temp.fun  = initial;
}
 
//${QEP::QHsm::init} .........................................................
void QHsm::init(
    void const * const e,
    std::uint_fast8_t const qsId)
{
    QF_CRIT_STAT
 
    QState r;
 
    // produce QS dictionary for QP::QHsm::top()
    #ifdef Q_SPY
    QS_CRIT_ENTRY();
    QS_MEM_SYS();
    if ((QS::priv_.flags & 0x01U) == 0U) {
        QS::priv_.flags |= 0x01U;
        r = Q_RET_HANDLED;
    }
    else {
        r = Q_RET_IGNORED;
    }
    QS_MEM_APP();
    QS_CRIT_EXIT();
    if (r == Q_RET_HANDLED) {
        QS_FUN_DICTIONARY(&QP::QHsm::top);
    }
    #else
    Q_UNUSED_PAR(qsId);
    #endif // def Q_SPY
 
    QStateHandler t = m_state.fun;
 
    QF_CRIT_ENTRY();
    Q_REQUIRE_INCRIT(200, (m_temp.fun != nullptr)
                      && (t == Q_STATE_CAST(&top)));
    QF_CRIT_EXIT();
 
    // execute the top-most initial tran.
    r = (*m_temp.fun)(this, Q_EVT_CAST(QEvt));
 
    QF_CRIT_ENTRY();
    // the top-most initial tran. must be taken
    Q_ASSERT_INCRIT(210, r == Q_RET_TRAN);
 
    QS_MEM_SYS();
    QS_BEGIN_PRE(QS_QEP_STATE_INIT, qsId)
        QS_OBJ_PRE(this);         // this state machine object
        QS_FUN_PRE(t);            // the source state
        QS_FUN_PRE(m_temp.fun);   // the target of the initial tran.
    QS_END_PRE()
    QS_MEM_APP();
 
    QF_CRIT_EXIT();
 
    // drill down into the state hierarchy with initial transitions...
    do {
        QStateHandler path[QHSM_MAX_NEST_DEPTH_]; // tran. entry path array
        std::int_fast8_t ip = 0; // tran. entry path index
 
        path[0] = m_temp.fun;
        static_cast<void>(QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG));
        // note: ip is here the fixed upper loop bound
        while ((m_temp.fun != t) && (ip < (QHSM_MAX_NEST_DEPTH_ - 1))) {
            ++ip;
            path[ip] = m_temp.fun;
            static_cast<void>(QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG));
        }
        QF_CRIT_ENTRY();
        // too many state nesting levels or "malformed" HSM
        Q_ENSURE_INCRIT(220, ip < QHSM_MAX_NEST_DEPTH_);
        QF_CRIT_EXIT();
 
        m_temp.fun = path[0];
 
        // retrace the entry path in reverse (desired) order...
        // note: ip is the fixed upper loop bound
        do {
            // enter path[ip]
            if (QHSM_RESERVED_EVT_(path[ip], Q_ENTRY_SIG)
                == Q_RET_HANDLED)
            {
                QS_STATE_ENTRY_(path[ip], qsId);
            }
            --ip;
        } while (ip >= 0);
 
        t = path[0]; // current state becomes the new source
 
        r = QHSM_RESERVED_EVT_(t, Q_INIT_SIG); // execute initial tran.
 
    #ifdef Q_SPY
        if (r == Q_RET_TRAN) {
            QS_CRIT_ENTRY();
            QS_MEM_SYS();
            QS_BEGIN_PRE(QS_QEP_STATE_INIT, qsId)
                QS_OBJ_PRE(this);         // this state machine object
                QS_FUN_PRE(t);            // the source state
                QS_FUN_PRE(m_temp.fun);   // the target of the initial tran.
            QS_END_PRE()
            QS_MEM_APP();
            QS_CRIT_EXIT();
        }
    #endif // Q_SPY
    } while (r == Q_RET_TRAN);
 
    QF_CRIT_ENTRY();
 
    QS_MEM_SYS();
    QS_BEGIN_PRE(QS_QEP_INIT_TRAN, qsId)
        QS_TIME_PRE();    // time stamp
        QS_OBJ_PRE(this); // this state machine object
        QS_FUN_PRE(t);    // the new active state
    QS_END_PRE()
    QS_MEM_APP();
 
    QF_CRIT_EXIT();
 
    m_state.fun = t;   // change the current active state
    #ifndef Q_UNSAFE
    m_temp.uint = ~m_state.uint;
    #endif
}
 
//${QEP::QHsm::dispatch} .....................................................
void QHsm::dispatch(
    QEvt const * const e,
    std::uint_fast8_t const qsId)
{
    #ifndef Q_SPY
    Q_UNUSED_PAR(qsId);
    #endif
 
    QStateHandler s = m_state.fun;
    QStateHandler t = s;
    QF_CRIT_STAT
 
    QF_CRIT_ENTRY();
    Q_REQUIRE_INCRIT(300, (e != nullptr) && (s != nullptr));
    Q_INVARIANT_INCRIT(301,
        e->verify_()
        && (m_state.uint == static_cast<std::uintptr_t>(~m_temp.uint)));
 
    QS_MEM_SYS();
    QS_BEGIN_PRE(QS_QEP_DISPATCH, qsId)
        QS_TIME_PRE();      // time stamp
        QS_SIG_PRE(e->sig); // the signal of the event
        QS_OBJ_PRE(this);   // this state machine object
        QS_FUN_PRE(s);      // the current state
    QS_END_PRE()
    QS_MEM_APP();
 
    QF_CRIT_EXIT();
 
    // process the event hierarchically...
    QState r;
    m_temp.fun = s;
    std::int_fast8_t ip = QHSM_MAX_NEST_DEPTH_; // fixed upper loop bound
    do {
        s = m_temp.fun;
        r = (*s)(this, e); // invoke state handler s
 
        if (r == Q_RET_UNHANDLED) { // unhandled due to a guard?
 
            QS_CRIT_ENTRY();
            QS_MEM_SYS();
            QS_BEGIN_PRE(QS_QEP_UNHANDLED, qsId)
                QS_SIG_PRE(e->sig); // the signal of the event
                QS_OBJ_PRE(this);   // this state machine object
                QS_FUN_PRE(s);      // the current state
            QS_END_PRE()
            QS_MEM_APP();
            QS_CRIT_EXIT();
 
            r = QHSM_RESERVED_EVT_(s, Q_EMPTY_SIG); // superstate of s
        }
 
        --ip;
    } while ((r == Q_RET_SUPER) && (ip > 0));
 
    QF_CRIT_ENTRY();
    Q_ENSURE_INCRIT(310, ip > 0);
    QF_CRIT_EXIT();
 
    if (r >= Q_RET_TRAN) { // tran. (regular or history) taken?
    #ifdef Q_SPY
        if (r == Q_RET_TRAN_HIST) { // tran. to history?
            QS_CRIT_ENTRY();
            QS_MEM_SYS();
            QS_BEGIN_PRE(QS_QEP_TRAN_HIST, qsId)
                QS_OBJ_PRE(this);         // this state machine object
                QS_FUN_PRE(s);            // tran. to history source
                QS_FUN_PRE(m_temp.fun);   // tran. to history target
            QS_END_PRE()
            QS_MEM_APP();
            QS_CRIT_EXIT();
        }
    #endif // Q_SPY
 
        QStateHandler path[QHSM_MAX_NEST_DEPTH_];
        path[0] = m_temp.fun; // tran. target
        path[1] = t; // current state
        path[2] = s; // tran. source
 
        // exit current state to tran. source s...
        ip = QHSM_MAX_NEST_DEPTH_; // fixed upper loop bound
        for (; (t != s) && (ip > 0); t = m_temp.fun) {
            // exit from t
            if (QHSM_RESERVED_EVT_(t, Q_EXIT_SIG) == Q_RET_HANDLED) {
                QS_STATE_EXIT_(t, qsId);
                // find superstate of t
                static_cast<void>(QHSM_RESERVED_EVT_(t, Q_EMPTY_SIG));
            }
            --ip;
        }
        QF_CRIT_ENTRY();
        Q_ENSURE_INCRIT(320, ip > 0);
        QF_CRIT_EXIT();
 
        ip = hsm_tran(&path[0], qsId); // take the tran.
 
        // execute state entry actions in the desired order...
        // note: ip is the fixed upper loop bound
        for (; ip >= 0; --ip) {
            // enter path[ip]
            if (QHSM_RESERVED_EVT_(path[ip], Q_ENTRY_SIG)
                == Q_RET_HANDLED)
            {
                QS_STATE_ENTRY_(path[ip], qsId);
            }
        }
        t = path[0];    // stick the target into register
        m_temp.fun = t; // update the next state
 
        // drill into the target hierarchy...
        while (QHSM_RESERVED_EVT_(t, Q_INIT_SIG) == Q_RET_TRAN) {
 
            QS_CRIT_ENTRY();
            QS_MEM_SYS();
            QS_BEGIN_PRE(QS_QEP_STATE_INIT, qsId)
                QS_OBJ_PRE(this);         // this state machine object
                QS_FUN_PRE(t);            // the source (pseudo)state
                QS_FUN_PRE(m_temp.fun);   // the target of the tran.
            QS_END_PRE()
            QS_MEM_APP();
            QS_CRIT_EXIT();
 
            ip = 0;
            path[0] = m_temp.fun;
 
            // find superstate
            static_cast<void>(QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG));
 
            // note: ip is the fixed upper loop bound
            while ((m_temp.fun != t) && (ip < (QHSM_MAX_NEST_DEPTH_ - 1))) {
                ++ip;
                path[ip] = m_temp.fun;
                // find superstate
                static_cast<void>(
                    QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG));
            }
            QF_CRIT_ENTRY();
            // too many state nesting levels or "malformed" HSM
            Q_ENSURE_INCRIT(330, ip < QHSM_MAX_NEST_DEPTH_);
            QF_CRIT_EXIT();
 
            m_temp.fun = path[0];
 
            // retrace the entry path in reverse (correct) order...
            // note: ip is the fixed upper loop bound
            do {
                // enter path[ip]
                if (QHSM_RESERVED_EVT_(path[ip], Q_ENTRY_SIG)
                    == Q_RET_HANDLED)
                {
                    QS_STATE_ENTRY_(path[ip], qsId);
                }
                --ip;
            } while (ip >= 0);
 
            t = path[0]; // current state becomes the new source
        }
 
        QS_CRIT_ENTRY();
        QS_MEM_SYS();
        QS_BEGIN_PRE(QS_QEP_TRAN, qsId)
            QS_TIME_PRE();      // time stamp
            QS_SIG_PRE(e->sig); // the signal of the event
            QS_OBJ_PRE(this);   // this state machine object
            QS_FUN_PRE(s);      // the source of the tran.
            QS_FUN_PRE(t);      // the new active state
        QS_END_PRE()
        QS_MEM_APP();
        QS_CRIT_EXIT();
    }
 
    #ifdef Q_SPY
    else if (r == Q_RET_HANDLED) {
        QS_CRIT_ENTRY();
        QS_MEM_SYS();
        QS_BEGIN_PRE(QS_QEP_INTERN_TRAN, qsId)
            QS_TIME_PRE();      // time stamp
            QS_SIG_PRE(e->sig); // the signal of the event
            QS_OBJ_PRE(this);   // this state machine object
            QS_FUN_PRE(s);      // the source state
        QS_END_PRE()
        QS_MEM_APP();
        QS_CRIT_EXIT();
    }
    else {
        QS_CRIT_ENTRY();
        QS_MEM_SYS();
        QS_BEGIN_PRE(QS_QEP_IGNORED, qsId)
            QS_TIME_PRE();      // time stamp
            QS_SIG_PRE(e->sig); // the signal of the event
            QS_OBJ_PRE(this);   // this state machine object
            QS_FUN_PRE(m_state.fun); // the current state
        QS_END_PRE()
        QS_MEM_APP();
        QS_CRIT_EXIT();
    }
    #endif // Q_SPY
 
    m_state.fun = t; // change the current active state
    #ifndef Q_UNSAFE
    m_temp.uint = ~m_state.uint;
    #endif
}
 
//${QEP::QHsm::isIn} .........................................................
bool QHsm::isIn(QStateHandler const state) noexcept {
    QF_CRIT_STAT
    QF_CRIT_ENTRY();
    Q_INVARIANT_INCRIT(602,
        m_state.uint == static_cast<std::uintptr_t>(~m_temp.uint));
    QF_CRIT_EXIT();
 
    bool inState = false; // assume that this HSM is not in 'state'
 
    // scan the state hierarchy bottom-up
    QStateHandler s = m_state.fun;
    std::int_fast8_t lbound = QHSM_MAX_NEST_DEPTH_ + 1; // fixed upper loop bound
    QState r = Q_RET_SUPER;
    for (; (r != Q_RET_IGNORED) && (lbound > 0); --lbound) {
        if (s == state) { // do the states match?
            inState = true;  // 'true' means that match found
            break; // break out of the for-loop
        }
        else {
            r = QHSM_RESERVED_EVT_(s, Q_EMPTY_SIG);
            s = m_temp.fun;
        }
    }
 
    QF_CRIT_ENTRY();
    Q_ENSURE_INCRIT(690, lbound > 0);
    QF_CRIT_EXIT();
 
    #ifndef Q_UNSAFE
    m_temp.uint = ~m_state.uint;
    #endif
 
    return inState; // return the status
}
 
//${QEP::QHsm::childState} ...................................................
QStateHandler QHsm::childState(QStateHandler const parent) noexcept {
    QStateHandler child = m_state.fun; // start with current state
    bool isFound = false; // start with the child not found
 
    // establish stable state configuration
    m_temp.fun = child;
    QState r;
    std::int_fast8_t lbound = QHSM_MAX_NEST_DEPTH_; // fixed upper loop bound
    do {
        // is this the parent of the current child?
        if (m_temp.fun == parent) {
            isFound = true; // child is found
            r = Q_RET_IGNORED; // break out of the loop
        }
        else {
            child = m_temp.fun;
            r = QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG);
        }
        --lbound;
    } while ((r != Q_RET_IGNORED)  // the top state not reached
             && (lbound > 0));
 
    #ifndef Q_UNSAFE
    m_temp.uint = ~m_state.uint;
    #else
    Q_UNUSED_PAR(isFound);
    #endif
 
    QF_CRIT_STAT
    QF_CRIT_ENTRY();
    // NOTE: the following postcondition can only succeed when
    // (lbound > 0), so no extra check is necessary.
    Q_ENSURE_INCRIT(890, isFound);
    QF_CRIT_EXIT();
 
    return child;
}
 
//${QEP::QHsm::hsm_tran} .....................................................
std::int_fast8_t QHsm::hsm_tran(
    QStateHandler * const path,
    std::uint_fast8_t const qsId)
{
    #ifndef Q_SPY
    Q_UNUSED_PAR(qsId);
    #endif
 
    std::int_fast8_t ip = -1; // tran. entry path index
    QStateHandler t = path[0];
    QStateHandler const s = path[2];
    QF_CRIT_STAT
 
    // (a) check source==target (tran. to self)...
    if (s == t) {
        // exit source s
        if (QHSM_RESERVED_EVT_(s, Q_EXIT_SIG) == Q_RET_HANDLED) {
            QS_STATE_EXIT_(s, qsId);
        }
        ip = 0; // enter the target
    }
    else {
        // find superstate of target
        static_cast<void>(QHSM_RESERVED_EVT_(t, Q_EMPTY_SIG));
 
        t = m_temp.fun;
 
        // (b) check source==target->super...
        if (s == t) {
            ip = 0; // enter the target
        }
        else {
            // find superstate of src
            static_cast<void>(QHSM_RESERVED_EVT_(s, Q_EMPTY_SIG));
 
            // (c) check source->super==target->super...
            if (m_temp.fun == t) {
                // exit source s
                if (QHSM_RESERVED_EVT_(s, Q_EXIT_SIG) == Q_RET_HANDLED) {
                    QS_STATE_EXIT_(s, qsId);
                }
                ip = 0; // enter the target
            }
            else {
                // (d) check source->super==target...
                if (m_temp.fun == path[0]) {
                    // exit source s
                    if (QHSM_RESERVED_EVT_(s, Q_EXIT_SIG) == Q_RET_HANDLED) {
                        QS_STATE_EXIT_(s, qsId);
                    }
                }
                else {
                    // (e) check rest of source==target->super->super..
                    // and store the entry path along the way
                    std::int_fast8_t iq = 0; // indicate that LCA was found
                    ip = 1; // enter target and its superstate
                    path[1] = t;      // save the superstate of target
                    t = m_temp.fun;   // save source->super
 
                    // find target->super->super...
                    // note: ip is the fixed upper loop bound
                    QState r = QHSM_RESERVED_EVT_(path[1], Q_EMPTY_SIG);
                    while ((r == Q_RET_SUPER)
                           && (ip < (QHSM_MAX_NEST_DEPTH_ - 1)))
                    {
                        ++ip;
                        path[ip] = m_temp.fun; // store the entry path
                        if (m_temp.fun == s) { // is it the source?
                            iq = 1; // indicate that the LCA found
                            --ip; // do not enter the source
                            r = Q_RET_HANDLED; // terminate the loop
                        }
                        else { // it is not the source, keep going up
                            r = QHSM_RESERVED_EVT_(m_temp.fun, Q_EMPTY_SIG);
                        }
                    }
                    QF_CRIT_ENTRY();
                    // NOTE: The following postcondition succeeds only when
                    // ip < QHSM_MAX_NEST_DEPTH, so no additional check is necessary
                    // too many state nesting levels or "malformed" HSM.
                    Q_ENSURE_INCRIT(510, r != Q_RET_SUPER);
                    QF_CRIT_EXIT();
 
                    // the LCA not found yet?
                    if (iq == 0) {
                        // exit source s
                        if (QHSM_RESERVED_EVT_(s, Q_EXIT_SIG)
                            == Q_RET_HANDLED)
                        {
                            QS_STATE_EXIT_(s, qsId);
                        }
 
                        // (f) check the rest of source->super
                        //                  == target->super->super...
                        iq = ip;
                        r = Q_RET_IGNORED; // indicate that the LCA NOT found
                        // note: iq is the fixed upper loop bound
                        do {
                            if (t == path[iq]) { // is this the LCA?
                                r = Q_RET_HANDLED; // indicate the LCA found
                                ip = iq - 1; // do not enter the LCA
                                iq = -1; // cause termination of the loop
                            }
                            else {
                                --iq; // try lower superstate of target
                            }
                        } while (iq >= 0);
 
                        // the LCA not found yet?
                        if (r != Q_RET_HANDLED) {
                            // (g) check each source->super->...
                            // for each target->super...
                            r = Q_RET_IGNORED; // keep looping
                            std::int_fast8_t lbound = QHSM_MAX_NEST_DEPTH_;
                            do {
                                // exit from t
                                if (QHSM_RESERVED_EVT_(t, Q_EXIT_SIG)
                                    == Q_RET_HANDLED)
                                {
                                    QS_STATE_EXIT_(t, qsId);
                                    // find superstate of t
                                    static_cast<void>(
                                        QHSM_RESERVED_EVT_(t, Q_EMPTY_SIG));
                                }
                                t = m_temp.fun; // set to super of t
                                iq = ip;
                                do {
                                    // is this the LCA?
                                    if (t == path[iq]) {
                                        ip = iq - 1; // do not enter the LCA
                                        iq = -1;     // break out of inner loop
                                        r = Q_RET_HANDLED; // break outer loop
                                    }
                                    else {
                                        --iq;
                                    }
                                } while (iq >= 0);
 
                                --lbound;
                            } while ((r != Q_RET_HANDLED) && (lbound > 0));
                            QF_CRIT_ENTRY();
                            Q_ENSURE_INCRIT(530, lbound > 0);
                            QF_CRIT_EXIT();
                        }
                    }
                }
            }
        }
    }
    QF_CRIT_ENTRY();
    Q_ENSURE_INCRIT(590, ip < QHSM_MAX_NEST_DEPTH_);
    QF_CRIT_EXIT();
    return ip;
}
 
} // namespace QP
//$enddef${QEP::QHsm} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^