module Pdg_state:sig
..end
Types data_state and Node.t come froms this module
val dkey : Log.category
module P: Pdg_parameters
exception Cannot_fold
val make : PdgTypes.LocInfo.t -> Locations.Zone.t -> PdgTypes.data_state
val empty : PdgTypes.data_state
val bottom : PdgTypes.data_state
val pretty : Format.formatter -> PdgTypes.data_state -> unit
val add_loc_node : PdgTypes.data_state ->
?initializing:bool ->
exact:bool ->
Locations.Zone.t -> PdgTypes.NodeSetLattice.O.elt -> PdgTypes.data_state
val add_init_state_input : PdgTypes.data_state ->
Locations.Zone.t -> PdgTypes.NodeSetLattice.O.elt -> PdgTypes.data_state
add_loc_node
except that
we want to accumulate the nodes (exact = false) but nonetheless
define under_outputs like (exact = true)val test_and_merge : old:PdgTypes.data_state -> PdgTypes.data_state -> bool * PdgTypes.data_state
val get_loc_nodes_and_part : PdgTypes.data_state ->
Locations.Zone.t ->
(PdgTypes.NodeSetLattice.O.elt * Locations.Zone.t option) list
loc
and z is the intersection between loc
and the zone computed by the node.
Cannot_fold
if the state is top (TODO : something better ?)val get_loc_nodes : PdgTypes.data_state ->
Locations.Zone.t ->
(PdgTypes.NodeSetLattice.O.elt * Locations.Zone.t option) list *
Locations.Zone.t option
Cannot_fold
(see get_loc_nodes_and_part
)
if the state is Top
typestates =
PdgTypes.data_state Cil_datatype.Stmt.Hashtbl.t
val stmt_init : Cil_datatype.Stmt.t
val stmt_last : Cil_types.stmt
val store_init_state : 'a Cil_datatype.Stmt.Hashtbl.t -> 'a -> unit
val store_last_state : 'a Cil_datatype.Stmt.Hashtbl.t -> 'a -> unit
val get_init_state : 'a Cil_datatype.Stmt.Hashtbl.t -> 'a
val get_last_state : 'a Cil_datatype.Stmt.Hashtbl.t -> 'a
val get_stmt_state : 'a Cil_datatype.Stmt.Hashtbl.t -> Cil_datatype.Stmt.Hashtbl.key -> 'a