}
case Client::WAITING_FOR_KEYFRAME: {
Stream *stream = client->stream;
- if (ssize_t(client->stream_pos) > stream->last_suitable_starting_point) {
+ if (stream->suitable_starting_points.empty() ||
+ client->stream_pos > stream->suitable_starting_points.back()) {
// We haven't received a keyframe since this stream started waiting,
// so keep on waiting for one.
// This is postcondition #3.
stream->put_client_to_sleep(client);
return;
}
- client->stream_pos = stream->last_suitable_starting_point;
+ client->stream_pos = stream->suitable_starting_points.back();
client->state = Client::PREBUFFERING;
// Fall through.
}
#include <sys/types.h>
#include <algorithm>
#include <string>
+#include <queue>
#include <vector>
#include "log.h"
backlog_size(backlog_size),
prebuffering_bytes(prebuffering_bytes),
bytes_received(0),
- last_suitable_starting_point(-1),
pacing_rate(~0U)
{
if (data_fd == -1) {
exit(1);
}
- assert(serialized.has_last_suitable_starting_point());
- last_suitable_starting_point = serialized.last_suitable_starting_point();
+ for (int i = 0; i < serialized.suitable_starting_point_size(); ++i) {
+ ssize_t point = serialized.suitable_starting_point(i);
+ if (point == -1) {
+ // Can happen when upgrading from before 1.1.3,
+ // where this was an optional field with -1 signifying
+ // "no such point".
+ continue;
+ }
+ suitable_starting_points.push_back(point);
+ }
pthread_mutex_init(&queued_data_mutex, NULL);
}
serialized.set_backlog_size(backlog_size);
serialized.set_prebuffering_bytes(prebuffering_bytes);
serialized.set_bytes_received(bytes_received);
- serialized.set_last_suitable_starting_point(last_suitable_starting_point);
+ for (size_t i = 0; i < suitable_starting_points.size(); ++i) {
+ serialized.add_suitable_starting_point(suitable_starting_points[i]);
+ }
serialized.set_url(url);
data_fd = -1;
return serialized;
vector<DataElement> data_elements;
data_elements.push_back(data_element);
add_data_raw(data_elements);
+ remove_obsolete_starting_points();
}
void Stream::put_client_to_sleep(Client *client)
}
}
+void Stream::remove_obsolete_starting_points()
+{
+ // We could do a binary search here (std::lower_bound), but it seems
+ // overkill for removing what's probably only a few points.
+ while (!suitable_starting_points.empty() &&
+ bytes_received - suitable_starting_points[0] > backlog_size) {
+ suitable_starting_points.pop_front();
+ }
+}
+
void Stream::add_data_deferred(const char *data, size_t bytes, StreamStartSuitability suitable_for_stream_start)
{
MutexLock lock(&queued_data_mutex);
swap(queued_data, queued_data_copy);
}
- // Update the last suitable starting point for the stream,
- // if the queued data contains such a starting point.
+ // Add suitable starting points for the stream, if the queued data
+ // contains such starting points. Note that we drop starting points
+ // if they're less than 10 kB apart, so that we don't get a huge
+ // amount of them for e.g. each and every MPEG-TS 188-byte cell.
+ // The 10 kB value is somewhat arbitrary, but at least it should make
+ // the RAM cost of saving the position ~0.1% (or less) of the actual
+ // data, and 10 kB is a very fine granularity in most streams.
+ static const int minimum_start_point_distance = 10240;
size_t byte_position = bytes_received;
for (size_t i = 0; i < queued_data_copy.size(); ++i) {
if (queued_data_copy[i].suitable_for_stream_start == SUITABLE_FOR_STREAM_START) {
- last_suitable_starting_point = byte_position;
+ size_t num_points = suitable_starting_points.size();
+ if (num_points >= 2 &&
+ suitable_starting_points[num_points - 1] - suitable_starting_points[num_points - 2] < minimum_start_point_distance) {
+ // p[n-1] - p[n-2] < 10 kB, so drop p[n-1].
+ suitable_starting_points.pop_back();
+ }
+ suitable_starting_points.push_back(byte_position);
}
byte_position += queued_data_copy[i].data.iov_len;
}
add_data_raw(queued_data_copy);
+ remove_obsolete_starting_points();
for (size_t i = 0; i < queued_data_copy.size(); ++i) {
char *data = reinterpret_cast<char *>(queued_data_copy[i].data.iov_base);
delete[] data;
#include <stdint.h>
#include <sys/types.h>
#include <sys/uio.h>
+#include <deque>
#include <string>
#include <vector>
// than <backlog_size>, since the buffer wraps.
size_t bytes_received;
- // The last point in the stream that is suitable to start new clients at
- // (after having sent the header). -1 if no such point exists yet.
- ssize_t last_suitable_starting_point;
+ // A list of points in the stream that is suitable to start new clients at
+ // (after having sent the header). Empty if no such point exists yet.
+ std::deque<size_t> suitable_starting_points;
// Clients that are in SENDING_DATA, but that we don't listen on,
// because we currently don't have any data for them.
// Adds data directly to the stream file descriptor, without adding headers or
// going through <queued_data>.
- // You should hold the owning Server's <mutex>.
+ // You should hold the owning Server's <mutex>, and probably call
+ // remove_obsolete_starting_points() afterwards.
void add_data_raw(const std::vector<DataElement> &data);
+
+ // Remove points from <suitable_starting_points> that are no longer
+ // in the backlog.
+ // You should hold the owning Server's <mutex>.
+ void remove_obsolete_starting_points();
};
#endif // !defined(_STREAM_H)