mirror of
https://github.com/QuantumLeaps/qpc.git
synced 2025-01-14 06:43:19 +08:00
112 lines
4.9 KiB
C
112 lines
4.9 KiB
C
/*****************************************************************************
|
|
* Product: DPP example for Windows
|
|
* Last Updated for Version: 5.7.5
|
|
* Date of the Last Update: 2016-11-08
|
|
*
|
|
* 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:
|
|
* Web : https://state-machine.com
|
|
* Email: info@state-machine.com
|
|
*****************************************************************************/
|
|
#include "qpc.h"
|
|
#include "dpp.h"
|
|
#include "bsp.h"
|
|
|
|
/* "fudge factor" for Windows, see NOTE1 */
|
|
enum { WIN_FUDGE_FACTOR = 10 };
|
|
|
|
/*..........................................................................*/
|
|
int main() {
|
|
static QEvt const *tableQueueSto[N_PHILO*WIN_FUDGE_FACTOR];
|
|
static QEvt const *philoQueueSto[N_PHILO][N_PHILO*WIN_FUDGE_FACTOR];
|
|
static QF_MPOOL_EL(TableEvt) smlPoolSto[2*N_PHILO*WIN_FUDGE_FACTOR];
|
|
static QSubscrList subscrSto[MAX_PUB_SIG];
|
|
uint8_t n;
|
|
|
|
Philo_ctor(); /* instantiate all Philosopher active objects */
|
|
Table_ctor(); /* instantiate the Table active object */
|
|
|
|
QF_init(); /* initialize the framework and the underlying RT kernel */
|
|
BSP_init(); /* initialize the Board Support Package */
|
|
|
|
/* 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]);
|
|
|
|
/* initialize publish-subscribe... */
|
|
QF_psInit(subscrSto, Q_DIM(subscrSto));
|
|
|
|
/* initialize event pools... */
|
|
QF_poolInit(smlPoolSto, sizeof(smlPoolSto), sizeof(smlPoolSto[0]));
|
|
|
|
/* start the 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 */
|
|
}
|
|
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 */
|
|
}
|
|
|
|
/*****************************************************************************
|
|
* NOTE1:
|
|
* Windows is not a deterministic real-time system, which means that the
|
|
* system can occasionally and unexpectedly "choke and freeze" for a number
|
|
* of seconds. The designers of Windows have dealt with these sort of issues
|
|
* by massively oversizing the resources available to the applications. For
|
|
* example, the default Windows GUI message queues size is 10,000 entries,
|
|
* which can dynamically grow to an even larger number. Also the stacks of
|
|
* Win32 threads can dynamically grow to several megabytes.
|
|
*
|
|
* In contrast, the event queues, event pools, and stack size inside the
|
|
* real-time embedded (RTE) systems can be (and must be) much smaller,
|
|
* because you typically can put an upper bound on the real-time behavior
|
|
* and the resulting delays.
|
|
*
|
|
* To be able to run the unmodified applications designed originally for
|
|
* RTE systems on Windows, and to reduce the odds of resource shortages in
|
|
* this case, the generous WIN_FUDGE_FACTOR is used to oversize the
|
|
* event queues and event pools.
|
|
*/
|
|
|