/***************************************************************************** * Product: DPP example for QXK * Last Updated for Version: 5.6.0 * Date of the Last Update: 2015-12-09 * * 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 . * * Contact information: * http://www.state-machine.com * mailto:info@state-machine.com *****************************************************************************/ #include "qpc.h" #include "dpp.h" #include "bsp.h" /*..........................................................................*/ int main() { static QEvt const *tableQueueSto[N_PHILO]; static uint64_t tableStackSto[32]; static QEvt const *philoQueueSto[N_PHILO][N_PHILO]; static uint64_t philoStackSto[N_PHILO][32]; static QSubscrList subscrSto[MAX_PUB_SIG]; static QF_MPOOL_EL(TableEvt) smlPoolSto[2*N_PHILO]; /* small pool */ /* stack for the "naked" test thread */ static void const *testQueueSto[5]; static uint64_t testStackSto[32]; /* stack for the QXK's idle thread */ static uint64_t idleStackSto[16]; uint8_t n; Philo_ctor(); /* instantiate all Philosopher active objects */ Table_ctor(); /* instantiate the Table active object */ Test_ctor(); /* instantiate the Test "naked" thread */ QF_init(); /* initialize the framework */ 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 QXK... */ QXK_init(idleStackSto, sizeof(idleStackSto)); /* 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] */ philoStackSto[n], /* stack storage */ sizeof(philoStackSto[n]), /* stack size [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] */ tableStackSto, /* stack storage */ sizeof(tableStackSto), /* stack size [bytes] */ (QEvt *)0); /* initialization event */ /* start the "naked" thread */ QXTHREAD_START(&XT_Test->super, /* Thread to start */ (uint_fast8_t)7U, /* QP priority of the thread */ testQueueSto, /* message queue storage */ Q_DIM(testQueueSto), /* message length [events] */ testStackSto, /* stack storage */ sizeof(testStackSto), /* stack size [bytes] */ (QEvt *)0); /* initialization event */ return QF_run(); /* run the QF application */ }