opam-graph/src/opam_graph.ml

79 lines
2.6 KiB
OCaml
Raw Normal View History

2021-12-20 13:25:23 +00:00
module Set = OpamPackage.Set
type package = OpamPackage.t
let packages (switch : OpamFile.SwitchExport.t) =
assert (Set.cardinal switch.selections.sel_pinned = 0);
assert (Set.cardinal switch.selections.sel_compiler = 0);
assert (Set.subset switch.selections.sel_roots switch.selections.sel_installed);
switch.selections.sel_installed
let root (switch : OpamFile.SwitchExport.t) =
assert (Set.cardinal switch.selections.sel_roots = 1);
Set.choose switch.selections.sel_roots
module Name_set = OpamPackage.Name.Set
let filtered_formula_to_pkgs (_switch : OpamFile.SwitchExport.t)
?(set = Name_set.empty) formula =
OpamFormula.fold_left (fun acc (name, _) -> Name_set.add name acc) set formula
let opam (switch : OpamFile.SwitchExport.t) pkg_name =
OpamPackage.Name.Map.find pkg_name switch.overlays
(* TODO depexts *)
(* TODO build / dev packages *)
(* TODO constraints (os = "linux") *)
let direct_dependencies (switch : OpamFile.SwitchExport.t) pkg =
let opam = opam switch pkg in
let set = filtered_formula_to_pkgs switch (OpamFile.OPAM.depends opam) in
filtered_formula_to_pkgs switch ~set (OpamFile.OPAM.depopts opam)
module Name_map = OpamPackage.Name.Map
type graph = {
nodes : Name_set.t Name_map.t ;
top : OpamPackage.Name.t ;
}
let add_node graph pkg edges =
let nodes = Name_map.add pkg edges graph.nodes in
{ graph with nodes }
let pp_graph ppf graph =
Name_map.iter (fun pkg deps ->
let top = if pkg = graph.top then "ROOT " else "" in
Format.fprintf ppf "%s%s: %s@."
top (OpamPackage.Name.to_string pkg)
(String.concat ", " (List.map OpamPackage.Name.to_string
(Name_set.elements deps))))
graph.nodes
let dependencies (switch : OpamFile.SwitchExport.t) =
let root_pkg = root switch in
let top = root_pkg.OpamPackage.name in
let graph = { top ; nodes = Name_map.empty } in
let available = switch.selections.sel_installed in
let rec find_deps graph work =
match Name_set.choose_opt work with
| None -> graph
| Some x ->
let deps = direct_dependencies switch x in
let deps =
Name_set.filter (fun name ->
OpamPackage.Set.exists
(fun pkg -> pkg.OpamPackage.name = name)
available)
deps
in
let graph = add_node graph x deps in
let work =
Name_set.diff
(Name_set.union (Name_set.remove x work) deps)
(Name_set.of_list (Name_map.keys graph.nodes))
in
find_deps graph work
in
let graph = find_deps graph (Name_set.singleton top) in
Format.printf "%a" pp_graph graph