|
QP/C
|
00001 /***************************************************************************** 00002 * Product: QEP/C 00003 * Last Updated for Version: 4.4.00 00004 * Date of the Last Update: Jan 21, 2012 00005 * 00006 * Q u a n t u m L e a P s 00007 * --------------------------- 00008 * innovating embedded systems 00009 * 00010 * Copyright (C) 2002-2012 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 00027 *****************************************************************************/ 00028 #include "qep_pkg.h" 00029 #include "qassert.h" 00030 00031 Q_DEFINE_THIS_MODULE("qhsm_ini") 00032 00033 00039 /*..........................................................................*/ 00040 void QHsm_init(QHsm *me, QEvent const *e) { 00041 QStateHandler t = &QHsm_top; /* HSM starts in the top state */ 00042 QS_CRIT_STAT_ 00043 /* the top-most initial transition must be taken */ 00044 Q_ALLEGE((*me->state)(me, e) == Q_RET_TRAN); 00045 00046 do { /* drill into the target... */ 00047 QStateHandler path[QEP_MAX_NEST_DEPTH_]; 00048 int8_t ip = (int8_t)0; /* transition entry path index */ 00049 00050 QS_BEGIN_(QS_QEP_STATE_INIT, QS_smObj_, me) 00051 QS_OBJ_(me); /* this state machine object */ 00052 QS_FUN_(t); /* the source state */ 00053 QS_FUN_(me->state); /* the target of the initial transition */ 00054 QS_END_() 00055 00056 path[0] = me->state; 00057 (void)QEP_TRIG_(me->state, QEP_EMPTY_SIG_); 00058 while (me->state != t) { 00059 ++ip; 00060 path[ip] = me->state; 00061 (void)QEP_TRIG_(me->state, QEP_EMPTY_SIG_); 00062 } 00063 me->state = path[0]; 00064 /* entry path must not overflow */ 00065 Q_ASSERT(ip < (int8_t)QEP_MAX_NEST_DEPTH_); 00066 00067 do { /* retrace the entry path in reverse (desired) order... */ 00068 QEP_ENTER_(path[ip]) /* enter path[ip] */ 00069 --ip; 00070 } while (ip >= (int8_t)0); 00071 00072 t = path[0]; /* current state becomes the new source */ 00073 } while (QEP_TRIG_(t, Q_INIT_SIG) == Q_RET_TRAN); 00074 me->state = t; 00075 00076 QS_BEGIN_(QS_QEP_INIT_TRAN, QS_smObj_, me) 00077 QS_TIME_(); /* time stamp */ 00078 QS_OBJ_(me); /* this state machine object */ 00079 QS_FUN_(me->state); /* the new active state */ 00080 QS_END_() 00081 }
1.7.6.1