2013-11-23 03:36:07 +00:00
|
|
|
/*
|
|
|
|
The MIT License (MIT)
|
|
|
|
|
2014-01-01 02:37:12 +00:00
|
|
|
Copyright (c) 2013-2014 winlin
|
2013-11-23 03:36:07 +00:00
|
|
|
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
|
|
this software and associated documentation files (the "Software"), to deal in
|
|
|
|
the Software without restriction, including without limitation the rights to
|
|
|
|
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
|
|
|
the Software, and to permit persons to whom the Software is furnished to do so,
|
|
|
|
subject to the following conditions:
|
|
|
|
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
|
|
copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
|
|
|
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
|
|
|
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
|
|
|
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2014-12-03 10:56:09 +00:00
|
|
|
#include <srs_protocol_buffer.hpp>
|
2013-11-23 03:36:07 +00:00
|
|
|
|
2014-03-01 02:30:16 +00:00
|
|
|
#include <srs_kernel_error.hpp>
|
2014-03-01 02:42:55 +00:00
|
|
|
#include <srs_kernel_log.hpp>
|
2014-12-03 14:51:19 +00:00
|
|
|
#include <srs_kernel_utility.hpp>
|
2013-11-23 03:36:07 +00:00
|
|
|
|
2014-12-04 03:29:47 +00:00
|
|
|
SrsSimpleBuffer::SrsSimpleBuffer()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
SrsSimpleBuffer::~SrsSimpleBuffer()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
int SrsSimpleBuffer::length()
|
|
|
|
{
|
|
|
|
int len = (int)data.size();
|
|
|
|
srs_assert(len >= 0);
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* SrsSimpleBuffer::bytes()
|
|
|
|
{
|
|
|
|
return (length() == 0)? NULL : &data.at(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SrsSimpleBuffer::erase(int size)
|
|
|
|
{
|
|
|
|
if (size <= 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (size >= length()) {
|
|
|
|
data.clear();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
data.erase(data.begin(), data.begin() + size);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SrsSimpleBuffer::append(const char* bytes, int size)
|
|
|
|
{
|
|
|
|
srs_assert(size > 0);
|
|
|
|
|
|
|
|
data.insert(data.end(), bytes, bytes + size);
|
|
|
|
}
|
|
|
|
|
2014-12-03 11:27:27 +00:00
|
|
|
IMergeReadHandler::IMergeReadHandler()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
IMergeReadHandler::~IMergeReadHandler()
|
|
|
|
{
|
|
|
|
}
|
2013-11-23 03:36:07 +00:00
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
SrsFastBuffer::SrsFastBuffer()
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-12-03 11:27:27 +00:00
|
|
|
merged_read = false;
|
|
|
|
_handler = NULL;
|
|
|
|
|
2014-12-03 13:46:47 +00:00
|
|
|
nb_buffer = SOCKET_READ_SIZE;
|
|
|
|
buffer = new char[nb_buffer];
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
SrsFastBuffer::~SrsFastBuffer()
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-12-03 06:27:36 +00:00
|
|
|
srs_freep(buffer);
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
int SrsFastBuffer::length()
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-06-07 13:09:46 +00:00
|
|
|
int len = (int)data.size();
|
|
|
|
srs_assert(len >= 0);
|
|
|
|
return len;
|
2014-04-01 06:28:19 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
char* SrsFastBuffer::bytes()
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-06-07 13:09:46 +00:00
|
|
|
return (length() == 0)? NULL : &data.at(0);
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
void SrsFastBuffer::erase(int size)
|
2014-04-01 06:28:19 +00:00
|
|
|
{
|
2014-06-10 08:06:18 +00:00
|
|
|
if (size <= 0) {
|
|
|
|
return;
|
|
|
|
}
|
2014-06-07 13:09:46 +00:00
|
|
|
|
2014-06-07 14:23:17 +00:00
|
|
|
if (size >= length()) {
|
2014-06-07 13:09:46 +00:00
|
|
|
data.clear();
|
2014-04-01 06:28:19 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-06-07 13:09:46 +00:00
|
|
|
data.erase(data.begin(), data.begin() + size);
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
void SrsFastBuffer::append(const char* bytes, int size)
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-04-01 06:28:19 +00:00
|
|
|
srs_assert(size > 0);
|
2014-06-07 13:09:46 +00:00
|
|
|
|
2014-03-18 03:32:58 +00:00
|
|
|
data.insert(data.end(), bytes, bytes + size);
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
int SrsFastBuffer::grow(ISrsBufferReader* reader, int required_size)
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-03-18 03:32:58 +00:00
|
|
|
int ret = ERROR_SUCCESS;
|
|
|
|
|
|
|
|
if (required_size < 0) {
|
|
|
|
ret = ERROR_SYSTEM_SIZE_NEGATIVE;
|
|
|
|
srs_error("size is negative. size=%d, ret=%d", required_size, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-06-07 13:09:46 +00:00
|
|
|
while (length() < required_size) {
|
2014-03-18 03:32:58 +00:00
|
|
|
ssize_t nread;
|
2014-12-03 13:46:47 +00:00
|
|
|
if ((ret = reader->read(buffer, nb_buffer, &nread)) != ERROR_SUCCESS) {
|
2014-12-02 14:26:20 +00:00
|
|
|
return ret;
|
2014-03-18 03:32:58 +00:00
|
|
|
}
|
|
|
|
|
2014-12-03 11:27:27 +00:00
|
|
|
/**
|
|
|
|
* to improve read performance, merge some packets then read,
|
|
|
|
* when it on and read small bytes, we sleep to wait more data.,
|
|
|
|
* that is, we merge some data to read together.
|
|
|
|
* @see https://github.com/winlinvip/simple-rtmp-server/issues/241
|
|
|
|
*/
|
|
|
|
if (merged_read && _handler) {
|
2014-12-03 14:39:25 +00:00
|
|
|
_handler->on_read(nread);
|
2014-12-03 11:27:27 +00:00
|
|
|
}
|
|
|
|
|
2014-03-18 03:32:58 +00:00
|
|
|
srs_assert((int)nread > 0);
|
|
|
|
append(buffer, (int)nread);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
void SrsFastBuffer::set_merge_read(bool v, int max_buffer, IMergeReadHandler* handler)
|
2014-12-03 11:27:27 +00:00
|
|
|
{
|
|
|
|
merged_read = v;
|
|
|
|
_handler = handler;
|
2014-12-03 14:39:25 +00:00
|
|
|
|
2014-12-03 14:51:19 +00:00
|
|
|
// limit the max buffer.
|
|
|
|
int buffer_size = srs_min(max_buffer, SOCKET_MAX_BUF);
|
|
|
|
|
|
|
|
if (v && buffer_size != nb_buffer) {
|
|
|
|
reset_buffer(buffer_size);
|
2014-12-03 14:39:25 +00:00
|
|
|
}
|
2014-12-03 15:05:42 +00:00
|
|
|
|
|
|
|
if (_handler) {
|
|
|
|
_handler->on_buffer_change(nb_buffer);
|
|
|
|
}
|
2014-12-03 11:27:27 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
void SrsFastBuffer::on_chunk_size(int32_t chunk_size)
|
2014-12-03 13:46:47 +00:00
|
|
|
{
|
|
|
|
if (nb_buffer >= chunk_size) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-12-03 15:11:13 +00:00
|
|
|
// limit the max buffer.
|
|
|
|
int buffer_size = srs_min(chunk_size, SOCKET_MAX_BUF);
|
|
|
|
|
|
|
|
if (buffer_size != nb_buffer) {
|
|
|
|
reset_buffer(buffer_size);
|
|
|
|
}
|
2014-12-03 15:05:42 +00:00
|
|
|
|
|
|
|
if (_handler) {
|
|
|
|
_handler->on_buffer_change(nb_buffer);
|
|
|
|
}
|
2014-12-03 13:46:47 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
int SrsFastBuffer::buffer_size()
|
2014-12-03 13:46:47 +00:00
|
|
|
{
|
|
|
|
return nb_buffer;
|
|
|
|
}
|
|
|
|
|
2014-12-04 03:32:32 +00:00
|
|
|
void SrsFastBuffer::reset_buffer(int size)
|
2014-12-03 14:39:25 +00:00
|
|
|
{
|
|
|
|
srs_freep(buffer);
|
|
|
|
|
|
|
|
nb_buffer = size;
|
|
|
|
buffer = new char[nb_buffer];
|
|
|
|
}
|