mirror of
https://github.com/QuantumLeaps/qpcpp.git
synced 2025-01-28 06:02:56 +08:00
95 lines
4.1 KiB
C++
95 lines
4.1 KiB
C++
//////////////////////////////////////////////////////////////////////////////
|
|
// Product: DPP example
|
|
// Last Updated for Version: 4.5.00
|
|
// Date of the Last Update: May 20, 2012
|
|
//
|
|
// Q u a n t u m L e a P s
|
|
// ---------------------------
|
|
// innovating embedded systems
|
|
//
|
|
// Copyright (C) 2002-2012 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 2 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:
|
|
// Quantum Leaps Web sites: http://www.quantum-leaps.com
|
|
// http://www.state-machine.com
|
|
// e-mail: info@quantum-leaps.com
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
#include "qp_port.h"
|
|
#include "dpp.h"
|
|
#include "bsp.h"
|
|
|
|
// Local-scope objects -------------------------------------------------------
|
|
static QEvt const *l_tableQueueSto[N_PHILO];
|
|
static QEvt const *l_philoQueueSto[N_PHILO][N_PHILO];
|
|
static QSubscrList l_subscrSto[MAX_PUB_SIG];
|
|
|
|
static union SmallEvents {
|
|
void *e0; // minimum event size
|
|
uint8_t e1[sizeof(TableEvt)];
|
|
// ... other event types to go into this pool
|
|
} l_smlPoolSto[2*N_PHILO]; // storage for the small event pool
|
|
|
|
static OS_STK l_philoStk[N_PHILO][256]; // stacks for the Philosophers
|
|
static OS_STK l_tableStk[256]; // stack for the Table
|
|
static OS_STK l_ucosTaskStk[256]; // stack for the ucosTask
|
|
|
|
//............................................................................
|
|
int main(int argc, char *argv[]) {
|
|
|
|
BSP_init(argc, argv); // initialize the BSP
|
|
|
|
QF::init(); // initialize the framework and the underlying RT kernel
|
|
|
|
// object dictionaries...
|
|
QS_OBJ_DICTIONARY(l_smlPoolSto);
|
|
QS_OBJ_DICTIONARY(l_tableQueueSto);
|
|
QS_OBJ_DICTIONARY(l_philoQueueSto[0]);
|
|
QS_OBJ_DICTIONARY(l_philoQueueSto[1]);
|
|
QS_OBJ_DICTIONARY(l_philoQueueSto[2]);
|
|
QS_OBJ_DICTIONARY(l_philoQueueSto[3]);
|
|
QS_OBJ_DICTIONARY(l_philoQueueSto[4]);
|
|
|
|
QF::psInit(l_subscrSto, Q_DIM(l_subscrSto)); // init publish-subscribe
|
|
|
|
// initialize event pools...
|
|
QF::poolInit(l_smlPoolSto, sizeof(l_smlPoolSto), sizeof(l_smlPoolSto[0]));
|
|
|
|
// start the active objects...
|
|
uint8_t n;
|
|
for (n = 0; n < N_PHILO; ++n) {
|
|
AO_Philo[n]->start((uint8_t)(n + 1),
|
|
l_philoQueueSto[n], Q_DIM(l_philoQueueSto[n]),
|
|
l_philoStk[n], sizeof(l_philoStk[n]), (QEvt *)0);
|
|
}
|
|
AO_Table->start((uint8_t)(N_PHILO + 1),
|
|
l_tableQueueSto, Q_DIM(l_tableQueueSto),
|
|
l_tableStk, sizeof(l_tableStk), (QEvt *)0);
|
|
|
|
// create a uC/OS-II task to start interrupts and poll the keyboard
|
|
OSTaskCreate(&ucosTask,
|
|
(void *)0, // pdata
|
|
&l_ucosTaskStk[Q_DIM(l_ucosTaskStk) - 1],
|
|
0); // the highest uC/OS-II priority
|
|
|
|
return QF::run(); // run the QF application
|
|
}
|
|
|