smokephil/ardour
1
0
Fork 0
mirror of https://github.com/Ardour/ardour.git synced 2025-12-20 05:36:31 +01:00
Code Issues Projects Releases Wiki Activity

NO-OP: whitespace

Browse source
This commit is contained in:
Robin Gareus 2017-04-22 16:09:10 +02:00
parent 51f184e1a2
commit dd1bf47394
1 changed files with 229 additions and 230 deletions
Download patch file Download diff file Expand all files Collapse all files

17
libs/ardour/graph.cc
View file

@ -62,7 +62,7 @@ Graph::Graph (Session & session)
pthread_mutex_init( &_trigger_mutex, NULL);
/* XXX: rather hacky `fix' to stop _trigger_queue.push_back() allocating
memory in the RT thread.
* memory in the RT thread.
*/
_trigger_queue.reserve (8192);
@ -104,7 +104,7 @@ Graph::reset_thread_list ()
assert (num_threads > 1);
/* don't bother doing anything here if we already have the right
number of threads.
* number of threads.
*/
if (AudioEngine::instance()->process_thread_count() == num_threads) {
@ -183,7 +183,7 @@ Graph::clear_other_chain ()
break;
}
/* setup chain == pending chain - we have
to wait till this is no longer true.
* to wait till this is no longer true.
*/
_cleanup_cond.wait (_swap_mutex);
}
@ -242,7 +242,7 @@ Graph::dec_ref()
if (g_atomic_int_dec_and_test (const_cast<gint*> (&_finished_refcount))) {
/* We have run all the nodes that are at the `output' end of
the graph, so there is nothing more to do this time around.
* the graph, so there is nothing more to do this time around.
*/
restart_cycle ();
@ -254,7 +254,7 @@ Graph::restart_cycle()
{
// we are through. wakeup our caller.
again:
again:
_callback_done_sem.signal ();
/* Block until the a process callback triggers us */
@ -278,7 +278,6 @@ Graph::restart_cycle()
* a directed graph of their interconnections, which is guaranteed to be
* acyclic.
*/
void
Graph::rechain (boost::shared_ptr<RouteList> routelist, GraphEdges const & edges)
{
@ -288,12 +287,12 @@ Graph::rechain (boost::shared_ptr<RouteList> routelist, GraphEdges const & edges
DEBUG_TRACE (DEBUG::Graph, string_compose ("============== setup %1\n", chain));
/* This will become the number of nodes that do not feed any other node;
once we have processed this number of those nodes, we have finished.
* once we have processed this number of those nodes, we have finished.
*/
_init_finished_refcount[chain] = 0;
/* This will become a list of nodes that are not fed by another node, ie
those at the `input' end.
* those at the `input' end.
*/
_init_trigger_list[chain].clear();
@ -338,7 +337,7 @@ Graph::rechain (boost::shared_ptr<RouteList> routelist, GraphEdges const & edges
if (!has_output) {
/* no output, so this is one of the nodes that we can count off to decide
if we've finished
* if we've finished
*/
_init_finished_refcount[chain] += 1;
}