QP/C++
qhsm_ini.cpp
Go to the documentation of this file.
00001 
00002 // Product: QEP/C++
00003 // Last Updated for Version: 4.3.00
00004 // Date of the Last Update:  Nov 01, 2011
00005 //
00006 //                    Q u a n t u m     L e a P s
00007 //                    ---------------------------
00008 //                    innovating embedded systems
00009 //
00010 // Copyright (C) 2002-2011 Quantum Leaps, LLC. All rights reserved.
00011 //
00012 // This software may be distributed and modified under the terms of the GNU
00013 // General Public License version 2 (GPL) as published by the Free Software
00014 // Foundation and appearing in the file GPL.TXT included in the packaging of
00015 // this file. Please note that GPL Section 2[b] requires that all works based
00016 // on this software must also be made publicly available under the terms of
00017 // the GPL ("Copyleft").
00018 //
00019 // Alternatively, this software may be distributed and modified under the
00020 // terms of Quantum Leaps commercial licenses, which expressly supersede
00021 // the GPL and are specifically designed for licensees interested in
00022 // retaining the proprietary status of their code.
00023 //
00024 // Contact information:
00025 // Quantum Leaps Web site:  http://www.quantum-leaps.com
00026 // e-mail:                  info@quantum-leaps.com
00028 #include "qep_pkg.h"
00029 #include "qassert.h"
00030 
00034 
00035 #ifdef Q_USE_NAMESPACE
00036 namespace QP {
00037 #endif
00038 
00039 Q_DEFINE_THIS_MODULE(qhsm_ini)
00040 
00041 //............................................................................
00042 QHsm::~QHsm() {
00043 }
00044 //............................................................................
00045 void QHsm::init(QEvent const *e) {
00046     QStateHandler t;
00047     QS_CRIT_STAT_
00048 
00049                               // the top-most initial transition must be taken
00050     Q_ALLEGE((*m_state)(this, e) == Q_RET_TRAN);
00051 
00052     t = (QStateHandler)&QHsm::top;              // HSM starts in the top state
00053     do {                                           // drill into the target...
00054         QStateHandler path[QEP_MAX_NEST_DEPTH_];
00055         int8_t ip = (int8_t)0;                  // transition entry path index
00056 
00057 
00058         QS_BEGIN_(QS_QEP_STATE_INIT, QS::smObj_, this)
00059             QS_OBJ_(this);                        // this state machine object
00060             QS_FUN_(t);                                    // the source state
00061             QS_FUN_(m_state);          // the target of the initial transition
00062         QS_END_()
00063 
00064         path[0] = m_state;
00065         (void)QEP_TRIG_(m_state, QEP_EMPTY_SIG_);
00066         while (m_state != t) {
00067             ++ip;
00068             path[ip] = m_state;
00069             (void)QEP_TRIG_(m_state, QEP_EMPTY_SIG_);
00070         }
00071         m_state = path[0];
00072                                                // entry path must not overflow
00073         Q_ASSERT(ip < (int8_t)QEP_MAX_NEST_DEPTH_);
00074 
00075         do {           // retrace the entry path in reverse (desired) order...
00076             QEP_ENTER_(path[ip]);                            // enter path[ip]
00077             --ip;
00078         } while (ip >= (int8_t)0);
00079 
00080         t = path[0];                   // current state becomes the new source
00081     } while (QEP_TRIG_(t, Q_INIT_SIG) == Q_RET_TRAN);
00082     m_state = t;
00083 
00084     QS_BEGIN_(QS_QEP_INIT_TRAN, QS::smObj_, this)
00085         QS_TIME_();                                              // time stamp
00086         QS_OBJ_(this);                            // this state machine object
00087         QS_FUN_(m_state);                              // the new active state
00088     QS_END_()
00089 }
00090 
00091 #ifdef Q_USE_NAMESPACE
00092 }                                                              // namespace QP
00093 #endif
00094