86 lines
3.2 KiB
C++
Raw Normal View History

2014-10-02 10:40:48 -04:00
//****************************************************************************
2015-05-14 16:05:04 -04:00
// Product: QP-lwIP demonstration
// Last Updated for Version: 5.4.0
// Date of the Last Update: 2015-05-12
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, LLC. All rights reserved.
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 : http://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"
//............................................................................
2015-05-14 16:05:04 -04:00
int main(void) {
static QEvt const *tableQueueSto[N_PHILO + 5];
static QEvt const *philoQueueSto[N_PHILO][N_PHILO];
static QEvt const *lwIPMgrQueueSto[10];
static QSubscrList subscrSto[MAX_PUB_SIG];
2014-10-02 10:40:48 -04:00
2015-05-14 16:05:04 -04:00
static QF_MPOOL_EL(TableEvt) smlPoolSto[20]; // storage for small pool
static QF_MPOOL_EL(TextEvt) medPoolSto[4]; // storage for med. pool
2014-10-02 10:40:48 -04:00
2015-05-14 16:05:04 -04:00
QF::init(); // initialize the framework and the underlying RT kernel
BSP_init(); // initialize the BSP
2014-10-02 10:40:48 -04:00
// object dictionaries...
QS_OBJ_DICTIONARY(smlPoolSto);
2015-05-14 16:05:04 -04:00
QS_OBJ_DICTIONARY(medPoolSto);
QS_OBJ_DICTIONARY(lwIPMgrQueueSto);
2014-10-02 10:40:48 -04:00
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]);
2015-05-14 16:05:04 -04:00
QS_OBJ_DICTIONARY(tableQueueSto);
2014-10-02 10:40:48 -04:00
2015-05-14 16:05:04 -04:00
// initialize publish-subscribe...
QF::psInit(subscrSto, Q_DIM(subscrSto));
2014-10-02 10:40:48 -04:00
// initialize event pools...
2015-05-14 16:05:04 -04:00
QF::poolInit(smlPoolSto, sizeof(smlPoolSto), sizeof(smlPoolSto[0]));
QF::poolInit(medPoolSto, sizeof(medPoolSto), sizeof(medPoolSto[0]));
2014-10-02 10:40:48 -04:00
// start the active objects...
2015-05-14 16:05:04 -04:00
AO_LwIPMgr->start(1U,
lwIPMgrQueueSto, Q_DIM(lwIPMgrQueueSto),
(void *)0, 0U);
2014-10-02 10:40:48 -04:00
for (uint8_t n = 0U; n < N_PHILO; ++n) {
2015-05-14 16:05:04 -04:00
AO_Philo[n]->start(n + 2U,
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-05-14 16:05:04 -04:00
AO_Table->start(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
2015-05-14 16:05:04 -04:00
return QF::run(); // run the application
2014-10-02 10:40:48 -04:00
}
2015-05-14 16:05:04 -04:00