mirror of
https://github.com/meshtastic/firmware.git
synced 2025-09-24 10:19:19 +00:00
40bc04b521
* Fix potential duplicate packets to PhoneAPI/MQTT * Fix include error for STM32 * Fix cppcheck error
90 lines
3.2 KiB
C++
90 lines
3.2 KiB
C++
#include "PacketHistory.h"
|
|
#include "configuration.h"
|
|
#include "mesh-pb-constants.h"
|
|
|
|
#ifdef ARCH_PORTDUINO
|
|
#include "platform/portduino/PortduinoGlue.h"
|
|
#endif
|
|
#include "Throttle.h"
|
|
|
|
PacketHistory::PacketHistory()
|
|
{
|
|
recentPackets.reserve(MAX_NUM_NODES); // Prealloc the worst case # of records - to prevent heap fragmentation
|
|
// setup our periodic task
|
|
}
|
|
|
|
/**
|
|
* Update recentBroadcasts and return true if we have already seen this packet
|
|
*/
|
|
bool PacketHistory::wasSeenRecently(const meshtastic_MeshPacket *p, bool withUpdate, bool *isRepeated)
|
|
{
|
|
if (p->id == 0) {
|
|
LOG_DEBUG("Ignore message with zero id");
|
|
return false; // Not a floodable message ID, so we don't care
|
|
}
|
|
|
|
PacketRecord r;
|
|
r.id = p->id;
|
|
r.sender = getFrom(p);
|
|
r.rxTimeMsec = millis();
|
|
|
|
auto found = recentPackets.find(r);
|
|
bool seenRecently = (found != recentPackets.end()); // found not equal to .end() means packet was seen recently
|
|
|
|
if (seenRecently &&
|
|
!Throttle::isWithinTimespanMs(found->rxTimeMsec, FLOOD_EXPIRE_TIME)) { // Check whether found packet has already expired
|
|
recentPackets.erase(found); // Erase and pretend packet has not been seen recently
|
|
found = recentPackets.end();
|
|
seenRecently = false;
|
|
}
|
|
|
|
/* If the original transmitter is doing retransmissions (hopStart equals hopLimit) for a reliable transmission, e.g., when the
|
|
ACK got lost, we will handle the packet again to make sure it gets an ACK/response to its packet. */
|
|
if (seenRecently && p->hop_start > 0 && p->hop_start == p->hop_limit) {
|
|
if (withUpdate)
|
|
LOG_DEBUG("Repeated reliable tx");
|
|
|
|
if (isRepeated)
|
|
*isRepeated = true;
|
|
|
|
seenRecently = false;
|
|
}
|
|
|
|
if (seenRecently) {
|
|
LOG_DEBUG("Found existing packet record for fr=0x%x,to=0x%x,id=0x%x", p->from, p->to, p->id);
|
|
}
|
|
|
|
if (withUpdate) {
|
|
if (found != recentPackets.end()) { // delete existing to updated timestamp (re-insert)
|
|
recentPackets.erase(found); // as unsorted_set::iterator is const (can't update timestamp - so re-insert..)
|
|
}
|
|
recentPackets.insert(r);
|
|
LOG_DEBUG("Add packet record fr=0x%x, id=0x%x", p->from, p->id);
|
|
}
|
|
|
|
// Capacity is reerved, so only purge expired packets if recentPackets fills past 90% capacity
|
|
// Expiry is normally dealt with after having searched/found a packet (above)
|
|
if (recentPackets.size() > (MAX_NUM_NODES * 0.9)) {
|
|
clearExpiredRecentPackets();
|
|
}
|
|
|
|
return seenRecently;
|
|
}
|
|
|
|
/**
|
|
* Iterate through all recent packets, and remove all older than FLOOD_EXPIRE_TIME
|
|
*/
|
|
void PacketHistory::clearExpiredRecentPackets()
|
|
{
|
|
LOG_DEBUG("recentPackets size=%ld", recentPackets.size());
|
|
|
|
for (auto it = recentPackets.begin(); it != recentPackets.end();) {
|
|
if (!Throttle::isWithinTimespanMs(it->rxTimeMsec, FLOOD_EXPIRE_TIME)) {
|
|
it = recentPackets.erase(it); // erase returns iterator pointing to element immediately following the one erased
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
|
|
LOG_DEBUG("recentPackets size=%ld (after clearing expired packets)", recentPackets.size());
|
|
} |