aver/call_graph/
codegen.rs1use std::collections::{HashMap, HashSet};
2
3use crate::ast::FnDef;
4
5use super::collect_codegen_deps_body;
6use super::scc::{tarjan_sccs, topo_components};
7
8pub fn ordered_fn_components<'a>(
15 fns: &[&'a FnDef],
16 module_prefixes: &HashSet<String>,
17) -> Vec<Vec<&'a FnDef>> {
18 if fns.is_empty() {
19 return vec![];
20 }
21
22 let fn_map: HashMap<String, &FnDef> = fns.iter().map(|fd| (fd.name.clone(), *fd)).collect();
23 let names: Vec<String> = fn_map.keys().cloned().collect();
24 let name_set: HashSet<String> = names.iter().cloned().collect();
25
26 let mut graph: HashMap<String, Vec<String>> = HashMap::new();
27 for fd in fns {
28 let mut deps = HashSet::new();
29 collect_codegen_deps_body(&fd.body, &name_set, module_prefixes, &mut deps);
30 let mut sorted = deps.into_iter().collect::<Vec<_>>();
31 sorted.sort();
32 graph.insert(fd.name.clone(), sorted);
33 }
34
35 let sccs = tarjan_sccs(&names, &graph);
36 let mut comp_of: HashMap<String, usize> = HashMap::new();
37 for (idx, comp) in sccs.iter().enumerate() {
38 for name in comp {
39 comp_of.insert(name.clone(), idx);
40 }
41 }
42
43 let mut comp_graph: HashMap<usize, HashSet<usize>> = HashMap::new();
44 for (caller, deps) in &graph {
45 let from = comp_of[caller];
46 for callee in deps {
47 let to = comp_of[callee];
48 if from != to {
49 comp_graph.entry(from).or_default().insert(to);
50 }
51 }
52 }
53
54 let comp_order = topo_components(&sccs, &comp_graph);
55 comp_order
56 .into_iter()
57 .map(|idx| {
58 let mut group: Vec<&FnDef> = sccs[idx]
59 .iter()
60 .filter_map(|name| fn_map.get(name).copied())
61 .collect();
62 group.sort_by(|a, b| a.name.cmp(&b.name));
63 group
64 })
65 .collect()
66}