2 Copyright (C) 2000 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 <pbd/xml++.h>
24 #include <ardour/send.h>
25 #include <ardour/session.h>
26 #include <ardour/port.h>
30 using namespace ARDOUR;
33 Send::Send (Session& s, Placement p)
34 : Redirect (s, string_compose (_("send %1"), (bitslot = s.next_send_id()) + 1), p)
38 RedirectCreated (this); /* EMIT SIGNAL */
41 Send::Send (Session& s, const XMLNode& node)
42 : Redirect (s, "send", PreFader)
49 if (set_state (node)) {
50 throw failed_constructor();
53 RedirectCreated (this); /* EMIT SIGNAL */
56 Send::Send (const Send& other)
57 : Redirect (other._session, string_compose (_("send %1"), (bitslot = other._session.next_send_id()) + 1), other.placement())
62 /* set up the same outputs, and connect them to the same places */
63 for (uint32_t i = 0; i < other.n_outputs (); ++i) {
64 add_output_port ("", 0);
65 Port* p = other.output (i);
67 /* this is what the other send's output is connected to */
68 const char **connections = p->get_connections ();
70 for (uint32_t c = 0; connections[c]; ++c) {
71 connect_output (output (i), connections [c], 0);
78 set_active (true, this);
81 RedirectCreated (this); /* EMIT SIGNAL */
96 Send::state(bool full)
98 XMLNode *node = new XMLNode("Send");
100 node->add_child_nocopy (Redirect::state (full));
101 snprintf (buf, sizeof (buf), "%" PRIu32, bitslot);
102 node->add_property ("bitslot", buf);
107 Send::set_state(const XMLNode& node)
109 XMLNodeList nlist = node.children();
110 XMLNodeIterator niter;
111 const XMLProperty* prop;
113 if ((prop = node.property ("bitslot")) == 0) {
114 bitslot = _session.next_send_id();
116 uint32_t old_bitslot = bitslot;
117 sscanf (prop->value().c_str(), "%" PRIu32, &bitslot);
119 if (bitslot != old_bitslot) {
120 _session.mark_send_id (bitslot);
124 /* Send has regular IO automation (gain, pan) */
126 for (niter = nlist.begin(); niter != nlist.end(); ++niter) {
127 if ((*niter)->name() == Redirect::state_node_name) {
128 Redirect::set_state (**niter);
130 } else if ((*niter)->name() == X_("Automation")) {
131 IO::set_automation_state (*(*niter));
135 if (niter == nlist.end()) {
136 error << _("XML node describing a send is missing a Redirect node") << endmsg;
144 Send::run (vector<Sample *>& bufs, uint32_t nbufs, nframes_t nframes, nframes_t offset)
148 // we have to copy the input, because IO::deliver_output may alter the buffers
149 // in-place, which a send must never do.
151 vector<Sample*>& sendbufs = _session.get_send_buffers();
153 for (size_t i=0; i < nbufs; ++i) {
154 memcpy (sendbufs[i], bufs[i], sizeof (Sample) * nframes);
158 IO::deliver_output (sendbufs, nbufs, nframes, offset);
162 uint32_t no = n_outputs();
166 for (n = 0; n < no; ++n) {
172 for (n = 0; n < no; ++n) {
173 _peak_power[n] = Session::compute_peak (output(n)->get_buffer(nframes) + offset, nframes, _peak_power[n]);
179 silence (nframes, offset);
183 uint32_t no = n_outputs();
185 for (n = 0; n < no; ++n) {
193 Send::set_metering (bool yn)
198 /* XXX possible thread hazard here */
199 reset_peak_meters ();
204 Send::expect_inputs (uint32_t expected)
206 if (expected != expected_inputs) {
207 expected_inputs = expected;