-
Notifications
You must be signed in to change notification settings - Fork 88
/
run_graph.rs
262 lines (223 loc) · 7.52 KB
/
run_graph.rs
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
use config::Config;
use crossbeam;
use errors::*;
use ex::{self, ExMode, Experiment};
use file;
use petgraph::Direction;
use petgraph::dot::Dot;
use petgraph::graph::{Graph, NodeIndex};
use petgraph::visit::EdgeRef;
use results::WriteResults;
use std::fmt;
use std::mem;
use std::path::Path;
use std::sync::Mutex;
use tasks::{Task, TaskStep};
pub enum Node {
Task(Task),
RunningTask,
CrateCompleted,
Root,
}
impl fmt::Debug for Node {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match *self {
Node::Task(ref task) => write!(f, "{:?}", task)?,
Node::RunningTask => write!(f, "running task")?,
Node::CrateCompleted => write!(f, "crate completed")?,
Node::Root => write!(f, "root")?,
}
Ok(())
}
}
enum WalkResult {
Task(NodeIndex, Task),
Blocked,
NotBlocked,
}
#[derive(Default)]
pub struct TasksGraph {
graph: Graph<Node, ()>,
root: NodeIndex,
completed_root: NodeIndex,
}
impl TasksGraph {
pub fn new() -> Self {
let mut graph = Graph::new();
let root = graph.add_node(Node::Root);
let completed_root = graph.add_node(Node::Root);
TasksGraph {
graph,
root,
completed_root,
}
}
pub fn add_task(&mut self, task: Task, deps: &[NodeIndex]) -> NodeIndex {
self.add_node(Node::Task(task), deps)
}
pub fn add_crate(&mut self, deps: &[NodeIndex]) -> NodeIndex {
let id = self.add_node(Node::CrateCompleted, deps);
self.graph.add_edge(self.root, id, ());
id
}
fn add_node(&mut self, node: Node, deps: &[NodeIndex]) -> NodeIndex {
let id = self.graph.add_node(node);
for dep in deps {
self.graph.add_edge(id, *dep, ());
}
id
}
pub fn next_task(&mut self) -> Option<(NodeIndex, Task)> {
let root = self.root;
if let WalkResult::Task(id, task) = self.walk_graph(root) {
Some((id, task))
} else {
None
}
}
fn walk_graph(&mut self, node: NodeIndex) -> WalkResult {
let mut dependencies = 0;
// Try to check for the dependencies of this node
// The list is collected to make the borrowchecker happy
let mut neighbors = self.graph.neighbors(node).collect::<Vec<_>>();
for neighbor in neighbors.drain(..) {
match self.walk_graph(neighbor) {
WalkResult::Task(id, task) => return WalkResult::Task(id, task),
WalkResult::Blocked => dependencies += 1,
WalkResult::NotBlocked => {}
}
}
if dependencies == 0 {
match self.graph[node] {
Node::Task(_) => {
let content = mem::replace(&mut self.graph[node], Node::RunningTask);
if let Node::Task(task) = content {
WalkResult::Task(node, task)
} else {
unreachable!();
}
}
Node::RunningTask => WalkResult::Blocked,
Node::CrateCompleted => {
// All the steps for this crate were completed
self.mark_as_completed(node);
WalkResult::NotBlocked
}
Node::Root => WalkResult::NotBlocked,
}
} else {
WalkResult::Blocked
}
}
pub fn mark_as_completed(&mut self, node: NodeIndex) {
// Remove all the edges from this node, and move the node to the completed root.
// The node is not removed because node IDs are not stable, so removing one node changes
// the ID of the other ones.
let mut edges = self.graph
.edges_directed(node, Direction::Incoming)
.map(|e| e.id())
.collect::<Vec<_>>();
for edge in edges.drain(..) {
self.graph.remove_edge(edge);
}
self.graph.add_edge(self.completed_root, node, ());
}
}
fn build_graph(ex: &Experiment, config: &Config) -> TasksGraph {
let mut graph = TasksGraph::new();
for krate in &ex.crates {
if config.should_skip(krate) {
continue;
}
let prepare_id = graph.add_task(
Task {
krate: krate.clone(),
step: TaskStep::Prepare,
},
&[],
);
let quiet = config.is_quiet(krate);
let mut builds = Vec::new();
for tc in &ex.toolchains {
let build_id = graph.add_task(
Task {
krate: krate.clone(),
step: match ex.mode {
ExMode::BuildOnly => TaskStep::BuildOnly {
tc: tc.clone(),
quiet,
},
ExMode::BuildAndTest if config.should_skip(krate) => TaskStep::BuildOnly {
tc: tc.clone(),
quiet,
},
ExMode::BuildAndTest => TaskStep::BuildAndTest {
tc: tc.clone(),
quiet,
},
ExMode::CheckOnly => TaskStep::CheckOnly {
tc: tc.clone(),
quiet,
},
ExMode::UnstableFeatures => TaskStep::UnstableFeatures { tc: tc.clone() },
},
},
&[prepare_id],
);
builds.push(build_id);
}
graph.add_crate(&builds);
}
graph
}
pub fn run_ex<DB: WriteResults + Sync>(
ex: &Experiment,
db: &DB,
threads_count: usize,
config: &Config,
) -> Result<()> {
info!("computing the tasks graph...");
let graph = Mutex::new(build_graph(ex, config));
info!("preparing the execution...");
ex::prepare_all_toolchains(ex)?;
info!("running tasks in {} threads...", threads_count);
crossbeam::scope(|scope| -> Result<()> {
let mut threads = Vec::new();
for i in 0..threads_count {
let name = format!("worker-{}", i);
let join = scope.builder().name(name).spawn(|| -> Result<()> {
// This uses a `loop` instead of a `while let` to avoid locking the graph too much
loop {
let option_task = graph.lock().unwrap().next_task();
if let Some((id, task)) = option_task {
info!("running task: {:?}", task);
task.run(ex, db)?;
graph.lock().unwrap().mark_as_completed(id);
} else {
break;
}
}
Ok(())
})?;
threads.push(join);
}
for thread in threads.drain(..) {
thread.join()?;
}
Ok(())
})?;
// Only the root node must be present
let mut g = graph.lock().unwrap();
assert!(g.next_task().is_none());
assert_eq!(g.graph.neighbors(g.root).count(), 0);
Ok(())
}
pub fn dump_dot(ex_name: &str, config: &Config, dest: &Path) -> Result<()> {
let ex = Experiment::load(ex_name)?;
info!("computing the tasks graph...");
let graph = build_graph(&ex, config);
info!("dumping the tasks graph...");
file::write_string(dest, &format!("{:?}", Dot::new(&graph.graph)))?;
info!("tasks graph available in {}", dest.to_string_lossy());
Ok(())
}