mirror of
https://github.com/meshtastic/firmware.git
synced 2025-12-31 23:21:06 +00:00
* Initial version of NextHopRouter * Set original hop limit in header flags * Short-circuit to FloodingRouter for broadcasts * If packet traveled 1 hop, set `relay_node` as `next_hop` for the original transmitter * Set last byte to 0xFF if it ended at 0x00 As per an idea of @S5NC * Also update next-hop based on received DM for us * temp * Add 1 retransmission for intermediate hops when using NextHopRouter * Add next_hop and relayed_by in PacketHistory for setting next-hop and handle flooding fallback * Update protos, store multiple relayers * Remove next-hop update logic from NeighborInfoModule * Fix retransmissions * Improve ACKs for repeated packets and responses * Stop retransmission even if there's not relay node * Revert perhapsRebroadcast() * Remove relayer if we cancel a transmission * Better checking for fallback to flooding * Fix newlines in traceroute print logs * Stop retransmission for original packet * Use relayID * Also when want_ack is set, we should try to retransmit * Fix cppcheck error * Fix 'router' not in scope error * Fix another cppcheck error * Check for hop_limit and also update next hop when `hop_start == hop_limit` on ACK Also check for broadcast in `getNextHop()` * Formatting and correct NUM_RETRANSMISSIONS * Update protos * Start retransmissions in NextHopRouter if ReliableRouter didn't do it * Handle repeated/fallback to flooding packets properly First check if it's not still in the TxQueue * Guard against clients setting `next_hop`/`relay_node` * Don't cancel relay if we were the assigned next-hop * Replies (e.g. tapback emoji) are also a valid confirmation of receipt --------- Co-authored-by: GUVWAF <thijs@havinga.eu> Co-authored-by: Thomas Göttgens <tgoettgens@gmail.com> Co-authored-by: Tom Fifield <tom@tomfifield.net> Co-authored-by: GUVWAF <78759985+GUVWAF@users.noreply.github.com>
43 lines
1.2 KiB
C++
43 lines
1.2 KiB
C++
#pragma once
|
|
|
|
#include "MeshTypes.h"
|
|
|
|
#include <queue>
|
|
|
|
/**
|
|
* A priority queue of packets
|
|
*/
|
|
class MeshPacketQueue
|
|
{
|
|
size_t maxLen;
|
|
std::vector<meshtastic_MeshPacket *> queue;
|
|
|
|
/** Replace a lower priority package in the queue with 'mp' (provided there are lower pri packages). Return true if replaced.
|
|
*/
|
|
bool replaceLowerPriorityPacket(meshtastic_MeshPacket *mp);
|
|
|
|
public:
|
|
explicit MeshPacketQueue(size_t _maxLen);
|
|
|
|
/** enqueue a packet, return false if full */
|
|
bool enqueue(meshtastic_MeshPacket *p);
|
|
|
|
/** return true if the queue is empty */
|
|
bool empty();
|
|
|
|
/** 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; }
|
|
|
|
meshtastic_MeshPacket *dequeue();
|
|
|
|
meshtastic_MeshPacket *getFront();
|
|
|
|
/** Attempt to find and remove a packet from this queue. Returns the packet which was removed from the queue */
|
|
meshtastic_MeshPacket *remove(NodeNum from, PacketId id, bool tx_normal = true, bool tx_late = true);
|
|
|
|
/* Attempt to find a packet from this queue. Return true if it was found. */
|
|
bool find(NodeNum from, PacketId id);
|
|
}; |