1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
/*
Copyright (C) 2009 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 <glibmm/thread.h>
#include "pbd/failed_constructor.h"
#include "ardour/internal_return.h"
#include "ardour/mute_master.h"
#include "ardour/session.h"
using namespace std;
using namespace ARDOUR;
sigc::signal<void,nframes_t> InternalReturn::CycleStart;
InternalReturn::InternalReturn (Session& s)
: Return (s, true)
, user_count (0)
{
CycleStart.connect (mem_fun (*this, &InternalReturn::cycle_start));
}
InternalReturn::InternalReturn (Session& s, const XMLNode& node)
: Return (s, node, true)
, user_count (0)
{
CycleStart.connect (mem_fun (*this, &InternalReturn::cycle_start));
}
void
InternalReturn::run (BufferSet& bufs, sframes_t start_frame, sframes_t end_frame, nframes_t nframes)
{
/* XXX no lock here, just atomic fetch */
if (g_atomic_int_get(&user_count) == 0) {
/* nothing to do - nobody is feeding us anything */
return;
}
bufs.merge_from (buffers, nframes);
}
bool
InternalReturn::configure_io (ChanCount in, ChanCount out)
{
IOProcessor::configure_io (in, out);
allocate_buffers (_session.engine().frames_per_cycle());
return true;
}
void
InternalReturn::set_block_size (nframes_t nframes)
{
allocate_buffers (nframes);
}
void
InternalReturn::allocate_buffers (nframes_t nframes)
{
buffers.ensure_buffers (_configured_input, nframes);
buffers.set_count (_configured_input);
}
BufferSet*
InternalReturn::get_buffers ()
{
Glib::Mutex::Lock lm (_session.engine().process_lock());
/* use of g_atomic here is just for code consistency - its protected by the lock
for writing.
*/
g_atomic_int_inc (&user_count);
return &buffers;
}
void
InternalReturn::release_buffers ()
{
Glib::Mutex::Lock lm (_session.engine().process_lock());
if (user_count) {
/* use of g_atomic here is just for code consistency - its protected by the lock
for writing.
*/
(void) g_atomic_int_dec_and_test (&user_count);
}
}
void
InternalReturn::cycle_start (nframes_t nframes)
{
/* called from process cycle - no lock necessary */
if (user_count) {
/* don't bother with this if nobody is going to feed us anything */
buffers.silence (nframes, 0);
}
}
XMLNode&
InternalReturn::state (bool full)
{
XMLNode& node (Return::state (full));
/* override type */
node.add_property("type", "intreturn");
return node;
}
XMLNode&
InternalReturn::get_state()
{
return state (true);
}
int
InternalReturn::set_state (const XMLNode& node)
{
return Return::set_state (node);
}
bool
InternalReturn::can_support_io_configuration (const ChanCount& in, ChanCount& out) const
{
out = in;
return true;
}
bool
InternalReturn::visible () const
{
return false;
}
|
