generated from EmbarkStudios/opensource-template
/
util.rs
242 lines (198 loc) Β· 6.56 KB
/
util.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
#![allow(dead_code)]
use std::{fmt, path::Path};
pub struct JustId(pub krates::Kid);
pub type Graph = krates::Krates<JustId>;
impl From<krates::cm::Package> for JustId {
fn from(pkg: krates::cm::Package) -> Self {
Self(pkg.id)
}
}
impl fmt::Display for JustId {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.write_str(&self.0.repr)
}
}
pub struct Grafs {
pub actual: Graph,
pub filtered: Vec<krates::Kid>,
pub simple: SimpleGraph,
}
impl Grafs {
#[inline]
pub fn dotgraph(&self) -> String {
krates::petgraph::dot::Dot::new(self.actual.graph()).to_string()
}
}
pub fn build<P: AsRef<Path>>(src: P, kb: krates::Builder) -> Result<Grafs, String> {
let contents = std::fs::read_to_string(Path::new("tests").join(src))
.map_err(|e| format!("failed to load metadata file: {e}"))?;
let md: krates::cm::Metadata = serde_json::from_str(&contents)
.map_err(|e| format!("failed to deserialize metadata: {e}"))?;
let resolved = md.resolve.as_ref().cloned().unwrap();
let simple = SimpleGraph {
workspace: md.workspace_members.clone(),
nodes: resolved
.nodes
.into_iter()
.map(|rnode| {
(
rnode.id,
rnode
.deps
.into_iter()
.flat_map(|d| {
let id = d.pkg;
d.dep_kinds.into_iter().map(move |dk| {
(
id.clone(),
krates::Edge::Dep {
kind: dk.kind.into(),
cfg: dk.target.map(|f| f.to_string()),
},
)
})
})
.collect(),
)
})
.collect(),
};
let mut filtered = Vec::new();
let graph = kb
.build_with_metadata(md, |f: krates::cm::Package| {
filtered.push(f.id);
})
.map_err(|e| format!("failed to build graph: {e}"))?;
filtered.sort();
Ok(Grafs {
actual: graph,
filtered,
simple,
})
}
#[macro_export]
macro_rules! graph {
{ $($id:expr => [$($did:expr; $kind:ident $(@ $cfg:expr)?),* $(,)?]),+ $(,)? } => {{
let mut _sg = $crate::util::SimpleGraph {
nodes: Vec::new(),
};
$(
let mut _deps = Vec::new();
$(
let mut _cfg = None;
$(
_cfg = Some($cfg.to_owned());
)?
_deps.push(($crate::util::make_kid($did), krates::Edge {
kind: krates::DepKind::$kind,
cfg: _cfg,
}));
)*
_sg.nodes.push(($crate::util::make_kid($id), _deps));
)+
_sg
}};
}
pub fn is_workspace(kid: &krates::Kid) -> bool {
kid.repr.starts_with("a ") || kid.repr.starts_with("b ") | kid.repr.starts_with("c ")
}
pub fn make_kid(s: &str) -> krates::Kid {
let mut i = s.splitn(3, ' ');
let name = i.next().unwrap();
let version = i.next().unwrap();
let source = i.next();
let source = match name {
which @ ("a" | "b" | "c") => {
format!("(path+file:///home/jake/code/krates/tests/ws/{which})")
}
_ => source
.unwrap_or("(registry+https://github.com/rust-lang/crates.io-index)")
.to_owned(),
};
krates::Kid {
repr: format!("{name} {version} {source}"),
}
}
pub struct SimpleGraph {
pub nodes: Vec<(krates::Kid, Vec<(krates::Kid, krates::Edge)>)>,
workspace: Vec<krates::Kid>,
}
impl SimpleGraph {
fn build<NF: Fn(&krates::Kid) -> bool, EF: Fn(EdgeFilter<'_>) -> bool>(
mut self,
nf: NF,
ef: EF,
) -> krates::petgraph::Graph<JustId, krates::Edge> {
self.nodes.sort_by(|a, b| a.0.cmp(&b.0));
let mut graph = krates::petgraph::Graph::new();
let mut edge_map = std::collections::HashMap::new();
let mut pkg_stack = Vec::new();
for kid in &self.workspace {
pkg_stack.push(kid);
}
while let Some(kid) = pkg_stack.pop() {
if nf(kid) {
continue;
}
let pkg = &self.nodes[self.nodes.binary_search_by(|(id, _)| id.cmp(kid)).unwrap()];
let mut edges: Vec<_> = pkg
.1
.iter()
.filter_map(|(pid, edge)| {
if ef(EdgeFilter {
source: kid,
target: pid,
dep: if let krates::Edge::Dep { kind, cfg } = edge {
Some(EdgeDepFilter {
kind: *kind,
cfg: cfg.as_deref(),
})
} else {
None
},
}) {
None
} else {
Some((pid, edge))
}
})
.collect();
edges.sort_by(|a, b| a.0.cmp(b.0));
for kid in edges.iter().map(|(kid, _)| kid) {
if !edge_map.contains_key(kid) {
pkg_stack.push(kid);
}
}
edge_map.insert(kid, edges);
}
let mut node_map = std::collections::HashMap::new();
for kid in self.nodes.iter().map(|(id, _)| id) {
if edge_map.contains_key(kid) {
node_map.insert(kid, graph.add_node(JustId(kid.clone())));
}
}
for kid in self.nodes.iter().map(|(id, _)| id) {
if let Some(source) = node_map.get(kid) {
let edges = edge_map.remove(kid).unwrap();
for (edge, target) in edges
.into_iter()
.filter_map(|edge| node_map.get(edge.0).map(|target| (edge, target)))
{
graph.add_edge(*source, *target, edge.1.clone());
}
} else {
println!("filtered {}", kid);
}
}
graph
}
}
pub struct EdgeDepFilter<'a> {
pub kind: krates::DepKind,
pub cfg: Option<&'a str>,
}
pub struct EdgeFilter<'a> {
pub source: &'a krates::Kid,
pub target: &'a krates::Kid,
pub dep: Option<EdgeDepFilter<'a>>,
}