add missing graph.cc and friends :S

git-svn-id: svn://localhost/ardour2/branches/3.0@7225 d708f5d6-7413-0410-9779-e7cbd77b26cf

1 files changed, 137 insertions, 0 deletions

diff --git a/libs/ardour/ardour/graph.h b/libs/ardour/ardour/graph.h
new file mode 100644
index 0000000000..e8bae4a32c
--- /dev/null
+++ b/libs/ardour/ardour/graph.h
@@ -0,0 +1,137 @@
+/*
+    Copyright (C) 2010 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_graph_h__
+#define __ardour_graph_h__
+
+
+#include <list>
+#include <set>
+#include <vector>
+#include <string>
+
+#include <boost/shared_ptr.hpp>
+
+#include <glib/gatomic.h>
+#include <cassert>
+
+#include <pthread.h>
+#include <semaphore.h>
+
+#include <ardour/types.h>
+#include <ardour/session_handle.h>
+
+namespace ARDOUR
+{
+
+class GraphNode;
+class Graph;
+
+class Route;
+class Session;
+
+typedef boost::shared_ptr<GraphNode> node_ptr_t;
+typedef boost::shared_ptr<Graph> graph_ptr_t;
+
+typedef std::list< node_ptr_t > node_list_t;
+typedef std::set< node_ptr_t > node_set_t;
+
+
+
+class Graph : public SessionHandleRef
+{
+    public:
+	Graph( Session & session );
+
+	void prep();
+	void trigger( GraphNode * n );
+	void rechain( boost::shared_ptr<RouteList> r );
+
+	void dump( int chain );
+	void process();
+	void dec_ref();
+	void restart_cycle();
+
+	bool run_one();
+	void helper_thread();
+	void main_thread();
+
+	int silent_process_routes (nframes_t nframes, sframes_t start_frame, sframes_t end_frame,
+                bool can_record, bool rec_monitors_input, bool& need_butler );
+
+	int process_routes (nframes_t nframes, sframes_t start_frame, sframes_t end_frame, int declick,
+                bool can_record, bool rec_monitors_input, bool& need_butler );
+
+        int routes_no_roll (nframes_t nframes, sframes_t start_frame, sframes_t end_frame, 
+                bool non_rt_pending, bool can_record, int declick);
+
+	void process_one_route( Route * route );
+
+    protected:
+        virtual void session_going_away ();
+
+    private:
+        std::list<Glib::Thread *> _thread_list;
+        volatile bool _quit_threads;
+        
+	node_list_t _nodes;
+	node_list_t _nodes_rt[2];
+
+	node_list_t _init_trigger_list[2];
+
+	std::vector<GraphNode *> _trigger_queue;
+	pthread_mutex_t _trigger_mutex;
+
+
+	sem_t _execution_sem;
+
+	sem_t _callback_start_sem;
+	sem_t _callback_done_sem;
+
+	volatile gint _execution_tokens;
+	volatile gint _finished_refcount;
+	volatile gint _init_finished_refcount[2];
+
+        bool _graph_empty;
+
+	// chain swapping
+	pthread_mutex_t _swap_mutex;
+	volatile int _current_chain;
+	volatile int _pending_chain;
+	volatile int _setup_chain;
+
+	// parameter caches.
+	nframes_t	_process_nframes;
+	sframes_t	_process_start_frame;
+	sframes_t	_process_end_frame;
+	bool		_process_can_record;
+	bool		_process_rec_monitors_input;
+	bool		_process_non_rt_pending;
+	int		_process_declick;
+
+	bool		_process_silent;
+	bool		_process_noroll;
+	int		_process_retval;
+	bool		_process_need_butler;
+};
+
+}
+
+#endif