module Component: sig
.. end
module M: FCMap.Make
(
Components.NodeKf
)
type
fwd_kind =
type
kind =
| |
Direct |
| |
Indirect_Backward |
| |
Forward of fwd_kind |
type
value = {
|
pdg : Db.Pdg.t ; |
|
mutable callstack_length : int ; |
|
mutable direct : bool ; |
|
mutable indirect_backward : bool ; |
|
mutable forward : bool ; |
}
type
t = value M.t
val is_direct : value -> bool
val is_indirect_backward : value -> bool
val is_forward : value -> bool
val check_and_add : bool ->
M.key ->
kind ->
Db.Pdg.t -> int -> t -> bool * t
Returns
found, new_already
with:
found
is true
iff elt
was previously added for kind
new_already
is already
updated with elt
and its (new) associated
value.
val one_step_related_nodes : kind ->
Db.Pdg.t -> PdgTypes.Node.t -> PdgTypes.Node.t list
val search_input : 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 : kind ->
t -> Components.Todolist.t -> t
val initial_nodes : Cil_types.kernel_function -> Cil_types.stmt -> Components.Todolist.todo list
val direct : Cil_types.kernel_function ->
Cil_types.stmt -> value M.t
val backward : Cil_types.kernel_function -> Cil_types.stmt -> t
val whole : Cil_types.kernel_function -> Cil_types.stmt -> t
val forward : fwd_kind ->
Cil_types.kernel_function -> Cil_types.stmt -> Cil_datatype.Stmt.Set.elt list
val get_component : kind -> Cil_types.stmt -> Cil_datatype.Stmt.Set.elt list