Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source
Page
Library
Module
Module type
Parameter
Class
Class type
Source
subgraph.ml1 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(**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2007-2023 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* you can redistribute it and/or modify it under the terms of the GNU *) (* Lesser General Public License as published by the Free Software *) (* Foundation, version 2.1. *) (* *) (* It is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *) (* GNU Lesser General Public License for more details. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file licenses/LGPLv2.1). *) (* *) (**************************************************************************) module Make (G: sig include Graph.Sig.G val create: ?size:int -> unit -> t val add_edge_e: t -> E.t -> unit end) (D: Datatype.S with type t = G.t) (Info: sig val self: State.t val name: string val get: unit -> G.t val vertex: Kernel_function.t -> G.V.t end) = struct module S = State_builder.Option_ref (Datatype.Option(D)) (* none if no root is specified *) (struct let name = "Subgraph of " ^ Info.name let dependencies = [ Info.self; Options.Roots.self ] end) let self = S.self let compute = let module HNodes = Hashtbl.Make(G.V) in fun () -> let g = Info.get () in let roots = Options.Roots.get () in if Kernel_function.Set.is_empty roots then None else let subg = G.create () in let visited = HNodes.create 17 in let rec add_component v = (* iter over the connected component of [v] for adding every edge to the subgraph *) if not (HNodes.mem visited v) then begin HNodes.add visited v (); G.iter_succ_e (fun e -> G.add_edge_e subg e; add_component (G.E.dst e)) g v end in Kernel_function.Set.iter (fun kf -> add_component (Info.vertex kf)) roots; Some subg let get () = match S.memo compute with | None -> Info.get () (* when no root is specified, use the whole graph *) | Some g -> g end (* Local Variables: compile-command: "make -C ../../.." End: *)