2019-09-05 07:16:48 +00:00
|
|
|
#ifdef _WIN32
|
|
|
|
#else
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#endif
|
|
|
|
|
2019-03-30 10:22:57 +00:00
|
|
|
#include <cstdint>
|
|
|
|
#include <cstring>
|
2019-08-12 06:25:17 +00:00
|
|
|
#include <iostream>
|
2019-09-05 07:16:48 +00:00
|
|
|
#include <unordered_map>
|
|
|
|
#include <queue>
|
2019-03-30 10:22:57 +00:00
|
|
|
|
2019-05-17 06:25:11 +00:00
|
|
|
#include "debug.hh"
|
2019-07-15 07:16:31 +00:00
|
|
|
#include "queue.hh"
|
2019-03-30 10:22:57 +00:00
|
|
|
|
2020-09-08 05:19:38 +00:00
|
|
|
#include "formats/h26x.hh"
|
2019-09-11 08:12:10 +00:00
|
|
|
|
2019-09-11 07:06:52 +00:00
|
|
|
#define PTR_DIFF(a, b) ((ptrdiff_t)((char *)(a) - (char *)(b)))
|
|
|
|
|
|
|
|
#define haszero64_le(v) (((v) - 0x0101010101010101) & ~(v) & 0x8080808080808080UL)
|
|
|
|
#define haszero32_le(v) (((v) - 0x01010101) & ~(v) & 0x80808080UL)
|
|
|
|
|
|
|
|
#define haszero64_be(v) (((v) - 0x1010101010101010) & ~(v) & 0x0808080808080808UL)
|
|
|
|
#define haszero32_be(v) (((v) - 0x10101010) & ~(v) & 0x08080808UL)
|
|
|
|
|
2020-01-09 08:10:58 +00:00
|
|
|
#ifndef __LITTLE_ENDIAN
|
|
|
|
#define __LITTLE_ENDIAN 1337
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef __BYTE_ORDER
|
|
|
|
#define __BYTE_ORDER __LITTLE_ENDIAN
|
|
|
|
#endif
|
|
|
|
|
2020-12-01 07:31:20 +00:00
|
|
|
static inline unsigned __find_h26x_start(uint32_t value)
|
2019-09-11 07:06:52 +00:00
|
|
|
{
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
uint16_t u = (value >> 16) & 0xffff;
|
|
|
|
uint16_t l = (value >> 0) & 0xffff;
|
|
|
|
|
|
|
|
bool t1 = (l == 0);
|
|
|
|
bool t2 = ((u & 0xff) == 0x01);
|
|
|
|
bool t3 = (u == 0x0100);
|
|
|
|
bool t4 = (((l >> 8) & 0xff) == 0);
|
|
|
|
#else
|
|
|
|
uint16_t u = (value >> 0) & 0xffff;
|
|
|
|
uint16_t l = (value >> 16) & 0xffff;
|
|
|
|
|
|
|
|
bool t1 = (l == 0);
|
|
|
|
bool t2 = (((u >> 8) & 0xff) == 0x01);
|
|
|
|
bool t3 = (u == 0x0001);
|
|
|
|
bool t4 = ((l & 0xff) == 0);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (t1) {
|
|
|
|
/* 0x00000001 */
|
|
|
|
if (t3)
|
|
|
|
return 4;
|
|
|
|
|
|
|
|
/* "value" definitely has a start code (0x000001XX), but at this
|
|
|
|
* point we can't know for sure whether it's 3 or 4 bytes long.
|
|
|
|
*
|
|
|
|
* Return 5 to indicate that start length could not be determined
|
|
|
|
* and that caller must check previous dword's last byte for 0x00 */
|
|
|
|
if (t2)
|
|
|
|
return 5;
|
|
|
|
} else if (t4 && t3) {
|
|
|
|
/* 0xXX000001 */
|
|
|
|
return 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-01-07 07:54:33 +00:00
|
|
|
/* NOTE: the area 0 - len (ie data[0] - data[len - 1]) must be addressable
|
2020-10-06 03:20:22 +00:00
|
|
|
* Do not add offset to "data" ptr before passing it to find_h26x_start_code()! */
|
2020-09-08 05:19:38 +00:00
|
|
|
ssize_t uvg_rtp::formats::h26x::find_h26x_start_code(
|
|
|
|
uint8_t *data,
|
|
|
|
size_t len,
|
|
|
|
size_t offset,
|
|
|
|
uint8_t& start_len
|
|
|
|
)
|
2019-03-30 10:22:57 +00:00
|
|
|
{
|
2019-09-11 07:06:52 +00:00
|
|
|
bool prev_z = false;
|
|
|
|
bool cur_z = false;
|
|
|
|
size_t pos = offset;
|
2020-02-04 10:07:05 +00:00
|
|
|
size_t rpos = len - (len % 8) - 1;
|
2019-09-11 07:06:52 +00:00
|
|
|
uint8_t *ptr = data + offset;
|
|
|
|
uint8_t *tmp = nullptr;
|
|
|
|
uint8_t lb = 0;
|
|
|
|
uint32_t prev = UINT32_MAX;
|
|
|
|
|
|
|
|
uint64_t prefetch = UINT64_MAX;
|
|
|
|
uint32_t value = UINT32_MAX;
|
|
|
|
unsigned ret = 0;
|
|
|
|
|
|
|
|
/* We can get rid of the bounds check when looping through
|
|
|
|
* non-zero 8 byte chunks by setting the last byte to zero.
|
|
|
|
*
|
|
|
|
* This added zero will make the last 8 byte zero check to fail
|
2020-02-04 10:07:05 +00:00
|
|
|
* and when we get out of the loop we can check if we've reached the end */
|
|
|
|
lb = data[rpos];
|
|
|
|
data[rpos] = 0;
|
2019-09-11 07:06:52 +00:00
|
|
|
|
2020-02-04 10:07:05 +00:00
|
|
|
while (pos + 8 < len) {
|
2019-09-11 07:06:52 +00:00
|
|
|
prefetch = *(uint64_t *)ptr;
|
|
|
|
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
if (!prev_z && !(cur_z = haszero64_le(prefetch))) {
|
|
|
|
#else
|
|
|
|
if (!prev_z && !(cur_z = haszero64_be(prefetch))) {
|
|
|
|
#endif
|
|
|
|
/* pos is not used in the following loop so it makes little sense to
|
|
|
|
* update it on every iteration. Faster way to do the loop is to save
|
|
|
|
* ptr's current value before loop, update only ptr in the loop and when
|
|
|
|
* the loop is exited, calculate the difference between tmp and ptr to get
|
|
|
|
* the number of iterations done * 8 */
|
|
|
|
tmp = ptr;
|
|
|
|
|
|
|
|
do {
|
|
|
|
ptr += 8;
|
|
|
|
prefetch = *(uint64_t *)ptr;
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
cur_z = haszero64_le(prefetch);
|
|
|
|
#else
|
|
|
|
cur_z = haszero64_be(prefetch);
|
|
|
|
#endif
|
|
|
|
} while (!cur_z);
|
|
|
|
|
|
|
|
pos += PTR_DIFF(ptr, tmp);
|
2019-03-30 10:22:57 +00:00
|
|
|
|
2020-02-04 10:07:05 +00:00
|
|
|
if (pos + 8 >= len)
|
2019-09-11 07:06:52 +00:00
|
|
|
break;
|
2019-03-30 10:22:57 +00:00
|
|
|
}
|
|
|
|
|
2019-09-11 07:06:52 +00:00
|
|
|
value = *(uint32_t *)ptr;
|
|
|
|
|
|
|
|
if (cur_z)
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
cur_z = haszero32_le(value);
|
|
|
|
#else
|
|
|
|
cur_z = haszero32_be(value);
|
|
|
|
#endif
|
2019-03-30 10:22:57 +00:00
|
|
|
|
2019-09-11 07:06:52 +00:00
|
|
|
if (!prev_z && !cur_z)
|
|
|
|
goto end;
|
|
|
|
|
|
|
|
/* Previous dword had zeros but this doesn't. The only way there might be a start code
|
|
|
|
* is if the most significant byte of current dword is 0x01 */
|
|
|
|
if (prev_z && !cur_z) {
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
/* previous dword: 0xXX000000 or 0xXXXX0000 and current dword 0x01XXXXXX */
|
|
|
|
if (((value >> 0) & 0xff) == 0x01 && ((prev >> 16) & 0xffff) == 0) {
|
|
|
|
start_len = (((prev >> 8) & 0xffffff) == 0) ? 4 : 3;
|
|
|
|
#else
|
|
|
|
if (((value >> 24) & 0xff) == 0x01 && ((prev >> 0) & 0xffff) == 0) {
|
|
|
|
start_len = (((prev >> 0) & 0xffffff) == 0) ? 4 : 3;
|
|
|
|
#endif
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-09-11 07:06:52 +00:00
|
|
|
return pos + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
{
|
2020-12-01 07:31:20 +00:00
|
|
|
if ((ret = start_len = __find_h26x_start(value)) > 0) {
|
2019-09-11 07:06:52 +00:00
|
|
|
if (ret == 5) {
|
|
|
|
ret = 3;
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
start_len = (((prev >> 24) & 0xff) == 0) ? 4 : 3;
|
|
|
|
#else
|
|
|
|
start_len = (((prev >> 0) & 0xff) == 0) ? 4 : 3;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-09-11 07:06:52 +00:00
|
|
|
return pos + ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
uint16_t u = (value >> 16) & 0xffff;
|
|
|
|
uint16_t l = (value >> 0) & 0xffff;
|
|
|
|
uint16_t p = (prev >> 16) & 0xffff;
|
|
|
|
|
|
|
|
bool t1 = ((p & 0xffff) == 0);
|
|
|
|
bool t2 = (((p >> 8) & 0xff) == 0);
|
|
|
|
bool t4 = (l == 0x0100);
|
|
|
|
bool t5 = (l == 0x0000 && u == 0x01);
|
|
|
|
#else
|
|
|
|
uint16_t u = (value >> 0) & 0xffff;
|
|
|
|
uint16_t l = (value >> 16) & 0xffff;
|
|
|
|
uint16_t p = (prev >> 0) & 0xffff;
|
|
|
|
|
|
|
|
bool t1 = ((p & 0xffff) == 0);
|
|
|
|
bool t2 = ((p & 0xff) == 0);
|
|
|
|
bool t4 = (l == 0x0001);
|
|
|
|
bool t5 = (l == 0x0000 && u == 0x01);
|
|
|
|
#endif
|
|
|
|
if (t1 && t4) {
|
|
|
|
/* previous dword 0xxxxx0000 and current dword is 0x0001XXXX */
|
|
|
|
if (t4) {
|
|
|
|
start_len = 4;
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-09-11 07:06:52 +00:00
|
|
|
return pos + 2;
|
|
|
|
}
|
|
|
|
/* Previous dwod was 0xXXXXXX00 */
|
|
|
|
} else if (t2) {
|
|
|
|
/* Current dword is 0x000001XX */
|
|
|
|
if (t5) {
|
|
|
|
start_len = 4;
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-09-11 07:06:52 +00:00
|
|
|
return pos + 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Current dword is 0x0001XXXX */
|
|
|
|
else if (t4) {
|
|
|
|
start_len = 3;
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-09-11 07:06:52 +00:00
|
|
|
return pos + 2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
end:
|
|
|
|
prev_z = cur_z;
|
|
|
|
pos += 4;
|
|
|
|
ptr += 4;
|
|
|
|
prev = value;
|
2019-03-30 10:22:57 +00:00
|
|
|
}
|
|
|
|
|
2020-02-04 10:07:05 +00:00
|
|
|
data[rpos] = lb;
|
2019-03-30 10:22:57 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2020-10-22 11:38:59 +00:00
|
|
|
rtp_error_t uvg_rtp::formats::h26x::push_h26x_frame(uint8_t *data, size_t data_len, int flags)
|
2019-03-30 10:22:57 +00:00
|
|
|
{
|
2019-09-11 07:06:52 +00:00
|
|
|
/* find first start code */
|
2020-07-30 10:40:16 +00:00
|
|
|
uint8_t start_len = 0;
|
2020-09-08 05:19:38 +00:00
|
|
|
int offset = find_h26x_start_code(data, data_len, 0, start_len);
|
2020-07-30 10:40:16 +00:00
|
|
|
int prev_offset = offset;
|
|
|
|
size_t r_off = 0;
|
|
|
|
rtp_error_t ret = RTP_GENERIC_ERROR;
|
2020-08-04 05:37:40 +00:00
|
|
|
size_t payload_size = rtp_ctx_->get_payload_size();
|
2020-07-30 10:40:16 +00:00
|
|
|
|
2020-10-22 11:38:59 +00:00
|
|
|
if (data_len < payload_size || flags & RTP_SLICE) {
|
2020-08-04 05:37:40 +00:00
|
|
|
r_off = (offset < 0) ? 0 : offset;
|
2020-10-07 08:50:20 +00:00
|
|
|
|
2020-10-22 11:38:59 +00:00
|
|
|
if (data_len > payload_size) {
|
|
|
|
return push_nal_unit(data + r_off, data_len, false);
|
|
|
|
} else {
|
|
|
|
if ((ret = fqueue_->enqueue_message(data + r_off, data_len - r_off)) != RTP_OK) {
|
|
|
|
LOG_ERROR("Failed to enqueue Single NAL Unit packet!");
|
|
|
|
return ret;
|
|
|
|
}
|
2020-10-07 08:50:20 +00:00
|
|
|
|
2020-10-22 11:38:59 +00:00
|
|
|
return fqueue_->flush_queue();
|
|
|
|
}
|
2019-08-30 06:03:35 +00:00
|
|
|
}
|
2019-08-26 05:49:22 +00:00
|
|
|
|
|
|
|
while (offset != -1) {
|
2020-09-08 05:19:38 +00:00
|
|
|
offset = find_h26x_start_code(data, data_len, offset, start_len);
|
2019-08-26 05:49:22 +00:00
|
|
|
|
2019-09-11 07:06:52 +00:00
|
|
|
if (offset != -1) {
|
2020-09-08 05:19:38 +00:00
|
|
|
ret = push_nal_unit(&data[prev_offset], offset - prev_offset - start_len, true);
|
2019-08-26 05:49:22 +00:00
|
|
|
|
|
|
|
if (ret != RTP_NOT_READY)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
prev_offset = offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-06-05 11:23:32 +00:00
|
|
|
if (prev_offset == -1)
|
|
|
|
prev_offset = 0;
|
|
|
|
|
2020-09-08 05:19:38 +00:00
|
|
|
if ((ret = push_nal_unit(&data[prev_offset], data_len - prev_offset, false)) == RTP_OK)
|
2019-08-26 05:49:22 +00:00
|
|
|
return RTP_OK;
|
|
|
|
|
|
|
|
error:
|
2020-08-04 05:37:40 +00:00
|
|
|
fqueue_->deinit_transaction();
|
2019-08-26 05:49:22 +00:00
|
|
|
return ret;
|
2019-06-03 08:58:53 +00:00
|
|
|
}
|
2019-07-30 05:33:21 +00:00
|
|
|
|
2020-09-08 05:19:38 +00:00
|
|
|
rtp_error_t uvg_rtp::formats::h26x::push_nal_unit(uint8_t *data, size_t data_len, bool more)
|
|
|
|
{
|
|
|
|
(void)data, (void)data_len, (void)more;
|
|
|
|
|
|
|
|
LOG_ERROR("Each H26x class must implement this function!");
|
|
|
|
|
|
|
|
return RTP_NOT_SUPPORTED;
|
|
|
|
}
|
|
|
|
|
|
|
|
uvg_rtp::formats::h26x::h26x(uvg_rtp::socket *socket, uvg_rtp::rtp *rtp, int flags):
|
2020-08-18 04:03:12 +00:00
|
|
|
media(socket, rtp, flags)
|
2019-10-11 06:11:21 +00:00
|
|
|
{
|
2020-08-04 05:37:40 +00:00
|
|
|
}
|
2019-10-11 06:11:21 +00:00
|
|
|
|
2020-09-08 05:19:38 +00:00
|
|
|
uvg_rtp::formats::h26x::~h26x()
|
2020-08-04 05:37:40 +00:00
|
|
|
{
|
|
|
|
delete fqueue_;
|
2019-10-11 06:11:21 +00:00
|
|
|
}
|
|
|
|
|
2020-09-08 05:19:38 +00:00
|
|
|
rtp_error_t uvg_rtp::formats::h26x::push_media_frame(uint8_t *data, size_t data_len, int flags)
|
2019-10-11 06:11:21 +00:00
|
|
|
{
|
2020-08-04 05:37:40 +00:00
|
|
|
rtp_error_t ret;
|
2019-10-11 06:11:21 +00:00
|
|
|
|
2020-08-04 05:37:40 +00:00
|
|
|
if (!data || !data_len)
|
|
|
|
return RTP_INVALID_VALUE;
|
2019-10-11 06:11:21 +00:00
|
|
|
|
2020-08-04 05:37:40 +00:00
|
|
|
if ((ret = fqueue_->init_transaction(data)) != RTP_OK) {
|
2019-10-11 06:11:21 +00:00
|
|
|
LOG_ERROR("Invalid frame queue or failed to initialize transaction!");
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-10-22 11:38:59 +00:00
|
|
|
return push_h26x_frame(data, data_len, flags);
|
2019-10-11 06:11:21 +00:00
|
|
|
}
|