sig
module type Interface =
sig
type t
type 'a key
val mem : 'a Abstract.Interface.key -> bool
val get :
'a Abstract.Interface.key -> (Abstract.Interface.t -> 'a) option
val set :
'a Abstract.Interface.key ->
'a -> Abstract.Interface.t -> Abstract.Interface.t
end
module Value :
sig
type 'a key = 'a Structure.Key_Value.key
val create_key : string -> 'a key
val eq_type : 'a key -> 'b key -> ('a, 'b) Structure.eq option
val print : 'a key Pretty_utils.formatter
val compare : 'a key -> 'b key -> int
val equal : 'a key -> 'b key -> bool
val hash : 'a key -> int
val tag : 'a key -> int
type 'a data = (module Abstract_value.S with type t = 'a)
type 'a structure =
Unit : unit structure
| Leaf : 'a key * 'a data -> 'a structure
| Node : 'a structure * 'b structure -> ('a * 'b) structure
val eq_structure :
'a structure -> 'b structure -> ('a, 'b) Structure.eq option
module type Internal =
sig
type 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 pretty_typ : Cil_types.typ option -> t Pretty_utils.formatter
val top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
val zero : t
val one : t
val top_int : t
val inject_int : Cil_types.typ -> Integer.t -> t
val assume_non_zero : t -> t Abstract_value.truth
val assume_bounded :
Abstract_value.bound_kind ->
Abstract_value.bound -> t -> t Abstract_value.truth
val assume_not_nan :
assume_finite:bool ->
Cil_types.fkind -> t -> t Abstract_value.truth
val assume_comparable :
Abstract_value.pointer_comparison ->
t -> t -> (t * t) Abstract_value.truth
val constant : Cil_types.exp -> Cil_types.constant -> t
val forward_unop :
Cil_types.typ -> Cil_types.unop -> t -> t Eval.or_bottom
val forward_binop :
Cil_types.typ -> Cil_types.binop -> t -> t -> t Eval.or_bottom
val rewrap_integer : Eval_typ.integer_range -> t -> t
val forward_cast :
src_type:Eval_typ.scalar_typ ->
dst_type:Eval_typ.scalar_typ -> t -> t Eval.or_bottom
val backward_binop :
input_type:Cil_types.typ ->
resulting_type:Cil_types.typ ->
Cil_types.binop ->
left:t ->
right:t -> result:t -> (t option * t option) Eval.or_bottom
val backward_unop :
typ_arg:Cil_types.typ ->
Cil_types.unop -> arg:t -> res:t -> t option Eval.or_bottom
val backward_cast :
src_typ:Cil_types.typ ->
dst_typ:Cil_types.typ ->
src_val:t -> dst_val:t -> t option Eval.or_bottom
val resolve_functions :
t -> Kernel_function.t list Eval.or_top * bool
val structure : t structure
end
module type External =
sig
type 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 pretty_typ : Cil_types.typ option -> t Pretty_utils.formatter
val top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
val zero : t
val one : t
val top_int : t
val inject_int : Cil_types.typ -> Integer.t -> t
val assume_non_zero : t -> t Abstract_value.truth
val assume_bounded :
Abstract_value.bound_kind ->
Abstract_value.bound -> t -> t Abstract_value.truth
val assume_not_nan :
assume_finite:bool ->
Cil_types.fkind -> t -> t Abstract_value.truth
val assume_comparable :
Abstract_value.pointer_comparison ->
t -> t -> (t * t) Abstract_value.truth
val constant : Cil_types.exp -> Cil_types.constant -> t
val forward_unop :
Cil_types.typ -> Cil_types.unop -> t -> t Eval.or_bottom
val forward_binop :
Cil_types.typ -> Cil_types.binop -> t -> t -> t Eval.or_bottom
val rewrap_integer : Eval_typ.integer_range -> t -> t
val forward_cast :
src_type:Eval_typ.scalar_typ ->
dst_type:Eval_typ.scalar_typ -> t -> t Eval.or_bottom
val backward_binop :
input_type:Cil_types.typ ->
resulting_type:Cil_types.typ ->
Cil_types.binop ->
left:t ->
right:t -> result:t -> (t option * t option) Eval.or_bottom
val backward_unop :
typ_arg:Cil_types.typ ->
Cil_types.unop -> arg:t -> res:t -> t option Eval.or_bottom
val backward_cast :
src_typ:Cil_types.typ ->
dst_typ:Cil_types.typ ->
src_val:t -> dst_val:t -> t option Eval.or_bottom
val resolve_functions :
t -> Kernel_function.t list Eval.or_top * bool
val structure : t structure
val mem : 'a key -> bool
val get : 'a key -> (t -> 'a) option
val set : 'a key -> 'a -> t -> t
end
end
module Location :
sig
type 'a key = 'a Structure.Key_Location.key
val create_key : string -> 'a key
val eq_type : 'a key -> 'b key -> ('a, 'b) Structure.eq option
val print : 'a key Pretty_utils.formatter
val compare : 'a key -> 'b key -> int
val equal : 'a key -> 'b key -> bool
val hash : 'a key -> int
val tag : 'a key -> int
type 'a data = (module Abstract_location.S with type location = 'a)
type 'a structure =
Unit : unit structure
| Leaf : 'a key * 'a data -> 'a structure
| Node : 'a structure * 'b structure -> ('a * 'b) structure
val eq_structure :
'a structure -> 'b structure -> ('a, 'b) Structure.eq option
module type Internal =
sig
type value
type location
type offset
val top : location
val equal_loc : location -> location -> bool
val equal_offset : offset -> offset -> bool
val pretty_loc : Format.formatter -> location -> unit
val pretty_offset : Format.formatter -> offset -> unit
val to_value : location -> value
val size : location -> Int_Base.t
val assume_no_overlap :
partial:bool ->
location ->
location -> (location * location) Abstract_location.truth
val assume_valid_location :
for_writing:bool ->
bitfield:bool -> location -> location Abstract_location.truth
val no_offset : offset
val forward_field :
Cil_types.typ -> Cil_types.fieldinfo -> offset -> offset
val forward_index : Cil_types.typ -> value -> offset -> offset
val forward_variable :
Cil_types.typ ->
Cil_types.varinfo -> offset -> location Eval.or_bottom
val forward_pointer :
Cil_types.typ -> value -> offset -> location Eval.or_bottom
val eval_varinfo : Cil_types.varinfo -> location
val backward_variable :
Cil_types.varinfo -> location -> offset Eval.or_bottom
val backward_pointer :
value -> offset -> location -> (value * offset) Eval.or_bottom
val backward_field :
Cil_types.typ ->
Cil_types.fieldinfo -> offset -> offset Eval.or_bottom
val backward_index :
Cil_types.typ ->
index:value ->
remaining:offset -> offset -> (value * offset) Eval.or_bottom
val structure : location structure
end
module type External =
sig
type value
type location
type offset
val top : location
val equal_loc : location -> location -> bool
val equal_offset : offset -> offset -> bool
val pretty_loc : Format.formatter -> location -> unit
val pretty_offset : Format.formatter -> offset -> unit
val to_value : location -> value
val size : location -> Int_Base.t
val assume_no_overlap :
partial:bool ->
location ->
location -> (location * location) Abstract_location.truth
val assume_valid_location :
for_writing:bool ->
bitfield:bool -> location -> location Abstract_location.truth
val no_offset : offset
val forward_field :
Cil_types.typ -> Cil_types.fieldinfo -> offset -> offset
val forward_index : Cil_types.typ -> value -> offset -> offset
val forward_variable :
Cil_types.typ ->
Cil_types.varinfo -> offset -> location Eval.or_bottom
val forward_pointer :
Cil_types.typ -> value -> offset -> location Eval.or_bottom
val eval_varinfo : Cil_types.varinfo -> location
val backward_variable :
Cil_types.varinfo -> location -> offset Eval.or_bottom
val backward_pointer :
value -> offset -> location -> (value * offset) Eval.or_bottom
val backward_field :
Cil_types.typ ->
Cil_types.fieldinfo -> offset -> offset Eval.or_bottom
val backward_index :
Cil_types.typ ->
index:value ->
remaining:offset -> offset -> (value * offset) Eval.or_bottom
val structure : location structure
val mem : 'a key -> bool
val get : 'a key -> (location -> 'a) option
val set : 'a key -> 'a -> location -> location
end
end
module Domain :
sig
type 'a key = 'a Structure.Key_Domain.key
val create_key : string -> 'a key
val eq_type : 'a key -> 'b key -> ('a, 'b) Structure.eq option
val print : 'a key Pretty_utils.formatter
val compare : 'a key -> 'b key -> int
val equal : 'a key -> 'b key -> bool
val hash : 'a key -> int
val tag : 'a key -> int
type 'a data = (module Abstract_domain.Internal with type state = 'a)
type 'a structure =
Unit : unit structure
| Leaf : 'a key * 'a data -> 'a structure
| Node : 'a structure * 'b structure -> ('a * 'b) structure
val eq_structure :
'a structure -> 'b structure -> ('a, 'b) Structure.eq option
module type Internal =
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
type location
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 structure : t structure
end
module type 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
type location
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 structure : t structure
val mem : 'a key -> bool
val get : 'a key -> (t -> 'a) option
val set : 'a key -> 'a -> t -> t
val get_cvalue : (t -> Cvalue.Model.t) option
val get_cvalue_or_top : t -> Cvalue.Model.t
val get_cvalue_or_bottom : t Bottom.or_bottom -> Cvalue.Model.t
end
end
end