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.
21 #include "ardour/graph.h"
22 #include "ardour/graphnode.h"
23 #include "ardour/route.h"
25 using namespace ARDOUR;
27 GraphNode::GraphNode (boost::shared_ptr<Graph> graph)
32 GraphNode::~GraphNode ()
37 GraphNode::prep (int chain)
39 /* This is the number of nodes that directly feed us */
40 g_atomic_int_set (&_refcount, _init_refcount[chain]);
43 /** Called by an upstream node, when it has completed processing */
47 /* check if we can run */
48 if (g_atomic_int_dec_and_test (&_refcount)) {
49 #if 0 // TODO optimize: remove prep()
50 /* reset reference count for next cycle */
51 g_atomic_int_set (&_refcount, _init_refcount[chain]);
53 /* All nodes that feed this node have completed, so this node be processed now. */
54 _graph->trigger (this);
59 GraphNode::finish (int chain)
61 node_set_t::iterator i;
64 /* Notify downstream nodes that depend on this node */
65 for (i = _activation_set[chain].begin (); i != _activation_set[chain].end (); ++i) {
71 /* This node is a terminal node that does not feed another note,
72 * so notify the graph to decrement the the finished count */
73 _graph->reached_terminal_node ();
80 _graph->process_one_route (dynamic_cast<Route*> (this));