functor (Value : Abstract.Value.External) ->
sig
type state
type t = state
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
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 find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val split : elt -> t -> t * bool * t
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
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 find_opt : key -> 'a t -> 'a option
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
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 filter_map_inplace : (key -> 'a -> 'a option) -> '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 find_opt : 'a t -> key -> 'a option
val find_def : 'a t -> key -> 'a -> 'a
val memo : 'a t -> key -> (key -> 'a) -> 'a
val structural_descr : Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.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
val top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val widen : Cil_types.kernel_function -> Cil_types.stmt -> t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
type value = Value.t
type location = precise_loc
type origin
val extract_expr :
(Cil_types.exp -> value Eval.evaluated) ->
t -> Cil_types.exp -> (value * origin) Eval.evaluated
val extract_lval :
(Cil_types.exp -> value Eval.evaluated) ->
t ->
Cil_types.lval ->
Cil_types.typ -> location -> (value * origin) Eval.evaluated
val backward_location :
t ->
Cil_types.lval ->
Cil_types.typ -> location -> value -> (location * value) Eval.or_bottom
val reduce_further :
t -> Cil_types.exp -> value -> (Cil_types.exp * value) list
module Transfer :
functor
(Valuation : sig
type t
type value = value
type origin = origin
type loc = location
val find :
t ->
Cil_types.exp ->
(value, origin) Eval.record_val Eval.or_top
val fold :
(Cil_types.exp ->
(value, origin) Eval.record_val -> 'a -> 'a) ->
t -> 'a -> 'a
val find_loc :
t ->
Cil_types.lval -> loc Eval.record_loc Eval.or_top
end) ->
sig
val update : Valuation.t -> t -> t Eval.or_bottom
val assign :
Cil_types.kinstr ->
location Eval.left_value ->
Cil_types.exp ->
(location, value) Eval.assigned ->
Valuation.t -> t -> t Eval.or_bottom
val assume :
Cil_types.stmt ->
Cil_types.exp -> bool -> Valuation.t -> t -> t Eval.or_bottom
val start_call :
Cil_types.stmt ->
(location, value) Eval.call ->
Valuation.t -> t -> t Eval.or_bottom
val finalize_call :
Cil_types.stmt ->
(location, value) Eval.call ->
pre:t -> post:t -> t Eval.or_bottom
val show_expr :
Valuation.t -> t -> Format.formatter -> Cil_types.exp -> unit
end
val logic_assign :
Eval.logic_assign -> location -> pre:state -> state -> state
val evaluate_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> Alarmset.status
val reduce_by_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> bool -> state Eval.or_bottom
val enter_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val leave_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val enter_loop : Cil_types.stmt -> state -> state
val incr_loop_counter : Cil_types.stmt -> state -> state
val leave_loop : Cil_types.stmt -> state -> state
val empty : unit -> t
val introduce_globals : Cil_types.varinfo list -> t -> t
val initialize_variable :
Cil_types.lval ->
location -> initialized:bool -> Abstract_domain.init_value -> t -> t
val initialize_variable_using_type :
Abstract_domain.init_kind -> Cil_types.varinfo -> t -> t
val relate :
Cil_types.kernel_function -> Base.Hptset.t -> t -> Base.SetLattice.t
val filter :
Cil_types.kernel_function ->
[ `Post | `Pre ] -> Base.Hptset.t -> t -> t
val reuse :
Cil_types.kernel_function ->
Base.Hptset.t -> current_input:t -> previous_output:t -> t
val log_category : Value_parameters.category
module Store :
sig
val register_global_state : state Eval.or_bottom -> unit
val register_initial_state : Value_types.callstack -> state -> unit
val register_state_before_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val register_state_after_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val get_global_state : unit -> state Eval.or_bottom
val get_initial_state :
Cil_types.kernel_function -> state Eval.or_bottom
val get_initial_state_by_callstack :
Cil_types.kernel_function ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
val get_stmt_state :
after:bool -> Cil_types.stmt -> state Eval.or_bottom
val get_stmt_state_by_callstack :
after:bool ->
Cil_types.stmt ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
end
val post_analysis : t Eval.or_bottom -> unit
val key : t Abstract_domain.key
end