David Robillard
a473d630eb
git-svn-id: svn://localhost/ardour2/branches/3.0@9654 d708f5d6-7413-0410-9779-e7cbd77b26cf
71 lines
1.6 KiB
C++
71 lines
1.6 KiB
C++
/*
|
|
Copyright (C) 2010 Paul Davis
|
|
Author: Torben Hohn
|
|
|
|
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 "ardour/graph.h"
|
|
#include "ardour/graphnode.h"
|
|
#include "ardour/route.h"
|
|
|
|
using namespace ARDOUR;
|
|
|
|
GraphNode::GraphNode (graph_ptr_t graph)
|
|
: _graph(graph)
|
|
{
|
|
}
|
|
|
|
GraphNode::~GraphNode()
|
|
{
|
|
}
|
|
|
|
void
|
|
GraphNode::prep (int chain)
|
|
{
|
|
_refcount = _init_refcount[chain];
|
|
}
|
|
|
|
void
|
|
GraphNode::dec_ref()
|
|
{
|
|
if (g_atomic_int_dec_and_test (&_refcount))
|
|
_graph->trigger (this);
|
|
}
|
|
|
|
void
|
|
GraphNode::finish (int chain)
|
|
{
|
|
node_set_t::iterator i;
|
|
bool feeds_somebody = false;
|
|
|
|
for (i=_activation_set[chain].begin(); i!=_activation_set[chain].end(); i++) {
|
|
(*i)->dec_ref();
|
|
feeds_somebody = true;
|
|
}
|
|
|
|
if (!feeds_somebody) {
|
|
_graph->dec_ref();
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
GraphNode::process()
|
|
{
|
|
_graph->process_one_route (dynamic_cast<Route *>(this));
|
|
}
|