sig
module M :
sig
type key = Base.t
type t
val iter :
(Base.t -> Ival.t -> unit) -> Locations.Location_Bytes.M.t -> unit
val find :
Locations.Location_Bytes.M.key ->
Locations.Location_Bytes.M.t -> Ival.t
val fold :
(Base.t -> Ival.t -> 'a -> 'a) ->
Locations.Location_Bytes.M.t -> 'a -> 'a
val shape :
Locations.Location_Bytes.M.t -> Ival.t Hptmap.Shape(Base.Base).t
end
type z =
Top of Base.SetLattice.t * Origin.t
| Map of Locations.Location_Bytes.M.t
type t = z
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 join_and_is_included : t -> t -> t * bool
val bottom : t
val top : t
type widen_hint = Base.t -> Ival.widen_hint
val widen : widen_hint -> t -> t -> t
val narrow : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val intersects : t -> t -> bool
exception Error_Top
val singleton_zero : t
val singleton_one : t
val zero_or_one : t
val is_zero : t -> bool
val is_bottom : t -> bool
val top_int : t
val top_float : t
val top_single_precision_float : t
val inject : Base.t -> Ival.t -> t
val inject_ival : Ival.t -> t
val inject_float : Ival.F.t -> t
val add : Base.t -> Ival.t -> t -> t
val diff : t -> t -> t
val diff_if_one : t -> t -> t
val shift : Ival.t -> t -> t
val shift_under : Ival.t -> t -> t
val topify_arith_origin : t -> t
val topify_misaligned_read_origin : t -> t
val topify_merge_origin : t -> t
val topify_leaf_origin : t -> t
val topify_with_origin : Origin.t -> t -> t
val topify_with_origin_kind : Origin.kind -> t -> t
val inject_top_origin : Origin.t -> Base.Hptset.t -> t
val top_with_origin : Origin.t -> t
val fold_bases : (Base.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_i : (Base.t -> Ival.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_topset_ok : (Base.t -> Ival.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_enum : (t -> 'a -> 'a) -> t -> 'a -> 'a
val cached_fold :
cache_name:string ->
temporary:bool ->
f:(Base.t -> Ival.t -> 'a) ->
projection:(Base.t -> Ival.t) ->
joiner:('a -> 'a -> 'a) -> empty:'a -> t -> 'a
val cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
val cardinal : t -> Integer.t option
val find_lonely_key : t -> Base.t * Ival.t
val find_lonely_binding : t -> Base.t * Ival.t
val find_or_bottom : Base.t -> Locations.Location_Bytes.M.t -> Ival.t
val split : Base.t -> t -> Ival.t * t
val get_bases : t -> Base.SetLattice.t
val contains_addresses_of_locals :
(Locations.Location_Bytes.M.key -> bool) -> t -> bool
val remove_escaping_locals :
(Locations.Location_Bytes.M.key -> bool) -> t -> Base.SetLattice.t * t
val contains_addresses_of_any_locals : t -> bool
val iter_on_strings :
skip:Base.t option ->
(Base.t -> string -> int -> int -> unit) -> t -> unit
val partially_overlaps : size:Abstract_interp.Int.t -> t -> t -> bool
val is_relationable : t -> bool
val may_reach : Base.t -> t -> bool
val clear_caches : unit -> unit
end