1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
|
/**
* Copyright (C) 2011-2012 Juho Vähä-Herttua
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
*==================================================================
* modified by fduncanh 2021-2023
*/
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <math.h>
#include <stdio.h>
#include <stdbool.h>
#include <stdint.h>
#include "raop_buffer.h"
#include "raop_rtp.h"
#include "crypto.h"
#include "compat.h"
#include "stream.h"
#include "global.h"
#include "utils.h"
#include "byteutils.h"
#define RAOP_BUFFER_LENGTH 32
typedef struct {
/* Data available */
int filled;
uint64_t packet_arrival_time;
/* RTP header */
unsigned short seqnum;
uint32_t rtp_timestamp;
/* Payload data */
unsigned int payload_size;
void *payload_data;
} raop_buffer_entry_t;
struct raop_buffer_s {
logger_t *logger;
/* AES CTX used for decryption */
aes_ctx_t *aes_ctx;
/* First and last seqnum */
int is_empty;
unsigned short first_seqnum;
unsigned short last_seqnum;
/* RTP buffer entries */
raop_buffer_entry_t entries[RAOP_BUFFER_LENGTH];
};
raop_buffer_t *
raop_buffer_init(logger_t *logger,
const unsigned char *aeskey,
const unsigned char *aesiv)
{
raop_buffer_t *raop_buffer;
assert(aeskey);
assert(aesiv);
raop_buffer = calloc(1, sizeof(raop_buffer_t));
if (!raop_buffer) {
return NULL;
}
raop_buffer->logger = logger;
// Need to be initialized internally
raop_buffer->aes_ctx = aes_cbc_init(aeskey, aesiv, AES_DECRYPT);
for (int i = 0; i < RAOP_BUFFER_LENGTH; i++) {
raop_buffer_entry_t *entry = &raop_buffer->entries[i];
entry->payload_data = NULL;
entry->payload_size = 0;
}
raop_buffer->is_empty = 1;
return raop_buffer;
}
void
raop_buffer_destroy(raop_buffer_t *raop_buffer)
{
for (int i = 0; i < RAOP_BUFFER_LENGTH; i++) {
raop_buffer_entry_t *entry = &raop_buffer->entries[i];
if (entry->payload_data != NULL) {
free(entry->payload_data);
}
}
if (raop_buffer) {
aes_cbc_destroy(raop_buffer->aes_ctx);
free(raop_buffer);
}
}
static short
seqnum_cmp(unsigned short s1, unsigned short s2)
{
return (s1 - s2);
}
int
raop_buffer_decrypt(raop_buffer_t *raop_buffer, unsigned char *data, unsigned char* output, unsigned int payload_size, unsigned int *outputlen)
{
assert(raop_buffer);
int encryptedlen;
if (DECRYPTION_TEST) {
char *str = utils_data_to_string(data,12,12);
logger_log(raop_buffer->logger, LOGGER_INFO, "encrypted 12 byte header %s", str);
free(str);
if (payload_size) {
str = utils_data_to_string(&data[12],16,16);
logger_log(raop_buffer->logger, LOGGER_INFO, "len %d before decryption:\n%s", payload_size, str);
free(str);
}
}
encryptedlen = payload_size / 16*16;
memset(output, 0, payload_size);
aes_cbc_decrypt(raop_buffer->aes_ctx, &data[12], output, encryptedlen);
aes_cbc_reset(raop_buffer->aes_ctx);
memcpy(output + encryptedlen, &data[12 + encryptedlen], payload_size - encryptedlen);
*outputlen = payload_size;
if (payload_size && DECRYPTION_TEST){
switch (output[0]) {
case 0x8c:
case 0x8d:
case 0x8e:
case 0x80:
case 0x81:
case 0x82:
case 0x20:
break;
default:
logger_log(raop_buffer->logger, LOGGER_INFO, "***ERROR AUDIO FRAME IS NOT AAC_ELD OR ALAC");
break;
}
if (DECRYPTION_TEST == 2) {
logger_log(raop_buffer->logger, LOGGER_INFO, "decrypted audio frame, len = %d", *outputlen);
char *str = utils_data_to_string(output,payload_size,16);
logger_log(raop_buffer->logger, LOGGER_INFO,"%s",str);
free(str);
} else {
char *str = utils_data_to_string(output,16,16);
logger_log(raop_buffer->logger, LOGGER_INFO, "%d after \n%s", payload_size, str);
free(str);
}
}
return 1;
}
int
raop_buffer_enqueue(raop_buffer_t *raop_buffer, unsigned char *data, unsigned short datalen, int use_seqnum) {
unsigned char empty_packet_marker[] = { 0x00, 0x68, 0x34, 0x00 };
assert(raop_buffer);
/* Check packet data length is valid */
if (datalen < 12 || datalen > RAOP_PACKET_LEN) {
return -1;
}
/* before time is synchronized, some empty data packets are sent */
if (datalen == 16 && !memcmp(&data[12], empty_packet_marker, 4)) {
return 0;
}
int payload_size = datalen - 12;
/* Get correct seqnum for the packet */
unsigned short seqnum;
if (use_seqnum) {
seqnum = byteutils_get_short_be(data, 2);
} else {
seqnum = raop_buffer->first_seqnum;
}
/* If this packet is too late, just skip it */
if (!raop_buffer->is_empty && seqnum_cmp(seqnum, raop_buffer->first_seqnum) < 0) {
return 0;
}
/* Check that there is always space in the buffer, otherwise flush */
if (seqnum_cmp(seqnum, raop_buffer->first_seqnum + RAOP_BUFFER_LENGTH) >= 0) {
raop_buffer_flush(raop_buffer, seqnum);
}
/* Get entry corresponding our seqnum */
raop_buffer_entry_t *entry = &raop_buffer->entries[seqnum % RAOP_BUFFER_LENGTH];
if (entry->filled && seqnum_cmp(entry->seqnum, seqnum) == 0) {
/* Packet resend, we can safely ignore */
return 0;
}
/* Update the raop_buffer entry header */
entry->seqnum = seqnum;
entry->rtp_timestamp = byteutils_get_int_be(data, 4);
entry->filled = 1;
entry->payload_data = malloc(payload_size);
int decrypt_ret = raop_buffer_decrypt(raop_buffer, data, entry->payload_data, payload_size, &entry->payload_size);
assert(decrypt_ret >= 0);
assert(entry->payload_size <= payload_size);
/* Update the raop_buffer seqnums */
if (raop_buffer->is_empty) {
raop_buffer->first_seqnum = seqnum;
raop_buffer->last_seqnum = seqnum;
raop_buffer->is_empty = 0;
}
if (seqnum_cmp(seqnum, raop_buffer->last_seqnum) > 0) {
raop_buffer->last_seqnum = seqnum;
}
return 1;
}
void *
raop_buffer_dequeue(raop_buffer_t *raop_buffer, unsigned int *length, uint32_t *rtp_timestamp, unsigned short *seqnum, int no_resend) {
assert(raop_buffer);
/* Calculate number of entries in the current buffer */
short entry_count = seqnum_cmp(raop_buffer->last_seqnum, raop_buffer->first_seqnum)+1;
/* Cannot dequeue from empty buffer */
if (raop_buffer->is_empty || entry_count <= 0) {
return NULL;
}
/* Get the first buffer entry for inspection */
raop_buffer_entry_t *entry = &raop_buffer->entries[raop_buffer->first_seqnum % RAOP_BUFFER_LENGTH];
if (no_resend) {
/* If we do no resends, always return the first entry */
} else if (!entry->filled) {
/* Check how much we have space left in the buffer */
if (entry_count < RAOP_BUFFER_LENGTH) {
/* Return nothing and hope resend gets on time */
return NULL;
}
/* Risk of buffer overrun, return empty buffer */
}
/* Update buffer and validate entry */
raop_buffer->first_seqnum += 1;
if (!entry->filled) {
return NULL;
}
entry->filled = 0;
/* Return entry payload buffer */
*rtp_timestamp = entry->rtp_timestamp;
*seqnum = entry->seqnum;
*length = entry->payload_size;
entry->payload_size = 0;
void* data = entry->payload_data;
entry->payload_data = NULL;
return data;
}
void raop_buffer_handle_resends(raop_buffer_t *raop_buffer, raop_resend_cb_t resend_cb, void *opaque) {
assert(raop_buffer);
assert(resend_cb);
if (seqnum_cmp(raop_buffer->first_seqnum, raop_buffer->last_seqnum) < 0) {
unsigned short seqnum, count = 0;
logger_log(raop_buffer->logger, LOGGER_DEBUG, "raop_buffer_handle_resends first_seqnum=%u last seqnum=%u",
raop_buffer->first_seqnum, raop_buffer->last_seqnum);
for (seqnum = raop_buffer->first_seqnum; seqnum_cmp(seqnum, raop_buffer->last_seqnum) < 0; seqnum++) {
raop_buffer_entry_t *entry = &raop_buffer->entries[seqnum % RAOP_BUFFER_LENGTH];
if (entry->filled) {
break;
}
count++;
}
if (count){
resend_cb(opaque, raop_buffer->first_seqnum, count);
}
}
}
void raop_buffer_flush(raop_buffer_t *raop_buffer, int next_seq) {
assert(raop_buffer);
for (int i = 0; i < RAOP_BUFFER_LENGTH; i++) {
if (raop_buffer->entries[i].payload_data) {
free(raop_buffer->entries[i].payload_data);
raop_buffer->entries[i].payload_data = NULL;
raop_buffer->entries[i].payload_size = 0;
}
raop_buffer->entries[i].filled = 0;
}
if (next_seq < 0 || next_seq > 0xffff) {
raop_buffer->is_empty = 1;
} else {
raop_buffer->first_seqnum = next_seq;
raop_buffer->last_seqnum = next_seq - 1;
}
}
|