2 Copyright (C) 2000 Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 #ifndef __ardour_graphnode_h__
22 #define __ardour_graphnode_h__
28 #include <boost/shared_ptr.hpp>
36 typedef boost::shared_ptr<GraphNode> node_ptr_t;
37 typedef std::set< node_ptr_t > node_set_t;
38 typedef std::list< node_ptr_t > node_list_t;
40 /** A node on our processing graph, ie a Route */
41 class LIBARDOUR_API GraphNode
44 GraphNode( boost::shared_ptr<Graph> Graph );
47 void prep( int chain );
49 void finish( int chain );
51 virtual void process();
56 /** Nodes that we directly feed */
57 node_set_t _activation_set[2];
59 boost::shared_ptr<Graph> _graph;
62 /** The number of nodes that we directly feed us (one count for each chain) */
63 gint _init_refcount[2];