2 Copyright (C) 2010 Paul Davis
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 #include <xmmintrin.h>
24 #include "pbd/compose.h"
25 #include "pbd/debug_rt_alloc.h"
27 #include "ardour/debug.h"
28 #include "ardour/graph.h"
29 #include "ardour/types.h"
30 #include "ardour/session.h"
31 #include "ardour/route.h"
32 #include "ardour/process_thread.h"
33 #include "ardour/audioengine.h"
35 #include <jack/thread.h>
39 using namespace ARDOUR;
44 static Graph* graph = 0;
50 return !graph->in_process_thread ();
56 Graph::Graph (Session & session)
57 : SessionHandleRef (session)
58 , _quit_threads (false)
59 , _execution_sem ("graph_execution", 0)
60 , _callback_start_sem ("graph_start", 0)
61 , _callback_done_sem ("graph_done", 0)
62 , _cleanup_sem ("graph_cleanup", 0)
64 pthread_mutex_init( &_trigger_mutex, NULL);
66 /* XXX: rather hacky `fix' to stop _trigger_queue.push_back() allocating
67 memory in the RT thread.
69 _trigger_queue.reserve (8192);
71 _execution_tokens = 0;
76 _quit_threads = false;
83 pbd_alloc_allowed = &::alloc_allowed;
87 /** Set up threads for running the graph */
89 Graph::reset_thread_list ()
91 uint32_t num_threads = how_many_dsp_threads ();
93 /* For now, we shouldn't be using the graph code if we only have 1 DSP thread */
94 assert (num_threads > 1);
96 /* don't bother doing anything here if we already have the right
100 if (_thread_list.size() == num_threads) {
104 Glib::Mutex::Lock lm (_session.engine().process_lock());
107 if (!_thread_list.empty()) {
111 if (AudioEngine::instance()->create_process_thread (boost::bind (&Graph::main_thread, this), &a_thread, 100000) == 0) {
112 _thread_list.push_back (a_thread);
115 for (uint32_t i = 1; i < num_threads; ++i) {
116 if (AudioEngine::instance()->create_process_thread (boost::bind (&Graph::helper_thread, this), &a_thread, 100000) == 0) {
117 _thread_list.push_back (a_thread);
123 Graph::session_going_away()
127 // now drop all references on the nodes.
128 _nodes_rt[0].clear();
129 _nodes_rt[1].clear();
130 _init_trigger_list[0].clear();
131 _init_trigger_list[1].clear();
132 _trigger_queue.clear();
136 Graph::drop_threads ()
138 _quit_threads = true;
140 for (unsigned int i=0; i< _thread_list.size(); i++) {
141 _execution_sem.signal ();
144 _callback_start_sem.signal ();
146 for (list<pthread_t>::iterator i = _thread_list.begin(); i != _thread_list.end(); ++i) {
148 pthread_join (*i, &status);
151 _thread_list.clear ();
153 _execution_tokens = 0;
155 _quit_threads = false;
159 Graph::clear_other_chain ()
161 Glib::Mutex::Lock ls (_swap_mutex);
164 if (_setup_chain != _pending_chain) {
166 for (node_list_t::iterator ni=_nodes_rt[_setup_chain].begin(); ni!=_nodes_rt[_setup_chain].end(); ni++) {
167 (*ni)->_activation_set[_setup_chain].clear();
170 _nodes_rt[_setup_chain].clear ();
171 _init_trigger_list[_setup_chain].clear ();
174 /* setup chain == pending chain - we have
175 to wait till this is no longer true.
177 _cleanup_cond.wait (_swap_mutex);
184 node_list_t::iterator i;
187 if (_swap_mutex.trylock()) {
188 // we got the swap mutex.
189 if (_current_chain != _pending_chain)
191 // printf ("chain swap ! %d -> %d\n", _current_chain, _pending_chain);
192 _setup_chain = _current_chain;
193 _current_chain = _pending_chain;
194 _cleanup_cond.signal ();
196 _swap_mutex.unlock ();
199 chain = _current_chain;
202 for (i=_nodes_rt[chain].begin(); i!=_nodes_rt[chain].end(); i++) {
204 _graph_empty = false;
206 _finished_refcount = _init_finished_refcount[chain];
208 /* Trigger the initial nodes for processing, which are the ones at the `input' end */
209 pthread_mutex_lock (&_trigger_mutex);
210 for (i=_init_trigger_list[chain].begin(); i!=_init_trigger_list[chain].end(); i++) {
211 /* don't use ::trigger here, as we have already locked the mutex */
212 _trigger_queue.push_back (i->get ());
214 pthread_mutex_unlock (&_trigger_mutex);
218 Graph::trigger (GraphNode* n)
220 pthread_mutex_lock (&_trigger_mutex);
221 _trigger_queue.push_back (n);
222 pthread_mutex_unlock (&_trigger_mutex);
225 /** Called when a node at the `output' end of the chain (ie one that has no-one to feed)
231 if (g_atomic_int_dec_and_test (&_finished_refcount)) {
233 /* We have run all the nodes that are at the `output' end of
234 the graph, so there is nothing more to do this time around.
242 Graph::restart_cycle()
244 // we are through. wakeup our caller.
247 _callback_done_sem.signal ();
249 /* Block until the a process callback triggers us */
250 _callback_start_sem.wait();
262 // returning will restart the cycle.
263 // starting with waking up the others.
266 /** Rechain our stuff using a list of routes (which can be in any order) and
267 * a directed graph of their interconnections, which is guaranteed to be
272 Graph::rechain (boost::shared_ptr<RouteList> routelist, GraphEdges const & edges)
274 Glib::Mutex::Lock ls (_swap_mutex);
276 int chain = _setup_chain;
277 DEBUG_TRACE (DEBUG::Graph, string_compose ("============== setup %1\n", chain));
279 /* This will become the number of nodes that do not feed any other node;
280 once we have processed this number of those nodes, we have finished.
282 _init_finished_refcount[chain] = 0;
284 /* This will become a list of nodes that are not fed by another node, ie
285 those at the `input' end.
287 _init_trigger_list[chain].clear();
289 _nodes_rt[chain].clear();
291 /* Clear things out, and make _nodes_rt[chain] a copy of routelist */
292 for (RouteList::iterator ri=routelist->begin(); ri!=routelist->end(); ri++) {
293 (*ri)->_init_refcount[chain] = 0;
294 (*ri)->_activation_set[chain].clear();
295 _nodes_rt[chain].push_back (*ri);
298 // now add refs for the connections.
300 for (node_list_t::iterator ni = _nodes_rt[chain].begin(); ni != _nodes_rt[chain].end(); ni++) {
302 boost::shared_ptr<Route> r = boost::dynamic_pointer_cast<Route> (*ni);
304 /* The routes that are directly fed by r */
305 set<GraphVertex> fed_from_r = edges.from (r);
307 /* Hence whether r has an output */
308 bool const has_output = !fed_from_r.empty ();
310 /* Set up r's activation set */
311 for (set<GraphVertex>::iterator i = fed_from_r.begin(); i != fed_from_r.end(); ++i) {
312 r->_activation_set[chain].insert (*i);
315 /* r has an input if there are some incoming edges to r in the graph */
316 bool const has_input = !edges.has_none_to (r);
318 /* Increment the refcount of any route that we directly feed */
319 for (node_set_t::iterator ai = r->_activation_set[chain].begin(); ai != r->_activation_set[chain].end(); ai++) {
320 (*ai)->_init_refcount[chain] += 1;
324 /* no input, so this node needs to be triggered initially to get things going */
325 _init_trigger_list[chain].push_back (*ni);
329 /* no output, so this is one of the nodes that we can count off to decide
332 _init_finished_refcount[chain] += 1;
336 _pending_chain = chain;
340 /** Called by both the main thread and all helpers.
341 * @return true to quit, false to carry on.
348 pthread_mutex_lock (&_trigger_mutex);
349 if (_trigger_queue.size()) {
350 to_run = _trigger_queue.back();
351 _trigger_queue.pop_back();
356 /* the number of threads that are asleep */
357 int et = _execution_tokens;
358 /* the number of nodes that need to be run */
359 int ts = _trigger_queue.size();
361 /* hence how many threads to wake up */
362 int wakeup = min (et, ts);
363 /* update the number of threads that will still be sleeping */
364 _execution_tokens -= wakeup;
366 DEBUG_TRACE(DEBUG::ProcessThreads, string_compose ("%1 signals %2\n", pthread_self(), wakeup));
368 for (int i = 0; i < wakeup; i++) {
369 _execution_sem.signal ();
372 while (to_run == 0) {
373 _execution_tokens += 1;
374 pthread_mutex_unlock (&_trigger_mutex);
375 DEBUG_TRACE (DEBUG::ProcessThreads, string_compose ("%1 goes to sleep\n", pthread_self()));
376 _execution_sem.wait ();
380 DEBUG_TRACE (DEBUG::ProcessThreads, string_compose ("%1 is awake\n", pthread_self()));
381 pthread_mutex_lock (&_trigger_mutex);
382 if (_trigger_queue.size()) {
383 to_run = _trigger_queue.back();
384 _trigger_queue.pop_back();
387 pthread_mutex_unlock (&_trigger_mutex);
390 to_run->finish (_current_chain);
392 DEBUG_TRACE(DEBUG::ProcessThreads, string_compose ("%1 has finished run_one()\n", pthread_self()));
398 Graph::helper_thread()
400 suspend_rt_malloc_checks ();
401 ProcessThread* pt = new ProcessThread ();
402 resume_rt_malloc_checks ();
415 /** Here's the main graph thread */
419 suspend_rt_malloc_checks ();
420 ProcessThread* pt = new ProcessThread ();
421 resume_rt_malloc_checks ();
426 _callback_start_sem.wait ();
428 DEBUG_TRACE(DEBUG::ProcessThreads, "main thread is awake\n");
436 if (_graph_empty && !_quit_threads) {
437 _callback_done_sem.signal ();
438 DEBUG_TRACE(DEBUG::ProcessThreads, "main thread sees graph done, goes back to sleep\n");
442 /* This loop will run forever */
444 DEBUG_TRACE(DEBUG::ProcessThreads, "main thread runs one graph node\n");
454 Graph::dump (int chain)
457 node_list_t::iterator ni;
458 node_set_t::iterator ai;
460 chain = _pending_chain;
462 DEBUG_TRACE (DEBUG::Graph, "--------------------------------------------Graph dump:\n");
463 for (ni=_nodes_rt[chain].begin(); ni!=_nodes_rt[chain].end(); ni++) {
464 boost::shared_ptr<Route> rp = boost::dynamic_pointer_cast<Route>( *ni);
465 DEBUG_TRACE (DEBUG::Graph, string_compose ("GraphNode: %1 refcount: %2\n", rp->name().c_str(), (*ni)->_init_refcount[chain]));
466 for (ai=(*ni)->_activation_set[chain].begin(); ai!=(*ni)->_activation_set[chain].end(); ai++) {
467 DEBUG_TRACE (DEBUG::Graph, string_compose (" triggers: %1\n", boost::dynamic_pointer_cast<Route>(*ai)->name().c_str()));
471 DEBUG_TRACE (DEBUG::Graph, "------------- trigger list:\n");
472 for (ni=_init_trigger_list[chain].begin(); ni!=_init_trigger_list[chain].end(); ni++) {
473 DEBUG_TRACE (DEBUG::Graph, string_compose ("GraphNode: %1 refcount: %2\n", boost::dynamic_pointer_cast<Route>(*ni)->name().c_str(), (*ni)->_init_refcount[chain]));
476 DEBUG_TRACE (DEBUG::Graph, string_compose ("final activation refcount: %1\n", _init_finished_refcount[chain]));
481 Graph::silent_process_routes (pframes_t nframes, framepos_t start_frame, framepos_t end_frame, bool& need_butler)
483 _process_nframes = nframes;
484 _process_start_frame = start_frame;
485 _process_end_frame = end_frame;
487 _process_silent = true;
488 _process_noroll = false;
490 _process_need_butler = false;
493 DEBUG_TRACE(DEBUG::ProcessThreads, "wake graph for silent process\n");
494 _callback_start_sem.signal ();
495 _callback_done_sem.wait ();
498 need_butler = _process_need_butler;
500 return _process_retval;
504 Graph::process_routes (pframes_t nframes, framepos_t start_frame, framepos_t end_frame, int declick, bool& need_butler)
506 DEBUG_TRACE (DEBUG::ProcessThreads, string_compose ("graph execution from %1 to %2 = %3\n", start_frame, end_frame, nframes));
508 _process_nframes = nframes;
509 _process_start_frame = start_frame;
510 _process_end_frame = end_frame;
511 _process_declick = declick;
513 _process_silent = false;
514 _process_noroll = false;
516 _process_need_butler = false;
518 DEBUG_TRACE(DEBUG::ProcessThreads, "wake graph for non-silent process\n");
519 _callback_start_sem.signal ();
520 _callback_done_sem.wait ();
522 DEBUG_TRACE (DEBUG::ProcessThreads, "graph execution complete\n");
524 need_butler = _process_need_butler;
526 return _process_retval;
530 Graph::routes_no_roll (pframes_t nframes, framepos_t start_frame, framepos_t end_frame,
531 bool non_rt_pending, int declick)
533 DEBUG_TRACE (DEBUG::ProcessThreads, string_compose ("no-roll graph execution from %1 to %2 = %3\n", start_frame, end_frame, nframes));
535 _process_nframes = nframes;
536 _process_start_frame = start_frame;
537 _process_end_frame = end_frame;
538 _process_declick = declick;
539 _process_non_rt_pending = non_rt_pending;
541 _process_silent = false;
542 _process_noroll = true;
544 _process_need_butler = false;
546 DEBUG_TRACE(DEBUG::ProcessThreads, "wake graph for no-roll process\n");
547 _callback_start_sem.signal ();
548 _callback_done_sem.wait ();
550 return _process_retval;
553 Graph::process_one_route (Route* route)
555 bool need_butler = false;
560 DEBUG_TRACE (DEBUG::ProcessThreads, string_compose ("%1 runs route %2\n", pthread_self(), route->name()));
562 if (_process_silent) {
563 retval = route->silent_roll (_process_nframes, _process_start_frame, _process_end_frame, need_butler);
564 } else if (_process_noroll) {
565 route->set_pending_declick (_process_declick);
566 retval = route->no_roll (_process_nframes, _process_start_frame, _process_end_frame, _process_non_rt_pending);
568 route->set_pending_declick (_process_declick);
569 retval = route->roll (_process_nframes, _process_start_frame, _process_end_frame, _process_declick, need_butler);
573 _process_retval = retval;
577 _process_need_butler = true;
582 Graph::in_process_thread () const
584 for (list<pthread_t>::const_iterator i = _thread_list.begin (); i != _thread_list.end(); ++i) {
585 if (*i == pthread_self()) {