ardour/livetrax
13
0
Fork 0
Code
9ec3728796
livetrax/libs/ardour/playlist.cc

2392 lines
52 KiB
C++
Raw Blame History

/*
Copyright (C) 2000-2003 Paul Davis
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
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <set>
#include <fstream>
#include <algorithm>
#include <unistd.h>
#include <cerrno>
#include <string>
#include <climits>
#include <sigc++/bind.h>
#include "pbd/failed_constructor.h"
#include "pbd/stl_delete.h"
#include "pbd/xml++.h"
#include "pbd/stacktrace.h"
#include "ardour/playlist.h"
#include "ardour/session.h"
#include "ardour/region.h"
#include "ardour/region_factory.h"
#include "ardour/playlist_factory.h"
#include "ardour/transient_detector.h"
#include "i18n.h"
using namespace std;
using namespace ARDOUR;
using namespace PBD;
struct ShowMeTheList {
ShowMeTheList (boost::shared_ptr<Playlist> pl, const string& n) : playlist (pl), name (n) {}
~ShowMeTheList () {
cerr << ">>>>" << name << endl; playlist->dump(); cerr << "<<<<" << name << endl << endl;
};
boost::shared_ptr<Playlist> playlist;
string name;
};
struct RegionSortByLayer {
bool operator() (boost::shared_ptr<Region> a, boost::shared_ptr<Region> b) {
return a->layer() < b->layer();
}
};
struct RegionSortByPosition {
bool operator() (boost::shared_ptr<Region> a, boost::shared_ptr<Region> b) {
return a->position() < b->position();
}
};
struct RegionSortByLastLayerOp {
bool operator() (boost::shared_ptr<Region> a, boost::shared_ptr<Region> b) {
return a->last_layer_op() < b->last_layer_op();
}
};
Playlist::Playlist (Session& sess, string nom, DataType type, bool hide)
: SessionObject(sess, nom)
, _type(type)
{
init (hide);
first_set_state = false;
_name = nom;
}
Playlist::Playlist (Session& sess, const XMLNode& node, DataType type, bool hide)
: SessionObject(sess, "unnamed playlist")
, _type(type)
{
const XMLProperty* prop = node.property("type");
assert(!prop || DataType(prop->value()) == _type);
init (hide);
_name = "unnamed"; /* reset by set_state */
/* set state called by derived class */
}
Playlist::Playlist (boost::shared_ptr<const Playlist> other, string namestr, bool hide)
: SessionObject(other->_session, namestr), _type(other->_type), _orig_diskstream_id(other->_orig_diskstream_id)
{
init (hide);
RegionList tmp;
other->copy_regions (tmp);
in_set_state++;
for (list<boost::shared_ptr<Region> >::iterator x = tmp.begin(); x != tmp.end(); ++x) {
add_region_internal( (*x), (*x)->position());
}
in_set_state--;
_splicing = other->_splicing;
_nudging = other->_nudging;
_edit_mode = other->_edit_mode;
in_set_state = 0;
first_set_state = false;
in_flush = false;
in_partition = false;
subcnt = 0;
_read_data_count = 0;
_frozen = other->_frozen;
layer_op_counter = other->layer_op_counter;
freeze_length = other->freeze_length;
}
Playlist::Playlist (boost::shared_ptr<const Playlist> other, nframes_t start, nframes_t cnt, string str, bool hide)
: SessionObject(other->_session, str), _type(other->_type), _orig_diskstream_id(other->_orig_diskstream_id)
{
RegionLock rlock2 (const_cast<Playlist*> (other.get()));
nframes_t end = start + cnt - 1;
init (hide);
in_set_state++;
for (RegionList::const_iterator i = other->regions.begin(); i != other->regions.end(); i++) {
boost::shared_ptr<Region> region;
boost::shared_ptr<Region> new_region;
nframes_t offset = 0;
nframes_t position = 0;
nframes_t len = 0;
string new_name;
OverlapType overlap;
region = *i;
overlap = region->coverage (start, end);
switch (overlap) {
case OverlapNone:
continue;
case OverlapInternal:
offset = start - region->position();
position = 0;
len = cnt;
break;
case OverlapStart:
offset = 0;
position = region->position() - start;
len = end - region->position();
break;
case OverlapEnd:
offset = start - region->position();
position = 0;
len = region->length() - offset;
break;
case OverlapExternal:
offset = 0;
position = region->position() - start;
len = region->length();
break;
}
_session.region_name (new_name, region->name(), false);
new_region = RegionFactory::RegionFactory::create (region, offset, len, new_name, region->layer(), region->flags());
add_region_internal (new_region, position);
}
in_set_state--;
first_set_state = false;
/* this constructor does NOT notify others (session) */
}
void
Playlist::use ()
{
++_refcnt;
InUse (true); /* EMIT SIGNAL */
}
void
Playlist::release ()
{
if (_refcnt > 0) {
_refcnt--;
}
if (_refcnt == 0) {
InUse (false); /* EMIT SIGNAL */
}
}
void
Playlist::copy_regions (RegionList& newlist) const
{
RegionLock rlock (const_cast<Playlist *> (this));
for (RegionList::const_iterator i = regions.begin(); i != regions.end(); ++i) {
newlist.push_back (RegionFactory::RegionFactory::create (*i));
}
}
void
Playlist::init (bool hide)
{
g_atomic_int_set (&block_notifications, 0);
g_atomic_int_set (&ignore_state_changes, 0);
pending_modified = false;
pending_length = false;
first_set_state = true;
_refcnt = 0;
_hidden = hide;
_splicing = false;
_shuffling = false;
_nudging = false;
in_set_state = 0;
_edit_mode = Config->get_edit_mode();
in_flush = false;
in_partition = false;
subcnt = 0;
_read_data_count = 0;
_frozen = false;
layer_op_counter = 0;
freeze_length = 0;
Modified.connect (mem_fun (*this, &Playlist::mark_session_dirty));
}
Playlist::~Playlist ()
{
{
RegionLock rl (this);
for (set<boost::shared_ptr<Region> >::iterator i = all_regions.begin(); i != all_regions.end(); ++i) {
(*i)->set_playlist (boost::shared_ptr<Playlist>());
}
}
/* GoingAway must be emitted by derived classes */
}
bool
Playlist::set_name (const string& str)
{
/* in a typical situation, a playlist is being used
by one diskstream and also is referenced by the
Session. if there are more references than that,
then don't change the name.
*/
if (_refcnt > 2) {
return false;
} else {
return SessionObject::set_name(str);
}
}
/***********************************************************************
CHANGE NOTIFICATION HANDLING
Notifications must be delayed till the region_lock is released. This
is necessary because handlers for the signals may need to acquire
the lock (e.g. to read from the playlist).
***********************************************************************/
void
Playlist::freeze ()
{
delay_notifications ();
g_atomic_int_inc (&ignore_state_changes);
}
void
Playlist::thaw ()
{
g_atomic_int_dec_and_test (&ignore_state_changes);
release_notifications ();
}
void
Playlist::delay_notifications ()
{
g_atomic_int_inc (&block_notifications);
freeze_length = _get_maximum_extent();
}
void
Playlist::release_notifications ()
{
if (g_atomic_int_dec_and_test (&block_notifications)) {
flush_notifications ();
}
}
void
Playlist::notify_modified ()
{
if (holding_state ()) {
pending_modified = true;
} else {
pending_modified = false;
Modified(); /* EMIT SIGNAL */
}
}
void
Playlist::notify_region_removed (boost::shared_ptr<Region> r)
{
if (holding_state ()) {
pending_removes.insert (r);
pending_modified = true;
pending_length = true;
} else {
/* this might not be true, but we have to act
as though it could be.
*/
pending_length = false;
LengthChanged (); /* EMIT SIGNAL */
pending_modified = false;
Modified (); /* EMIT SIGNAL */
}
}
void
Playlist::notify_region_moved (boost::shared_ptr<Region> r)
{
Evoral::RangeMove<nframes_t> const move (r->last_position (), r->length (), r->position ());
if (holding_state ()) {
pending_range_moves.push_back (move);
} else {
list< Evoral::RangeMove<nframes_t> > m;
m.push_back (move);
RangesMoved (m);
}
}
void
Playlist::notify_region_added (boost::shared_ptr<Region> r)
{
/* the length change might not be true, but we have to act
as though it could be.
*/
if (holding_state()) {
pending_adds.insert (r);
pending_modified = true;
pending_length = true;
} else {
pending_length = false;
LengthChanged (); /* EMIT SIGNAL */
pending_modified = false;
Modified (); /* EMIT SIGNAL */
}
}
void
Playlist::notify_length_changed ()
{
if (holding_state ()) {
pending_length = true;
} else {
pending_length = false;
LengthChanged(); /* EMIT SIGNAL */
pending_modified = false;
Modified (); /* EMIT SIGNAL */
}
}
void
Playlist::flush_notifications ()
{
set<boost::shared_ptr<Region> > dependent_checks_needed;
set<boost::shared_ptr<Region> >::iterator s;
uint32_t n = 0;
if (in_flush) {
return;
}
in_flush = true;
/* we have no idea what order the regions ended up in pending
bounds (it could be based on selection order, for example).
so, to preserve layering in the "most recently moved is higher"
model, sort them by existing layer, then timestamp them.
*/
// RegionSortByLayer cmp;
// pending_bounds.sort (cmp);
for (RegionList::iterator r = pending_bounds.begin(); r != pending_bounds.end(); ++r) {
if (Config->get_layer_model() == MoveAddHigher) {
timestamp_layer_op (*r);
}
pending_length = true;
dependent_checks_needed.insert (*r);
n++;
}
for (s = pending_adds.begin(); s != pending_adds.end(); ++s) {
dependent_checks_needed.insert (*s);
n++;
}
for (s = pending_removes.begin(); s != pending_removes.end(); ++s) {
remove_dependents (*s);
n++;
}
if ((freeze_length != _get_maximum_extent()) || pending_length) {
pending_length = 0;
LengthChanged(); /* EMIT SIGNAL */
n++;
}
if (n || pending_modified) {
if (!in_set_state) {
relayer ();
}
pending_modified = false;
Modified (); /* EMIT SIGNAL */
}
for (s = dependent_checks_needed.begin(); s != dependent_checks_needed.end(); ++s) {
check_dependents (*s, false);
}
if (!pending_range_moves.empty ()) {
RangesMoved (pending_range_moves);
}
pending_adds.clear ();
pending_removes.clear ();
pending_bounds.clear ();
pending_range_moves.clear ();
in_flush = false;
}
/*************************************************************
PLAYLIST OPERATIONS
*************************************************************/
void
Playlist::add_region (boost::shared_ptr<Region> region, nframes_t position, float times, bool auto_partition)
{
RegionLock rlock (this);
times = fabs (times);
int itimes = (int) floor (times);
nframes_t pos = position;
if(times == 1 && auto_partition){
partition(pos, (nframes_t) (pos + region->length()), true);
}
if (itimes >= 1) {
add_region_internal (region, pos);
pos += region->length();
--itimes;
}
/* note that itimes can be zero if we being asked to just
insert a single fraction of the region.
*/
for (int i = 0; i < itimes; ++i) {
boost::shared_ptr<Region> copy = RegionFactory::create (region);
add_region_internal (copy, pos);
pos += region->length();
}
nframes_t length = 0;
if (floor (times) != times) {
length = (nframes_t) floor (region->length() * (times - floor (times)));
string name;
_session.region_name (name, region->name(), false);
boost::shared_ptr<Region> sub = RegionFactory::create (region, 0, length, name, region->layer(), region->flags());
add_region_internal (sub, pos);
}
possibly_splice_unlocked (position, (pos + length) - position, boost::shared_ptr<Region>());
}
void
Playlist::set_region_ownership ()
{
RegionLock rl (this);
RegionList::iterator i;
boost::weak_ptr<Playlist> pl (shared_from_this());
for (i = regions.begin(); i != regions.end(); ++i) {
(*i)->set_playlist (pl);
}
}
bool
Playlist::add_region_internal (boost::shared_ptr<Region> region, nframes_t position)
{
if (region->data_type() != _type){
return false;
}
RegionSortByPosition cmp;
nframes_t old_length = 0;
if (!holding_state()) {
old_length = _get_maximum_extent();
}
if (!first_set_state) {
boost::shared_ptr<Playlist> foo (shared_from_this());
region->set_playlist (boost::weak_ptr<Playlist>(foo));
}
region->set_position (position, this);
timestamp_layer_op (region);
regions.insert (upper_bound (regions.begin(), regions.end(), region, cmp), region);
all_regions.insert (region);
possibly_splice_unlocked (position, region->length(), region);
if (!holding_state () && !in_set_state) {
/* layers get assigned from XML state */
relayer ();
}
/* we need to notify the existence of new region before checking dependents. Ick. */
notify_region_added (region);
if (!holding_state ()) {
check_dependents (region, false);
if (old_length != _get_maximum_extent()) {
notify_length_changed ();
}
}
region_state_changed_connections.push_back (
region->StateChanged.connect (sigc::bind (mem_fun (this, &Playlist::region_changed_proxy),
boost::weak_ptr<Region> (region)))
);
return true;
}
void
Playlist::replace_region (boost::shared_ptr<Region> old, boost::shared_ptr<Region> newr, nframes_t pos)
{
RegionLock rlock (this);
bool old_sp = _splicing;
_splicing = true;
remove_region_internal (old);
add_region_internal (newr, pos);
_splicing = old_sp;
possibly_splice_unlocked (pos, (nframes64_t) old->length() - (nframes64_t) newr->length());
}
void
Playlist::remove_region (boost::shared_ptr<Region> region)
{
RegionLock rlock (this);
remove_region_internal (region);
}
int
Playlist::remove_region_internal (boost::shared_ptr<Region> region)
{
RegionList::iterator i;
nframes_t old_length = 0;
if (!holding_state()) {
old_length = _get_maximum_extent();
}
if (!in_set_state) {
/* unset playlist */
region->set_playlist (boost::weak_ptr<Playlist>());
}
for (i = regions.begin(); i != regions.end(); ++i) {
if (*i == region) {
nframes_t pos = (*i)->position();
nframes64_t distance = (*i)->length();
regions.erase (i);
possibly_splice_unlocked (pos, -distance);
if (!holding_state ()) {
relayer ();
remove_dependents (region);
if (old_length != _get_maximum_extent()) {
notify_length_changed ();
}
}
notify_region_removed (region);
return 0;
}
}
return -1;
}
void
Playlist::get_equivalent_regions (boost::shared_ptr<Region> other, vector<boost::shared_ptr<Region> >& results)
{
if (Config->get_use_overlap_equivalency()) {
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->overlap_equivalent (other)) {
results.push_back ((*i));
}
}
} else {
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->equivalent (other)) {
results.push_back ((*i));
}
}
}
}
void
Playlist::get_region_list_equivalent_regions (boost::shared_ptr<Region> other, vector<boost::shared_ptr<Region> >& results)
{
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i) && (*i)->region_list_equivalent (other)) {
results.push_back (*i);
}
}
}
void
Playlist::partition (nframes_t start, nframes_t end, bool cut)
{
RegionList thawlist;
partition_internal (start, end, cut, thawlist);
for (RegionList::iterator i = thawlist.begin(); i != thawlist.end(); ++i) {
(*i)->thaw ("separation");
}
}
void
Playlist::partition_internal (nframes_t start, nframes_t end, bool cutting, RegionList& thawlist)
{
RegionList new_regions;
{
RegionLock rlock (this);
boost::shared_ptr<Region> region;
boost::shared_ptr<Region> current;
string new_name;
RegionList::iterator tmp;
OverlapType overlap;
nframes_t pos1, pos2, pos3, pos4;
in_partition = true;
/* need to work from a copy, because otherwise the regions we add during the process
get operated on as well.
*/
RegionList copy = regions;
for (RegionList::iterator i = copy.begin(); i != copy.end(); i = tmp) {
tmp = i;
++tmp;
current = *i;
if (current->first_frame() >= start && current->last_frame() < end) {
if (cutting) {
remove_region_internal (current);
}
continue;
}
/* coverage will return OverlapStart if the start coincides
with the end point. we do not partition such a region,
so catch this special case.
*/
if (current->first_frame() >= end) {
continue;
}
if ((overlap = current->coverage (start, end)) == OverlapNone) {
continue;
}
pos1 = current->position();
pos2 = start;
pos3 = end;
pos4 = current->last_frame();
if (overlap == OverlapInternal) {
/* split: we need 3 new regions, the front, middle and end.
cut: we need 2 regions, the front and end.
*/
/*
start end
---------------*************************------------
P1 P2 P3 P4
SPLIT:
---------------*****++++++++++++++++====------------
CUT
---------------*****----------------====------------
*/
if (!cutting) {
/* "middle" ++++++ */
_session.region_name (new_name, current->name(), false);
region = RegionFactory::create (current, pos2 - pos1, pos3 - pos2, new_name,
regions.size(), Region::Flag(current->flags()|Region::Automatic|Region::LeftOfSplit|Region::RightOfSplit));
add_region_internal (region, start);
new_regions.push_back (region);
}
/* "end" ====== */
_session.region_name (new_name, current->name(), false);
region = RegionFactory::create (current, pos3 - pos1, pos4 - pos3, new_name,
regions.size(), Region::Flag(current->flags()|Region::Automatic|Region::RightOfSplit));
add_region_internal (region, end);
new_regions.push_back (region);
/* "front" ***** */
current->freeze ();
thawlist.push_back (current);
current->trim_end (pos2, this);
} else if (overlap == OverlapEnd) {
/*
start end
---------------*************************------------
P1 P2 P4 P3
SPLIT:
---------------**************+++++++++++------------
CUT:
---------------**************-----------------------
*/
if (!cutting) {
/* end +++++ */
_session.region_name (new_name, current->name(), false);
region = RegionFactory::create (current, pos2 - pos1, pos4 - pos2, new_name, (layer_t) regions.size(),
Region::Flag(current->flags()|Region::Automatic|Region::LeftOfSplit));
add_region_internal (region, start);
new_regions.push_back (region);
}
/* front ****** */
current->freeze ();
thawlist.push_back (current);
current->trim_end (pos2, this);
} else if (overlap == OverlapStart) {
/* split: we need 2 regions: the front and the end.
cut: just trim current to skip the cut area
*/
/*
start end
---------------*************************------------
P2 P1 P3 P4
SPLIT:
---------------****+++++++++++++++++++++------------
CUT:
-------------------*********************------------
*/
if (!cutting) {
/* front **** */
_session.region_name (new_name, current->name(), false);
region = RegionFactory::create (current, 0, pos3 - pos1, new_name,
regions.size(), Region::Flag(current->flags()|Region::Automatic|Region::RightOfSplit));
add_region_internal (region, pos1);
new_regions.push_back (region);
}
/* end */
current->freeze ();
thawlist.push_back (current);
current->trim_front (pos3, this);
} else if (overlap == OverlapExternal) {
/* split: no split required.
cut: remove the region.
*/
/*
start end
---------------*************************------------
P2 P1 P3 P4
SPLIT:
---------------*************************------------
CUT:
----------------------------------------------------
*/
if (cutting) {
remove_region_internal (current);
}
new_regions.push_back (current);
}
}
in_partition = false;
}
for (RegionList::iterator i = new_regions.begin(); i != new_regions.end(); ++i) {
check_dependents (*i, false);
}
}
boost::shared_ptr<Playlist>
Playlist::cut_copy (boost::shared_ptr<Playlist> (Playlist::*pmf)(nframes_t, nframes_t,bool), list<AudioRange>& ranges, bool result_is_hidden)
{
boost::shared_ptr<Playlist> ret;
boost::shared_ptr<Playlist> pl;
nframes_t start;
if (ranges.empty()) {
return boost::shared_ptr<Playlist>();
}
start = ranges.front().start;
for (list<AudioRange>::iterator i = ranges.begin(); i != ranges.end(); ++i) {
pl = (this->*pmf)((*i).start, (*i).length(), result_is_hidden);
if (i == ranges.begin()) {
ret = pl;
} else {
/* paste the next section into the nascent playlist,
offset to reflect the start of the first range we
chopped.
*/
ret->paste (pl, (*i).start - start, 1.0f);
}
}
return ret;
}
boost::shared_ptr<Playlist>
Playlist::cut (list<AudioRange>& ranges, bool result_is_hidden)
{
boost::shared_ptr<Playlist> (Playlist::*pmf)(nframes_t,nframes_t,bool) = &Playlist::cut;
return cut_copy (pmf, ranges, result_is_hidden);
}
boost::shared_ptr<Playlist>
Playlist::copy (list<AudioRange>& ranges, bool result_is_hidden)
{
boost::shared_ptr<Playlist> (Playlist::*pmf)(nframes_t,nframes_t,bool) = &Playlist::copy;
return cut_copy (pmf, ranges, result_is_hidden);
}
boost::shared_ptr<Playlist>
Playlist::cut (nframes_t start, nframes_t cnt, bool result_is_hidden)
{
boost::shared_ptr<Playlist> the_copy;
RegionList thawlist;
char buf[32];
snprintf (buf, sizeof (buf), "%" PRIu32, ++subcnt);
string new_name = _name;
new_name += '.';
new_name += buf;
if ((the_copy = PlaylistFactory::create (shared_from_this(), start, cnt, new_name, result_is_hidden)) == 0) {
return boost::shared_ptr<Playlist>();
}
partition_internal (start, start+cnt-1, true, thawlist);
for (RegionList::iterator i = thawlist.begin(); i != thawlist.end(); ++i) {
(*i)->thaw ("playlist cut");
}
return the_copy;
}
boost::shared_ptr<Playlist>
Playlist::copy (nframes_t start, nframes_t cnt, bool result_is_hidden)
{
char buf[32];
snprintf (buf, sizeof (buf), "%" PRIu32, ++subcnt);
string new_name = _name;
new_name += '.';
new_name += buf;
cnt = min (_get_maximum_extent() - start, cnt);
return PlaylistFactory::create (shared_from_this(), start, cnt, new_name, result_is_hidden);
}
int
Playlist::paste (boost::shared_ptr<Playlist> other, nframes_t position, float times)
{
times = fabs (times);
nframes_t old_length;
{
RegionLock rl1 (this);
RegionLock rl2 (other.get());
old_length = _get_maximum_extent();
int itimes = (int) floor (times);
nframes_t pos = position;
nframes_t shift = other->_get_maximum_extent();
layer_t top_layer = regions.size();
while (itimes--) {
for (RegionList::iterator i = other->regions.begin(); i != other->regions.end(); ++i) {
boost::shared_ptr<Region> copy_of_region = RegionFactory::create (*i);
/* put these new regions on top of all existing ones, but preserve
the ordering they had in the original playlist.
*/
copy_of_region->set_layer (copy_of_region->layer() + top_layer);
add_region_internal (copy_of_region, copy_of_region->position() + pos);
}
pos += shift;
}
/* XXX shall we handle fractional cases at some point? */
if (old_length != _get_maximum_extent()) {
notify_length_changed ();
}
}
return 0;
}
void
Playlist::duplicate (boost::shared_ptr<Region> region, nframes_t position, float times)
{
times = fabs (times);
RegionLock rl (this);
int itimes = (int) floor (times);
nframes_t pos = position;
while (itimes--) {
boost::shared_ptr<Region> copy = RegionFactory::create (region);
add_region_internal (copy, pos);
pos += region->length();
}
if (floor (times) != times) {
nframes_t length = (nframes_t) floor (region->length() * (times - floor (times)));
string name;
_session.region_name (name, region->name(), false);
boost::shared_ptr<Region> sub = RegionFactory::create (region, 0, length, name, region->layer(), region->flags());
add_region_internal (sub, pos);
}
}
void
Playlist::shift (nframes64_t at, nframes64_t distance, bool move_intersected, bool ignore_music_glue)
{
RegionLock rlock (this);
RegionList copy (regions);
RegionList fixup;
for (RegionList::iterator r = copy.begin(); r != copy.end(); ++r) {
if ((*r)->last_frame() < at) {
/* too early */
continue;
}
if (at > (*r)->first_frame() && at < (*r)->last_frame()) {
/* intersected region */
if (!move_intersected) {
continue;
}
}
/* do not move regions glued to music time - that
has to be done separately.
*/
if (!ignore_music_glue && (*r)->positional_lock_style() != Region::AudioTime) {
fixup.push_back (*r);
continue;
}
(*r)->set_position ((*r)->position() + distance, this);
}
for (RegionList::iterator r = fixup.begin(); r != fixup.end(); ++r) {
(*r)->recompute_position_from_lock_style ();
}
}
void
Playlist::split (nframes64_t at)
{
RegionLock rlock (this);
RegionList copy (regions);
/* use a copy since this operation can modify the region list
*/
for (RegionList::iterator r = copy.begin(); r != copy.end(); ++r) {
_split_region (*r, at);
}
}
void
Playlist::split_region (boost::shared_ptr<Region> region, nframes_t playlist_position)
{
RegionLock rl (this);
_split_region (region, playlist_position);
}
void
Playlist::_split_region (boost::shared_ptr<Region> region, nframes_t playlist_position)
{
if (!region->covers (playlist_position)) {
return;
}
if (region->position() == playlist_position ||
region->last_frame() == playlist_position) {
return;
}
boost::shared_ptr<Region> left;
boost::shared_ptr<Region> right;
nframes_t before;
nframes_t after;
string before_name;
string after_name;
/* split doesn't change anything about length, so don't try to splice */
bool old_sp = _splicing;
_splicing = true;
before = playlist_position - region->position();
after = region->length() - before;
_session.region_name (before_name, region->name(), false);
left = RegionFactory::create (region, 0, before, before_name, region->layer(), Region::Flag (region->flags()|Region::LeftOfSplit));
_session.region_name (after_name, region->name(), false);
right = RegionFactory::create (region, before, after, after_name, region->layer(), Region::Flag (region->flags()|Region::RightOfSplit));
add_region_internal (left, region->position());
add_region_internal (right, region->position() + before);
uint64_t orig_layer_op = region->last_layer_op();
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->last_layer_op() > orig_layer_op) {
(*i)->set_last_layer_op( (*i)->last_layer_op() + 1 );
}
}
left->set_last_layer_op ( orig_layer_op );
right->set_last_layer_op ( orig_layer_op + 1);
layer_op_counter++;
finalize_split_region (region, left, right);
remove_region_internal (region);
_splicing = old_sp;
}
void
Playlist::possibly_splice (nframes_t at, nframes64_t distance, boost::shared_ptr<Region> exclude)
{
if (_splicing || in_set_state) {
/* don't respond to splicing moves or state setting */
return;
}
if (_edit_mode == Splice) {
splice_locked (at, distance, exclude);
}
}
void
Playlist::possibly_splice_unlocked (nframes_t at, nframes64_t distance, boost::shared_ptr<Region> exclude)
{
if (_splicing || in_set_state) {
/* don't respond to splicing moves or state setting */
return;
}
if (_edit_mode == Splice) {
splice_unlocked (at, distance, exclude);
}
}
void
Playlist::splice_locked (nframes_t at, nframes64_t distance, boost::shared_ptr<Region> exclude)
{
{
RegionLock rl (this);
core_splice (at, distance, exclude);
}
}
void
Playlist::splice_unlocked (nframes_t at, nframes64_t distance, boost::shared_ptr<Region> exclude)
{
core_splice (at, distance, exclude);
}
void
Playlist::core_splice (nframes_t at, nframes64_t distance, boost::shared_ptr<Region> exclude)
{
_splicing = true;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if (exclude && (*i) == exclude) {
continue;
}
if ((*i)->position() >= at) {
nframes64_t new_pos = (*i)->position() + distance;
if (new_pos < 0) {
new_pos = 0;
} else if (new_pos >= max_frames - (*i)->length()) {
new_pos = max_frames - (*i)->length();
}
(*i)->set_position (new_pos, this);
}
}
_splicing = false;
notify_length_changed ();
}
void
Playlist::region_bounds_changed (Change what_changed, boost::shared_ptr<Region> region)
{
if (in_set_state || _splicing || _nudging || _shuffling) {
return;
}
if (what_changed & ARDOUR::PositionChanged) {
/* remove it from the list then add it back in
the right place again.
*/
RegionSortByPosition cmp;
RegionList::iterator i = find (regions.begin(), regions.end(), region);
if (i == regions.end()) {
warning << string_compose (_("%1: bounds changed received for region (%2)not in playlist"),
_name, region->name())
<< endmsg;
return;
}
regions.erase (i);
regions.insert (upper_bound (regions.begin(), regions.end(), region, cmp), region);
}
if (what_changed & Change (ARDOUR::PositionChanged|ARDOUR::LengthChanged)) {
nframes64_t delta = 0;
if (what_changed & ARDOUR::PositionChanged) {
delta = (nframes64_t) region->position() - (nframes64_t) region->last_position();
}
if (what_changed & ARDOUR::LengthChanged) {
delta += (nframes64_t) region->length() - (nframes64_t) region->last_length();
}
if (delta) {
possibly_splice (region->last_position() + region->last_length(), delta, region);
}
if (holding_state ()) {
pending_bounds.push_back (region);
} else {
if (Config->get_layer_model() == MoveAddHigher) {
/* it moved or changed length, so change the timestamp */
timestamp_layer_op (region);
}
notify_length_changed ();
relayer ();
check_dependents (region, false);
}
}
}
void
Playlist::region_changed_proxy (Change what_changed, boost::weak_ptr<Region> weak_region)
{
boost::shared_ptr<Region> region (weak_region.lock());
if (!region) {
return;
}
/* this makes a virtual call to the right kind of playlist ... */
region_changed (what_changed, region);
}
bool
Playlist::region_changed (Change what_changed, boost::shared_ptr<Region> region)
{
Change our_interests = Change (Region::MuteChanged|Region::LayerChanged|Region::OpacityChanged);
bool save = false;
if (in_set_state || in_flush) {
return false;
}
if (what_changed & BoundsChanged) {
region_bounds_changed (what_changed, region);
save = !(_splicing || _nudging);
}
if ((what_changed & our_interests) &&
!(what_changed & Change (ARDOUR::PositionChanged|ARDOUR::LengthChanged))) {
check_dependents (region, false);
}
if (what_changed & Change (ARDOUR::PositionChanged)) {
notify_region_moved (region);
}
if (what_changed & our_interests) {
save = true;
}
return save;
}
void
Playlist::drop_regions ()
{
RegionLock rl (this);
regions.clear ();
all_regions.clear ();
}
void
Playlist::clear (bool with_signals)
{
{
RegionLock rl (this);
for (
std::list<sigc::connection>::iterator i = region_state_changed_connections.begin ();
i != region_state_changed_connections.end ();
++i
) {
i->disconnect ();
}
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
pending_removes.insert (*i);
}
regions.clear ();
}
if (with_signals) {
pending_length = false;
LengthChanged ();
pending_modified = false;
Modified ();
}
}
/***********************************************************************
FINDING THINGS
**********************************************************************/
Playlist::RegionList *
Playlist::regions_at (nframes_t frame)
{
RegionLock rlock (this);
return find_regions_at (frame);
}
boost::shared_ptr<Region>
Playlist::top_region_at (nframes_t frame)
{
RegionLock rlock (this);
RegionList *rlist = find_regions_at (frame);
boost::shared_ptr<Region> region;
if (rlist->size()) {
RegionSortByLayer cmp;
rlist->sort (cmp);
region = rlist->back();
}
delete rlist;
return region;
}
Playlist::RegionList*
Playlist::regions_to_read (nframes_t start, nframes_t end)
{
/* Caller must hold lock */
RegionList covering;
set<nframes_t> to_check;
set<boost::shared_ptr<Region> > unique;
RegionList here;
to_check.insert (start);
to_check.insert (end);
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
/* find all/any regions that span start+end */
switch ((*i)->coverage (start, end)) {
case OverlapNone:
break;
case OverlapInternal:
covering.push_back (*i);
break;
case OverlapStart:
to_check.insert ((*i)->position());
covering.push_back (*i);
break;
case OverlapEnd:
to_check.insert ((*i)->last_frame());
covering.push_back (*i);
break;
case OverlapExternal:
covering.push_back (*i);
to_check.insert ((*i)->position());
to_check.insert ((*i)->last_frame());
break;
}
/* don't go too far */
if ((*i)->position() > end) {
break;
}
}
RegionList* rlist = new RegionList;
/* find all the regions that cover each position .... */
if (covering.size() == 1) {
rlist->push_back (covering.front());
} else {
for (set<nframes_t>::iterator t = to_check.begin(); t != to_check.end(); ++t) {
here.clear ();
for (RegionList::iterator x = covering.begin(); x != covering.end(); ++x) {
if ((*x)->covers (*t)) {
here.push_back (*x);
}
}
RegionSortByLayer cmp;
here.sort (cmp);
/* ... and get the top/transparent regions at "here" */
for (RegionList::reverse_iterator c = here.rbegin(); c != here.rend(); ++c) {
unique.insert (*c);
if ((*c)->opaque()) {
/* the other regions at this position are hidden by this one */
break;
}
}
}
for (set<boost::shared_ptr<Region> >::iterator s = unique.begin(); s != unique.end(); ++s) {
rlist->push_back (*s);
}
if (rlist->size() > 1) {
/* now sort by time order */
RegionSortByPosition cmp;
rlist->sort (cmp);
}
}
return rlist;
}
Playlist::RegionList *
Playlist::find_regions_at (nframes_t frame)
{
/* Caller must hold lock */
RegionList *rlist = new RegionList;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->covers (frame)) {
rlist->push_back (*i);
}
}
return rlist;
}
Playlist::RegionList *
Playlist::regions_touched (nframes_t start, nframes_t end)
{
RegionLock rlock (this);
RegionList *rlist = new RegionList;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->coverage (start, end) != OverlapNone) {
rlist->push_back (*i);
}
}
return rlist;
}
nframes64_t
Playlist::find_next_transient (nframes64_t from, int dir)
{
RegionLock rlock (this);
AnalysisFeatureList points;
AnalysisFeatureList these_points;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if (dir > 0) {
if ((*i)->last_frame() < from) {
continue;
}
} else {
if ((*i)->first_frame() > from) {
continue;
}
}
(*i)->get_transients (these_points);
/* add first frame, just, err, because */
these_points.push_back ((*i)->first_frame());
points.insert (points.end(), these_points.begin(), these_points.end());
these_points.clear ();
}
if (points.empty()) {
return -1;
}
TransientDetector::cleanup_transients (points, _session.frame_rate(), 3.0);
bool reached = false;
if (dir > 0) {
for (AnalysisFeatureList::iterator x = points.begin(); x != points.end(); ++x) {
if ((*x) >= from) {
reached = true;
}
if (reached && (*x) > from) {
return *x;
}
}
} else {
for (AnalysisFeatureList::reverse_iterator x = points.rbegin(); x != points.rend(); ++x) {
if ((*x) <= from) {
reached = true;
}
if (reached && (*x) < from) {
return *x;
}
}
}
return -1;
}
boost::shared_ptr<Region>
Playlist::find_next_region (nframes_t frame, RegionPoint point, int dir)
{
RegionLock rlock (this);
boost::shared_ptr<Region> ret;
nframes_t closest = max_frames;
bool end_iter = false;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if(end_iter) break;
nframes_t distance;
boost::shared_ptr<Region> r = (*i);
nframes_t pos = 0;
switch (point) {
case Start:
pos = r->first_frame ();
break;
case End:
pos = r->last_frame ();
break;
case SyncPoint:
pos = r->sync_position ();
// r->adjust_to_sync (r->first_frame());
break;
}
switch (dir) {
case 1: /* forwards */
if (pos > frame) {
if ((distance = pos - frame) < closest) {
closest = distance;
ret = r;
end_iter = true;
}
}
break;
default: /* backwards */
if (pos < frame) {
if ((distance = frame - pos) < closest) {
closest = distance;
ret = r;
}
}
else {
end_iter = true;
}
break;
}
}
return ret;
}
nframes64_t
Playlist::find_next_region_boundary (nframes64_t frame, int dir)
{
RegionLock rlock (this);
nframes64_t closest = max_frames;
nframes64_t ret = -1;
if (dir > 0) {
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
boost::shared_ptr<Region> r = (*i);
nframes64_t distance;
if (r->first_frame() > frame) {
distance = r->first_frame() - frame;
if (distance < closest) {
ret = r->first_frame();
closest = distance;
}
}
if (r->last_frame () > frame) {
distance = r->last_frame () - frame;
if (distance < closest) {
ret = r->last_frame ();
closest = distance;
}
}
}
} else {
for (RegionList::reverse_iterator i = regions.rbegin(); i != regions.rend(); ++i) {
boost::shared_ptr<Region> r = (*i);
nframes64_t distance;
if (r->last_frame() < frame) {
distance = frame - r->last_frame();
if (distance < closest) {
ret = r->last_frame();
closest = distance;
}
}
if (r->first_frame() < frame) {
distance = frame - r->first_frame();
if (distance < closest) {
ret = r->first_frame();
closest = distance;
}
}
}
}
return ret;
}
/***********************************************************************/
void
Playlist::mark_session_dirty ()
{
if (!in_set_state && !holding_state ()) {
_session.set_dirty();
}
}
int
Playlist::set_state (const XMLNode& node)
{
XMLNode *child;
XMLNodeList nlist;
XMLNodeConstIterator niter;
XMLPropertyList plist;
XMLPropertyConstIterator piter;
XMLProperty *prop;
boost::shared_ptr<Region> region;
string region_name;
in_set_state++;
if (node.name() != "Playlist") {
in_set_state--;
return -1;
}
freeze ();
plist = node.properties();
for (piter = plist.begin(); piter != plist.end(); ++piter) {
prop = *piter;
if (prop->name() == X_("name")) {
_name = prop->value();
} else if (prop->name() == X_("orig_diskstream_id")) {
_orig_diskstream_id = prop->value ();
} else if (prop->name() == X_("frozen")) {
_frozen = (prop->value() == X_("yes"));
}
}
clear (false);
nlist = node.children();
for (niter = nlist.begin(); niter != nlist.end(); ++niter) {
child = *niter;
if (child->name() == "Region") {
if ((prop = child->property ("id")) == 0) {
error << _("region state node has no ID, ignored") << endmsg;
continue;
}
ID id = prop->value ();
if ((region = region_by_id (id))) {
Change what_changed = Change (0);
if (region->set_live_state (*child, what_changed, true)) {
error << _("Playlist: cannot reset region state from XML") << endmsg;
continue;
}
} else if ((region = RegionFactory::create (_session, *child, true)) == 0) {
error << _("Playlist: cannot create region from XML") << endmsg;
continue;
}
add_region (region, region->position(), 1.0);
// So that layer_op ordering doesn't get screwed up
region->set_last_layer_op( region->layer());
}
}
notify_modified ();
thaw ();
/* update dependents, which was not done during add_region_internal
due to in_set_state being true
*/
for (RegionList::iterator r = regions.begin(); r != regions.end(); ++r) {
check_dependents (*r, false);
}
in_set_state--;
first_set_state = false;
return 0;
}
XMLNode&
Playlist::get_state()
{
return state(true);
}
XMLNode&
Playlist::get_template()
{
return state(false);
}
XMLNode&
Playlist::state (bool full_state)
{
XMLNode *node = new XMLNode (X_("Playlist"));
char buf[64];
node->add_property (X_("name"), _name);
node->add_property (X_("type"), _type.to_string());
_orig_diskstream_id.print (buf, sizeof (buf));
node->add_property (X_("orig_diskstream_id"), buf);
node->add_property (X_("frozen"), _frozen ? "yes" : "no");
if (full_state) {
RegionLock rlock (this, false);
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
node->add_child_nocopy ((*i)->get_state());
}
}
if (_extra_xml) {
node->add_child_copy (*_extra_xml);
}
return *node;
}
bool
Playlist::empty() const
{
RegionLock rlock (const_cast<Playlist *>(this), false);
return regions.empty();
}
uint32_t
Playlist::n_regions() const
{
RegionLock rlock (const_cast<Playlist *>(this), false);
return regions.size();
}
nframes_t
Playlist::get_maximum_extent () const
{
RegionLock rlock (const_cast<Playlist *>(this), false);
return _get_maximum_extent ();
}
ARDOUR::nframes_t
Playlist::_get_maximum_extent () const
{
RegionList::const_iterator i;
nframes_t max_extent = 0;
nframes_t end = 0;
for (i = regions.begin(); i != regions.end(); ++i) {
if ((end = (*i)->position() + (*i)->length()) > max_extent) {
max_extent = end;
}
}
return max_extent;
}
string
Playlist::bump_name (string name, Session &session)
{
string newname = name;
do {
newname = bump_name_once (newname);
} while (session.playlist_by_name (newname)!=NULL);
return newname;
}
layer_t
Playlist::top_layer() const
{
RegionLock rlock (const_cast<Playlist *> (this));
layer_t top = 0;
for (RegionList::const_iterator i = regions.begin(); i != regions.end(); ++i) {
top = max (top, (*i)->layer());
}
return top;
}
void
Playlist::set_edit_mode (EditMode mode)
{
_edit_mode = mode;
}
/********************
* Region Layering
********************/
void
Playlist::relayer ()
{
/* don't send multiple Modified notifications
when multiple regions are relayered.
*/
freeze ();
/* build up a new list of regions on each layer */
std::vector<RegionList> layers;
/* we want to go through regions from desired lowest to desired highest layer,
which depends on the layer model
*/
RegionList copy = regions;
/* sort according to the model */
if (Config->get_layer_model() == MoveAddHigher || Config->get_layer_model() == AddHigher) {
RegionSortByLastLayerOp cmp;
copy.sort (cmp);
}
for (RegionList::iterator i = copy.begin(); i != copy.end(); ++i) {
/* find the lowest layer that this region can go on */
size_t j = layers.size();
while (j > 0) {
/* try layer j - 1; it can go on if it overlaps no other region
that is already on that layer
*/
RegionList::iterator k = layers[j - 1].begin();
while (k != layers[j - 1].end()) {
if ((*k)->overlap_equivalent (*i)) {
break;
}
k++;
}
if (k != layers[j - 1].end()) {
/* no overlap, so we can use this layer */
break;
}
j--;
}
if (j == layers.size()) {
/* we need a new layer for this region */
layers.push_back (RegionList ());
}
layers[j].push_back (*i);
}
/* first pass: set up the layer numbers in the regions */
for (size_t j = 0; j < layers.size(); ++j) {
for (RegionList::iterator i = layers[j].begin(); i != layers[j].end(); ++i) {
(*i)->set_layer (j);
}
}
/* sending Modified means that various kinds of layering
models operate correctly at the GUI
level. slightly inefficient, but only slightly.
We force a Modified signal here in case no layers actually
changed.
*/
notify_modified ();
thaw ();
}
/* XXX these layer functions are all deprecated */
void
Playlist::raise_region (boost::shared_ptr<Region> region)
{
uint32_t rsz = regions.size();
layer_t target = region->layer() + 1U;
if (target >= rsz) {
/* its already at the effective top */
return;
}
move_region_to_layer (target, region, 1);
}
void
Playlist::lower_region (boost::shared_ptr<Region> region)
{
if (region->layer() == 0) {
/* its already at the bottom */
return;
}
layer_t target = region->layer() - 1U;
move_region_to_layer (target, region, -1);
}
void
Playlist::raise_region_to_top (boost::shared_ptr<Region> region)
{
/* does nothing useful if layering mode is later=higher */
if ((Config->get_layer_model() == MoveAddHigher) ||
(Config->get_layer_model() == AddHigher)) {
timestamp_layer_op (region);
relayer ();
}
}
void
Playlist::lower_region_to_bottom (boost::shared_ptr<Region> region)
{
/* does nothing useful if layering mode is later=higher */
if ((Config->get_layer_model() == MoveAddHigher) ||
(Config->get_layer_model() == AddHigher)) {
region->set_last_layer_op (0);
relayer ();
}
}
int
Playlist::move_region_to_layer (layer_t target_layer, boost::shared_ptr<Region> region, int dir)
{
RegionList::iterator i;
typedef pair<boost::shared_ptr<Region>,layer_t> LayerInfo;
list<LayerInfo> layerinfo;
layer_t dest;
{
RegionLock rlock (const_cast<Playlist *> (this));
for (i = regions.begin(); i != regions.end(); ++i) {
if (region == *i) {
continue;
}
if (dir > 0) {
/* region is moving up, move all regions on intermediate layers
down 1
*/
if ((*i)->layer() > region->layer() && (*i)->layer() <= target_layer) {
dest = (*i)->layer() - 1;
} else {
/* not affected */
continue;
}
} else {
/* region is moving down, move all regions on intermediate layers
up 1
*/
if ((*i)->layer() < region->layer() && (*i)->layer() >= target_layer) {
dest = (*i)->layer() + 1;
} else {
/* not affected */
continue;
}
}
LayerInfo newpair;
newpair.first = *i;
newpair.second = dest;
layerinfo.push_back (newpair);
}
}
/* now reset the layers without holding the region lock */
for (list<LayerInfo>::iterator x = layerinfo.begin(); x != layerinfo.end(); ++x) {
x->first->set_layer (x->second);
}
region->set_layer (target_layer);
#if 0
/* now check all dependents */
for (list<LayerInfo>::iterator x = layerinfo.begin(); x != layerinfo.end(); ++x) {
check_dependents (x->first, false);
}
check_dependents (region, false);
#endif
return 0;
}
void
Playlist::nudge_after (nframes_t start, nframes_t distance, bool forwards)
{
RegionList::iterator i;
nframes_t new_pos;
bool moved = false;
_nudging = true;
{
RegionLock rlock (const_cast<Playlist *> (this));
for (i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->position() >= start) {
if (forwards) {
if ((*i)->last_frame() > max_frames - distance) {
new_pos = max_frames - (*i)->length();
} else {
new_pos = (*i)->position() + distance;
}
} else {
if ((*i)->position() > distance) {
new_pos = (*i)->position() - distance;
} else {
new_pos = 0;
}
}
(*i)->set_position (new_pos, this);
moved = true;
}
}
}
if (moved) {
_nudging = false;
notify_length_changed ();
}
}
boost::shared_ptr<Region>
Playlist::find_region (const ID& id) const
{
RegionLock rlock (const_cast<Playlist*> (this));
/* searches all regions currently in use by the playlist */
for (RegionList::const_iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i)->id() == id) {
return *i;
}
}
return boost::shared_ptr<Region> ();
}
boost::shared_ptr<Region>
Playlist::region_by_id (ID id)
{
/* searches all regions ever added to this playlist */
for (set<boost::shared_ptr<Region> >::iterator i = all_regions.begin(); i != all_regions.end(); ++i) {
if ((*i)->id() == id) {
return *i;
}
}
return boost::shared_ptr<Region> ();
}
void
Playlist::dump () const
{
boost::shared_ptr<Region> r;
cerr << "Playlist \"" << _name << "\" " << endl
<< regions.size() << " regions "
<< endl;
for (RegionList::const_iterator i = regions.begin(); i != regions.end(); ++i) {
r = *i;
cerr << " " << r->name() << " ["
<< r->start() << "+" << r->length()
<< "] at "
<< r->position()
<< " on layer "
<< r->layer ()
<< endl;
}
}
void
Playlist::set_frozen (bool yn)
{
_frozen = yn;
}
void
Playlist::timestamp_layer_op (boost::shared_ptr<Region> region)
{
// struct timeval tv;
// gettimeofday (&tv, 0);
region->set_last_layer_op (++layer_op_counter);
}
void
Playlist::shuffle (boost::shared_ptr<Region> region, int dir)
{
bool moved = false;
nframes_t new_pos;
if (region->locked()) {
return;
}
_shuffling = true;
{
RegionLock rlock (const_cast<Playlist*> (this));
if (dir > 0) {
RegionList::iterator next;
for (RegionList::iterator i = regions.begin(); i != regions.end(); ++i) {
if ((*i) == region) {
next = i;
++next;
if (next != regions.end()) {
if ((*next)->locked()) {
break;
}
if ((*next)->position() != region->last_frame() + 1) {
/* they didn't used to touch, so after shuffle,
just have them swap positions.
*/
new_pos = (*next)->position();
} else {
/* they used to touch, so after shuffle,
make sure they still do. put the earlier
region where the later one will end after
it is moved.
*/
new_pos = region->position() + (*next)->length();
}
(*next)->set_position (region->position(), this);
region->set_position (new_pos, this);
/* avoid a full sort */
regions.erase (i); // removes the region from the list */
next++;
regions.insert (next, region); // adds it back after next
moved = true;
}
break;
}
}
} else {
RegionList::iterator prev = regions.end();
for (RegionList::iterator i = regions.begin(); i != regions.end(); prev = i, ++i) {
if ((*i) == region) {
if (prev != regions.end()) {
if ((*prev)->locked()) {
break;
}
if (region->position() != (*prev)->last_frame() + 1) {
/* they didn't used to touch, so after shuffle,
just have them swap positions.
*/
new_pos = region->position();
} else {
/* they used to touch, so after shuffle,
make sure they still do. put the earlier
one where the later one will end after
*/
new_pos = (*prev)->position() + region->length();
}
region->set_position ((*prev)->position(), this);
(*prev)->set_position (new_pos, this);
/* avoid a full sort */
regions.erase (i); // remove region
regions.insert (prev, region); // insert region before prev
moved = true;
}
break;
}
}
}
}
_shuffling = false;
if (moved) {
relayer ();
check_dependents (region, false);
notify_modified();
}
}
bool
Playlist::region_is_shuffle_constrained (boost::shared_ptr<Region>)
{
RegionLock rlock (const_cast<Playlist*> (this));
if (regions.size() > 1) {
return true;
}
return false;
}
void
Playlist::update_after_tempo_map_change ()
{
RegionLock rlock (const_cast<Playlist*> (this));
RegionList copy (regions);
freeze ();
for (RegionList::iterator i = copy.begin(); i != copy.end(); ++i) {
(*i)->update_position_after_tempo_map_change ();
}
thaw ();
}
View Git Blame Copy Permalink