2013-11-23 03:36:07 +00:00
|
|
|
/*
|
|
|
|
The MIT License (MIT)
|
|
|
|
|
2015-04-29 09:38:23 +00:00
|
|
|
Copyright (c) 2013-2015 SRS(simple-rtmp-server)
|
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.
|
|
|
|
*/
|
|
|
|
|
2015-05-23 02:04:28 +00:00
|
|
|
#include <srs_protocol_buffer.hpp>
|
2013-11-23 03:36:07 +00:00
|
|
|
|
2015-03-18 08:34:27 +00:00
|
|
|
#include <stdlib.h>
|
|
|
|
|
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>
|
2014-12-04 05:43:55 +00:00
|
|
|
#include <srs_core_performance.hpp>
|
2013-11-23 03:36:07 +00:00
|
|
|
|
2014-12-04 14:00:09 +00:00
|
|
|
// the default recv buffer size, 128KB.
|
|
|
|
#define SRS_DEFAULT_RECV_BUFFER_SIZE 131072
|
|
|
|
|
|
|
|
// limit user-space buffer to 256KB, for 3Mbps stream delivery.
|
|
|
|
// 800*2000/8=200000B(about 195KB).
|
|
|
|
// @remark it's ok for higher stream, the buffer is ok for one chunk is 256KB.
|
|
|
|
#define SRS_MAX_SOCKET_BUFFER 262144
|
2014-12-04 10:21:04 +00:00
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
// the max header size,
|
|
|
|
// @see SrsProtocol::read_message_header().
|
|
|
|
#define SRS_RTMP_MAX_MESSAGE_HEADER 11
|
|
|
|
|
2014-12-04 05:43:55 +00:00
|
|
|
#ifdef SRS_PERF_MERGED_READ
|
2014-12-03 11:27:27 +00:00
|
|
|
IMergeReadHandler::IMergeReadHandler()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
IMergeReadHandler::~IMergeReadHandler()
|
|
|
|
{
|
|
|
|
}
|
2014-12-04 05:43:55 +00:00
|
|
|
#endif
|
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-04 05:43:55 +00:00
|
|
|
#ifdef SRS_PERF_MERGED_READ
|
2014-12-03 11:27:27 +00:00
|
|
|
merged_read = false;
|
|
|
|
_handler = NULL;
|
2014-12-04 05:43:55 +00:00
|
|
|
#endif
|
2014-12-03 11:27:27 +00:00
|
|
|
|
2014-12-04 10:21:04 +00:00
|
|
|
nb_buffer = SRS_DEFAULT_RECV_BUFFER_SIZE;
|
2015-03-18 08:34:27 +00:00
|
|
|
buffer = (char*)malloc(nb_buffer);
|
2014-12-04 07:45:25 +00:00
|
|
|
p = end = buffer;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2015-03-18 08:34:27 +00:00
|
|
|
SrsFastBuffer::~SrsFastBuffer()
|
|
|
|
{
|
|
|
|
free(buffer);
|
|
|
|
buffer = NULL;
|
|
|
|
}
|
|
|
|
|
2015-03-06 03:36:26 +00:00
|
|
|
int SrsFastBuffer::size()
|
|
|
|
{
|
|
|
|
return end - p;
|
|
|
|
}
|
|
|
|
|
|
|
|
char* SrsFastBuffer::bytes()
|
|
|
|
{
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2014-12-04 10:21:04 +00:00
|
|
|
void SrsFastBuffer::set_buffer(int buffer_size)
|
|
|
|
{
|
2015-03-18 08:50:47 +00:00
|
|
|
// never exceed the max size.
|
2015-03-18 08:34:27 +00:00
|
|
|
if (buffer_size > SRS_MAX_SOCKET_BUFFER) {
|
2015-03-18 08:50:47 +00:00
|
|
|
srs_warn("limit the user-space buffer from %d to %d",
|
|
|
|
buffer_size, SRS_MAX_SOCKET_BUFFER);
|
2014-12-04 14:00:09 +00:00
|
|
|
}
|
2015-03-18 08:50:47 +00:00
|
|
|
|
|
|
|
// the user-space buffer size limit to a max value.
|
|
|
|
int nb_resize_buf = srs_min(buffer_size, SRS_MAX_SOCKET_BUFFER);
|
2014-12-04 14:00:09 +00:00
|
|
|
|
2014-12-04 10:21:04 +00:00
|
|
|
// only realloc when buffer changed bigger
|
2015-03-18 08:34:27 +00:00
|
|
|
if (nb_resize_buf <= nb_buffer) {
|
2014-12-04 10:21:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2015-03-18 08:50:47 +00:00
|
|
|
// realloc for buffer change bigger.
|
2015-06-06 12:23:18 +00:00
|
|
|
int start = (int)(p - buffer);
|
|
|
|
int nb_bytes = (int)(end - p);
|
2014-12-04 10:21:04 +00:00
|
|
|
|
2015-03-18 08:34:27 +00:00
|
|
|
buffer = (char*)realloc(buffer, nb_resize_buf);
|
|
|
|
nb_buffer = nb_resize_buf;
|
2014-12-04 10:21:04 +00:00
|
|
|
p = buffer + start;
|
2015-03-18 08:34:27 +00:00
|
|
|
end = p + nb_bytes;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
char SrsFastBuffer::read_1byte()
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-12-04 05:05:13 +00:00
|
|
|
srs_assert(end - p >= 1);
|
|
|
|
return *p++;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
char* SrsFastBuffer::read_slice(int size)
|
2014-04-01 06:28:19 +00:00
|
|
|
{
|
2014-12-04 05:05:13 +00:00
|
|
|
srs_assert(end - p >= size);
|
|
|
|
srs_assert(p + size > buffer);
|
2014-06-07 13:09:46 +00:00
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
char* ptr = p;
|
|
|
|
p += size;
|
|
|
|
|
|
|
|
return ptr;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
void SrsFastBuffer::skip(int size)
|
2013-11-23 03:36:07 +00:00
|
|
|
{
|
2014-12-04 05:05:13 +00:00
|
|
|
srs_assert(end - p >= size);
|
|
|
|
srs_assert(p + size > buffer);
|
|
|
|
p += 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;
|
|
|
|
|
2015-03-18 08:34:27 +00:00
|
|
|
// already got required size of bytes.
|
2014-12-04 14:10:05 +00:00
|
|
|
if (end - p >= required_size) {
|
2014-03-18 03:32:58 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-12-04 14:10:05 +00:00
|
|
|
// must be positive.
|
|
|
|
srs_assert(required_size > 0);
|
|
|
|
|
2015-03-18 08:34:27 +00:00
|
|
|
// the free space of buffer,
|
|
|
|
// buffer = consumed_bytes + exists_bytes + free_space.
|
2015-03-21 03:55:28 +00:00
|
|
|
int nb_free_space = (int)(buffer + nb_buffer - end);
|
2015-03-18 08:34:27 +00:00
|
|
|
// resize the space when no left space.
|
|
|
|
if (nb_free_space < required_size) {
|
|
|
|
// the bytes already in buffer
|
2015-03-21 03:55:28 +00:00
|
|
|
int nb_exists_bytes = (int)(end - p);
|
2015-03-18 08:34:27 +00:00
|
|
|
srs_assert(nb_exists_bytes >= 0);
|
|
|
|
srs_verbose("move fast buffer %d bytes", nb_exists_bytes);
|
|
|
|
|
2015-03-18 08:50:47 +00:00
|
|
|
// reset or move to get more space.
|
2015-03-18 08:34:27 +00:00
|
|
|
if (!nb_exists_bytes) {
|
|
|
|
// reset when buffer is empty.
|
|
|
|
p = end = buffer;
|
|
|
|
srs_verbose("all consumed, reset fast buffer");
|
|
|
|
} else {
|
|
|
|
// move the left bytes to start of buffer.
|
|
|
|
srs_assert(nb_exists_bytes < nb_buffer);
|
|
|
|
buffer = (char*)memmove(buffer, p, nb_exists_bytes);
|
2014-12-04 10:46:08 +00:00
|
|
|
p = buffer;
|
2015-03-18 08:34:27 +00:00
|
|
|
end = p + nb_exists_bytes;
|
2014-12-04 10:46:08 +00:00
|
|
|
}
|
2015-03-18 08:50:47 +00:00
|
|
|
|
|
|
|
// check whether enough free space in buffer.
|
2015-03-21 03:55:28 +00:00
|
|
|
nb_free_space = (int)(buffer + nb_buffer - end);
|
2015-03-18 08:50:47 +00:00
|
|
|
if (nb_free_space < required_size) {
|
|
|
|
ret = ERROR_READER_BUFFER_OVERFLOW;
|
|
|
|
srs_error("buffer overflow, required=%d, max=%d, left=%d, ret=%d",
|
|
|
|
required_size, nb_buffer, nb_free_space, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
2014-12-04 14:10:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// buffer is ok, read required size of bytes.
|
2014-12-04 05:05:13 +00:00
|
|
|
while (end - p < required_size) {
|
2014-03-18 03:32:58 +00:00
|
|
|
ssize_t nread;
|
2015-03-18 08:34:27 +00:00
|
|
|
if ((ret = reader->read(end, nb_free_space, &nread)) != ERROR_SUCCESS) {
|
2014-12-02 14:26:20 +00:00
|
|
|
return ret;
|
2014-03-18 03:32:58 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 05:43:55 +00:00
|
|
|
#ifdef SRS_PERF_MERGED_READ
|
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.
|
2015-04-29 09:06:32 +00:00
|
|
|
* @see https://github.com/simple-rtmp-server/srs/issues/241
|
2014-12-03 11:27:27 +00:00
|
|
|
*/
|
|
|
|
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-12-04 05:43:55 +00:00
|
|
|
#endif
|
2014-12-03 11:27:27 +00:00
|
|
|
|
2014-12-04 05:05:13 +00:00
|
|
|
// we just move the ptr to next.
|
2014-03-18 03:32:58 +00:00
|
|
|
srs_assert((int)nread > 0);
|
2014-12-04 05:05:13 +00:00
|
|
|
end += nread;
|
2015-03-18 08:34:27 +00:00
|
|
|
nb_free_space -= nread;
|
2014-03-18 03:32:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
2013-11-23 03:36:07 +00:00
|
|
|
}
|
|
|
|
|
2014-12-04 05:43:55 +00:00
|
|
|
#ifdef SRS_PERF_MERGED_READ
|
2014-12-04 07:43:37 +00:00
|
|
|
void SrsFastBuffer::set_merge_read(bool v, IMergeReadHandler* handler)
|
2014-12-03 11:27:27 +00:00
|
|
|
{
|
|
|
|
merged_read = v;
|
|
|
|
_handler = handler;
|
|
|
|
}
|
2014-12-04 05:43:55 +00:00
|
|
|
#endif
|
2014-12-03 11:27:27 +00:00
|
|
|
|