2 Copyright (C) 2013 Carl Hetherington <cth@carlh.net>
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 #include <libcxml/cxml.h>
21 #include <boost/shared_ptr.hpp>
22 #include <boost/lexical_cast.hpp>
24 #include "sndfile_content.h"
25 #include "sndfile_decoder.h"
26 #include "video_content.h"
27 #include "ffmpeg_decoder.h"
28 #include "ffmpeg_content.h"
29 #include "image_decoder.h"
30 #include "content_factory.h"
43 using std::stringstream;
45 using boost::optional;
46 using boost::shared_ptr;
47 using boost::weak_ptr;
48 using boost::dynamic_pointer_cast;
49 using boost::lexical_cast;
52 : _sequence_video (true)
53 , _sequencing_video (false)
58 Playlist::~Playlist ()
65 Playlist::content_changed (weak_ptr<Content> content, int property, bool frequent)
67 if (property == ContentProperty::LENGTH) {
68 maybe_sequence_video ();
71 ContentChanged (content, property, frequent);
75 Playlist::maybe_sequence_video ()
77 if (!_sequence_video || _sequencing_video) {
81 _sequencing_video = true;
83 ContentList cl = _content;
85 for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
86 if (!dynamic_pointer_cast<VideoContent> (*i)) {
90 (*i)->set_position (next);
91 next = (*i)->end() + 1;
94 /* This won't change order, so it does not need a sort */
96 _sequencing_video = false;
100 Playlist::video_identifier () const
104 for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
105 shared_ptr<const VideoContent> vc = dynamic_pointer_cast<const VideoContent> (*i);
107 t += vc->identifier ();
111 return md5_digest (t.c_str(), t.length());
114 /** @param node <Playlist> node */
116 Playlist::set_from_xml (shared_ptr<const Film> film, shared_ptr<const cxml::Node> node, int version)
118 list<cxml::NodePtr> c = node->node_children ("Content");
119 for (list<cxml::NodePtr>::iterator i = c.begin(); i != c.end(); ++i) {
120 _content.push_back (content_factory (film, *i, version));
123 sort (_content.begin(), _content.end(), ContentSorter ());
128 /** @param node <Playlist> node */
130 Playlist::as_xml (xmlpp::Node* node)
132 for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
133 (*i)->as_xml (node->add_child ("Content"));
138 Playlist::add (shared_ptr<Content> c)
140 _content.push_back (c);
141 sort (_content.begin(), _content.end(), ContentSorter ());
147 Playlist::remove (shared_ptr<Content> c)
149 ContentList::iterator i = _content.begin ();
150 while (i != _content.end() && *i != c) {
154 if (i != _content.end ()) {
159 /* This won't change order, so it does not need a sort */
163 Playlist::remove (ContentList c)
165 for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
166 ContentList::iterator j = _content.begin ();
167 while (j != _content.end() && *j != *i) {
171 if (j != _content.end ()) {
176 /* This won't change order, so it does not need a sort */
182 Playlist::has_subtitles () const
184 for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
185 shared_ptr<const FFmpegContent> fc = dynamic_pointer_cast<FFmpegContent> (*i);
186 if (fc && !fc->subtitle_streams().empty()) {
194 class FrameRateCandidate
197 FrameRateCandidate (float source_, int dcp_)
207 Playlist::best_dcp_frame_rate () const
209 list<int> const allowed_dcp_frame_rates = Config::instance()->allowed_dcp_frame_rates ();
211 /* Work out what rates we could manage, including those achieved by using skip / repeat. */
212 list<FrameRateCandidate> candidates;
214 /* Start with the ones without skip / repeat so they will get matched in preference to skipped/repeated ones */
215 for (list<int>::const_iterator i = allowed_dcp_frame_rates.begin(); i != allowed_dcp_frame_rates.end(); ++i) {
216 candidates.push_back (FrameRateCandidate (*i, *i));
219 /* Then the skip/repeat ones */
220 for (list<int>::const_iterator i = allowed_dcp_frame_rates.begin(); i != allowed_dcp_frame_rates.end(); ++i) {
221 candidates.push_back (FrameRateCandidate (float (*i) / 2, *i));
222 candidates.push_back (FrameRateCandidate (float (*i) * 2, *i));
225 /* Pick the best one */
226 float error = std::numeric_limits<float>::max ();
227 optional<FrameRateCandidate> best;
228 list<FrameRateCandidate>::iterator i = candidates.begin();
229 while (i != candidates.end()) {
231 float this_error = 0;
232 for (ContentList::const_iterator j = _content.begin(); j != _content.end(); ++j) {
233 shared_ptr<VideoContent> vc = dynamic_pointer_cast<VideoContent> (*j);
238 /* Use the largest difference between DCP and source as the "error" */
239 this_error = max (this_error, float (fabs (i->source - vc->video_frame_rate ())));
242 if (this_error < error) {
258 Playlist::length () const
261 for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
262 len = max (len, (*i)->end() + 1);
269 Playlist::reconnect ()
271 for (list<boost::signals2::connection>::iterator i = _content_connections.begin(); i != _content_connections.end(); ++i) {
275 _content_connections.clear ();
277 for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
278 _content_connections.push_back ((*i)->Changed.connect (bind (&Playlist::content_changed, this, _1, _2, _3)));
283 Playlist::video_end () const
286 for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
287 if (dynamic_pointer_cast<const VideoContent> (*i)) {
288 end = max (end, (*i)->end ());
296 Playlist::set_sequence_video (bool s)
302 ContentSorter::operator() (shared_ptr<Content> a, shared_ptr<Content> b)
304 return a->position() < b->position();
307 /** @return content in an undefined order */
309 Playlist::content () const
315 Playlist::repeat (ContentList c, int n)
317 pair<Time, Time> range (TIME_MAX, 0);
318 for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
319 range.first = min (range.first, (*i)->position ());
320 range.second = max (range.second, (*i)->position ());
321 range.first = min (range.first, (*i)->end ());
322 range.second = max (range.second, (*i)->end ());
325 Time pos = range.second;
326 for (int i = 0; i < n; ++i) {
327 for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
328 shared_ptr<Content> copy = (*i)->clone ();
329 copy->set_position (pos + copy->position() - range.first);
330 _content.push_back (copy);
332 pos += range.second - range.first;
335 sort (_content.begin(), _content.end(), ContentSorter ());
342 Playlist::move_earlier (shared_ptr<Content> c)
344 sort (_content.begin(), _content.end(), ContentSorter ());
346 ContentList::iterator previous = _content.end ();
347 ContentList::iterator i = _content.begin();
348 while (i != _content.end() && *i != c) {
353 assert (i != _content.end ());
354 if (previous == _content.end ()) {
358 Time const p = (*previous)->position ();
359 (*previous)->set_position (p + c->length_after_trim ());
361 sort (_content.begin(), _content.end(), ContentSorter ());
367 Playlist::move_later (shared_ptr<Content> c)
369 sort (_content.begin(), _content.end(), ContentSorter ());
371 ContentList::iterator i = _content.begin();
372 while (i != _content.end() && *i != c) {
376 assert (i != _content.end ());
378 ContentList::iterator next = i;
381 if (next == _content.end ()) {
385 Time const p = (*next)->position ();
386 (*next)->set_position (c->position ());
387 c->set_position (p + c->length_after_trim ());
388 sort (_content.begin(), _content.end(), ContentSorter ());