diff options
Diffstat (limited to 'kitchen_sink/src/deps_stats.rs')
| -rw-r--r-- | kitchen_sink/src/deps_stats.rs | 250 |
1 files changed, 0 insertions, 250 deletions
diff --git a/kitchen_sink/src/deps_stats.rs b/kitchen_sink/src/deps_stats.rs deleted file mode 100644 index 437bbed..0000000 --- a/kitchen_sink/src/deps_stats.rs +++ /dev/null @@ -1,250 +0,0 @@ -use crate::index::*; -use crate::KitchenSinkErr; -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(crate) fn all_dependencies_flattened(&self, c: &impl ICrate) -> Result<DepInfMap, KitchenSinkErr> { - 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()); - (name.into(), v) - })); - Ok(converted) - } - - pub(crate) async 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 { - 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) { - visitor.start(dep, depinf, |vis, dep, depinf| flatten_set(dep, depinf, collected, vis)); -} - -fn flatten_set(depset: &ArcDepSet, depinf: DepInf, collected: &mut FxHashMap<Sym, (DepInf, MiniVer)>, visitor: &mut DepVisitor) { - visitor.visit(depset, depinf, |vis, (name, _), dep| { - collected.entry(name.clone()) - .and_modify(|(old, semver)| { - if depinf.default {old.default = true;} - if depinf.direct { - old.direct = true; - *semver = dep.semver.clone(); // direct version is most important; used for estimating out-of-date versions - } - match (old.ty, depinf.ty) { - (_, DepTy::Runtime) => {old.ty = DepTy::Runtime;}, - (DepTy::Dev, DepTy::Build) => {old.ty = DepTy::Build;}, - _ => {}, - } - }) - .or_insert((depinf, dep.semver.clone())); - vis.recurse(dep, depinf, |vis, dep, depinf| flatten_set(dep, depinf, collected, vis)); - }) -} - -#[derive(Debug, Clone, Default)] -pub struct CompactStringSet(String); - -impl CompactStringSet { - pub fn push(&mut self, s: &str) { - if !self.0.is_empty() { - self.0.reserve(1 + s.len()); - self.0.push('\0'); - } - self.0.push_str(s); - } - - pub fn iter(&self) -> impl Iterator<Item = &str> { - self.0.split('\0') - } -} |