2021-02-11 11:00:17 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "MeshTypes.h"
|
|
|
|
|
|
|
|
#include <queue>
|
|
|
|
|
|
|
|
/**
|
2021-07-31 19:42:48 +00:00
|
|
|
* A priority queue of packets
|
2021-02-11 11:00:17 +00:00
|
|
|
*/
|
2021-07-31 19:42:48 +00:00
|
|
|
class MeshPacketQueue
|
2021-02-11 11:00:17 +00:00
|
|
|
{
|
|
|
|
size_t maxLen;
|
2023-01-21 17:22:19 +00:00
|
|
|
std::vector<meshtastic_MeshPacket *> queue;
|
2021-07-31 19:42:48 +00:00
|
|
|
|
2023-01-21 13:34:29 +00:00
|
|
|
/** Replace a lower priority package in the queue with 'mp' (provided there are lower pri packages). Return true if replaced.
|
|
|
|
*/
|
2023-01-21 17:22:19 +00:00
|
|
|
bool replaceLowerPriorityPacket(meshtastic_MeshPacket *mp);
|
2021-07-31 19:42:48 +00:00
|
|
|
|
2021-02-11 11:00:17 +00:00
|
|
|
public:
|
2022-01-24 18:39:17 +00:00
|
|
|
explicit MeshPacketQueue(size_t _maxLen);
|
2021-02-11 11:00:17 +00:00
|
|
|
|
|
|
|
/** enqueue a packet, return false if full */
|
2023-01-21 17:22:19 +00:00
|
|
|
bool enqueue(meshtastic_MeshPacket *p);
|
2021-02-11 11:00:17 +00:00
|
|
|
|
2021-07-31 19:42:48 +00:00
|
|
|
/** return true if the queue is empty */
|
|
|
|
bool empty();
|
2021-02-11 11:00:17 +00:00
|
|
|
|
2023-01-04 12:56:52 +00:00
|
|
|
/** return amount of free packets in Queue */
|
|
|
|
size_t getFree() { return maxLen - queue.size(); }
|
|
|
|
|
|
|
|
/** return total size of the Queue */
|
|
|
|
size_t getMaxLen() { return maxLen; }
|
|
|
|
|
2023-01-21 17:22:19 +00:00
|
|
|
meshtastic_MeshPacket *dequeue();
|
2021-02-11 11:00:17 +00:00
|
|
|
|
2023-01-21 17:22:19 +00:00
|
|
|
meshtastic_MeshPacket *getFront();
|
2022-04-20 17:58:52 +00:00
|
|
|
|
2021-07-31 19:42:48 +00:00
|
|
|
/** Attempt to find and remove a packet from this queue. Returns the packet which was removed from the queue */
|
2023-01-21 17:22:19 +00:00
|
|
|
meshtastic_MeshPacket *remove(NodeNum from, PacketId id);
|
2022-01-24 18:39:17 +00:00
|
|
|
};
|