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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
Copyright (C) 2011 Paul Davis
Author: Carl Hetherington <cth@carlh.net>
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/route.h"
#include "ardour/route_dag.h"
#include "i18n.h"
using namespace std;
using namespace ARDOUR;
void
DAGEdges::add (DAGVertex from, DAGVertex to)
{
insert (_from_to, from, to);
insert (_to_from, to, from);
EdgeMap::iterator i = _from_to.find (from);
if (i != _from_to.end ()) {
i->second.insert (to);
} else {
set<DAGVertex> v;
v.insert (to);
_from_to.insert (make_pair (from, v));
}
}
set<DAGVertex>
DAGEdges::from (DAGVertex r) const
{
EdgeMap::const_iterator i = _from_to.find (r);
if (i == _from_to.end ()) {
return set<DAGVertex> ();
}
return i->second;
}
void
DAGEdges::remove (DAGVertex from, DAGVertex to)
{
EdgeMap::iterator i = _from_to.find (from);
assert (i != _from_to.end ());
i->second.erase (to);
if (i->second.empty ()) {
_from_to.erase (i);
}
EdgeMap::iterator j = _to_from.find (to);
assert (j != _to_from.end ());
j->second.erase (from);
if (j->second.empty ()) {
_to_from.erase (j);
}
}
/** @param to `To' route.
* @return true if there are no edges going to `to'.
*/
bool
DAGEdges::has_none_to (DAGVertex to) const
{
return _to_from.find (to) == _to_from.end ();
}
bool
DAGEdges::empty () const
{
assert (_from_to.empty () == _to_from.empty ());
return _from_to.empty ();
}
void
DAGEdges::dump () const
{
for (EdgeMap::const_iterator i = _from_to.begin(); i != _from_to.end(); ++i) {
cout << "FROM: " << i->first->name() << " ";
for (set<DAGVertex>::const_iterator j = i->second.begin(); j != i->second.end(); ++j) {
cout << (*j)->name() << " ";
}
cout << "\n";
}
for (EdgeMap::const_iterator i = _to_from.begin(); i != _to_from.end(); ++i) {
cout << "TO: " << i->first->name() << " ";
for (set<DAGVertex>::const_iterator j = i->second.begin(); j != i->second.end(); ++j) {
cout << (*j)->name() << " ";
}
cout << "\n";
}
}
void
DAGEdges::insert (EdgeMap& e, DAGVertex a, DAGVertex b)
{
EdgeMap::iterator i = e.find (a);
if (i != e.end ()) {
i->second.insert (b);
} else {
set<DAGVertex> v;
v.insert (b);
e.insert (make_pair (a, v));
}
}
struct RouteRecEnabledComparator
{
bool operator () (DAGVertex r1, DAGVertex r2) const
{
if (r1->record_enabled()) {
if (r2->record_enabled()) {
/* both rec-enabled, just use signal order */
return r1->order_key(N_("signal")) < r2->order_key(N_("signal"));
} else {
/* r1 rec-enabled, r2 not rec-enabled, run r2 early */
return false;
}
} else {
if (r2->record_enabled()) {
/* r2 rec-enabled, r1 not rec-enabled, run r1 early */
return true;
} else {
/* neither rec-enabled, use signal order */
return r1->order_key(N_("signal")) < r2->order_key(N_("signal"));
}
}
}
};
/** Perform a topological sort of a list of routes using a directed graph representing connections.
* @return Sorted list of routes, or 0 if the graph contains cycles (feedback loops).
*/
boost::shared_ptr<RouteList>
ARDOUR::topological_sort (
boost::shared_ptr<RouteList> routes,
DAGEdges edges
)
{
boost::shared_ptr<RouteList> sorted_routes (new RouteList);
/* queue of routes to process */
RouteList queue;
/* initial queue has routes that are not fed by anything */
for (RouteList::iterator i = routes->begin(); i != routes->end(); ++i) {
if ((*i)->not_fed ()) {
queue.push_back (*i);
}
}
/* Sort the initial queue so that non-rec-enabled routes are run first.
This is so that routes can record things coming from other routes
via external connections.
*/
queue.sort (RouteRecEnabledComparator ());
/* Do the sort: algorithm is Kahn's from Wikipedia.
`Topological sorting of large networks', Communications of the ACM 5(11):558-562.
*/
while (!queue.empty ()) {
DAGVertex r = queue.front ();
queue.pop_front ();
sorted_routes->push_back (r);
set<DAGVertex> e = edges.from (r);
for (set<DAGVertex>::iterator i = e.begin(); i != e.end(); ++i) {
edges.remove (r, *i);
if (edges.has_none_to (*i)) {
queue.push_back (*i);
}
}
}
if (!edges.empty ()) {
/* There are cycles in the graph, so we can't do a topological sort */
return boost::shared_ptr<RouteList> ();
}
return sorted_routes;
}
|
