mirror of
https://github.com/moonlight-stream/moonlight-common-c.git
synced 2025-08-18 01:15:46 +00:00
718 lines
29 KiB
C
718 lines
29 KiB
C
#include "Limelight-internal.h"
|
|
|
|
#if defined(LC_DEBUG) && !defined(LC_FUZZING)
|
|
// This enables FEC validation mode with a synthetic drop
|
|
// and recovered packet checks vs the original input. It
|
|
// is on by default for debug builds.
|
|
//
|
|
// NB: Unlike the video FEC feature of the same name, this
|
|
// is much more restrictive in terms of when the validation
|
|
// runs. Due to the logic to immediately return in-order
|
|
// data packets, it requires non-consecutive data packets to
|
|
// trigger the call to completeFecBlock(). Missing or OOO
|
|
// packets will do the job.
|
|
#define FEC_VALIDATION_MODE
|
|
#define FEC_VERBOSE
|
|
#endif
|
|
|
|
#define RTP_PAYLOAD_TYPE_AUDIO 97
|
|
#define RTP_PAYLOAD_TYPE_FEC 127
|
|
|
|
void RtpaInitializeQueue(PRTP_AUDIO_QUEUE queue) {
|
|
memset(queue, 0, sizeof(*queue));
|
|
|
|
// We will start in the synchronizing state, where we wait for the first
|
|
// full FEC block before reporting losses, out of order packets, etc.
|
|
queue->synchronizing = true;
|
|
|
|
// Older versions of GFE violate some invariants that our FEC code requires, so we turn it off for
|
|
// anything older than GFE 3.19 just to be safe. GFE seems to have changed to the "modern" behavior
|
|
// between GFE 3.18 and 3.19.
|
|
//
|
|
// In the case of GFE 3.13, it does send FEC packets but it requires very special handling because:
|
|
// a) data and FEC shards may vary in size
|
|
// b) FEC blocks can start on boundaries that are not multiples of RTPA_DATA_SHARDS
|
|
//
|
|
// It doesn't seem worth it to sink a bunch of hours into figure out how to properly handle audio FEC
|
|
// for a 3 year old version of GFE that almost nobody uses. Instead, we'll just disable the FEC queue
|
|
// entirely and pass all audio data straight to the decoder.
|
|
//
|
|
if (!APP_VERSION_AT_LEAST(7, 1, 415)) {
|
|
Limelog("Audio FEC has been disabled due to an incompatibility with your host's old software.\n");
|
|
Limelog("Audio quality may suffer on unreliable network connections due to lack of FEC!\n");
|
|
queue->incompatibleServer = true;
|
|
}
|
|
|
|
reed_solomon_init();
|
|
|
|
// The number of data and parity shards is constant, so we can reuse
|
|
// the same RS matrices for all traffic.
|
|
queue->rs = reed_solomon_new(RTPA_DATA_SHARDS, RTPA_FEC_SHARDS);
|
|
|
|
// For unknown reasons, the RS parity matrix computed by our RS implementation
|
|
// doesn't match the one Nvidia uses for audio data. I'm not exactly sure why,
|
|
// but we can simply replace it with the matrix generated by OpenFEC which
|
|
// works correctly. This is possible because the data and FEC shard count is
|
|
// constant and known in advance.
|
|
const unsigned char parity[] = { 0x77, 0x40, 0x38, 0x0e, 0xc7, 0xa7, 0x0d, 0x6c };
|
|
memcpy(&queue->rs->m[16], parity, sizeof(parity));
|
|
memcpy(queue->rs->parity, parity, sizeof(parity));
|
|
}
|
|
|
|
static void validateFecBlockState(PRTP_AUDIO_QUEUE queue) {
|
|
#ifdef LC_DEBUG
|
|
PRTPA_FEC_BLOCK lastBlock = queue->blockHead;
|
|
|
|
// The next sequence number must not be less than the oldest BSN unless we're still synchronizing with the source
|
|
LC_ASSERT(!isBefore16(queue->nextRtpSequenceNumber, queue->oldestRtpBaseSequenceNumber) || queue->synchronizing);
|
|
|
|
if (lastBlock == NULL) {
|
|
return;
|
|
}
|
|
|
|
uint16_t lastSeqNum = lastBlock->fecHeader.baseSequenceNumber;
|
|
uint32_t lastTs = lastBlock->fecHeader.baseTimestamp;
|
|
|
|
// The head should not have a previous entry
|
|
LC_ASSERT(lastBlock->prev == NULL);
|
|
|
|
// The next sequence number must not exceed the first FEC block (otherwise it should have been dequeued and freed)
|
|
LC_ASSERT(isBefore16(queue->nextRtpSequenceNumber, queue->blockHead->fecHeader.baseSequenceNumber + RTPA_DATA_SHARDS));
|
|
|
|
// The first FEC block should not be before the oldest BSN (or we will drop packets that belong in that FEC block).
|
|
LC_ASSERT(!isBefore16(queue->blockHead->fecHeader.baseSequenceNumber, queue->oldestRtpBaseSequenceNumber));
|
|
|
|
PRTPA_FEC_BLOCK block = lastBlock->next;
|
|
while (block != NULL) {
|
|
// Ensure the list is sorted correctly
|
|
LC_ASSERT(isBefore16(lastSeqNum, block->fecHeader.baseSequenceNumber));
|
|
LC_ASSERT_VT(isBefore32(lastTs, block->fecHeader.baseTimestamp));
|
|
|
|
// Ensure entry invariants are satisfied
|
|
LC_ASSERT_VT(block->blockSize == lastBlock->blockSize);
|
|
LC_ASSERT_VT(block->fecHeader.payloadType == lastBlock->fecHeader.payloadType);
|
|
LC_ASSERT_VT(block->fecHeader.ssrc == lastBlock->fecHeader.ssrc);
|
|
|
|
// Ensure the list itself is consistent
|
|
LC_ASSERT(block->prev == lastBlock);
|
|
LC_ASSERT(block->next != NULL || queue->blockTail == block);
|
|
|
|
lastBlock = block;
|
|
block = block->next;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
static PRTPA_FEC_BLOCK allocateFecBlock(PRTP_AUDIO_QUEUE queue, uint16_t blockSize) {
|
|
PRTPA_FEC_BLOCK block = queue->freeBlockHead;
|
|
|
|
if (block != NULL) {
|
|
LC_ASSERT(queue->freeBlockCount > 0);
|
|
|
|
// If the block size matches, we're good to go
|
|
if (block->blockSize == blockSize) {
|
|
// Advance the free block list to the next entry
|
|
queue->freeBlockHead = block->next;
|
|
queue->freeBlockCount--;
|
|
|
|
// Return the new block
|
|
return block;
|
|
}
|
|
else {
|
|
// The block size didn't match. This should never happen with GFE
|
|
// because it uses constant sized data shards, but Sunshine can
|
|
// trigger this condition. If it does happen, let's free the cached
|
|
// entry so we can populate the cache with correctly sized blocks.
|
|
queue->freeBlockHead = block->next;
|
|
queue->freeBlockCount--;
|
|
|
|
// Free the existing block
|
|
free(block);
|
|
}
|
|
}
|
|
else {
|
|
LC_ASSERT(queue->freeBlockCount == 0);
|
|
}
|
|
|
|
// We either didn't have any free entries or the block
|
|
// size didn't match, so allocate a new FEC block now.
|
|
uint16_t dataPacketSize = blockSize + sizeof(RTP_PACKET);
|
|
return malloc(sizeof(*block) + (RTPA_DATA_SHARDS * dataPacketSize) + (RTPA_FEC_SHARDS * blockSize));
|
|
}
|
|
|
|
static void freeFecBlockHead(PRTP_AUDIO_QUEUE queue) {
|
|
PRTPA_FEC_BLOCK blockHead = queue->blockHead;
|
|
|
|
queue->blockHead = queue->blockHead->next;
|
|
if (queue->blockHead != NULL) {
|
|
queue->blockHead->prev = NULL;
|
|
}
|
|
else {
|
|
LC_ASSERT(queue->blockTail == blockHead);
|
|
queue->blockTail = NULL;
|
|
}
|
|
|
|
queue->oldestRtpBaseSequenceNumber = blockHead->fecHeader.baseSequenceNumber + RTPA_DATA_SHARDS;
|
|
|
|
// Once we complete an FEC block (successfully or not), we're synchronized with the source
|
|
queue->synchronizing = false;
|
|
|
|
validateFecBlockState(queue);
|
|
|
|
if (queue->freeBlockCount >= RTPA_CACHED_FEC_BLOCK_LIMIT) {
|
|
// Too many entries cached, so just free this one
|
|
free(blockHead);
|
|
}
|
|
else {
|
|
// Place this entry at the head of the free list for better cache behavior
|
|
blockHead->next = queue->freeBlockHead;
|
|
queue->freeBlockHead = blockHead;
|
|
queue->freeBlockCount++;
|
|
}
|
|
}
|
|
|
|
void RtpaCleanupQueue(PRTP_AUDIO_QUEUE queue) {
|
|
while (queue->blockHead != NULL) {
|
|
PRTPA_FEC_BLOCK block = queue->blockHead;
|
|
queue->blockHead = block->next;
|
|
free(block);
|
|
}
|
|
|
|
queue->blockTail = NULL;
|
|
|
|
while (queue->freeBlockHead != NULL) {
|
|
PRTPA_FEC_BLOCK block = queue->freeBlockHead;
|
|
queue->freeBlockHead = block->next;
|
|
queue->freeBlockCount--;
|
|
free(block);
|
|
}
|
|
|
|
LC_ASSERT(queue->freeBlockCount == 0);
|
|
|
|
reed_solomon_release(queue->rs);
|
|
queue->rs = NULL;
|
|
}
|
|
|
|
static PRTPA_FEC_BLOCK getFecBlockForRtpPacket(PRTP_AUDIO_QUEUE queue, PRTP_PACKET packet, uint16_t length) {
|
|
uint32_t fecBlockSsrc;
|
|
uint16_t fecBlockBaseSeqNum;
|
|
uint32_t fecBlockBaseTs;
|
|
uint16_t blockSize;
|
|
uint8_t fecBlockPayloadType;
|
|
|
|
validateFecBlockState(queue);
|
|
|
|
if (packet->packetType == RTP_PAYLOAD_TYPE_AUDIO) {
|
|
if (length < sizeof(RTP_PACKET)) {
|
|
Limelog("RTP audio data packet too small: %u\n", length);
|
|
LC_ASSERT_VT(false);
|
|
return NULL;
|
|
}
|
|
|
|
// Remember if we've received out-of-sequence packets lately. We can use
|
|
// this knowledge to more quickly give up on FEC blocks.
|
|
if (!queue->synchronizing && isBefore16(packet->sequenceNumber, queue->oldestRtpBaseSequenceNumber)) {
|
|
queue->lastOosSequenceNumber = packet->sequenceNumber;
|
|
if (!queue->receivedOosData) {
|
|
Limelog("Leaving fast audio recovery mode after OOS audio data (%u < %u)\n",
|
|
packet->sequenceNumber, queue->oldestRtpBaseSequenceNumber);
|
|
queue->receivedOosData = true;
|
|
}
|
|
}
|
|
// This condition looks odd, but it's just a simple way to check if we've gone
|
|
// more than 32767 packets without an OOS packet.
|
|
else if (queue->receivedOosData && isBefore16(queue->oldestRtpBaseSequenceNumber, queue->lastOosSequenceNumber)) {
|
|
Limelog("Entering fast audio recovery mode after sequenced audio data\n");
|
|
queue->receivedOosData = false;
|
|
}
|
|
|
|
// This is a data packet, so we will need to synthesize an FEC header
|
|
fecBlockPayloadType = packet->packetType;
|
|
fecBlockBaseSeqNum = (packet->sequenceNumber / RTPA_DATA_SHARDS) * RTPA_DATA_SHARDS;
|
|
fecBlockBaseTs = packet->timestamp - ((packet->sequenceNumber - fecBlockBaseSeqNum) * AudioPacketDuration);
|
|
fecBlockSsrc = packet->ssrc;
|
|
|
|
blockSize = length - sizeof(RTP_PACKET);
|
|
}
|
|
else if (packet->packetType == RTP_PAYLOAD_TYPE_FEC) {
|
|
PAUDIO_FEC_HEADER fecHeader = (PAUDIO_FEC_HEADER)(packet + 1);
|
|
|
|
if (length < sizeof(RTP_PACKET) + sizeof(AUDIO_FEC_HEADER)) {
|
|
Limelog("RTP audio FEC packet too small: %u\n", length);
|
|
LC_ASSERT_VT(false);
|
|
return NULL;
|
|
}
|
|
|
|
// This is an FEC packet, so we can just copy (and byteswap) the FEC header
|
|
fecBlockPayloadType = fecHeader->payloadType;
|
|
fecBlockBaseSeqNum = BE16(fecHeader->baseSequenceNumber);
|
|
fecBlockBaseTs = BE32(fecHeader->baseTimestamp);
|
|
fecBlockSsrc = BE32(fecHeader->ssrc);
|
|
|
|
// Ensure the FEC shard index is valid to prevent OOB access
|
|
// later during recovery.
|
|
if (fecHeader->fecShardIndex >= RTPA_FEC_SHARDS) {
|
|
Limelog("Too many audio FEC shards: %u\n", fecHeader->fecShardIndex);
|
|
LC_ASSERT_VT(false);
|
|
return NULL;
|
|
}
|
|
|
|
if (fecBlockBaseSeqNum % RTPA_DATA_SHARDS != 0) {
|
|
// The FEC blocks must start on a RTPA_DATA_SHARDS boundary for our queuing logic to work. This isn't
|
|
// the case for older versions of GeForce Experience (at least 3.13). Disable the FEC logic if this
|
|
// invariant is validated.
|
|
Limelog("Invalid FEC block base sequence number (got %u, expected %u)\n",
|
|
fecBlockBaseSeqNum, (fecBlockBaseSeqNum / RTPA_DATA_SHARDS) * RTPA_DATA_SHARDS);
|
|
Limelog("Audio FEC has been disabled due to an incompatibility with your host's old software!\n");
|
|
LC_ASSERT_VT(fecBlockBaseSeqNum % RTPA_DATA_SHARDS == 0);
|
|
queue->incompatibleServer = true;
|
|
return NULL;
|
|
}
|
|
|
|
blockSize = length - sizeof(RTP_PACKET) - sizeof(AUDIO_FEC_HEADER);
|
|
}
|
|
else {
|
|
Limelog("Invalid RTP audio payload type: %u\n", packet->packetType);
|
|
LC_ASSERT_VT(false);
|
|
return NULL;
|
|
}
|
|
|
|
// Synchronize the nextRtpSequenceNumber and oldestRtpBaseSequenceNumber values
|
|
// when the connection begins. Start on the next FEC block boundary, so we can
|
|
// be sure we aren't starting in the middle (which will lead to a spurious audio
|
|
// data block recovery warning on connection start if we miss more than 2 packets).
|
|
if (queue->synchronizing && queue->oldestRtpBaseSequenceNumber == 0) {
|
|
queue->nextRtpSequenceNumber = queue->oldestRtpBaseSequenceNumber = fecBlockBaseSeqNum + RTPA_DATA_SHARDS;
|
|
return NULL;
|
|
}
|
|
|
|
// Drop packets from FEC blocks that have already been completed
|
|
if (isBefore16(fecBlockBaseSeqNum, queue->oldestRtpBaseSequenceNumber)) {
|
|
return NULL;
|
|
}
|
|
|
|
// Look for an existing FEC block
|
|
PRTPA_FEC_BLOCK existingBlock = queue->blockHead;
|
|
while (existingBlock != NULL) {
|
|
if (existingBlock->fecHeader.baseSequenceNumber == fecBlockBaseSeqNum) {
|
|
// The FEC header data should match for all packets
|
|
LC_ASSERT_VT(existingBlock->fecHeader.payloadType == fecBlockPayloadType);
|
|
LC_ASSERT_VT(existingBlock->fecHeader.baseTimestamp == fecBlockBaseTs);
|
|
LC_ASSERT_VT(existingBlock->fecHeader.ssrc == fecBlockSsrc);
|
|
|
|
// The block size must match in order to safely copy shards into it
|
|
if (existingBlock->blockSize != blockSize) {
|
|
// This can happen with older versions of GeForce Experience (3.13) and Sunshine that don't use a
|
|
// constant size for audio packets.
|
|
Limelog("Audio block size mismatch (got %u, expected %u)\n", blockSize, existingBlock->blockSize);
|
|
Limelog("Audio FEC has been disabled due to an incompatibility with your host's old software!\n");
|
|
LC_ASSERT_VT(existingBlock->blockSize == blockSize);
|
|
queue->incompatibleServer = true;
|
|
return NULL;
|
|
}
|
|
|
|
// If the block is completed, don't return it
|
|
return existingBlock->fullyReassembled ? NULL : existingBlock;
|
|
}
|
|
else if (isBefore16(fecBlockBaseSeqNum, existingBlock->fecHeader.baseSequenceNumber)) {
|
|
// The new block goes right before this one
|
|
break;
|
|
}
|
|
|
|
existingBlock = existingBlock->next;
|
|
}
|
|
|
|
// We didn't find an existing FEC block, so we'll have to allocate one
|
|
uint16_t dataPacketSize = blockSize + sizeof(RTP_PACKET);
|
|
PRTPA_FEC_BLOCK block = allocateFecBlock(queue, blockSize);
|
|
if (block == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
memset(block, 0, sizeof(*block));
|
|
|
|
block->queueTimeMs = PltGetMillis();
|
|
block->blockSize = blockSize;
|
|
memset(block->marks, 1, sizeof(block->marks));
|
|
|
|
// Set up the FEC header
|
|
block->fecHeader.payloadType = fecBlockPayloadType;
|
|
block->fecHeader.baseSequenceNumber = fecBlockBaseSeqNum;
|
|
block->fecHeader.baseTimestamp = fecBlockBaseTs;
|
|
block->fecHeader.ssrc = fecBlockSsrc;
|
|
|
|
// Set up packet buffers pointing into the slab we allocated
|
|
uint8_t* data = (uint8_t*)(block + 1);
|
|
for (int i = 0; i < RTPA_DATA_SHARDS; i++) {
|
|
block->dataPackets[i] = (PRTP_PACKET)data;
|
|
data += dataPacketSize;
|
|
}
|
|
for (int i = 0; i < RTPA_FEC_SHARDS; i++) {
|
|
block->fecPackets[i] = data;
|
|
data += blockSize;
|
|
}
|
|
|
|
// Place this block into the list in order
|
|
if (existingBlock != NULL) {
|
|
// This new block comes right before existingBlock
|
|
PRTPA_FEC_BLOCK prevBlock = existingBlock->prev;
|
|
|
|
existingBlock->prev = block;
|
|
|
|
if (prevBlock == NULL) {
|
|
LC_ASSERT(queue->blockHead == existingBlock);
|
|
queue->blockHead = block;
|
|
}
|
|
else {
|
|
prevBlock->next = block;
|
|
}
|
|
|
|
block->prev = prevBlock;
|
|
block->next = existingBlock;
|
|
}
|
|
else {
|
|
// This block goes at the tail of the list
|
|
block->prev = queue->blockTail;
|
|
if (queue->blockTail != NULL) {
|
|
queue->blockTail->next = block;
|
|
}
|
|
queue->blockTail = block;
|
|
if (queue->blockHead == NULL) {
|
|
queue->blockHead = block;
|
|
}
|
|
}
|
|
|
|
validateFecBlockState(queue);
|
|
|
|
return block;
|
|
}
|
|
|
|
static bool completeFecBlock(PRTP_AUDIO_QUEUE queue, PRTPA_FEC_BLOCK block) {
|
|
uint8_t* shards[RTPA_TOTAL_SHARDS];
|
|
|
|
// If we don't have enough shards, we can't do anything.
|
|
// FEC validation mode requires one additional shard.
|
|
#ifdef FEC_VALIDATION_MODE
|
|
if (block->dataShardsReceived + block->fecShardsReceived < RTPA_DATA_SHARDS + 1) {
|
|
#else
|
|
if (block->dataShardsReceived + block->fecShardsReceived < RTPA_DATA_SHARDS) {
|
|
#endif
|
|
return false;
|
|
}
|
|
|
|
// If we have all data shards, don't bother with any recovery
|
|
// unless we're in FEC validation mode
|
|
LC_ASSERT(block->dataShardsReceived <= RTPA_DATA_SHARDS);
|
|
#ifndef FEC_VALIDATION_MODE
|
|
if (block->dataShardsReceived == RTPA_DATA_SHARDS) {
|
|
return true;
|
|
}
|
|
#endif
|
|
|
|
// We have recovery to do. Let's build the array.
|
|
for (int i = 0; i < RTPA_DATA_SHARDS; i++) {
|
|
shards[i] = (uint8_t*)(block->dataPackets[i] + 1);
|
|
}
|
|
for (int i = 0; i < RTPA_FEC_SHARDS; i++) {
|
|
shards[RTPA_DATA_SHARDS + i] = block->fecPackets[i];
|
|
}
|
|
|
|
#ifdef FEC_VALIDATION_MODE
|
|
unsigned int dropIndex;
|
|
|
|
// Choose a successfully received packet to drop
|
|
do {
|
|
dropIndex = rand() % RTPA_DATA_SHARDS;
|
|
} while (block->marks[dropIndex]);
|
|
|
|
// Copy the original data to validate later
|
|
PRTP_PACKET droppedRtpPacket = malloc(sizeof(RTP_PACKET) + block->blockSize);
|
|
memcpy(droppedRtpPacket, block->dataPackets[dropIndex], sizeof(RTP_PACKET) + block->blockSize);
|
|
|
|
// Fake the drop by setting the mark bit and zeroing the "missing" packet
|
|
block->marks[dropIndex] = 1;
|
|
memset(block->dataPackets[dropIndex], 0, sizeof(RTP_PACKET) + block->blockSize);
|
|
#endif
|
|
|
|
int res = reed_solomon_reconstruct(queue->rs, shards, block->marks, RTPA_TOTAL_SHARDS, block->blockSize);
|
|
if (res != 0) {
|
|
// We should always have enough data to recover the entire block since we checked above.
|
|
LC_ASSERT(res == 0);
|
|
return false;
|
|
}
|
|
|
|
// We will need to recover the RTP packet using the FEC header
|
|
for (int i = 0; i < RTPA_DATA_SHARDS; i++) {
|
|
if (block->marks[i]) {
|
|
block->dataPackets[i]->header = 0x80; // RTPv2
|
|
block->dataPackets[i]->packetType = block->fecHeader.payloadType;
|
|
block->dataPackets[i]->sequenceNumber = block->fecHeader.baseSequenceNumber + i;
|
|
block->dataPackets[i]->timestamp = block->fecHeader.baseTimestamp + (i * AudioPacketDuration);
|
|
block->dataPackets[i]->ssrc = block->fecHeader.ssrc;
|
|
|
|
block->marks[i] = 0;
|
|
}
|
|
}
|
|
|
|
#ifdef FEC_VERBOSE
|
|
if (block->dataShardsReceived != RTPA_DATA_SHARDS) {
|
|
Limelog("Recovered %d audio data shards from block %d\n",
|
|
RTPA_DATA_SHARDS - block->dataShardsReceived,
|
|
block->fecHeader.baseSequenceNumber);
|
|
}
|
|
#endif
|
|
|
|
#ifdef FEC_VALIDATION_MODE
|
|
// Check the RTP header values
|
|
LC_ASSERT_VT(block->dataPackets[dropIndex]->header == droppedRtpPacket->header);
|
|
LC_ASSERT_VT(block->dataPackets[dropIndex]->packetType == droppedRtpPacket->packetType);
|
|
LC_ASSERT_VT(block->dataPackets[dropIndex]->sequenceNumber == droppedRtpPacket->sequenceNumber);
|
|
LC_ASSERT_VT(block->dataPackets[dropIndex]->timestamp == droppedRtpPacket->timestamp);
|
|
LC_ASSERT_VT(block->dataPackets[dropIndex]->ssrc == droppedRtpPacket->ssrc);
|
|
|
|
// Check the data itself - use memcmp() and only loop if an error is detected
|
|
if (memcmp(block->dataPackets[dropIndex] + 1, droppedRtpPacket + 1, block->blockSize)) {
|
|
unsigned char* actualData = (unsigned char*)(block->dataPackets[dropIndex] + 1);
|
|
unsigned char* expectedData = (unsigned char*)(droppedRtpPacket + 1);
|
|
int recoveryErrors = 0;
|
|
|
|
for (int j = 0; j < block->blockSize; j++) {
|
|
if (actualData[j] != expectedData[j]) {
|
|
Limelog("Recovery error at %d: expected 0x%02x, actual 0x%02x\n",
|
|
j, expectedData[j], actualData[j]);
|
|
recoveryErrors++;
|
|
}
|
|
}
|
|
|
|
LC_ASSERT_VT(recoveryErrors == 0);
|
|
}
|
|
|
|
free(droppedRtpPacket);
|
|
#endif
|
|
|
|
return true;
|
|
}
|
|
|
|
static bool queueHasPacketReady(PRTP_AUDIO_QUEUE queue) {
|
|
validateFecBlockState(queue);
|
|
return queue->blockHead != NULL &&
|
|
((queue->blockHead->marks[queue->blockHead->nextDataPacketIndex] == 0 &&
|
|
queue->blockHead->fecHeader.baseSequenceNumber + queue->blockHead->nextDataPacketIndex == queue->nextRtpSequenceNumber)
|
|
|| queue->blockHead->allowDiscontinuity);
|
|
}
|
|
|
|
static void handleMissingPackets(PRTP_AUDIO_QUEUE queue) {
|
|
// Nothing to do for an empty queue
|
|
if (queue->blockHead == NULL) {
|
|
return;
|
|
}
|
|
|
|
// If the packet we're waiting on precedes our earliest FEC block, a previous FEC block was completely lost.
|
|
// We should resynchronize immediately by advancing the queue state to play our oldest block next.
|
|
//
|
|
// NB: We do NOT want to set allowDiscontinuity here, because that will result in playing back the entire
|
|
// FEC block immediately but we've only received a single packet from that block. Worse still, when the
|
|
// remaining packets from this block arrive, they will trigger the OOS detection and kick us out of fast
|
|
// audio recovery mode.
|
|
if (isBefore16(queue->nextRtpSequenceNumber, queue->blockHead->fecHeader.baseSequenceNumber)) {
|
|
queue->nextRtpSequenceNumber = queue->blockHead->fecHeader.baseSequenceNumber;
|
|
queue->oldestRtpBaseSequenceNumber = queue->blockHead->fecHeader.baseSequenceNumber;
|
|
return;
|
|
}
|
|
|
|
// If we reach this point, we know the next packet resides in the first FEC block we're
|
|
// currently waiting on. In that case, we want to wait at least until we have a second FEC
|
|
// block to give up on the first one. If we don't have a second block now, just keep waiting.
|
|
LC_ASSERT_VT(isBefore16(queue->nextRtpSequenceNumber, queue->blockHead->fecHeader.baseSequenceNumber + RTPA_DATA_SHARDS));
|
|
if (queue->blockHead == queue->blockTail) {
|
|
return;
|
|
}
|
|
|
|
// At this point, we know we've got a second FEC block queued up waiting on the first one to complete.
|
|
// If we've never seen OOS data from this host, we'll assume the first one is lost and skip forward.
|
|
// If we have seen OOS data, we'll wait for a little while longer to see if OOS packets arrive before giving up.
|
|
if (!queue->receivedOosData || PltGetMillis() - queue->blockHead->queueTimeMs > (uint32_t)(AudioPacketDuration * RTPA_DATA_SHARDS) + RTPQ_OOS_WAIT_TIME_MS) {
|
|
LC_ASSERT(!isBefore16(queue->nextRtpSequenceNumber, queue->blockHead->fecHeader.baseSequenceNumber));
|
|
|
|
Limelog("Unable to recover audio data block %u to %u (%u+%u=%u received < %u needed)\n",
|
|
queue->blockHead->fecHeader.baseSequenceNumber,
|
|
queue->blockHead->fecHeader.baseSequenceNumber + RTPA_DATA_SHARDS - 1,
|
|
queue->blockHead->dataShardsReceived,
|
|
queue->blockHead->fecShardsReceived,
|
|
queue->blockHead->dataShardsReceived + queue->blockHead->fecShardsReceived,
|
|
RTPA_DATA_SHARDS);
|
|
|
|
// Return all available audio data even if there are discontinuities
|
|
queue->blockHead->allowDiscontinuity = true;
|
|
|
|
LC_ASSERT(queueHasPacketReady(queue));
|
|
}
|
|
}
|
|
|
|
int RtpaAddPacket(PRTP_AUDIO_QUEUE queue, PRTP_PACKET packet, uint16_t length) {
|
|
if (queue->incompatibleServer) {
|
|
// Just feed audio data straight through to the decoder. We lose handling of out-of-order
|
|
// and duplicated packets in this mode, but it shouldn't be a problem for the very small
|
|
// portion of users that are running an ancient GFE or Sunshine version.
|
|
if (packet->packetType == RTP_PAYLOAD_TYPE_AUDIO) {
|
|
return RTPQ_RET_HANDLE_NOW;
|
|
}
|
|
else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
PRTPA_FEC_BLOCK fecBlock = getFecBlockForRtpPacket(queue, packet, length);
|
|
if (fecBlock == NULL) {
|
|
// Reject the packet
|
|
return 0;
|
|
}
|
|
|
|
if (packet->packetType == RTP_PAYLOAD_TYPE_AUDIO) {
|
|
uint16_t pos = packet->sequenceNumber - fecBlock->fecHeader.baseSequenceNumber;
|
|
|
|
// This is validated in getFecBlockForRtpPacket()
|
|
LC_ASSERT(pos < RTPA_DATA_SHARDS);
|
|
|
|
if (fecBlock->marks[pos]) {
|
|
// If there was a missing data shard, copy the RTP header and packet data into it
|
|
memcpy(fecBlock->dataPackets[pos], packet, length);
|
|
fecBlock->marks[pos] = 0;
|
|
fecBlock->dataShardsReceived++;
|
|
}
|
|
else {
|
|
// This is a duplicate packet - reject it
|
|
return 0;
|
|
}
|
|
|
|
// This is the common case - an in-order receive of the next data shard.
|
|
// We handle this quickly by telling the caller to immediately consume it.
|
|
if (packet->sequenceNumber == queue->nextRtpSequenceNumber) {
|
|
queue->nextRtpSequenceNumber = packet->sequenceNumber + 1;
|
|
|
|
// We are going to return this entry, so update the FEC block
|
|
// state to indicate that the caller has already received it.
|
|
fecBlock->nextDataPacketIndex++;
|
|
|
|
// If we've returned all packets in this FEC block, free it.
|
|
if (queue->nextRtpSequenceNumber == U16(fecBlock->fecHeader.baseSequenceNumber + RTPA_DATA_SHARDS)) {
|
|
LC_ASSERT(fecBlock == queue->blockHead);
|
|
LC_ASSERT(fecBlock->nextDataPacketIndex == RTPA_DATA_SHARDS);
|
|
freeFecBlockHead(queue);
|
|
}
|
|
else {
|
|
validateFecBlockState(queue);
|
|
}
|
|
|
|
return RTPQ_RET_HANDLE_NOW;
|
|
}
|
|
}
|
|
else if (packet->packetType == RTP_PAYLOAD_TYPE_FEC) {
|
|
PAUDIO_FEC_HEADER fecHeader = (PAUDIO_FEC_HEADER)(packet + 1);
|
|
|
|
// This is validated in getFecBlockForRtpPacket()
|
|
LC_ASSERT(fecHeader->fecShardIndex < RTPA_FEC_SHARDS);
|
|
|
|
if (fecBlock->marks[RTPA_DATA_SHARDS + fecHeader->fecShardIndex]) {
|
|
// If there was a missing FEC shard, copy just the FEC data into it
|
|
memcpy(fecBlock->fecPackets[fecHeader->fecShardIndex], fecHeader + 1, length - sizeof(RTP_PACKET) - sizeof(AUDIO_FEC_HEADER));
|
|
fecBlock->marks[RTPA_DATA_SHARDS + fecHeader->fecShardIndex] = 0;
|
|
fecBlock->fecShardsReceived++;
|
|
}
|
|
else {
|
|
// This is a duplicate packet - reject it
|
|
return 0;
|
|
}
|
|
}
|
|
else {
|
|
// getFecBlockForRtpPacket() would have already failed
|
|
LC_ASSERT(false);
|
|
return 0;
|
|
}
|
|
|
|
// Try to complete the FEC block via data shards or data+FEC shards
|
|
LC_ASSERT(fecBlock == queue->blockHead || queue->blockHead != queue->blockTail);
|
|
if (completeFecBlock(queue, fecBlock)) {
|
|
// We completed a FEC block
|
|
fecBlock->fullyReassembled = true;
|
|
}
|
|
|
|
// If we still have nothing ready, see if we should skip the missing packets.
|
|
if (!queueHasPacketReady(queue)) {
|
|
handleMissingPackets(queue);
|
|
}
|
|
|
|
return queueHasPacketReady(queue) ? RTPQ_RET_PACKET_READY : 0;
|
|
}
|
|
|
|
PRTP_PACKET RtpaGetQueuedPacket(PRTP_AUDIO_QUEUE queue, uint16_t customHeaderLength, uint16_t* length) {
|
|
validateFecBlockState(queue);
|
|
|
|
// If we're returning audio data even with discontinuities, we'll fill in blank entries
|
|
// for packets that were lost and could not be recovered.
|
|
if (queue->blockHead != NULL && queue->blockHead->allowDiscontinuity) {
|
|
PRTPA_FEC_BLOCK nextBlock = queue->blockHead;
|
|
PRTP_PACKET lostPacket;
|
|
|
|
LC_ASSERT(nextBlock->fecHeader.baseSequenceNumber + nextBlock->nextDataPacketIndex == queue->nextRtpSequenceNumber);
|
|
if (nextBlock->marks[nextBlock->nextDataPacketIndex]) {
|
|
// This packet is missing. Return an empty entry to let the caller
|
|
// know to perform packet loss concealment for this frame.
|
|
lostPacket = malloc(customHeaderLength);
|
|
if (lostPacket == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
// Lost packet placeholder entries have no associated data
|
|
*length = 0;
|
|
|
|
// Move on to the next data shard
|
|
nextBlock->nextDataPacketIndex++;
|
|
queue->nextRtpSequenceNumber++;
|
|
}
|
|
else {
|
|
lostPacket = NULL;
|
|
LC_ASSERT(queueHasPacketReady(queue));
|
|
}
|
|
|
|
// If we've read everything from this FEC block, remove and free it
|
|
if (nextBlock->nextDataPacketIndex == RTPA_DATA_SHARDS) {
|
|
freeFecBlockHead(queue);
|
|
}
|
|
else {
|
|
validateFecBlockState(queue);
|
|
}
|
|
|
|
if (lostPacket != NULL) {
|
|
return lostPacket;
|
|
}
|
|
}
|
|
|
|
// Return the next RTP sequence number by indexing into the most recent FEC block
|
|
if (queueHasPacketReady(queue)) {
|
|
PRTPA_FEC_BLOCK nextBlock = queue->blockHead;
|
|
PRTP_PACKET packet = malloc(customHeaderLength + sizeof(RTP_PACKET) + nextBlock->blockSize);
|
|
if (packet == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
*length = nextBlock->blockSize + sizeof(RTP_PACKET);
|
|
memcpy((uint8_t*)packet + customHeaderLength, nextBlock->dataPackets[nextBlock->nextDataPacketIndex], *length);
|
|
nextBlock->nextDataPacketIndex++;
|
|
|
|
queue->nextRtpSequenceNumber++;
|
|
|
|
// If we've read everything from this FEC block, remove and free it
|
|
if (nextBlock->nextDataPacketIndex == RTPA_DATA_SHARDS) {
|
|
freeFecBlockHead(queue);
|
|
}
|
|
else {
|
|
validateFecBlockState(queue);
|
|
}
|
|
|
|
return packet;
|
|
}
|
|
|
|
return NULL;
|
|
}
|