blob: aa04d9b20a0ae72666ab2747c044a9243f581bd5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
/*
Copyright (C) 2000 Paul Davis
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.
*/
#ifndef __ardour_graphnode_h__
#define __ardour_graphnode_h__
#include <list>
#include <set>
#include <vector>
#include <boost/shared_ptr.hpp>
namespace ARDOUR
{
class Graph;
class GraphNode;
typedef boost::shared_ptr<GraphNode> node_ptr_t;
typedef std::set< node_ptr_t > node_set_t;
typedef std::list< node_ptr_t > node_list_t;
/** A node on our processing graph, ie a Route */
class LIBARDOUR_API GraphNode
{
public:
GraphNode( boost::shared_ptr<Graph> Graph );
virtual ~GraphNode();
void prep( int chain );
void dec_ref();
void finish( int chain );
virtual void process();
private:
friend class Graph;
/** Nodes that we directly feed */
node_set_t _activation_set[2];
boost::shared_ptr<Graph> _graph;
gint _refcount;
/** The number of nodes that we directly feed us (one count for each chain) */
gint _init_refcount[2];
};
}
#endif
|
