83 lines
3.0 KiB
C++
Raw Normal View History

2017-05-17 13:15:09 -04:00
//****************************************************************************
// DPP example
2018-06-16 17:21:53 -04:00
// Last Updated for Version: 6.3.2
// Date of the Last Update: 2018-06-16
2017-05-17 13:15:09 -04:00
//
// Q u a n t u m L e a P s
// ---------------------------
// innovating embedded systems
//
// Copyright (C) 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 <http://www.gnu.org/licenses/>.
//
// Contact information:
2018-03-19 14:51:26 -04:00
// https://www.state-machine.com
2017-05-17 13:15:09 -04:00
// mailto:info@state-machine.com
//****************************************************************************
#include "qpcpp.h"
#include "dpp.h"
#include "bsp.h"
2018-06-16 17:21:53 -04:00
using namespace DPP;
2017-05-17 13:15:09 -04:00
//............................................................................
2018-03-19 14:51:26 -04:00
int main(int argc, char *argv[]) {
2017-05-17 13:15:09 -04:00
static QP::QEvt const *tableQueueSto[N_PHILO];
static QP::QEvt const *philoQueueSto[N_PHILO][N_PHILO];
2018-06-16 17:21:53 -04:00
static QP::QSubscrList subscrSto[MAX_PUB_SIG];
static QF_MPOOL_EL(TableEvt) smlPoolSto[2*N_PHILO];
2017-05-17 13:15:09 -04:00
QP::QF::init(); // initialize the framework and the underlying RT kernel
2018-06-16 17:21:53 -04:00
BSP::init(argc, argv); // initialize the BSP
2017-05-17 13:15:09 -04:00
// object dictionaries...
2018-06-16 17:21:53 -04:00
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]);
2017-05-17 13:15:09 -04:00
QS_OBJ_DICTIONARY(smlPoolSto);
2018-06-16 17:21:53 -04:00
// pause execution of the test and wait for the test script to continue
2017-05-17 13:15:09 -04:00
QS_TEST_PAUSE();
// initialize publish-subscribe...
QP::QF::psInit(subscrSto, Q_DIM(subscrSto));
// initialize event pools...
QP::QF::poolInit(smlPoolSto,
sizeof(smlPoolSto), sizeof(smlPoolSto[0]));
// start the active objects...
for (uint8_t n = 0U; n < N_PHILO; ++n) {
2018-06-16 17:21:53 -04:00
AO_Philo[n]->start((uint_fast8_t)(n + 1U), // priority
2017-05-17 13:15:09 -04:00
philoQueueSto[n], Q_DIM(philoQueueSto[n]),
(void *)0, 0U);
}
2018-06-16 17:21:53 -04:00
AO_Table->start((uint_fast8_t)(N_PHILO + 1U), // priority
2017-05-17 13:15:09 -04:00
tableQueueSto, Q_DIM(tableQueueSto),
(void *)0, 0U);
return QP::QF::run(); // run the QF application
}