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
_refcount = _init_refcount[chain];
43
/** Called by another node to tell us that one of the nodes that feed us
49
if (g_atomic_int_dec_and_test (&_refcount)) {
50
/* All the nodes that feed us are done, so we can queue this node
53
_graph->trigger (this);
58
GraphNode::finish (int chain)
60
node_set_t::iterator i;
61
bool feeds_somebody = false;
63
/* Tell the nodes that we feed that we've finished */
64
for (i=_activation_set[chain].begin(); i!=_activation_set[chain].end(); i++) {
66
feeds_somebody = true;
69
if (!feeds_somebody) {
70
/* This node does not feed anybody, so decrement the graph's finished count */
79
_graph->process_one_route (dynamic_cast<Route *>(this));