2 Copyright (C) 2013-2018 Carl Hetherington <cth@carlh.net>
4 This file is part of DCP-o-matic.
6 DCP-o-matic is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 DCP-o-matic is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with DCP-o-matic. If not, see <http://www.gnu.org/licenses/>.
22 #include "video_content.h"
23 #include "text_content.h"
24 #include "ffmpeg_decoder.h"
25 #include "ffmpeg_content.h"
26 #include "image_decoder.h"
27 #include "audio_content.h"
28 #include "content_factory.h"
29 #include "dcp_content.h"
34 #include <libcxml/cxml.h>
35 #include <libxml++/libxml++.h>
36 #include <boost/shared_ptr.hpp>
37 #include <boost/foreach.hpp>
49 using boost::optional;
50 using boost::shared_ptr;
51 using boost::weak_ptr;
52 using boost::dynamic_pointer_cast;
61 Playlist::~Playlist ()
68 Playlist::content_changed (weak_ptr<Content> content, int property, bool frequent)
71 property == ContentProperty::TRIM_START ||
72 property == ContentProperty::TRIM_END ||
73 property == ContentProperty::LENGTH ||
74 property == VideoContentProperty::FRAME_TYPE
76 /* Don't respond to position changes here, as:
77 - sequencing after earlier/later changes is handled by move_earlier/move_later
78 - any other position changes will be timeline drags which should not result in content
85 property == ContentProperty::POSITION ||
86 property == ContentProperty::LENGTH ||
87 property == ContentProperty::TRIM_START ||
88 property == ContentProperty::TRIM_END) {
90 ContentList old = _content;
91 sort (_content.begin(), _content.end(), ContentSorter ());
92 if (_content != old) {
97 ContentChanged (content, property, frequent);
101 Playlist::maybe_sequence ()
103 if (!_sequence || _sequencing) {
109 /* Keep track of the content that we've set the position of so that we don't
118 BOOST_FOREACH (shared_ptr<Content> i, _content) {
123 if (i->video->frame_type() == VIDEO_FRAME_TYPE_3D_RIGHT) {
124 i->set_position (next_right);
125 next_right = i->end();
127 i->set_position (next_left);
128 next_left = i->end();
131 placed.push_back (i);
137 BOOST_FOREACH (shared_ptr<Content> i, _content) {
138 if (i->text.empty() || find (placed.begin(), placed.end(), i) != placed.end()) {
142 i->set_position (next);
147 /* This won't change order, so it does not need a sort */
153 Playlist::video_identifier () const
157 BOOST_FOREACH (shared_ptr<const Content> i, _content) {
159 BOOST_FOREACH (shared_ptr<TextContent> j, i->text) {
164 if (i->video || burn) {
165 t += i->identifier ();
170 digester.add (t.c_str(), t.length());
171 return digester.get ();
174 /** @param film Film that this Playlist is for.
175 * @param node <Playlist> node.
176 * @param version Metadata version number.
177 * @param notes Output notes about that happened.
180 Playlist::set_from_xml (shared_ptr<const Film> film, cxml::ConstNodePtr node, int version, list<string>& notes)
182 BOOST_FOREACH (cxml::NodePtr i, node->node_children ("Content")) {
183 _content.push_back (content_factory (film, i, version, notes));
186 /* This shouldn't be necessary but better safe than sorry (there could be old files) */
187 sort (_content.begin(), _content.end(), ContentSorter ());
192 /** @param node <Playlist> node.
193 * @param with_content_paths true to include <Path> nodes in <Content> nodes, false to omit them.
196 Playlist::as_xml (xmlpp::Node* node, bool with_content_paths)
198 BOOST_FOREACH (shared_ptr<Content> i, _content) {
199 i->as_xml (node->add_child ("Content"), with_content_paths);
204 Playlist::add (shared_ptr<Content> c)
206 _content.push_back (c);
207 sort (_content.begin(), _content.end(), ContentSorter ());
213 Playlist::remove (shared_ptr<Content> c)
215 ContentList::iterator i = _content.begin ();
216 while (i != _content.end() && *i != c) {
220 if (i != _content.end ()) {
225 /* This won't change order, so it does not need a sort */
229 Playlist::remove (ContentList c)
231 BOOST_FOREACH (shared_ptr<Content> i, c) {
232 ContentList::iterator j = _content.begin ();
233 while (j != _content.end() && *j != i) {
237 if (j != _content.end ()) {
242 /* This won't change order, so it does not need a sort */
247 class FrameRateCandidate
250 FrameRateCandidate (float source_, int dcp_)
260 Playlist::best_video_frame_rate () const
262 list<int> const allowed_dcp_frame_rates = Config::instance()->allowed_dcp_frame_rates ();
264 /* Work out what rates we could manage, including those achieved by using skip / repeat */
265 list<FrameRateCandidate> candidates;
267 /* Start with the ones without skip / repeat so they will get matched in preference to skipped/repeated ones */
268 for (list<int>::const_iterator i = allowed_dcp_frame_rates.begin(); i != allowed_dcp_frame_rates.end(); ++i) {
269 candidates.push_back (FrameRateCandidate (*i, *i));
272 /* Then the skip/repeat ones */
273 for (list<int>::const_iterator i = allowed_dcp_frame_rates.begin(); i != allowed_dcp_frame_rates.end(); ++i) {
274 candidates.push_back (FrameRateCandidate (float (*i) / 2, *i));
275 candidates.push_back (FrameRateCandidate (float (*i) * 2, *i));
278 /* Pick the best one */
279 float error = std::numeric_limits<float>::max ();
280 optional<FrameRateCandidate> best;
281 list<FrameRateCandidate>::iterator i = candidates.begin();
282 while (i != candidates.end()) {
284 float this_error = 0;
285 BOOST_FOREACH (shared_ptr<Content> j, _content) {
286 if (!j->video || !j->video_frame_rate()) {
290 /* Best error for this content; we could use the content as-is or double its rate */
291 float best_error = min (
292 float (fabs (i->source - j->video_frame_rate().get())),
293 float (fabs (i->source - j->video_frame_rate().get() * 2))
296 /* Use the largest difference between DCP and source as the "error" */
297 this_error = max (this_error, best_error);
300 if (this_error < error) {
315 /** @return length of the playlist from time 0 to the last thing on the playlist */
317 Playlist::length () const
320 BOOST_FOREACH (shared_ptr<const Content> i, _content) {
321 len = max (len, i->end());
327 /** @return position of the first thing on the playlist, if it's not empty */
329 Playlist::start () const
331 if (_content.empty ()) {
332 return optional<DCPTime> ();
335 DCPTime start = DCPTime::max ();
336 BOOST_FOREACH (shared_ptr<Content> i, _content) {
337 start = min (start, i->position ());
344 Playlist::reconnect ()
346 for (list<boost::signals2::connection>::iterator i = _content_connections.begin(); i != _content_connections.end(); ++i) {
350 _content_connections.clear ();
352 BOOST_FOREACH (shared_ptr<Content> i, _content) {
353 _content_connections.push_back (i->Changed.connect (bind (&Playlist::content_changed, this, _1, _2, _3)));
358 Playlist::video_end () const
361 BOOST_FOREACH (shared_ptr<Content> i, _content) {
363 end = max (end, i->end ());
371 Playlist::text_end () const
374 BOOST_FOREACH (shared_ptr<Content> i, _content) {
375 if (!i->text.empty ()) {
376 end = max (end, i->end ());
384 Playlist::active_frame_rate_change (DCPTime t, int dcp_video_frame_rate) const
386 for (ContentList::const_reverse_iterator i = _content.rbegin(); i != _content.rend(); ++i) {
391 if ((*i)->position() <= t) {
392 /* This is the first piece of content (going backwards...) that starts before t,
393 so it's the active one.
395 if ((*i)->video_frame_rate ()) {
396 /* This content specified a rate, so use it */
397 return FrameRateChange ((*i)->video_frame_rate().get(), dcp_video_frame_rate);
399 /* No specified rate so just use the DCP one */
400 return FrameRateChange (dcp_video_frame_rate, dcp_video_frame_rate);
405 return FrameRateChange (dcp_video_frame_rate, dcp_video_frame_rate);
409 Playlist::set_sequence (bool s)
415 ContentSorter::operator() (shared_ptr<Content> a, shared_ptr<Content> b)
417 if (a->position() != b->position()) {
418 return a->position() < b->position();
421 /* Put video before audio if they start at the same time */
422 if (a->video && !b->video) {
424 } else if (!a->video && b->video) {
429 return a->digest() < b->digest();
432 /** @return content in ascending order of position */
434 Playlist::content () const
440 Playlist::repeat (ContentList c, int n)
442 pair<DCPTime, DCPTime> range (DCPTime::max (), DCPTime ());
443 BOOST_FOREACH (shared_ptr<Content> i, c) {
444 range.first = min (range.first, i->position ());
445 range.second = max (range.second, i->position ());
446 range.first = min (range.first, i->end ());
447 range.second = max (range.second, i->end ());
450 DCPTime pos = range.second;
451 for (int i = 0; i < n; ++i) {
452 BOOST_FOREACH (shared_ptr<Content> j, c) {
453 shared_ptr<Content> copy = j->clone ();
454 copy->set_position (pos + copy->position() - range.first);
455 _content.push_back (copy);
457 pos += range.second - range.first;
460 sort (_content.begin(), _content.end(), ContentSorter ());
467 Playlist::move_earlier (shared_ptr<Content> c)
469 ContentList::iterator previous = _content.end ();
470 ContentList::iterator i = _content.begin();
471 while (i != _content.end() && *i != c) {
476 DCPOMATIC_ASSERT (i != _content.end ());
477 if (previous == _content.end ()) {
481 shared_ptr<Content> previous_c = *previous;
483 DCPTime const p = previous_c->position ();
484 previous_c->set_position (p + c->length_after_trim ());
489 Playlist::move_later (shared_ptr<Content> c)
491 ContentList::iterator i = _content.begin();
492 while (i != _content.end() && *i != c) {
496 DCPOMATIC_ASSERT (i != _content.end ());
498 ContentList::iterator next = i;
501 if (next == _content.end ()) {
505 shared_ptr<Content> next_c = *next;
507 next_c->set_position (c->position ());
508 c->set_position (c->position() + next_c->length_after_trim ());
512 Playlist::required_disk_space (int j2k_bandwidth, int audio_channels, int audio_frame_rate) const
514 int64_t video = uint64_t (j2k_bandwidth / 8) * length().seconds ();
515 int64_t audio = uint64_t (audio_channels * audio_frame_rate * 3) * length().seconds ();
517 BOOST_FOREACH (shared_ptr<Content> i, _content) {
518 shared_ptr<DCPContent> d = dynamic_pointer_cast<DCPContent> (i);
520 if (d->reference_video()) {
521 video -= uint64_t (j2k_bandwidth / 8) * d->length_after_trim().seconds();
523 if (d->reference_audio()) {
524 audio -= uint64_t (audio_channels * audio_frame_rate * 3) * d->length_after_trim().seconds();
529 /* Add on 64k for bits and pieces (metadata, subs etc) */
530 return video + audio + 65536;
534 Playlist::content_summary (DCPTimePeriod period) const
538 BOOST_FOREACH (shared_ptr<Content> i, _content) {
540 optional<DCPTimePeriod> const o = DCPTimePeriod(i->position(), i->end()).overlap (period);
542 score += 100 * o.get().duration().get() / period.duration().get();
549 if (score > best_score) {
550 best_summary = i->path(0).leaf().string();
559 Playlist::speed_up_range (int dcp_video_frame_rate) const
561 pair<double, double> range (DBL_MAX, -DBL_MAX);
563 BOOST_FOREACH (shared_ptr<Content> i, _content) {
567 if (i->video_frame_rate()) {
568 FrameRateChange const frc (i->video_frame_rate().get(), dcp_video_frame_rate);
569 range.first = min (range.first, frc.speed_up);
570 range.second = max (range.second, frc.speed_up);
572 FrameRateChange const frc (dcp_video_frame_rate, dcp_video_frame_rate);
573 range.first = min (range.first, frc.speed_up);
574 range.second = max (range.second, frc.speed_up);