2018-12-14 17:46:12 +08:00
|
|
|
|
/*
|
2020-04-04 20:30:09 +08:00
|
|
|
|
* Copyright (c) 2016 The ZLMediaKit project authors. All Rights Reserved.
|
2018-12-14 17:46:12 +08:00
|
|
|
|
*
|
2021-01-17 18:31:50 +08:00
|
|
|
|
* This file is part of ZLMediaKit(https://github.com/xia-chu/ZLMediaKit).
|
2018-12-14 17:46:12 +08:00
|
|
|
|
*
|
2020-04-04 20:30:09 +08:00
|
|
|
|
* Use of this source code is governed by MIT license that can be found in the
|
|
|
|
|
|
* LICENSE file in the root of the source tree. All contributing project authors
|
|
|
|
|
|
* may be found in the AUTHORS file in the root of the source tree.
|
2018-12-14 17:46:12 +08:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef ZLMEDIAKIT_RTPRECEIVER_H
|
|
|
|
|
|
#define ZLMEDIAKIT_RTPRECEIVER_H
|
|
|
|
|
|
|
2018-12-14 18:13:05 +08:00
|
|
|
|
#include <map>
|
2018-12-14 17:46:12 +08:00
|
|
|
|
#include <string>
|
|
|
|
|
|
#include <memory>
|
2022-11-29 11:07:13 +08:00
|
|
|
|
#include "Rtsp/Rtsp.h"
|
|
|
|
|
|
#include "Extension/Frame.h"
|
|
|
|
|
|
// for NtpStamp
|
2021-07-12 21:18:22 +08:00
|
|
|
|
#include "Common/Stamp.h"
|
2023-03-06 20:43:07 +08:00
|
|
|
|
#include "Util/TimeTicker.h"
|
2018-12-14 17:46:12 +08:00
|
|
|
|
|
|
|
|
|
|
namespace mediakit {
|
|
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
template<typename T, typename SEQ = uint16_t>
|
2020-10-01 19:02:14 +08:00
|
|
|
|
class PacketSortor {
|
|
|
|
|
|
public:
|
2023-03-05 23:24:55 +08:00
|
|
|
|
static constexpr SEQ SEQ_MAX = (std::numeric_limits<SEQ>::max)();
|
2020-10-01 19:02:14 +08:00
|
|
|
|
PacketSortor() = default;
|
|
|
|
|
|
~PacketSortor() = default;
|
|
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
void setOnSort(std::function<void(SEQ seq, T packet)> cb) { _cb = std::move(cb); }
|
2020-10-01 19:02:14 +08:00
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
|
* 清空状态
|
|
|
|
|
|
*/
|
|
|
|
|
|
void clear() {
|
2023-03-05 23:24:55 +08:00
|
|
|
|
_started = false;
|
2020-10-01 19:02:14 +08:00
|
|
|
|
_seq_cycle_count = 0;
|
2023-03-05 23:24:55 +08:00
|
|
|
|
_pkt_sort_cache_map.clear();
|
2020-10-01 19:02:14 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
|
* 获取排序缓存长度
|
|
|
|
|
|
*/
|
2023-03-06 20:43:07 +08:00
|
|
|
|
size_t getJitterSize() const { return _pkt_sort_cache_map.size(); }
|
2020-10-01 19:02:14 +08:00
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
|
* 获取seq回环次数
|
|
|
|
|
|
*/
|
2023-03-06 20:43:07 +08:00
|
|
|
|
size_t getCycleCount() const { return _seq_cycle_count; }
|
2020-10-01 19:02:14 +08:00
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
|
* 输入并排序
|
|
|
|
|
|
* @param seq 序列号
|
|
|
|
|
|
* @param packet 包负载
|
|
|
|
|
|
*/
|
2020-10-01 21:33:07 +08:00
|
|
|
|
void sortPacket(SEQ seq, T packet) {
|
2023-03-05 23:24:55 +08:00
|
|
|
|
if (!_started) {
|
|
|
|
|
|
// 记录第一个seq
|
|
|
|
|
|
_started = true;
|
|
|
|
|
|
_last_seq_out = seq - 1;
|
2022-09-28 15:29:11 +08:00
|
|
|
|
}
|
2023-03-05 23:24:55 +08:00
|
|
|
|
if (seq == static_cast<SEQ>(_last_seq_out + 1)) {
|
|
|
|
|
|
// 收到下一个seq
|
|
|
|
|
|
output(seq, std::move(packet));
|
2020-10-17 14:46:59 +08:00
|
|
|
|
return;
|
2020-10-01 19:02:14 +08:00
|
|
|
|
}
|
2020-10-17 14:46:59 +08:00
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
if (seq < _last_seq_out && _last_seq_out != SEQ_MAX && seq < 1024 && _last_seq_out > SEQ_MAX - 1024) {
|
2023-03-05 23:24:55 +08:00
|
|
|
|
// seq回环,清空回环前缓存
|
|
|
|
|
|
flush();
|
|
|
|
|
|
_last_seq_out = SEQ_MAX;
|
|
|
|
|
|
++_seq_cycle_count;
|
2023-03-06 20:43:07 +08:00
|
|
|
|
sortPacket(seq, std::move(packet));
|
2023-03-05 23:24:55 +08:00
|
|
|
|
return;
|
|
|
|
|
|
}
|
2020-10-01 19:02:14 +08:00
|
|
|
|
|
2023-03-05 23:24:55 +08:00
|
|
|
|
if (seq <= _last_seq_out && _last_seq_out != SEQ_MAX) {
|
|
|
|
|
|
// 这个回退包已经不再等待
|
|
|
|
|
|
return;
|
2020-10-17 14:46:59 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-05 23:24:55 +08:00
|
|
|
|
_pkt_sort_cache_map.emplace(seq, std::move(packet));
|
2023-03-06 20:43:07 +08:00
|
|
|
|
auto it_min = _pkt_sort_cache_map.begin();
|
|
|
|
|
|
auto it_max = _pkt_sort_cache_map.rbegin();
|
|
|
|
|
|
if (it_max->first - it_min->first > (SEQ_MAX >> 1)) {
|
2023-03-05 23:24:55 +08:00
|
|
|
|
// 回环后,收到回环前的大值seq, 忽略掉
|
2023-03-06 20:43:07 +08:00
|
|
|
|
_pkt_sort_cache_map.erase((++it_max).base());
|
2020-10-17 14:46:59 +08:00
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
tryFlushFrontPacket();
|
|
|
|
|
|
|
|
|
|
|
|
if (_pkt_sort_cache_map.size() > _max_buffer_size || (_ticker.elapsedTime() > _max_buffer_ms && !_pkt_sort_cache_map.empty())) {
|
|
|
|
|
|
// buffer太长,强行减小
|
|
|
|
|
|
WarnL << "packet dropped: " << static_cast<SEQ>(_last_seq_out + 1) << " -> "
|
|
|
|
|
|
<< static_cast<SEQ>(_pkt_sort_cache_map.begin()->first - 1)
|
|
|
|
|
|
<< ", jitter buffer size: " << _pkt_sort_cache_map.size()
|
|
|
|
|
|
<< ", jitter buffer ms: " << _ticker.elapsedTime();
|
|
|
|
|
|
popIterator(_pkt_sort_cache_map.begin());
|
2023-03-05 23:24:55 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
void flush() {
|
|
|
|
|
|
// 清空缓存
|
2023-03-05 23:24:55 +08:00
|
|
|
|
while (!_pkt_sort_cache_map.empty()) {
|
2021-07-17 19:58:29 +08:00
|
|
|
|
popIterator(_pkt_sort_cache_map.begin());
|
2020-10-17 14:46:59 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-05 23:24:55 +08:00
|
|
|
|
private:
|
2023-03-06 20:43:07 +08:00
|
|
|
|
void tryFlushFrontPacket() {
|
|
|
|
|
|
while (!_pkt_sort_cache_map.empty()) {
|
|
|
|
|
|
auto it = _pkt_sort_cache_map.begin();
|
|
|
|
|
|
auto next_seq = static_cast<SEQ>(_last_seq_out + 1);
|
|
|
|
|
|
if (it->first < next_seq) {
|
|
|
|
|
|
_pkt_sort_cache_map.erase(it);
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
if (it->first == next_seq) {
|
|
|
|
|
|
// 连续的seq
|
|
|
|
|
|
popIterator(it);
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2022-02-02 20:34:50 +08:00
|
|
|
|
void popIterator(typename std::map<SEQ, T>::iterator it) {
|
2021-01-17 10:25:00 +08:00
|
|
|
|
auto seq = it->first;
|
|
|
|
|
|
auto data = std::move(it->second);
|
2021-07-17 19:58:29 +08:00
|
|
|
|
_pkt_sort_cache_map.erase(it);
|
2023-03-05 23:24:55 +08:00
|
|
|
|
output(seq, std::move(data));
|
2020-10-01 19:02:14 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-05 23:24:55 +08:00
|
|
|
|
void output(SEQ seq, T packet) {
|
|
|
|
|
|
_last_seq_out = seq;
|
|
|
|
|
|
_cb(seq, std::move(packet));
|
2023-03-06 20:43:07 +08:00
|
|
|
|
_ticker.resetTime();
|
2020-10-01 19:02:14 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private:
|
2023-03-05 23:24:55 +08:00
|
|
|
|
bool _started = false;
|
2023-03-06 20:43:07 +08:00
|
|
|
|
//排序缓存最大保存数据长度,单位毫秒
|
2023-03-07 10:37:44 +08:00
|
|
|
|
size_t _max_buffer_ms = 3000;
|
2023-03-06 20:43:07 +08:00
|
|
|
|
//排序缓存最大保存数据个数
|
|
|
|
|
|
size_t _max_buffer_size = 1024;
|
|
|
|
|
|
//记录上次output至今的时间
|
|
|
|
|
|
toolkit::Ticker _ticker;
|
2020-10-01 21:33:07 +08:00
|
|
|
|
//下次应该输出的SEQ
|
2023-03-05 23:24:55 +08:00
|
|
|
|
SEQ _last_seq_out = 0;
|
2020-10-01 19:02:14 +08:00
|
|
|
|
//seq回环次数计数
|
2021-01-17 18:31:50 +08:00
|
|
|
|
size_t _seq_cycle_count = 0;
|
2021-07-17 19:58:29 +08:00
|
|
|
|
//pkt排序缓存,根据seq排序
|
2022-02-02 20:34:50 +08:00
|
|
|
|
std::map<SEQ, T> _pkt_sort_cache_map;
|
2020-10-01 19:02:14 +08:00
|
|
|
|
//回调
|
2023-03-05 23:24:55 +08:00
|
|
|
|
std::function<void(SEQ seq, T packet)> _cb;
|
2020-10-01 19:02:14 +08:00
|
|
|
|
};
|
|
|
|
|
|
|
2022-11-29 11:07:13 +08:00
|
|
|
|
class RtpTrack : private PacketSortor<RtpPacket::Ptr> {
|
2018-12-14 17:46:12 +08:00
|
|
|
|
public:
|
2022-02-02 20:34:50 +08:00
|
|
|
|
class BadRtpException : public std::invalid_argument {
|
2021-04-22 22:02:21 +08:00
|
|
|
|
public:
|
|
|
|
|
|
template<typename Type>
|
|
|
|
|
|
BadRtpException(Type &&type) : invalid_argument(std::forward<Type>(type)) {}
|
|
|
|
|
|
~BadRtpException() = default;
|
|
|
|
|
|
};
|
|
|
|
|
|
|
2021-06-25 16:24:44 +08:00
|
|
|
|
RtpTrack();
|
|
|
|
|
|
virtual ~RtpTrack() = default;
|
|
|
|
|
|
|
|
|
|
|
|
void clear();
|
|
|
|
|
|
uint32_t getSSRC() const;
|
2021-07-14 21:39:30 +08:00
|
|
|
|
RtpPacket::Ptr inputRtp(TrackType type, int sample_rate, uint8_t *ptr, size_t len);
|
2021-09-02 21:17:59 +08:00
|
|
|
|
void setNtpStamp(uint32_t rtp_stamp, uint64_t ntp_stamp_ms);
|
2023-03-06 20:43:07 +08:00
|
|
|
|
void setPayloadType(uint8_t pt);
|
2021-06-25 16:24:44 +08:00
|
|
|
|
|
2020-10-01 19:02:14 +08:00
|
|
|
|
protected:
|
2021-06-25 16:24:44 +08:00
|
|
|
|
virtual void onRtpSorted(RtpPacket::Ptr rtp) {}
|
|
|
|
|
|
virtual void onBeforeRtpSorted(const RtpPacket::Ptr &rtp) {}
|
|
|
|
|
|
|
|
|
|
|
|
private:
|
2021-08-21 18:52:52 +08:00
|
|
|
|
bool _disable_ntp = false;
|
2022-02-22 16:53:05 +08:00
|
|
|
|
uint8_t _pt = 0xFF;
|
2021-06-25 16:24:44 +08:00
|
|
|
|
uint32_t _ssrc = 0;
|
2022-02-02 20:34:50 +08:00
|
|
|
|
toolkit::Ticker _ssrc_alive;
|
2021-07-12 21:18:22 +08:00
|
|
|
|
NtpStamp _ntp_stamp;
|
2021-06-25 16:24:44 +08:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
class RtpTrackImp : public RtpTrack{
|
|
|
|
|
|
public:
|
2022-02-02 20:34:50 +08:00
|
|
|
|
using OnSorted = std::function<void(RtpPacket::Ptr)>;
|
|
|
|
|
|
using BeforeSorted = std::function<void(const RtpPacket::Ptr &)>;
|
2021-06-25 16:24:44 +08:00
|
|
|
|
|
|
|
|
|
|
RtpTrackImp() = default;
|
|
|
|
|
|
~RtpTrackImp() override = default;
|
|
|
|
|
|
|
|
|
|
|
|
void setOnSorted(OnSorted cb);
|
|
|
|
|
|
void setBeforeSorted(BeforeSorted cb);
|
|
|
|
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
|
void onRtpSorted(RtpPacket::Ptr rtp) override;
|
|
|
|
|
|
void onBeforeRtpSorted(const RtpPacket::Ptr &rtp) override;
|
|
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
OnSorted _on_sorted;
|
|
|
|
|
|
BeforeSorted _on_before_sorted;
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
template<int kCount = 2>
|
|
|
|
|
|
class RtpMultiReceiver {
|
|
|
|
|
|
public:
|
|
|
|
|
|
RtpMultiReceiver() {
|
|
|
|
|
|
int index = 0;
|
|
|
|
|
|
for (auto &track : _track) {
|
|
|
|
|
|
track.setOnSorted([this, index](RtpPacket::Ptr rtp) {
|
|
|
|
|
|
onRtpSorted(std::move(rtp), index);
|
|
|
|
|
|
});
|
|
|
|
|
|
track.setBeforeSorted([this, index](const RtpPacket::Ptr &rtp) {
|
|
|
|
|
|
onBeforeRtpSorted(rtp, index);
|
|
|
|
|
|
});
|
|
|
|
|
|
++index;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
virtual ~RtpMultiReceiver() = default;
|
|
|
|
|
|
|
2018-12-14 17:46:12 +08:00
|
|
|
|
/**
|
|
|
|
|
|
* 输入数据指针生成并排序rtp包
|
2021-01-31 19:19:24 +08:00
|
|
|
|
* @param index track下标索引
|
2020-07-08 23:23:11 +08:00
|
|
|
|
* @param type track类型
|
|
|
|
|
|
* @param samplerate rtp时间戳基准时钟,视频为90000,音频为采样率
|
2021-01-31 19:19:24 +08:00
|
|
|
|
* @param ptr rtp数据指针
|
|
|
|
|
|
* @param len rtp数据指针长度
|
2018-12-14 17:46:12 +08:00
|
|
|
|
* @return 解析成功返回true
|
|
|
|
|
|
*/
|
2022-01-12 15:21:33 +08:00
|
|
|
|
bool handleOneRtp(int index, TrackType type, int sample_rate, uint8_t *ptr, size_t len) {
|
|
|
|
|
|
assert(index < kCount && index >= 0);
|
2021-07-14 21:39:30 +08:00
|
|
|
|
return _track[index].inputRtp(type, sample_rate, ptr, len).operator bool();
|
2021-06-25 16:24:44 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2021-07-12 21:18:22 +08:00
|
|
|
|
/**
|
|
|
|
|
|
* 设置ntp时间戳,在收到rtcp sender report时设置
|
2021-08-21 18:52:52 +08:00
|
|
|
|
* 如果rtp_stamp/sample_rate/ntp_stamp_ms都为0,那么采用rtp时间戳为ntp时间戳
|
2021-07-12 21:18:22 +08:00
|
|
|
|
* @param index track下标索引
|
|
|
|
|
|
* @param rtp_stamp rtp时间戳
|
|
|
|
|
|
* @param ntp_stamp_ms ntp时间戳
|
|
|
|
|
|
*/
|
2022-01-12 15:21:33 +08:00
|
|
|
|
void setNtpStamp(int index, uint32_t rtp_stamp, uint64_t ntp_stamp_ms) {
|
|
|
|
|
|
assert(index < kCount && index >= 0);
|
2021-09-02 21:17:59 +08:00
|
|
|
|
_track[index].setNtpStamp(rtp_stamp, ntp_stamp_ms);
|
2021-07-12 21:18:22 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2023-03-06 20:43:07 +08:00
|
|
|
|
void setPayloadType(int index, uint8_t pt){
|
2022-07-17 00:26:07 +08:00
|
|
|
|
assert(index < kCount && index >= 0);
|
2023-03-06 20:43:07 +08:00
|
|
|
|
_track[index].setPayloadType(pt);
|
2022-07-17 00:26:07 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
2021-06-25 16:24:44 +08:00
|
|
|
|
void clear() {
|
|
|
|
|
|
for (auto &track : _track) {
|
|
|
|
|
|
track.clear();
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
size_t getJitterSize(int index) const {
|
2022-01-12 15:21:33 +08:00
|
|
|
|
assert(index < kCount && index >= 0);
|
2021-06-25 16:24:44 +08:00
|
|
|
|
return _track[index].getJitterSize();
|
|
|
|
|
|
}
|
2018-12-14 17:46:12 +08:00
|
|
|
|
|
2021-06-25 16:24:44 +08:00
|
|
|
|
size_t getCycleCount(int index) const {
|
2022-01-12 15:21:33 +08:00
|
|
|
|
assert(index < kCount && index >= 0);
|
2021-06-25 16:24:44 +08:00
|
|
|
|
return _track[index].getCycleCount();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
uint32_t getSSRC(int index) const {
|
2022-01-12 15:21:33 +08:00
|
|
|
|
assert(index < kCount && index >= 0);
|
2021-06-25 16:24:44 +08:00
|
|
|
|
return _track[index].getSSRC();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
protected:
|
2018-12-14 17:46:12 +08:00
|
|
|
|
/**
|
|
|
|
|
|
* rtp数据包排序后输出
|
2019-06-24 17:01:15 +08:00
|
|
|
|
* @param rtp rtp数据包
|
|
|
|
|
|
* @param track_index track索引
|
2018-12-14 17:46:12 +08:00
|
|
|
|
*/
|
2021-06-25 16:24:44 +08:00
|
|
|
|
virtual void onRtpSorted(RtpPacket::Ptr rtp, int index) {}
|
2020-10-01 19:02:14 +08:00
|
|
|
|
|
2021-01-31 19:18:17 +08:00
|
|
|
|
/**
|
|
|
|
|
|
* 解析出rtp但还未排序
|
|
|
|
|
|
* @param rtp rtp数据包
|
|
|
|
|
|
* @param track_index track索引
|
|
|
|
|
|
*/
|
2021-06-25 16:24:44 +08:00
|
|
|
|
virtual void onBeforeRtpSorted(const RtpPacket::Ptr &rtp, int index) {}
|
2020-07-08 23:23:11 +08:00
|
|
|
|
|
2019-06-24 16:56:46 +08:00
|
|
|
|
private:
|
2021-06-25 16:24:44 +08:00
|
|
|
|
RtpTrackImp _track[kCount];
|
2018-12-14 17:46:12 +08:00
|
|
|
|
};
|
|
|
|
|
|
|
2021-06-25 16:24:44 +08:00
|
|
|
|
using RtpReceiver = RtpMultiReceiver<2>;
|
|
|
|
|
|
|
2018-12-14 17:46:12 +08:00
|
|
|
|
}//namespace mediakit
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif //ZLMEDIAKIT_RTPRECEIVER_H
|