sig
type 'a default_contents = Bottom | Top of 'a | Constant of 'a | Other
module Make_LOffset :
functor
(V : sig
type numerical_widen_hint
type size_widen_hint = Integer.t
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 join : t -> t -> t
val is_included : t -> t -> bool
val bottom : t
type widen_hint = size_widen_hint * numerical_widen_hint
val widen : widen_hint -> t -> t -> t
val cardinal_zero_or_one : t -> bool
val pretty_typ :
Cil_types.typ option -> t Pretty_utils.formatter
val is_isotropic : t -> bool
val topify_with_origin : Origin.t -> t -> t
val extract_bits :
topify:Origin.kind ->
start:Integer.t ->
stop:Integer.t -> size:Integer.t -> t -> bool * t
val shift_bits :
topify:Origin.kind ->
offset:Integer.t -> size:Integer.t -> t -> t
val merge_distinct_bits :
topify:Origin.kind -> conflate_bottom:bool -> t -> t -> t
val merge_neutral_element : t
val anisotropic_cast : size:Integer.t -> t -> t
val top_opt : t option
end) (Offsetmap : sig
type v = V.t
type widen_hint = V.numerical_widen_hint
type t
val pretty_generic :
?typ:Cil_types.typ ->
?pretty_v:(Cil_types.typ option ->
Format.formatter -> v -> unit) ->
?skip_v:(v -> bool) ->
?sep:string ->
unit -> Format.formatter -> t -> unit
val create :
size:Abstract_interp.Int.t ->
v -> size_v:Abstract_interp.Int.t -> t
val create_isotropic :
size:Abstract_interp.Int.t -> v -> t
val of_list :
((t -> v -> t) -> t -> 'l -> t) ->
'l -> Abstract_interp.Int.t -> t
val empty : t
val size_from_validity :
Base.validity -> Integer.t Bottom.or_bottom
val iter :
(Abstract_interp.Int.t *
Abstract_interp.Int.t ->
v * Abstract_interp.Int.t *
Abstract_interp.Rel.t -> unit) ->
t -> unit
val fold :
(Abstract_interp.Int.t *
Abstract_interp.Int.t ->
v * Abstract_interp.Int.t *
Abstract_interp.Rel.t -> 'a -> 'a) ->
t -> 'a -> 'a
val fold_between :
?direction:[ `LTR | `RTL ] ->
entire:bool ->
Abstract_interp.Int.t *
Abstract_interp.Int.t ->
(Abstract_interp.Int.t *
Abstract_interp.Int.t ->
v * Abstract_interp.Int.t *
Abstract_interp.Rel.t -> 'a -> 'a) ->
t -> 'a -> 'a
val iter_on_values : (v -> unit) -> t -> unit
val fold_on_values :
(v -> 'a -> 'a) -> t -> 'a -> 'a
val map_on_values : (v -> v) -> t -> t
type map2_decide =
ReturnLeft
| ReturnRight
| ReturnConstant of v
| Recurse
val map2_on_values :
Hptmap_sig.cache_type ->
(t -> t -> map2_decide) ->
(v -> v -> v) -> t -> 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
val join : t -> t -> t
val is_included : t -> t -> bool
val widen : widen_hint -> t -> t -> t
module Make_Narrow :
functor
(X : sig
val top : v
val narrow : v -> v -> v
end) ->
sig
val narrow : t -> t -> t
val narrow_reinterpret : t -> t -> t
end
val find :
validity:Base.validity ->
?conflate_bottom:bool ->
offsets:Ival.t -> size:Integer.t -> t -> v
val find_imprecise :
validity:Base.validity -> t -> v
val find_imprecise_everywhere : t -> v
val copy_slice :
validity:Base.validity ->
offsets:Ival.t ->
size:Integer.t -> t -> t Bottom.or_bottom
val add :
?exact:bool ->
Abstract_interp.Int.t *
Abstract_interp.Int.t ->
v * Abstract_interp.Int.t *
Abstract_interp.Rel.t -> t -> t
val update :
?origin:Origin.t ->
validity:Base.validity ->
exact:bool ->
offsets:Ival.t ->
size:Abstract_interp.Int.t ->
v -> t -> t Bottom.or_bottom
val update_under :
validity:Base.validity ->
exact:bool ->
offsets:Ival.t ->
size:Abstract_interp.Int.t ->
v -> t -> t Bottom.or_bottom
val update_imprecise_everywhere :
validity:Base.validity ->
Origin.t -> v -> t -> t Bottom.or_bottom
val paste_slice :
validity:Base.validity ->
exact:bool ->
from:t ->
size:Abstract_interp.Int.t ->
offsets:Ival.t -> t -> t Bottom.or_bottom
val cardinal_zero_or_one : t -> bool
val is_single_interval : t -> bool
val single_interval_value : t -> v option
val is_same_value : t -> v -> bool
val imprecise_write_msg : string ref
val clear_caches : unit -> unit
val pretty_debug : t Pretty_utils.formatter
end) (Default_offsetmap : sig
val name : string
val default_offsetmap :
Base.t ->
Offsetmap.t
Bottom.or_bottom
val default_contents :
V.t
Lmap.default_contents
end) ->
sig
type v = V.t
type offsetmap = Offsetmap.t
type widen_hint_base = V.numerical_widen_hint
type map
type lmap = private Bottom | Top | Map of map
type t = lmap
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 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 disjoint : t -> t -> bool
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> 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 update : key -> ('a option -> 'a option) -> '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 union :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a 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 min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
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 find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a 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 to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_keys : 'a t -> key Seq.t
val to_seq_values : 'a t -> 'a Seq.t
val add_seq : 'a t -> (key * 'a) Seq.t -> unit
val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
val of_seq : (key * 'a) Seq.t -> 'a t
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 pretty : Format.formatter -> t -> unit
val pretty_debug : Format.formatter -> t -> unit
val pretty_filter : Format.formatter -> t -> Locations.Zone.t -> unit
val pretty_diff : Format.formatter -> t -> t -> unit
val top : t
val is_top : t -> bool
val empty_map : t
val is_empty_map : t -> bool
val bottom : t
val is_reachable : t -> bool
val join : t -> t -> t
val is_included : t -> t -> bool
module Make_Narrow :
functor
(X : sig
val top : v
val narrow : v -> v -> v
val bottom_is_strict : bool
end) ->
sig val narrow : t -> t -> t end
type widen_hint = Base.Set.t * (Base.t -> widen_hint_base)
val widen : widen_hint -> t -> t -> t
val merge : into:t -> t -> t
val find : ?conflate_bottom:bool -> t -> Locations.location -> v
val copy_offsetmap :
Locations.Location_Bits.t ->
Integer.t -> t -> offsetmap Bottom.or_bottom
val find_base : Base.t -> t -> offsetmap Bottom.Top.or_top_bottom
val find_base_or_default :
Base.t -> t -> offsetmap Bottom.Top.or_top_bottom
val add_binding : exact:bool -> t -> Locations.location -> v -> t
val paste_offsetmap :
from:offsetmap ->
dst_loc:Locations.Location_Bits.t ->
size:Integer.t -> exact:bool -> t -> t
val add_base : Base.t -> offsetmap -> t -> t
val add_base_value :
Base.t -> size:Integer.t -> v -> size_v:Integer.t -> t -> t
val filter_base : (Base.t -> bool) -> t -> t
val filter_by_shape : 'a Hptmap.Shape(Base.Base).t -> t -> t
val remove_base : Base.t -> t -> t
val iter : (Base.base -> offsetmap -> unit) -> map -> unit
val fold : (Base.t -> offsetmap -> 'a -> 'a) -> map -> 'a -> 'a
val cached_fold :
f:(Base.t -> offsetmap -> 'a) ->
cache_name:string ->
temporary:bool -> joiner:('a -> 'a -> 'a) -> empty:'a -> map -> 'a
val cached_map :
f:(Base.t -> offsetmap -> offsetmap) ->
cache:string * int -> temporary:bool -> t -> t
val remove_variables : Cil_types.varinfo list -> t -> t
val shape : map -> offsetmap Hptmap.Shape(Base.Base).t
val clear_caches : unit -> unit
type subtree
val comp_prefixes : t -> t -> unit
val find_prefix : t -> Hptmap.prefix -> subtree option
val hash_subtree : subtree -> int
val equal_subtree : subtree -> subtree -> bool
exception Found_prefix of Hptmap.prefix * subtree * subtree
end
end