mirror of
https://github.com/QuantumLeaps/qpc.git
synced 2025-01-28 07:03:10 +08:00
100 lines
4.1 KiB
C
100 lines
4.1 KiB
C
/*****************************************************************************
|
|
* Product: DPP example
|
|
* Last updated for version 6.4.0
|
|
* Last updated on 2019-02-08
|
|
*
|
|
* Q u a n t u m L e a P s
|
|
* ------------------------
|
|
* Modern Embedded Software
|
|
*
|
|
* Copyright (C) 2005-2019 Quantum Leaps, LLC. All rights reserved.
|
|
*
|
|
* This program is open source software: you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License as published
|
|
* by the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Alternatively, this program may be distributed and modified under the
|
|
* terms of Quantum Leaps commercial licenses, which expressly supersede
|
|
* the GNU General Public License and are specifically designed for
|
|
* licensees interested in retaining the proprietary status of their code.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <www.gnu.org/licenses/>.
|
|
*
|
|
* Contact information:
|
|
* <www.state-machine.com/licensing>
|
|
* <info@state-machine.com>
|
|
*****************************************************************************/
|
|
#include "qpc.h"
|
|
#include "dpp.h"
|
|
#include "bsp.h"
|
|
|
|
Q_DEFINE_THIS_FILE
|
|
|
|
/*..........................................................................*/
|
|
int main(int argc, char *argv[]) {
|
|
static QEvt const *tableQueueSto[N_PHILO];
|
|
static QEvt const *philoQueueSto[N_PHILO][N_PHILO];
|
|
static QSubscrList subscrSto[MAX_PUB_SIG];
|
|
static QF_MPOOL_EL(TableEvt) smlPoolSto[2*N_PHILO]; /* small pool */
|
|
uint8_t n;
|
|
|
|
QF_init(); /* initialize the framework and the underlying RT kernel */
|
|
BSP_init(argc, argv); /* initialize the Board Support Package */
|
|
|
|
/* object dictionaries... */
|
|
QS_OBJ_DICTIONARY(AO_Table);
|
|
QS_OBJ_DICTIONARY(AO_Philo[0]);
|
|
QS_OBJ_DICTIONARY(AO_Philo[1]);
|
|
QS_OBJ_DICTIONARY(AO_Philo[2]);
|
|
QS_OBJ_DICTIONARY(AO_Philo[3]);
|
|
QS_OBJ_DICTIONARY(AO_Philo[4]);
|
|
|
|
/* signal dictionaries */
|
|
QS_SIG_DICTIONARY(DONE_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(EAT_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(PAUSE_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(SERVE_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(TEST_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(HUNGRY_SIG, (void *)0);
|
|
QS_SIG_DICTIONARY(TIMEOUT_SIG, (void *)0);
|
|
|
|
/* pause execution of the test and wait for the test script to continue */
|
|
QS_TEST_PAUSE();
|
|
|
|
/* initialize publish-subscribe... */
|
|
QF_psInit(subscrSto, Q_DIM(subscrSto));
|
|
|
|
/* initialize event pools... */
|
|
QF_poolInit(smlPoolSto, sizeof(smlPoolSto), sizeof(smlPoolSto[0]));
|
|
|
|
/* start the active objects... */
|
|
Philo_ctor(); /* instantiate all Philosopher active objects */
|
|
for (n = 0U; n < N_PHILO; ++n) {
|
|
QACTIVE_START(AO_Philo[n], /* AO to start */
|
|
(uint_fast8_t)(n + 1), /* QP priority of the AO */
|
|
philoQueueSto[n], /* event queue storage */
|
|
Q_DIM(philoQueueSto[n]), /* queue length [events] */
|
|
(void *)0, /* stack storage (not used) */
|
|
0U, /* size of the stack [bytes] */
|
|
(QEvt *)0); /* initialization event */
|
|
}
|
|
|
|
Table_ctor(); /* instantiate the Table active object */
|
|
QACTIVE_START(AO_Table, /* AO to start */
|
|
(uint_fast8_t)(N_PHILO + 1), /* QP priority of the AO */
|
|
tableQueueSto, /* event queue storage */
|
|
Q_DIM(tableQueueSto), /* queue length [events] */
|
|
(void *)0, /* stack storage (not used) */
|
|
0U, /* size of the stack [bytes] */
|
|
(QEvt *)0); /* initialization event */
|
|
|
|
return QF_run(); /* run the QF application */
|
|
}
|