79 lines
3.0 KiB
C++
Raw Normal View History

2014-10-02 10:40:48 -04:00
//****************************************************************************
2015-05-14 16:05:04 -04:00
// DPP example
2015-12-31 14:56:37 -05:00
// Last updated for version 5.6.0
// Last updated on 2015-12-26
2014-10-02 10:40:48 -04:00
//
// Q u a n t u m L e a P s
// ---------------------------
// innovating embedded systems
//
2015-05-14 16:05:04 -04:00
// Copyright (C) Quantum Leaps, www.state-machine.com.
2014-10-02 10:40:48 -04:00
//
// 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:
2015-05-14 16:05:04 -04:00
// Web: www.state-machine.com
2014-10-02 10:40:48 -04:00
// Email: info@state-machine.com
//****************************************************************************
2015-05-14 16:05:04 -04:00
#include "qpcpp.h"
2014-10-02 10:40:48 -04:00
#include "dpp.h"
#include "bsp.h"
//............................................................................
int main() {
static QP::QEvt const *tableQueueSto[N_PHILO];
static QP::QEvt const *philoQueueSto[N_PHILO][N_PHILO];
static QP::QSubscrList subscrSto[DPP::MAX_PUB_SIG];
static QF_MPOOL_EL(DPP::TableEvt) smlPoolSto[2*N_PHILO];
QP::QF::init(); // initialize the framework and the underlying RT kernel
2015-12-31 14:56:37 -05:00
DPP::BSP::init(); // initialize the BSP
2014-10-02 10:40:48 -04:00
// object dictionaries...
QS_OBJ_DICTIONARY(smlPoolSto);
QS_OBJ_DICTIONARY(tableQueueSto);
QS_OBJ_DICTIONARY(philoQueueSto[0]);
QS_OBJ_DICTIONARY(philoQueueSto[1]);
QS_OBJ_DICTIONARY(philoQueueSto[2]);
QS_OBJ_DICTIONARY(philoQueueSto[3]);
QS_OBJ_DICTIONARY(philoQueueSto[4]);
QP::QF::psInit(subscrSto, Q_DIM(subscrSto)); // init publish-subscribe
// 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) {
2015-06-06 18:30:55 -04:00
DPP::AO_Philo[n]->start((uint_fast8_t)(n + 1U),
2014-10-02 10:40:48 -04:00
philoQueueSto[n], Q_DIM(philoQueueSto[n]),
2015-05-14 16:05:04 -04:00
(void *)0, 0U);
2014-10-02 10:40:48 -04:00
}
2015-12-31 14:56:37 -05:00
// leave the priority level (N_PHILO + 1) free for the mutex in BSP
DPP::AO_Table->start((uint_fast8_t)(N_PHILO + 2U),
2014-10-02 10:40:48 -04:00
tableQueueSto, Q_DIM(tableQueueSto),
2015-05-14 16:05:04 -04:00
(void *)0, 0U);
2014-10-02 10:40:48 -04:00
return QP::QF::run(); // run the QF application
}