functor
(G : sig
type t
module V :
sig
type t
val hash : t -> int
val equal : t -> t -> bool
val id : Service_graph.Make.t -> int
val name : Service_graph.Make.t -> string
val attributes :
Service_graph.Make.t ->
Graph.Graphviz.DotAttributes.vertex list
end
val iter_vertex :
(Service_graph.Make.V.t -> unit) -> Service_graph.Make.t -> unit
val iter_succ :
(Service_graph.Make.V.t -> unit) ->
Service_graph.Make.t -> Service_graph.Make.V.t -> unit
val iter_pred :
(Service_graph.Make.V.t -> unit) ->
Service_graph.Make.t -> Service_graph.Make.V.t -> unit
val fold_pred :
(Service_graph.Make.V.t -> 'a -> 'a) ->
Service_graph.Make.t -> Service_graph.Make.V.t -> 'a -> 'a
val in_degree :
Service_graph.Make.t -> Service_graph.Make.V.t -> int
val datatype_name : string
end) ->
sig
type vertex = private {
node : G.V.t;
mutable is_root : bool;
mutable root : Service_graph.Make.vertex;
}
type edge = private
Inter_services
| Inter_functions
| Function_to_service
module CallG :
sig
type t
module V :
sig
type t = vertex
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label = edge
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
type tt = t
module Datatype :
sig
type t = tt
val rehash : t -> t
val descr : Unmarshal.t
val copy : t -> t
val name : string
val register_comparable :
?compare:(t -> t -> int) ->
?equal:(t -> t -> bool) ->
?hash:(t -> int) -> ?physical_hash:(t -> int) -> unit -> unit
val is_comparable_set : unit -> bool
val hash : t -> int
val physical_hash : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
val contain_project : (Project.project -> t -> bool) option ref
end
end
val compute : G.t -> Cilutil.StringSet.t -> Service_graph.Make.CallG.t
val output_graph :
Pervasives.out_channel -> Service_graph.Make.CallG.t -> unit
module TP :
sig
type t = CallG.t
module V :
sig
type t = vertex
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t = CallG.E.t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val graph_attributes : t -> Graph.Graphviz.DotAttributes.graph list
val default_vertex_attributes :
t -> Graph.Graphviz.DotAttributes.vertex list
val vertex_name : V.t -> string
val vertex_attributes :
V.t -> Graph.Graphviz.DotAttributes.vertex list
val default_edge_attributes :
t -> Graph.Graphviz.DotAttributes.edge list
val edge_attributes : E.t -> Graph.Graphviz.DotAttributes.edge list
val get_subgraph :
V.t -> Graph.Graphviz.DotAttributes.subgraph option
end
end