/*
- Copyright (C) 2013 Carl Hetherington <cth@carlh.net>
+ Copyright (C) 2013-2016 Carl Hetherington <cth@carlh.net>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
*/
-#include <libcxml/cxml.h>
-#include <boost/shared_ptr.hpp>
#include "playlist.h"
#include "sndfile_content.h"
#include "sndfile_decoder.h"
#include "ffmpeg_content.h"
#include "image_decoder.h"
#include "content_factory.h"
+#include "dcp_content.h"
#include "job.h"
#include "config.h"
#include "util.h"
#include "md5_digester.h"
+#include <libcxml/cxml.h>
+#include <libxml++/libxml++.h>
+#include <boost/shared_ptr.hpp>
+#include <boost/foreach.hpp>
+#include <iostream>
#include "i18n.h"
using std::min;
using std::max;
using std::string;
-using std::stringstream;
using std::pair;
using boost::optional;
using boost::shared_ptr;
Playlist::content_changed (weak_ptr<Content> content, int property, bool frequent)
{
if (property == ContentProperty::LENGTH || property == VideoContentProperty::VIDEO_FRAME_TYPE) {
+ /* Don't respond to position changes here, as:
+ - sequencing after earlier/later changes is handled by move_earlier/move_later
+ - any other position changes will be timeline drags which should not result in content
+ being sequenced.
+ */
maybe_sequence_video ();
}
-
+
+ if (
+ property == ContentProperty::POSITION ||
+ property == ContentProperty::LENGTH ||
+ property == ContentProperty::TRIM_START ||
+ property == ContentProperty::TRIM_END) {
+
+ ContentList old = _content;
+ sort (_content.begin(), _content.end(), ContentSorter ());
+ if (_content != old) {
+ OrderChanged ();
+ }
+ }
+
ContentChanged (content, property, frequent);
}
if (!_sequence_video || _sequencing_video) {
return;
}
-
+
_sequencing_video = true;
-
- ContentList cl = _content;
+
DCPTime next_left;
DCPTime next_right;
- for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
- shared_ptr<VideoContent> vc = dynamic_pointer_cast<VideoContent> (*i);
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ shared_ptr<VideoContent> vc = dynamic_pointer_cast<VideoContent> (i);
if (!vc) {
continue;
}
-
+
if (vc->video_frame_type() == VIDEO_FRAME_TYPE_3D_RIGHT) {
vc->set_position (next_right);
- next_right = vc->end() + DCPTime::delta ();
+ next_right = vc->end();
} else {
vc->set_position (next_left);
- next_left = vc->end() + DCPTime::delta ();
+ next_left = vc->end();
}
}
/* This won't change order, so it does not need a sort */
-
+
_sequencing_video = false;
}
Playlist::video_identifier () const
{
string t;
-
- for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
- shared_ptr<const VideoContent> vc = dynamic_pointer_cast<const VideoContent> (*i);
+
+ BOOST_FOREACH (shared_ptr<const Content> i, _content) {
+ shared_ptr<const VideoContent> vc = dynamic_pointer_cast<const VideoContent> (i);
+ shared_ptr<const SubtitleContent> sc = dynamic_pointer_cast<const SubtitleContent> (i);
if (vc) {
t += vc->identifier ();
+ } else if (sc && sc->burn_subtitles ()) {
+ t += sc->identifier ();
}
}
void
Playlist::set_from_xml (shared_ptr<const Film> film, cxml::ConstNodePtr node, int version, list<string>& notes)
{
- list<cxml::NodePtr> c = node->node_children ("Content");
- for (list<cxml::NodePtr>::iterator i = c.begin(); i != c.end(); ++i) {
- _content.push_back (content_factory (film, *i, version, notes));
+ BOOST_FOREACH (cxml::NodePtr i, node->node_children ("Content")) {
+ _content.push_back (content_factory (film, i, version, notes));
}
+ /* This shouldn't be necessary but better safe than sorry (there could be old files) */
sort (_content.begin(), _content.end(), ContentSorter ());
reconnect ();
void
Playlist::as_xml (xmlpp::Node* node)
{
- for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
- (*i)->as_xml (node->add_child ("Content"));
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ i->as_xml (node->add_child ("Content"));
}
}
while (i != _content.end() && *i != c) {
++i;
}
-
+
if (i != _content.end ()) {
_content.erase (i);
Changed ();
void
Playlist::remove (ContentList c)
{
- for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
+ BOOST_FOREACH (shared_ptr<Content> i, c) {
ContentList::iterator j = _content.begin ();
- while (j != _content.end() && *j != *i) {
+ while (j != _content.end() && *j != i) {
++j;
}
-
+
if (j != _content.end ()) {
_content.erase (j);
}
}
/* This won't change order, so it does not need a sort */
-
- Changed ();
-}
-
-bool
-Playlist::has_subtitles () const
-{
- for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
- shared_ptr<const FFmpegContent> fc = dynamic_pointer_cast<FFmpegContent> (*i);
- if (fc && !fc->subtitle_streams().empty()) {
- return true;
- }
- }
- return false;
+ Changed ();
}
class FrameRateCandidate
{
list<int> const allowed_dcp_frame_rates = Config::instance()->allowed_dcp_frame_rates ();
- /* Work out what rates we could manage, including those achieved by using skip / repeat. */
+ /* Work out what rates we could manage, including those achieved by using skip / repeat */
list<FrameRateCandidate> candidates;
/* Start with the ones without skip / repeat so they will get matched in preference to skipped/repeated ones */
while (i != candidates.end()) {
float this_error = 0;
- for (ContentList::const_iterator j = _content.begin(); j != _content.end(); ++j) {
- shared_ptr<VideoContent> vc = dynamic_pointer_cast<VideoContent> (*j);
- if (!vc) {
+ BOOST_FOREACH (shared_ptr<Content> j, _content) {
+ shared_ptr<VideoContent> vc = dynamic_pointer_cast<VideoContent> (j);
+ if (!vc || !vc->has_own_video_frame_rate()) {
continue;
}
+ /* Best error for this content; we could use the content as-is or double its rate */
+ float best_error = min (
+ float (fabs (i->source - vc->video_frame_rate ())),
+ float (fabs (i->source - vc->video_frame_rate () * 2))
+ );
+
/* Use the largest difference between DCP and source as the "error" */
- this_error = max (this_error, float (fabs (i->source - vc->video_frame_rate ())));
+ this_error = max (this_error, best_error);
}
if (this_error < error) {
if (!best) {
return 24;
}
-
+
return best->dcp;
}
+/** @return length of the playlist from time 0 to the last thing on the playlist */
DCPTime
Playlist::length () const
{
DCPTime len;
- for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
- len = max (len, (*i)->end() + DCPTime::delta ());
+ BOOST_FOREACH (shared_ptr<const Content> i, _content) {
+ len = max (len, i->end());
}
return len;
}
+/** @return position of the first thing on the playlist, if it's not empty */
+optional<DCPTime>
+Playlist::start () const
+{
+ if (_content.empty ()) {
+ return optional<DCPTime> ();
+ }
+
+ DCPTime start = DCPTime::max ();
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ start = min (start, i->position ());
+ }
+
+ return start;
+}
+
void
Playlist::reconnect ()
{
}
_content_connections.clear ();
-
- for (ContentList::iterator i = _content.begin(); i != _content.end(); ++i) {
- _content_connections.push_back ((*i)->Changed.connect (bind (&Playlist::content_changed, this, _1, _2, _3)));
+
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ _content_connections.push_back (i->Changed.connect (bind (&Playlist::content_changed, this, _1, _2, _3)));
}
}
Playlist::video_end () const
{
DCPTime end;
- for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
- if (dynamic_pointer_cast<const VideoContent> (*i)) {
- end = max (end, (*i)->end ());
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ if (dynamic_pointer_cast<const VideoContent> (i)) {
+ end = max (end, i->end ());
}
}
FrameRateChange
Playlist::active_frame_rate_change (DCPTime t, int dcp_video_frame_rate) const
{
- for (ContentList::const_iterator i = _content.begin(); i != _content.end(); ++i) {
+ for (ContentList::const_reverse_iterator i = _content.rbegin(); i != _content.rend(); ++i) {
shared_ptr<const VideoContent> vc = dynamic_pointer_cast<const VideoContent> (*i);
if (!vc) {
continue;
}
- if (vc->position() >= t && t < vc->end()) {
+ if (vc->position() <= t) {
+ /* This is the first piece of content (going backwards...) that starts before t,
+ so it's the active one.
+ */
return FrameRateChange (vc->video_frame_rate(), dcp_video_frame_rate);
}
}
bool
ContentSorter::operator() (shared_ptr<Content> a, shared_ptr<Content> b)
{
- return a->position() < b->position();
+ if (a->position() != b->position()) {
+ return a->position() < b->position();
+ }
+
+ /* Put video before audio if they start at the same time */
+ if (dynamic_pointer_cast<VideoContent>(a) && !dynamic_pointer_cast<VideoContent>(b)) {
+ return true;
+ } else if (!dynamic_pointer_cast<VideoContent>(a) && dynamic_pointer_cast<VideoContent>(b)) {
+ return false;
+ }
+
+ /* Last resort */
+ return a->digest() < b->digest();
}
-/** @return content in an undefined order */
+/** @return content in ascending order of position */
ContentList
Playlist::content () const
{
Playlist::repeat (ContentList c, int n)
{
pair<DCPTime, DCPTime> range (DCPTime::max (), DCPTime ());
- for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
- range.first = min (range.first, (*i)->position ());
- range.second = max (range.second, (*i)->position ());
- range.first = min (range.first, (*i)->end ());
- range.second = max (range.second, (*i)->end ());
+ BOOST_FOREACH (shared_ptr<Content> i, c) {
+ range.first = min (range.first, i->position ());
+ range.second = max (range.second, i->position ());
+ range.first = min (range.first, i->end ());
+ range.second = max (range.second, i->end ());
}
DCPTime pos = range.second;
for (int i = 0; i < n; ++i) {
- for (ContentList::iterator i = c.begin(); i != c.end(); ++i) {
- shared_ptr<Content> copy = (*i)->clone ();
+ BOOST_FOREACH (shared_ptr<Content> j, c) {
+ shared_ptr<Content> copy = j->clone ();
copy->set_position (pos + copy->position() - range.first);
_content.push_back (copy);
}
}
sort (_content.begin(), _content.end(), ContentSorter ());
-
+
reconnect ();
Changed ();
}
void
Playlist::move_earlier (shared_ptr<Content> c)
{
- sort (_content.begin(), _content.end(), ContentSorter ());
-
ContentList::iterator previous = _content.end ();
ContentList::iterator i = _content.begin();
while (i != _content.end() && *i != c) {
++i;
}
- assert (i != _content.end ());
+ DCPOMATIC_ASSERT (i != _content.end ());
if (previous == _content.end ()) {
return;
}
-
- DCPTime const p = (*previous)->position ();
- (*previous)->set_position (p + c->length_after_trim ());
+
+ shared_ptr<Content> previous_c = *previous;
+
+ DCPTime const p = previous_c->position ();
+ previous_c->set_position (p + c->length_after_trim ());
c->set_position (p);
- sort (_content.begin(), _content.end(), ContentSorter ());
-
- Changed ();
}
void
Playlist::move_later (shared_ptr<Content> c)
{
- sort (_content.begin(), _content.end(), ContentSorter ());
-
ContentList::iterator i = _content.begin();
while (i != _content.end() && *i != c) {
++i;
}
- assert (i != _content.end ());
+ DCPOMATIC_ASSERT (i != _content.end ());
ContentList::iterator next = i;
++next;
return;
}
- DCPTime const p = (*next)->position ();
- (*next)->set_position (c->position ());
- c->set_position (p + c->length_after_trim ());
- sort (_content.begin(), _content.end(), ContentSorter ());
-
- Changed ();
+ shared_ptr<Content> next_c = *next;
+
+ next_c->set_position (c->position ());
+ c->set_position (c->position() + next_c->length_after_trim ());
+}
+
+int64_t
+Playlist::required_disk_space (int j2k_bandwidth, int audio_channels, int audio_frame_rate) const
+{
+ int64_t video = uint64_t (j2k_bandwidth / 8) * length().seconds ();
+ int64_t audio = uint64_t (audio_channels * audio_frame_rate * 3) * length().seconds ();
+
+ BOOST_FOREACH (shared_ptr<Content> i, _content) {
+ shared_ptr<DCPContent> d = dynamic_pointer_cast<DCPContent> (i);
+ if (d) {
+ if (d->reference_video()) {
+ video -= uint64_t (j2k_bandwidth / 8) * d->length_after_trim().seconds();
+ }
+ if (d->reference_audio()) {
+ audio -= uint64_t (audio_channels * audio_frame_rate * 3) * d->length_after_trim().seconds();
+ }
+ }
+ }
+
+ /* Add on 64k for bits and pieces (metadata, subs etc) */
+ return video + audio + 65536;
}