2 Copyright (C) 2016 Paul Davis
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.
22 #include <glibmm/threads.h>
24 #include "pbd/convert.h"
25 #include "pbd/error.h"
26 #include "pbd/xml++.h"
28 #include "ardour/slavable.h"
29 #include "ardour/slavable_automation_control.h"
30 #include "ardour/vca.h"
31 #include "ardour/vca_manager.h"
36 using namespace ARDOUR;
38 std::string Slavable::xml_node_name = X_("Slavable");
39 PBD::Signal1<void,VCAManager*> Slavable::Assign; /* signal sent once
40 * assignment is possible */
44 Assign.connect_same_thread (assign_connection, boost::bind (&Slavable::do_assign, this, _1));
48 Slavable::get_state () const
50 XMLNode* node = new XMLNode (xml_node_name);
53 Glib::Threads::RWLock::ReaderLock lm (master_lock);
54 for (std::set<uint32_t>::const_iterator i = _masters.begin(); i != _masters.end(); ++i) {
55 child = new XMLNode (X_("Master"));
56 child->add_property (X_("number"), to_string (*i, std::dec));
57 node->add_child_nocopy (*child);
64 Slavable::set_state (XMLNode const& node, int version)
66 if (node.name() != xml_node_name) {
70 XMLNodeList const& children (node.children());
71 Glib::Threads::RWLock::WriterLock lm (master_lock);
73 for (XMLNodeList::const_iterator i = children.begin(); i != children.end(); ++i) {
74 if ((*i)->name() == X_("Master")) {
75 XMLProperty const* prop = (*i)->property (X_("number"));
77 uint32_t n = atoi (prop->value());
87 Slavable::do_assign (VCAManager* manager)
89 std::vector<boost::shared_ptr<VCA> > vcas;
92 Glib::Threads::RWLock::ReaderLock lm (master_lock);
94 for (std::set<uint32_t>::const_iterator i = _masters.begin(); i != _masters.end(); ++i) {
95 boost::shared_ptr<VCA> v = manager->vca_by_number (*i);
99 warning << string_compose (_("Master #%1 not found, assignment lost"), *i) << endmsg;
104 /* now that we've released the lock, we can do the assignments */
106 for (std::vector<boost::shared_ptr<VCA> >::iterator v = vcas.begin(); v != vcas.end(); ++v) {
110 assign_connection.disconnect ();
116 Slavable::assign (boost::shared_ptr<VCA> v)
118 Glib::Threads::RWLock::WriterLock lm (master_lock);
119 if (assign_controls (v) == 0) {
120 _masters.insert (v->number());
125 Slavable::unassign (boost::shared_ptr<VCA> v)
127 Glib::Threads::RWLock::WriterLock lm (master_lock);
128 (void) unassign_controls (v);
129 _masters.erase (v->number());
133 Slavable::assign_controls (boost::shared_ptr<VCA> vca)
135 boost::shared_ptr<SlavableAutomationControl> slave;
136 boost::shared_ptr<AutomationControl> master;
137 AutomationType types[] = {
142 MonitoringAutomation,
146 for (uint32_t n = 0; types[n] != NullAutomation; ++n) {
148 slave = boost::dynamic_pointer_cast<SlavableAutomationControl> (automation_control (types[n]));
149 master = vca->automation_control (types[n]);
151 if (slave && master) {
152 slave->add_master (master);
160 Slavable::unassign_controls (boost::shared_ptr<VCA> vca)
162 boost::shared_ptr<SlavableAutomationControl> slave;
163 boost::shared_ptr<AutomationControl> master;
164 AutomationType types[] = {
169 MonitoringAutomation,
173 for (uint32_t n = 0; types[n] != NullAutomation; ++n) {
175 slave = boost::dynamic_pointer_cast<SlavableAutomationControl> (automation_control (types[n]));
177 /* unassign from all */
178 slave->clear_masters ();
180 slave->remove_master (master);