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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/*
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.
*/
#ifndef __ardour_graph_h__
#define __ardour_graph_h__
#include <list>
#include <set>
#include <vector>
#include <string>
#include <boost/shared_ptr.hpp>
#include <glib.h>
#include "pbd/semutils.h"
#include "ardour/libardour_visibility.h"
#include "ardour/types.h"
#include "ardour/audio_backend.h"
#include "ardour/session_handle.h"
namespace ARDOUR
{
class GraphNode;
class Graph;
class Route;
class Session;
class GraphEdges;
typedef boost::shared_ptr<GraphNode> node_ptr_t;
typedef std::list< node_ptr_t > node_list_t;
typedef std::set< node_ptr_t > node_set_t;
class LIBARDOUR_API Graph : public SessionHandleRef
{
public:
Graph (Session & session);
void trigger (GraphNode * n);
void rechain (boost::shared_ptr<RouteList>, GraphEdges const &);
void dump (int chain);
void dec_ref();
void helper_thread();
int process_routes (pframes_t nframes, samplepos_t start_sample, samplepos_t end_sample, bool& need_butler);
int routes_no_roll (pframes_t nframes, samplepos_t start_sample, samplepos_t end_sample, bool non_rt_pending );
void process_one_route (Route * route);
void clear_other_chain ();
bool in_process_thread () const;
protected:
virtual void session_going_away ();
private:
volatile bool _threads_active;
void reset_thread_list ();
void drop_threads ();
void restart_cycle();
bool run_one();
void main_thread();
void prep();
node_list_t _nodes_rt[2];
node_list_t _init_trigger_list[2];
std::vector<GraphNode *> _trigger_queue;
pthread_mutex_t _trigger_mutex;
PBD::Semaphore _execution_sem;
/** Signalled to start a run of the graph for a process callback */
PBD::Semaphore _callback_start_sem;
PBD::Semaphore _callback_done_sem;
/** The number of processing threads that are asleep */
volatile gint _execution_tokens;
/** The number of unprocessed nodes that do not feed any other node; updated during processing */
volatile gint _finished_refcount;
/** The initial number of nodes that do not feed any other node (for each chain) */
volatile gint _init_finished_refcount[2];
bool _graph_empty;
// chain swapping
Glib::Threads::Mutex _swap_mutex;
Glib::Threads::Cond _cleanup_cond;
volatile int _current_chain;
volatile int _pending_chain;
volatile int _setup_chain;
// parameter caches.
pframes_t _process_nframes;
samplepos_t _process_start_sample;
samplepos_t _process_end_sample;
bool _process_can_record;
bool _process_non_rt_pending;
bool _process_noroll;
int _process_retval;
bool _process_need_butler;
// enginer / thread connection
PBD::ScopedConnectionList engine_connections;
void engine_stopped ();
};
} // namespace
#endif /* __ardour_graph_h__ */
|
