mirror of
https://github.com/nonoo/kappanhang.git
synced 2025-12-06 08:02:00 +01:00
53 lines
1.2 KiB
Go
53 lines
1.2 KiB
Go
package main
|
|
|
|
import "time"
|
|
|
|
// This value is sent to the transceiver and - according to my observations - it will use
|
|
// this as it's RX buf length. Note that if it is set to larger than 500-600ms then audio TX
|
|
// won't work (small radio memory?)
|
|
const txSeqBufLength = 300 * time.Millisecond
|
|
|
|
type txSeqBufEntry struct {
|
|
seq seqNum
|
|
data []byte
|
|
addedAt time.Time
|
|
}
|
|
|
|
type txSeqBufStruct struct {
|
|
entries []txSeqBufEntry
|
|
}
|
|
|
|
func (s *txSeqBufStruct) add(seq seqNum, p []byte) {
|
|
s.entries = append(s.entries, txSeqBufEntry{
|
|
seq: seq,
|
|
data: p,
|
|
addedAt: time.Now(),
|
|
})
|
|
s.purgeOldEntries()
|
|
}
|
|
|
|
func (s *txSeqBufStruct) purgeOldEntries() {
|
|
// We keep much more entries than the specified length of the TX seqbuf, so we can serve
|
|
// any requests coming from the server.
|
|
for len(s.entries) > 0 && time.Since(s.entries[0].addedAt) > txSeqBufLength*10 {
|
|
s.entries = s.entries[1:]
|
|
}
|
|
}
|
|
|
|
func (s *txSeqBufStruct) get(seq seqNum) (d []byte) {
|
|
if len(s.entries) == 0 {
|
|
return nil
|
|
}
|
|
|
|
// Searching from backwards, as we expect most queries for latest entries.
|
|
for i := len(s.entries) - 1; i >= 0; i-- {
|
|
if s.entries[i].seq == seq {
|
|
d = make([]byte, len(s.entries[i].data))
|
|
copy(d, s.entries[i].data)
|
|
break
|
|
}
|
|
}
|
|
s.purgeOldEntries()
|
|
return d
|
|
}
|