int main() { static QP::QEvt const *tableQueueSto[N_PHILO]; static uint64_t tableStackSto[64]; static QP::QEvt const *philoQueueSto[N_PHILO][N_PHILO]; static uint64_t philoStackSto[N_PHILO][64]; static QP::QSubscrList subscrSto[DPP::MAX_PUB_SIG]; static QF_MPOOL_EL(DPP::TableEvt) smlPoolSto[2*N_PHILO]; // small pool // stack for the "naked" test thread static QP::QEvt const *testQueueSto[5]; static uint64_t testStackSto[64]; // stack for the QXK's idle thread static uint64_t idleStackSto[32]; QP::QF::init(); // initialize the framework and the underlying RT kernel QP::QXK::init(idleStackSto, sizeof(idleStackSto)); // initialize QXK DPP::BSP::init(); // initialize the BSP // object dictionaries... . . . 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) { DPP::AO_Philo[n]->start( static_cast(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] static_cast(0)); // initialization event } // leave the priority level (N_PHILO + 1) free for the mutex in BSP DPP::AO_Table->start( static_cast(N_PHILO + 2), // QP priority of the AO tableQueueSto, // event queue storage Q_DIM(tableQueueSto), // queue length [events] tableStackSto, // stack storage sizeof(tableStackSto), // stack size [bytes] static_cast(0)); // initialization event // start the "naked" test thread DPP::XT_Test->start( static_cast(10), // QP priority of the AO testQueueSto, // event queue storage Q_DIM(testQueueSto), // queue length [events] testStackSto, // stack storage sizeof(testStackSto), // stack size [bytes] static_cast(0)); // initialization event return QP::QF::run(); // run the QF application }