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
|
use crate::index::*;
use crate::DepsErr;
use parking_lot::Mutex;
use rayon::prelude::*;
use string_interner::Sym;
type FxHashMap<K, V> = std::collections::HashMap<K, V, ahash::RandomState>;
type FxHashSet<V> = std::collections::HashSet<V, ahash::RandomState>;
pub type DepInfMap = FxHashMap<Box<str>, (DepInf, MiniVer)>;
pub struct DepsStats {
pub total: usize,
pub counts: FxHashMap<Box<str>, RevDependencies>,
}
#[derive(Debug, Clone, Default)]
pub struct RevDepCount {
pub def: u16,
pub opt: u16,
}
impl RevDepCount {
pub fn all(&self) -> u32 {
self.def as u32 + self.opt as u32
}
}
#[derive(Debug, Clone, Default)]
pub struct DirectDepCount {
pub runtime: u16,
pub build: u16,
pub dev: u16,
}
impl DirectDepCount {
pub fn all(&self) -> u32 {
self.runtime as u32 + self.build as u32 + self.dev as u32
}
}
#[derive(Debug, Clone, Default)]
pub struct RevDependencies {
/// Default, optional
pub runtime: RevDepCount,
pub build: RevDepCount,
pub dev: u16,
pub direct: DirectDepCount,
pub versions: FxHashMap<MiniVer, u16>,
pub rev_dep_names: CompactStringSet,
}
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
pub enum DepTy {
Runtime,
Build,
Dev,
}
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
pub struct DepInf {
pub direct: bool,
pub default: bool,
pub ty: DepTy,
}
pub struct DepVisitor {
node_visited: FxHashSet<(DepInf, *const Mutex<DepSet>)>,
}
impl DepVisitor {
pub fn new() -> Self {
Self {
node_visited: FxHashSet::with_capacity_and_hasher(120, Default::default()),
}
}
pub fn visit(&mut self, depset: &ArcDepSet, depinf: DepInf, mut cb: impl FnMut(&mut Self, &DepName, &Dep)) {
let target_addr: &Mutex<FxHashMap<DepName, Dep>> = &*depset;
if self.node_visited.insert((depinf, target_addr as *const _)) {
if let Some(depset) = depset.try_lock() {
for (name, dep) in depset.iter() {
cb(self, name, dep);
}
}
}
}
#[inline]
pub fn start(&mut self, dep: &Dep, depinf: DepInf, cb: impl FnMut(&mut DepVisitor, &ArcDepSet, DepInf)) {
self.recurse_inner(dep, DepInf { direct: true, ..depinf }, cb)
}
#[inline]
pub fn recurse(&mut self, dep: &Dep, depinf: DepInf, cb: impl FnMut(&mut DepVisitor, &ArcDepSet, DepInf)) {
self.recurse_inner(dep, DepInf { direct: false, ..depinf }, cb)
}
#[inline]
fn recurse_inner(&mut self, dep: &Dep, depinf: DepInf, mut cb: impl FnMut(&mut DepVisitor, &ArcDepSet, DepInf)) {
cb(self, &dep.runtime, depinf);
let ty = if depinf.ty == DepTy::Dev { DepTy::Dev } else { DepTy::Build };
cb(self, &dep.build, DepInf { ty, ..depinf });
}
}
impl Index {
pub fn all_dependencies_flattened(&self, c: &impl ICrate) -> Result<DepInfMap, DepsErr> {
let mut collected = FxHashMap::with_capacity_and_hasher(120, Default::default());
let mut visitor = DepVisitor::new();
flatten(&self.deps_of_crate(c, DepQuery {
default: true,
all_optional: false,
dev: false,
})?, DepInf {
default: true,
direct: true,
ty: DepTy::Runtime,
}, &mut collected, &mut visitor);
flatten(&self.deps_of_crate(c, DepQuery {
default: true,
all_optional: true,
dev: false,
})?, DepInf {
default: false, // false, because real defaults have already been set
direct: true,
ty: DepTy::Runtime,
}, &mut collected, &mut visitor);
flatten(&self.deps_of_crate(c, DepQuery {
default: true,
all_optional: true,
dev: true,
})?, DepInf {
default: false, // false, because real defaults have already been set
direct: true,
ty: DepTy::Dev,
}, &mut collected, &mut visitor);
if collected.is_empty() {
return Ok(FxHashMap::default());
}
let inter = self.inter.read();
let mut converted = FxHashMap::with_capacity_and_hasher(collected.len(), Default::default());
converted.extend(collected.into_iter().map(|(k, v)| {
let name = inter.resolve(k).expect("resolve");
debug_assert_eq!(name, name.to_ascii_lowercase());
debug_assert!(!name.is_empty());
(name.into(), v)
}));
Ok(converted)
}
pub fn get_deps_stats(&self) -> DepsStats {
let crates = self.crates_io_crates();
let crates: Vec<(Box<str>, FxHashMap<_,_>)> = crates
.par_iter()
.filter_map(|(_, c)| {
self.all_dependencies_flattened(c)
.ok()
.filter(|collected| !collected.is_empty())
.map(|dep| {
(c.name().to_ascii_lowercase().into(), dep)
})
}).collect();
self.clear_cache();
let total = crates.len();
let mut counts = FxHashMap::with_capacity_and_hasher(total, Default::default());
for (parent_name, deps) in crates {
for (name, (depinf, semver)) in deps {
let n = counts.entry(name).or_insert_with(RevDependencies::default);
let t = n.versions.entry(semver).or_insert(0);
*t = t.checked_add(1).expect("overflow");
if depinf.direct {
debug_assert!(!parent_name.is_empty());
n.rev_dep_names.push(&parent_name);
}
match depinf.ty {
DepTy::Runtime => {
if depinf.direct {n.direct.runtime = n.direct.runtime.checked_add(1).expect("overflow"); }
if depinf.default {
n.runtime.def = n.runtime.def.checked_add(1).expect("overflow");
} else {
n.runtime.opt = n.runtime.opt.checked_add(1).expect("overflow");
}
},
DepTy::Build => {
if depinf.direct {n.direct.build = n.direct.build.checked_add(1).expect("overflow"); }
if depinf.default {
n.build.def = n.build.def.checked_add(1).expect("overflow");
} else {
n.build.opt = n.build.opt.checked_add(1).expect("overflow");
}
},
DepTy::Dev => {
if depinf.direct {n.direct.dev = n.direct.dev.checked_add(1).expect("overflow"); }
n.dev = n.dev.checked_add(1).expect("overflow");
},
}
}
}
DepsStats { total, counts }
}
}
fn flatten(dep: &Dep, depinf: DepInf, collected: &mut FxHashMap<Sym, (DepInf, MiniVer)>, visitor: &mut DepVisitor) {
|
