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
end
module Top_Param :
sig
module O :
sig
type elt = Base.t
type t
val descr : Unmarshal.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 elements : t -> elt list
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val cardinal : t -> int
val min_elt : t -> elt
val contains_single_elt : t -> elt option
end
type tt = private Set of O.t | Top
exception Error_Top
exception Error_Bottom
type t = tt
type widen_hint = O.t
val equal : t -> t -> bool
val join : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val narrow : t -> t -> t
val bottom : t
val top : t
val is_included : t -> t -> bool
val is_included_exn : t -> t -> unit
val intersects : t -> t -> bool
val pretty : Format.formatter -> t -> unit
val widen : widen_hint -> t -> t -> t
val cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
val tag : t -> int
module Datatype :
sig
type t = t
val descr : Unmarshal.t
val copy : t -> t
val name : string
val register_comparable :
?compare:(t -> t -> int) ->
?equal:(t -> t -> bool) -> ?hash:(t -> int) -> unit -> unit
val is_comparable_set : unit -> bool
val hash : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
val mem_project :
((Project.project -> bool) -> t -> bool) option ref
end
val hash : t -> int
val inject_singleton : O.elt -> t
val inject : O.t -> t
val empty : t
val apply2 : (O.elt -> O.elt -> O.elt) -> t -> t -> t
val apply1 : (O.elt -> O.elt) -> t -> t
val fold : (O.elt -> 'a -> 'a) -> t -> 'a -> 'a
val iter : (O.elt -> unit) -> t -> unit
val project : t -> O.t
val mem : O.elt -> t -> bool
end
type z =
Top of Locations.Location_Bytes.Top_Param.t * Origin.t
| Map of Locations.Location_Bytes.M.t
exception Error_Top
exception Error_Bottom
type t = z
type widen_hint = Top_Param.widen_hint * (Base.t -> Ival.widen_hint)
val equal : t -> t -> bool
val join : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val narrow : t -> t -> t
val bottom : t
val top : t
val is_included : t -> t -> bool
val is_included_exn : t -> t -> unit
val intersects : t -> t -> bool
val pretty : Format.formatter -> t -> unit
val widen : widen_hint -> t -> t -> t
val cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
val tag : t -> int
module Datatype :
sig
type t = t
val descr : Unmarshal.t
val copy : t -> t
val name : string
val register_comparable :
?compare:(t -> t -> int) ->
?equal:(t -> t -> bool) -> ?hash:(t -> int) -> unit -> unit
val is_comparable_set : unit -> bool
val hash : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
val mem_project : ((Project.project -> bool) -> t -> bool) option ref
end
val top_float : t
val is_zero : t -> bool
val hash : t -> int
val zero_or_one : t
val singleton_zero : t
val singleton_one : t
val topify_arith_origin : t -> t
val topify_misaligned_read_origin : t -> t
val topify_merge_origin : t -> t
val under_topify : t -> t
val top_int : t
val find_or_bottom : Base.t -> Locations.Location_Bytes.M.t -> Ival.t
val add_or_bottom :
Base.t ->
Ival.t -> Locations.Location_Bytes.M.t -> Locations.Location_Bytes.M.t
val inject : Base.t -> Ival.t -> t
val inject_ival : Ival.t -> t
val inject_top_origin :
Origin.t -> Locations.Location_Bytes.Top_Param.O.t -> t
val fold_enum :
split_non_enumerable:int -> (t -> 'a -> 'a) -> t -> 'a -> 'a
val splitting_cardinal_less_than :
split_non_enumerable:int -> t -> int -> int
val find_exclusive : Base.t -> t -> Ival.t
val split : Base.t -> t -> Ival.t * t
exception Not_all_keys
val get_keys_exclusive : Ival.t -> t -> Base.t list
val find_lonely_binding : t -> Base.t * Ival.t
val find_lonely_key : t -> Base.t * Ival.t
val diff : t -> t -> t
val diff_if_one : t -> t -> t
val location_shift : Ival.t -> t -> t
val fold_i : (Base.t -> Ival.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_bases : (Base.t -> 'a -> 'a) -> t -> 'a -> 'a
val top_leaf_origin : unit -> t
val topify_with_origin : Origin.t -> t -> t
val is_included_actual_generic :
BaseUtils.BaseSet.t ->
BaseUtils.BaseSet.t Pervasives.ref ->
t BaseUtils.BaseMap.t Pervasives.ref -> t -> t -> unit
val may_reach : Base.t -> t -> bool
val cached_fold :
cache:string * int ->
f:(Base.t -> Ival.t -> 'a) ->
projection:(Base.t -> Ival.t) ->
joiner:('a -> 'a -> 'a) -> empty:'a -> t -> 'a
val contains_addresses_of_locals :
(Locations.Location_Bytes.M.key -> bool) -> t -> bool
val remove_escaping_locals :
(Locations.Location_Bytes.M.key -> bool) -> t -> t
val contains_addresses_of_any_locals : t -> bool
end