ZLMediaKit/src/Rtsp/RtpReceiver.h

207 lines
5.7 KiB
C++
Raw Normal View History

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
*
* 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>
2019-06-28 17:30:13 +08:00
#include "RtpCodec.h"
2018-12-14 17:46:12 +08:00
#include "RtspMediaSource.h"
using namespace std;
using namespace toolkit;
namespace mediakit {
template<typename T, typename SEQ = uint16_t, size_t kMax = 256, size_t kMin = 10>
2020-10-01 19:02:14 +08:00
class PacketSortor {
public:
PacketSortor() = default;
~PacketSortor() = default;
2020-10-01 21:33:07 +08:00
void setOnSort(function<void(SEQ seq, T &packet)> cb) {
2020-10-01 19:02:14 +08:00
_cb = std::move(cb);
}
/**
*
*/
void clear() {
_seq_cycle_count = 0;
_rtp_sort_cache_map.clear();
2020-10-01 21:33:07 +08:00
_next_seq_out = 0;
_max_sort_size = kMin;
2020-10-01 19:02:14 +08:00
}
/**
*
*/
size_t getJitterSize() const{
2020-10-01 19:02:14 +08:00
return _rtp_sort_cache_map.size();
}
/**
* seq回环次数
*/
size_t getCycleCount() const{
2020-10-01 19:02:14 +08:00
return _seq_cycle_count;
}
/**
*
* @param seq
* @param packet
*/
2020-10-01 21:33:07 +08:00
void sortPacket(SEQ seq, T packet) {
2020-10-17 14:46:59 +08:00
if (seq < _next_seq_out) {
if (_next_seq_out - seq < kMax) {
//过滤seq回退包(回环包除外)
return;
}
} else if (_next_seq_out && seq - _next_seq_out > (0xFFFF >> 1)) {
//过滤seq跳变非常大的包(防止回环时乱序时收到非常大的seq)
return;
2020-10-01 19:02:14 +08:00
}
2020-10-17 14:46:59 +08:00
2020-10-01 21:33:07 +08:00
//放入排序缓存
_rtp_sort_cache_map.emplace(seq, std::move(packet));
//尝试输出排序后的包
tryPopPacket();
2020-10-01 19:02:14 +08:00
}
2020-10-17 14:46:59 +08:00
void flush(){
//清空缓存
while (!_rtp_sort_cache_map.empty()) {
popIterator(_rtp_sort_cache_map.begin());
}
}
2020-10-01 19:02:14 +08:00
private:
void popPacket() {
auto it = _rtp_sort_cache_map.begin();
2020-10-17 14:46:59 +08:00
if (it->first >= _next_seq_out) {
//过滤回跳包
popIterator(it);
return;
}
if (_next_seq_out - it->first > (0xFFFF >> 1)) {
//产生回环了
if (_rtp_sort_cache_map.size() < 2 * kMin) {
//等足够多的数据后才处理回环, 因为后面还可能出现大的SEQ
return;
}
++_seq_cycle_count;
//找到大的SEQ并清空掉然后从小的SEQ重新开始排序
auto hit = _rtp_sort_cache_map.upper_bound((SEQ) (_next_seq_out - _rtp_sort_cache_map.size()));
while (hit != _rtp_sort_cache_map.end()) {
//回环前清空剩余的大的SEQ的数据
_cb(hit->first, hit->second);
hit = _rtp_sort_cache_map.erase(hit);
}
//下一个回环的数据
popIterator(_rtp_sort_cache_map.begin());
return;
}
//删除回跳的数据包
_rtp_sort_cache_map.erase(it);
}
void popIterator(typename map<SEQ, T>::iterator it) {
auto seq = it->first;
auto data = std::move(it->second);
2020-10-01 19:02:14 +08:00
_rtp_sort_cache_map.erase(it);
_next_seq_out = seq + 1;
_cb(seq, data);
2020-10-01 19:02:14 +08:00
}
2020-10-01 21:33:07 +08:00
void tryPopPacket() {
2020-10-17 14:46:59 +08:00
int count = 0;
2020-10-01 21:33:07 +08:00
while ((!_rtp_sort_cache_map.empty() && _rtp_sort_cache_map.begin()->first == _next_seq_out)) {
//找到下个包,直接输出
popPacket();
2020-10-17 14:46:59 +08:00
++count;
2020-10-01 21:33:07 +08:00
}
2020-10-17 14:46:59 +08:00
if (count) {
2020-10-01 21:33:07 +08:00
setSortSize();
} else if (_rtp_sort_cache_map.size() > _max_sort_size) {
//排序缓存溢出,不再继续排序
popPacket();
setSortSize();
}
}
void setSortSize() {
2020-10-17 14:46:59 +08:00
_max_sort_size = kMin + _rtp_sort_cache_map.size();
2020-10-01 21:33:07 +08:00
if (_max_sort_size > kMax) {
_max_sort_size = kMax;
}
2020-10-01 19:02:14 +08:00
}
private:
2020-10-01 21:33:07 +08:00
//下次应该输出的SEQ
SEQ _next_seq_out = 0;
2020-10-01 19:02:14 +08:00
//seq回环次数计数
size_t _seq_cycle_count = 0;
2020-10-01 19:02:14 +08:00
//排序缓存长度
size_t _max_sort_size = kMin;
2020-10-01 19:02:14 +08:00
//rtp排序缓存根据seq排序
map<SEQ, T> _rtp_sort_cache_map;
//回调
2020-10-01 21:33:07 +08:00
function<void(SEQ seq, T &packet)> _cb;
2020-10-01 19:02:14 +08:00
};
2018-12-14 17:46:12 +08:00
class RtpReceiver {
public:
RtpReceiver();
virtual ~RtpReceiver();
2020-10-01 19:02:14 +08:00
protected:
2018-12-14 17:46:12 +08:00
/**
* rtp包
2019-06-24 16:56:46 +08:00
* @param track_index track下标索引
2020-07-08 23:23:11 +08:00
* @param type track类型
* @param samplerate rtp时间戳基准时钟90000
2019-06-24 16:56:46 +08:00
* @param rtp_raw_ptr rtp数据指针
* @param rtp_raw_len rtp数据指针长度
2018-12-14 17:46:12 +08:00
* @return true
*/
bool handleOneRtp(int track_index, TrackType type, int samplerate, unsigned char *rtp_raw_ptr, size_t rtp_raw_len);
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
*/
2020-10-01 21:33:07 +08:00
virtual void onRtpSorted(const RtpPacket::Ptr &rtp, int track_index) {}
2020-10-01 19:02:14 +08:00
2018-12-14 17:46:12 +08:00
void clear();
void setPoolSize(size_t size);
size_t getJitterSize(int track_index) const;
size_t getCycleCount(int track_index) const;
2020-12-27 18:11:10 +08:00
uint32_t getSSRC(int track_index) const;
2020-07-08 23:23:11 +08:00
2019-06-24 16:56:46 +08:00
private:
2020-10-01 21:33:07 +08:00
uint32_t _ssrc[2] = {0, 0};
2019-06-24 16:56:46 +08:00
//ssrc不匹配计数
size_t _ssrc_err_count[2] = {0, 0};
2019-06-24 16:56:46 +08:00
//rtp排序缓存根据seq排序
2020-10-01 19:02:14 +08:00
PacketSortor<RtpPacket::Ptr> _rtp_sortor[2];
2019-06-24 16:56:46 +08:00
//rtp循环池
RtspMediaSource::PoolType _rtp_pool;
2018-12-14 17:46:12 +08:00
};
}//namespace mediakit
#endif //ZLMEDIAKIT_RTPRECEIVER_H