ardour/livetrax
13
0
Fork 0
Code

style-guide-ification

Browse Source 
git-svn-id: svn://localhost/ardour2/branches/3.0@7231 d708f5d6-7413-0410-9779-e7cbd77b26cf
This commit is contained in:
Paul Davis 2010-06-04 12:03:14 +00:00
parent ea39189938
commit 04a10a9700
1 changed files with 40 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

62
libs/ardour/graphnode.cc
View File

@ -1,3 +1,22 @@
/*
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"
@ -5,44 +24,43 @@
using namespace ARDOUR;
// ========================================== GraphNode
GraphNode::GraphNode( graph_ptr_t graph )
: _graph(graph)
{ }
GraphNode::GraphNode (graph_ptr_t graph)
: _graph(graph)
{
}
void
GraphNode::prep( int chain )
GraphNode::prep (int chain)
{
_refcount = _init_refcount[chain];
_refcount = _init_refcount[chain];
}
void
GraphNode::dec_ref()
{
if (g_atomic_int_dec_and_test( &_refcount ))
_graph->trigger( this );
if (g_atomic_int_dec_and_test (&_refcount))
_graph->trigger (this);
}
void
GraphNode::finish( int chain )
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();
}
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) );
_graph->process_one_route (dynamic_cast<Route *>(this));
}