sig
module M :
sig
type key = NodeKf.t
type 'a t = 'a FCMap.Make(NodeKf).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
end
type fwd_kind = Impact | Security
type kind =
Direct
| Indirect_Backward
| Forward of Components.Component.fwd_kind
type value = {
pdg : Db.Pdg.t;
mutable callstack_length : int;
mutable direct : bool;
mutable indirect_backward : bool;
mutable forward : bool;
}
type t = Components.Component.value Components.Component.M.t
val is_direct : Components.Component.value -> bool
val is_indirect_backward : Components.Component.value -> bool
val is_forward : Components.Component.value -> bool
val check_and_add :
bool ->
Components.Component.M.key ->
Components.Component.kind ->
Db.Pdg.t ->
int -> Components.Component.t -> bool * Components.Component.t
val one_step_related_nodes :
Components.Component.kind ->
Db.Pdg.t -> PdgTypes.Node.t -> PdgTypes.Node.t list
val search_input :
Components.Component.kind ->
Cil_types.kernel_function -> 'a list Lazy.t -> 'a list
val add_from_deep :
Cil_types.kernel_function ->
Components.Todolist.t -> PdgTypes.Node.t -> Components.Todolist.t
val forward_caller :
Cil_types.kernel_function ->
PdgTypes.NodeSet.elt -> Components.Todolist.t -> Components.Todolist.t
val related_nodes_of_nodes :
Components.Component.kind ->
Components.Component.t -> Components.Todolist.t -> Components.Component.t
val initial_nodes :
Cil_types.kernel_function ->
Cil_types.stmt -> Components.Todolist.todo list
val direct :
Cil_types.kernel_function ->
Cil_types.stmt -> Components.Component.value Components.Component.M.t
val backward :
Cil_types.kernel_function -> Cil_types.stmt -> Components.Component.t
val whole :
Cil_types.kernel_function -> Cil_types.stmt -> Components.Component.t
val forward :
Components.Component.fwd_kind ->
Cil_types.kernel_function ->
Cil_types.stmt -> Cil_datatype.Stmt.Set.elt list
val get_component :
Components.Component.kind ->
Cil_types.stmt -> Cil_datatype.Stmt.Set.elt list
end