philo.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  1. /*$file${.::philo.c} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  2. /*
  3. * Model: dpp.qm
  4. * File: ${.::philo.c}
  5. *
  6. * This code has been generated by QM 5.2.5 <www.state-machine.com/qm>.
  7. * DO NOT EDIT THIS FILE MANUALLY. All your changes will be lost.
  8. *
  9. * SPDX-License-Identifier: GPL-3.0-or-later
  10. *
  11. * This generated code is open source software: you can redistribute it under
  12. * the terms of the GNU General Public License as published by the Free
  13. * Software Foundation.
  14. *
  15. * This code is distributed in the hope that it will be useful, but WITHOUT
  16. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  17. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  18. * more details.
  19. *
  20. * NOTE:
  21. * Alternatively, this generated code may be distributed under the terms
  22. * of Quantum Leaps commercial licenses, which expressly supersede the GNU
  23. * General Public License and are specifically designed for licensees
  24. * interested in retaining the proprietary status of their code.
  25. *
  26. * Contact information:
  27. * <www.state-machine.com/licensing>
  28. * <info@state-machine.com>
  29. */
  30. /*$endhead${.::philo.c} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
  31. #include "qpc.h"
  32. #include "dpp.h"
  33. #include "bsp.h"
  34. Q_DEFINE_THIS_MODULE("philo")
  35. /* Active object class -----------------------------------------------------*/
  36. /*$declare${AOs::Philo} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  37. /*${AOs::Philo} ............................................................*/
  38. typedef struct Philo {
  39. /* protected: */
  40. QActive super;
  41. /* public: */
  42. /* private: */
  43. QTimeEvt timeEvt;
  44. } Philo;
  45. extern Philo Philo_inst[N_PHILO];
  46. /* protected: */
  47. static QState Philo_initial(Philo * const me, void const * const par);
  48. static QState Philo_thinking(Philo * const me, QEvt const * const e);
  49. static QState Philo_hungry(Philo * const me, QEvt const * const e);
  50. static QState Philo_eating(Philo * const me, QEvt const * const e);
  51. /*$enddecl${AOs::Philo} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
  52. /* helper macros to provide a randomized think time for Philos */
  53. #define THINK_TIME \
  54. (QTimeEvtCtr)((BSP_random() % BSP_TICKS_PER_SEC) + (BSP_TICKS_PER_SEC/2U))
  55. #define EAT_TIME \
  56. (QTimeEvtCtr)((BSP_random() % BSP_TICKS_PER_SEC) + BSP_TICKS_PER_SEC)
  57. /* helper macro to provide the ID of Philo "me_" */
  58. #define PHILO_ID(me_) ((uint8_t)((me_) - &Philo_inst[0]))
  59. /* Shared objects ----------------------------------------------------------*/
  60. /*$skip${QP_VERSION} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  61. /* Check for the minimum required QP version */
  62. #if (QP_VERSION < 700U) || (QP_VERSION != ((QP_RELEASE^4294967295U) % 0x3E8U))
  63. #error qpc version 7.0.0 or higher required
  64. #endif
  65. /*$endskip${QP_VERSION} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
  66. /*$define${Shared::AO_Philo[N_PHILO]} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  67. /*${Shared::AO_Philo[N_PHILO]} .............................................*/
  68. QActive * const AO_Philo[N_PHILO] = {
  69. &Philo_inst[0].super,
  70. &Philo_inst[1].super,
  71. &Philo_inst[2].super,
  72. &Philo_inst[3].super,
  73. &Philo_inst[4].super
  74. };
  75. /*$enddef${Shared::AO_Philo[N_PHILO]} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
  76. /*$define${Shared::Philo_ctor} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  77. /*${Shared::Philo_ctor} ....................................................*/
  78. void Philo_ctor(uint8_t n) {
  79. Philo *me = &Philo_inst[n];
  80. QActive_ctor(&me->super, Q_STATE_CAST(&Philo_initial));
  81. QTimeEvt_ctorX(&me->timeEvt, &me->super, TIMEOUT_SIG, 0U);
  82. }
  83. /*$enddef${Shared::Philo_ctor} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/
  84. /* Philo definition --------------------------------------------------------*/
  85. /*$define${AOs::Philo} vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv*/
  86. /*${AOs::Philo} ............................................................*/
  87. Philo Philo_inst[N_PHILO];
  88. /*${AOs::Philo::SM} ........................................................*/
  89. static QState Philo_initial(Philo * const me, void const * const par) {
  90. /*${AOs::Philo::SM::initial} */
  91. (void)par; /* unused parameter */
  92. #ifdef Q_SPY
  93. uint8_t n = PHILO_ID(me);
  94. QS_OBJ_ARR_DICTIONARY(&Philo_inst[n], n);
  95. QS_OBJ_ARR_DICTIONARY(&Philo_inst[n].timeEvt, n);
  96. #endif
  97. QActive_subscribe(&me->super, EAT_SIG);
  98. QActive_subscribe(&me->super, TEST_SIG);
  99. /* the following code outputs the "fun-dictionaries" only once for
  100. * all Philo instances, as opposed to repeat them for every instance.
  101. */
  102. static bool registered = false;
  103. if (!registered) {
  104. registered = true;
  105. QS_FUN_DICTIONARY(&Philo_initial);
  106. QS_FUN_DICTIONARY(&Philo_thinking);
  107. QS_FUN_DICTIONARY(&Philo_hungry);
  108. QS_FUN_DICTIONARY(&Philo_eating);
  109. }
  110. return Q_TRAN(&Philo_thinking);
  111. }
  112. /*${AOs::Philo::SM::thinking} ..............................................*/
  113. static QState Philo_thinking(Philo * const me, QEvt const * const e) {
  114. QState status_;
  115. switch (e->sig) {
  116. /*${AOs::Philo::SM::thinking} */
  117. case Q_ENTRY_SIG: {
  118. QTimeEvt_armX(&me->timeEvt, THINK_TIME, 0U);
  119. status_ = Q_HANDLED();
  120. break;
  121. }
  122. /*${AOs::Philo::SM::thinking} */
  123. case Q_EXIT_SIG: {
  124. QTimeEvt_disarm(&me->timeEvt);
  125. status_ = Q_HANDLED();
  126. break;
  127. }
  128. /*${AOs::Philo::SM::thinking::TIMEOUT} */
  129. case TIMEOUT_SIG: {
  130. status_ = Q_TRAN(&Philo_hungry);
  131. break;
  132. }
  133. /*${AOs::Philo::SM::thinking::EAT, DONE} */
  134. case EAT_SIG: /* intentionally fall through */
  135. case DONE_SIG: {
  136. /* EAT or DONE must be for other Philos than this one */
  137. Q_ASSERT_ID(10, Q_EVT_CAST(TableEvt)->philoNum != PHILO_ID(me));
  138. status_ = Q_HANDLED();
  139. break;
  140. }
  141. default: {
  142. status_ = Q_SUPER(&QHsm_top);
  143. break;
  144. }
  145. }
  146. return status_;
  147. }
  148. /*${AOs::Philo::SM::hungry} ................................................*/
  149. static QState Philo_hungry(Philo * const me, QEvt const * const e) {
  150. QState status_;
  151. switch (e->sig) {
  152. /*${AOs::Philo::SM::hungry} */
  153. case Q_ENTRY_SIG: {
  154. TableEvt *pe = Q_NEW(TableEvt, HUNGRY_SIG);
  155. pe->philoNum = PHILO_ID(me);
  156. QACTIVE_POST(AO_Table, &pe->super, me);
  157. status_ = Q_HANDLED();
  158. break;
  159. }
  160. /*${AOs::Philo::SM::hungry::EAT} */
  161. case EAT_SIG: {
  162. /*${AOs::Philo::SM::hungry::EAT::[Q_EVT_CAST(TableEvt)->philoNum=~} */
  163. if (Q_EVT_CAST(TableEvt)->philoNum == PHILO_ID(me)) {
  164. status_ = Q_TRAN(&Philo_eating);
  165. }
  166. else {
  167. status_ = Q_UNHANDLED();
  168. }
  169. break;
  170. }
  171. /*${AOs::Philo::SM::hungry::DONE} */
  172. case DONE_SIG: {
  173. /* DONE must be for other Philos than this one */
  174. Q_ASSERT_ID(20, Q_EVT_CAST(TableEvt)->philoNum != PHILO_ID(me));
  175. status_ = Q_HANDLED();
  176. break;
  177. }
  178. default: {
  179. status_ = Q_SUPER(&QHsm_top);
  180. break;
  181. }
  182. }
  183. return status_;
  184. }
  185. /*${AOs::Philo::SM::eating} ................................................*/
  186. static QState Philo_eating(Philo * const me, QEvt const * const e) {
  187. QState status_;
  188. switch (e->sig) {
  189. /*${AOs::Philo::SM::eating} */
  190. case Q_ENTRY_SIG: {
  191. QTimeEvt_armX(&me->timeEvt, EAT_TIME, 0U);
  192. status_ = Q_HANDLED();
  193. break;
  194. }
  195. /*${AOs::Philo::SM::eating} */
  196. case Q_EXIT_SIG: {
  197. TableEvt *pe = Q_NEW(TableEvt, DONE_SIG);
  198. pe->philoNum = PHILO_ID(me);
  199. QACTIVE_PUBLISH(&pe->super, &me->super);
  200. QTimeEvt_disarm(&me->timeEvt);
  201. status_ = Q_HANDLED();
  202. break;
  203. }
  204. /*${AOs::Philo::SM::eating::TIMEOUT} */
  205. case TIMEOUT_SIG: {
  206. status_ = Q_TRAN(&Philo_thinking);
  207. break;
  208. }
  209. /*${AOs::Philo::SM::eating::EAT, DONE} */
  210. case EAT_SIG: /* intentionally fall through */
  211. case DONE_SIG: {
  212. /* EAT or DONE must be for other Philos than this one */
  213. Q_ASSERT_ID(30, Q_EVT_CAST(TableEvt)->philoNum != PHILO_ID(me));
  214. status_ = Q_HANDLED();
  215. break;
  216. }
  217. default: {
  218. status_ = Q_SUPER(&QHsm_top);
  219. break;
  220. }
  221. }
  222. return status_;
  223. }
  224. /*$enddef${AOs::Philo} ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^*/