QHsmTst is a contrived state machine from Chapter 2 of the PSiCC2 book for testing all possible transition topologies with up to 4-levels of state nesting. Test active object me->foo = 0U; BSP_display("top-INIT;"); BSP_display("s-ENTRY;"); BSP_display("s-EXIT;"); BSP_display("s-INIT;"); me->foo me->foo = 0U; BSP_display("s-I;"); BSP_display("s-E;"); BSP_exit(); BSP_display("s1-ENTRY;"); BSP_display("s1-EXIT;"); BSP_display("s1-INIT;"); BSP_display("s1-I;"); !me->foo me->foo = 1U; BSP_display("s1-D;"); BSP_display("s1-A;"); BSP_display("s1-B;"); BSP_display("s1-F;"); BSP_display("s1-C;"); BSP_display("s11-ENTRY;"); BSP_display("s11-EXIT;"); BSP_display("s11-H;"); me->foo me->foo = 0U; BSP_display("s11-D;"); BSP_display("s11-G;"); BSP_display("s2-ENTRY;"); BSP_display("s2-EXIT;"); BSP_display("s2-INIT;"); !me->foo me->foo = 1U; BSP_display("s2-I;"); BSP_display("s2-F;"); BSP_display("s2-C;"); BSP_display("s21-ENTRY;"); BSP_display("s21-EXIT;"); BSP_display("s21-INIT;"); BSP_display("s21-G;"); BSP_display("s21-A;"); BSP_display("s21-B;"); BSP_display("s211-ENTRY;"); BSP_display("s211-EXIT;"); BSP_display("s211-H;"); BSP_display("s211-D;"); QHsmTst *me = &l_hsmtst; QHsm_ctor(&me->super, Q_STATE_CAST(&QHsmTst_initial)); #ifndef QHSMTST_H #define QHSMTST_H enum QHsmTstSignals { A_SIG = Q_USER_SIG, B_SIG, C_SIG, D_SIG, E_SIG, F_SIG, G_SIG, H_SIG, I_SIG, TERMINATE_SIG, IGNORE_SIG, MAX_SIG }; extern QHsm * const the_hsm; /* opaque pointer to the test HSM */ $declare(HSMs::QHsmTst_ctor) #endif /* QHSMTST_H */ #include "qpn.h" #include "bsp.h" #include "qhsmtst.h" $declare(HSMs::QHsmTst) static QHsmTst l_hsmtst; /* the only instance of the QHsmTst class */ /* global-scope definitions ---------------------------------------*/ QHsm * const the_hsm = (QHsm *)&l_hsmtst; /* the opaque pointer */ $define(HSMs::QHsmTst_ctor) $define(HSMs::QHsmTst)