Dining Philosopher Problem example with QActive
QActive_armX(&me->super, 0U, THINK_TIME, 0U);
QActive_disarmX(&me->super, 0U);
Q_ERROR(); /* these events should never arrive in this state */
QACTIVE_POST(&AO_Table, HUNGRY_SIG, me->super.prio);
Q_ERROR(); /* this event should never arrive in this state */
QActive_armX(&me->super, 0U, EAT_TIME, 0U);
QActive_disarmX(&me->super, 0U);
QACTIVE_POST(&AO_Table, DONE_SIG, me->super.prio);
Q_ERROR(); /* these events should never arrive in this state */
uint8_t n;
for (n = 0U; n < N_PHILO; ++n) {
me->fork[n] = FREE;
me->isHungry[n] = 0U;
BSP_displayPhilStat(n, "thinking");
}
BSP_terminate(0);
Q_ERROR();
uint8_t n;
for (n = 0U; n < N_PHILO; ++n) { /* give permissions to eat... */
if ((me->isHungry[n] != 0U)
&& (me->fork[LEFT(n)] == FREE)
&& (me->fork[n] == FREE))
{
QActive *philo;
me->fork[LEFT(n)] = USED;
me->fork[n] = USED;
philo = QF_ACTIVE_CAST(Q_ROM_PTR(QF_active[PHILO_0_PRIO + n].act));
QACTIVE_POST(philo, EAT_SIG, n);
me->isHungry[n] = 0U;
BSP_displayPhilStat(n, "eating ");
}
}
uint8_t n, m;
QActive *philo;
n = (uint8_t)(Q_PAR(me) - PHILO_0_PRIO);
/* phil ID must be in range and he must be not hungry */
Q_ASSERT((n < N_PHILO) && (me->isHungry[n] == 0U));
BSP_displayPhilStat(n, "hungry ");
m = LEFT(n);
(me->fork[m] == FREE) && (me->fork[n] == FREE)
me->fork[m] = USED;
me->fork[n] = USED;
philo = QF_ACTIVE_CAST(Q_ROM_PTR(QF_active[PHILO_0_PRIO + n].act));
QACTIVE_POST(philo, EAT_SIG, n);
BSP_displayPhilStat(n, "eating ");
else
me->isHungry[n] = 1U;
uint8_t n, m;
QActive *philo;
n = (uint8_t)(Q_PAR(me) - PHILO_0_PRIO);
/* phil ID must be in range and he must be not hungry */
Q_ASSERT((n < N_PHILO) && (me->isHungry[n] == 0U));
BSP_displayPhilStat(n, "thinking");
m = LEFT(n);
/* both forks of Phil[n] must be used */
Q_ASSERT((me->fork[n] == USED) && (me->fork[m] == USED));
me->fork[m] = FREE;
me->fork[n] = FREE;
m = RIGHT(n); /* check the right neighbor */
if ((me->isHungry[m] != 0U) && (me->fork[m] == FREE)) {
me->fork[n] = USED;
me->fork[m] = USED;
me->isHungry[m] = 0U;
philo = QF_ACTIVE_CAST(Q_ROM_PTR(QF_active[PHILO_0_PRIO + m].act));
QACTIVE_POST(philo, EAT_SIG, m);
BSP_displayPhilStat(m, "eating ");
}
m = LEFT(n); /* check the left neighbor */
n = LEFT(m); /* left fork of the left neighbor */
if ((me->isHungry[m] != 0U) && (me->fork[n] == FREE)) {
me->fork[m] = USED;
me->fork[n] = USED;
me->isHungry[m] = 0U;
philo = QF_ACTIVE_CAST(Q_ROM_PTR(QF_active[PHILO_0_PRIO + m].act));
QACTIVE_POST(philo, EAT_SIG, m);
BSP_displayPhilStat(m, "eating ");
}
Q_ERROR();
BSP_displayPaused(1U);
BSP_displayPaused(0U);
uint8_t n = (uint8_t)(Q_PAR(me) - PHILO_0_PRIO);
/* philo ID must be in range and he must be not hungry */
Q_ASSERT((n < N_PHILO) && (me->isHungry[n] == 0U));
me->isHungry[n] = 1U;
BSP_displayPhilStat(n, "hungry ");
uint8_t n, m;
n = (uint8_t)(Q_PAR(me) - PHILO_0_PRIO);
/* phil ID must be in range and he must be not hungry */
Q_ASSERT((n < N_PHILO) && (me->isHungry[n] == 0U));
BSP_displayPhilStat(n, "thinking");
m = LEFT(n);
/* both forks of Phil[n] must be used */
Q_ASSERT((me->fork[n] == USED) && (me->fork[m] == USED));
me->fork[m] = FREE;
me->fork[n] = FREE;
QActive_ctor(&AO_Philo0.super, Q_STATE_CAST(&Philo_initial));
QActive_ctor(&AO_Philo1.super, Q_STATE_CAST(&Philo_initial));
QActive_ctor(&AO_Philo2.super, Q_STATE_CAST(&Philo_initial));
QActive_ctor(&AO_Philo3.super, Q_STATE_CAST(&Philo_initial));
QActive_ctor(&AO_Philo4.super, Q_STATE_CAST(&Philo_initial));
BSP_randomSeed(123U);
uint8_t n;
Table *me = &AO_Table;
QActive_ctor(&me->super, Q_STATE_CAST(&Table_initial));
for (n = 0U; n < N_PHILO; ++n) {
me->fork[n] = FREE;
me->isHungry[n] = 0U;
}
#ifndef DPP_H
#define DPP_H
enum DPPSignals {
EAT_SIG = Q_USER_SIG, /* published by Table to let a philosopher eat */
DONE_SIG, /* published by Philosopher when done eating */
PAUSE_SIG, /* published by BSP to pause the application */
SERVE_SIG, /* published by BSP to pause the application */
TERMINATE_SIG, /* published by BSP to terminate the application */
HUNGRY_SIG, /* posted direclty to Table from hungry Philo */
MAX_SIG /* the last signal */
};
/* number of philosophers */
#define N_PHILO ((uint8_t)5)
#define PHILO_0_PRIO 1
$declare${AOs::AO_Philo0}
$declare${AOs::AO_Philo1}
$declare${AOs::AO_Philo2}
$declare${AOs::AO_Philo3}
$declare${AOs::AO_Philo4}
$declare${AOs::AO_Table}
$declare${AOs::Philo_ctor}
$declare${AOs::Table_ctor}
#endif /* DPP_H */
#include "qpn.h" /* QP-nano port */
#include "bsp.h" /* Board Support Package */
#include "dpp.h" /* Application interface */
Q_DEFINE_THIS_MODULE("philo")
/* Active object class -----------------------------------------------------*/
$declare${AOs::Philo}
/* Global objects ----------------------------------------------------------*/
$define${AOs::AO_Philo0}
$define${AOs::AO_Philo1}
$define${AOs::AO_Philo2}
$define${AOs::AO_Philo3}
$define${AOs::AO_Philo4}
/* Local objects -----------------------------------------------------------*/
#define THINK_TIME \
(QTimeEvtCtr)((BSP_random() % BSP_TICKS_PER_SEC) + (BSP_TICKS_PER_SEC/2U))
#define EAT_TIME \
(QTimeEvtCtr)((BSP_random() % BSP_TICKS_PER_SEC) + BSP_TICKS_PER_SEC)
/* Philo definition --------------------------------------------------------*/
$define${AOs::Philo_ctor}
$define${AOs::Philo}
#include "qpn.h" /* QP-nano port */
#include "bsp.h" /* Board Support Package */
#include "dpp.h" /* Application interface */
Q_DEFINE_THIS_MODULE("table")
/* Active object class -----------------------------------------------------*/
$declare${AOs::Table}
/* Global objects ----------------------------------------------------------*/
$define${AOs::AO_Table}
#define RIGHT(n_) ((uint8_t)(((n_) + (N_PHILO - 1U)) % N_PHILO))
#define LEFT(n_) ((uint8_t)(((n_) + 1U) % N_PHILO))
#define FREE ((uint8_t)0)
#define USED ((uint8_t)1)
/*..........................................................................*/
$define${AOs::Table_ctor}
$define${AOs::Table}