sig
exception Top
exception Bottom
type fi = (PdgTypes.Node.t, unit) PdgIndex.FctIndex.t
val fi_descr : Structural_descr.t
type def = {
graph : PdgTypes.G.t;
states : PdgTypes.data_state Cil_datatype.Stmt.Hashtbl.t;
index : PdgTypes.Pdg.fi;
}
type body = PdgDef of PdgTypes.Pdg.def | PdgTop | PdgBottom
module Body_datatype :
sig
type t = body
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
type t = Kernel_function.t * Body_datatype.t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code : Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
val make :
'a ->
PdgTypes.G.t ->
PdgTypes.data_state Cil_datatype.Stmt.Hashtbl.t ->
PdgTypes.Pdg.fi -> 'a * PdgTypes.Pdg.body
val top : 'a -> 'a * PdgTypes.Pdg.body
val bottom : 'a -> 'a * PdgTypes.Pdg.body
val is_top : 'a * PdgTypes.Pdg.body -> bool
val is_bottom : 'a * PdgTypes.Pdg.body -> bool
val get_pdg_body : 'a * PdgTypes.Pdg.body -> PdgTypes.Pdg.def
val get_kf : 'a * 'b -> 'a
val get_graph : 'a * PdgTypes.Pdg.body -> PdgTypes.G.t
val get_states :
'a * PdgTypes.Pdg.body -> PdgTypes.data_state Cil_datatype.Stmt.Hashtbl.t
val get_index : 'a * PdgTypes.Pdg.body -> PdgTypes.Pdg.fi
val iter_nodes :
(PdgTypes.Node.Hashtbl.key -> unit) -> 'a * PdgTypes.Pdg.body -> unit
val iter_direct_dpds :
'a * PdgTypes.Pdg.body ->
(PdgTypes.Node.t -> unit) -> PdgTypes.Node.Hashtbl.key -> unit
val iter_direct_codpds :
'a * PdgTypes.Pdg.body ->
(PdgTypes.Node.t -> unit) -> PdgTypes.Node.Hashtbl.key -> unit
val fold_call_nodes :
('a -> PdgTypes.Node.t -> 'a) ->
'a -> 'b * PdgTypes.Pdg.body -> Cil_types.stmt -> 'a
type dpd_info = PdgTypes.Node.t * Locations.Zone.t option
val get_x_direct_edges :
co:bool ->
?dpd_type:PdgTypes.Dpd.td ->
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_x_direct :
co:bool ->
PdgTypes.Dpd.td ->
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_x_direct_dpds :
PdgTypes.Dpd.td ->
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_x_direct_codpds :
PdgTypes.Dpd.td ->
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_all_direct :
co:bool ->
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_all_direct_dpds :
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val get_all_direct_codpds :
'a * PdgTypes.Pdg.body ->
PdgTypes.Node.Hashtbl.key -> PdgTypes.Pdg.dpd_info list
val fold_direct :
co:bool ->
t ->
('a ->
PdgTypes.Dpd.t * Locations.Zone.t option ->
PdgTypes.Node.Hashtbl.key -> 'a) ->
'a -> PdgTypes.Node.Hashtbl.key -> 'a
val fold_direct_dpds :
t ->
('a ->
PdgTypes.Dpd.t * Locations.Zone.t option ->
PdgTypes.Node.Hashtbl.key -> 'a) ->
'a -> PdgTypes.Node.Hashtbl.key -> 'a
val fold_direct_codpds :
t ->
('a ->
PdgTypes.Dpd.t * Locations.Zone.t option ->
PdgTypes.Node.Hashtbl.key -> 'a) ->
'a -> PdgTypes.Node.Hashtbl.key -> 'a
val pretty_graph : ?bw:bool -> Format.formatter -> PdgTypes.G.g -> unit
val pretty_bw :
?bw:bool -> Format.formatter -> 'a * PdgTypes.Pdg.body -> unit
module Printer :
sig
type parent_t = t
type t = PdgTypes.Pdg.Printer.parent_t
module V :
sig
type t = Node.t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
module Set :
sig
type elt = t
type t = Node.Set.t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val choose : t -> elt
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Map :
sig
type key = t
type 'a t = 'a Node.Map.t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
module Hashtbl :
sig
type key = t
type 'a t = 'a Node.Hashtbl.t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val iter_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_value :
cmp:('a -> 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_value :
cmp:('a -> 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val structural_descr : Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.t
val memo : 'a t -> key -> (key -> 'a) -> 'a
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project :
(Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
val id : t -> int
val elem_key : t -> PdgIndex.Key.t
val stmt : t -> Cil_types.stmt option
val pretty_list : Format.formatter -> t list -> unit
val pretty_with_part :
Format.formatter -> t * Locations.Zone.t option -> unit
val pretty_node : Format.formatter -> t -> unit
val make : PdgIndex.Key.t -> t
end
module E :
sig
type t = PdgTypes.G.E.t * bool
val src : ('a * 'b * 'c) * 'd -> 'c
val dst : ('a * 'b * 'c) * 'd -> 'a
end
val print_node : PdgTypes.Node.t -> bool
val iter_vertex :
(PdgTypes.Node.Hashtbl.key -> unit) -> 'a * PdgTypes.Pdg.body -> unit
val iter_edges_e :
((PdgTypes.Node.Hashtbl.key * PdgTypes.DpdZone.t *
PdgTypes.Node.Hashtbl.key) *
bool -> unit) ->
'a * PdgTypes.Pdg.body -> unit
val graph_attributes : 'a -> [> `Rankdir of [> `TopToBottom ] ] list
val default_vertex_attributes :
'a -> [> `Style of [> `Filled ] list ] list
val vertex_name : PdgTypes.Node.t -> string
val vertex_attributes :
PdgTypes.Node.t ->
[> `Fillcolor of int
| `Label of string
| `Shape of [> `Box | `Diamond | `Doublecircle ] ]
list
val default_edge_attributes : 'a -> [> `Dir of [> `Back ] ] list
val edge_attributes :
('a * PdgTypes.DpdZone.t * 'b) * bool ->
[> `Arrowtail of [> `Odot ]
| `Color of int
| `Label of string
| `Style of [> `Dotted ] list ]
list
val get_subgraph :
PdgTypes.Node.t -> Graph.Graphviz.DotAttributes.subgraph option
end
module PrintG :
sig
val fprint_graph : Format.formatter -> Printer.t -> unit
val output_graph : out_channel -> Printer.t -> unit
end
val build_dot : string -> PdgTypes.Pdg.Printer.t -> unit
end