1
0
mirror of https://github.com/peterantypas/maiana.git synced 2025-05-17 07:50:10 -07:00
maiana/latest/Firmware/Src/EventQueue.cpp
2020-10-09 12:16:06 -07:00

100 lines
2.3 KiB
C++

/*
Copyright (c) 2016-2020 Peter Antypas
This file is part of the MAIANA™ transponder firmware.
The firmware is free 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.
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 <https://www.gnu.org/licenses/>
*/
#include "EventQueue.hpp"
#include <stm32l4xx.h>
#include "printf_serial.h"
#include "printf_serial.h"
#include "Utils.hpp"
#include "FreeRTOS.h"
#include "queue.h"
#include "task.h"
#define EVENT_QUEUE_SIZE 40
static Event __queue[EVENT_QUEUE_SIZE];
EventQueue &EventQueue::instance()
{
static EventQueue __instance;
return __instance;
}
EventQueue::EventQueue()
{
}
void EventQueue::init()
{
mQueueHandle = xQueueCreateStatic(EVENT_QUEUE_SIZE, sizeof(Event), (uint8_t*)&__queue[0], &mQueue);
configASSERT(mQueueHandle);
}
void EventQueue::push(const Event &e)
{
if ( xTaskGetSchedulerState() != taskSCHEDULER_RUNNING )
return;
BaseType_t xHighPriorityTaskWoken = pdFALSE;
if ( Utils::inISR() )
{
xQueueSendFromISR(mQueueHandle, &e, &xHighPriorityTaskWoken);
if ( xHighPriorityTaskWoken )
portYIELD_FROM_ISR(xHighPriorityTaskWoken);
}
else
{
xQueueSend(mQueueHandle, &e, 0);
}
}
void EventQueue::addObserver(EventConsumer *c, uint32_t eventMask)
{
mConsumers[c] = eventMask;
}
void EventQueue::removeObserver(EventConsumer *c)
{
map<EventConsumer*, uint32_t>::iterator i = mConsumers.find(c);
if ( i == mConsumers.end() )
return;
mConsumers.erase(i);
}
void EventQueue::dispatch()
{
Event e;
while ( xQueueReceive(mQueueHandle, &e, 10) == pdTRUE )
{
for ( map<EventConsumer*, uint32_t>::iterator c = mConsumers.begin(); c != mConsumers.end(); ++c )
{
if ( c->second & e.type )
{
c->first->processEvent(e);
}
}
}
}