module Location_Bytes:sig
..end
module M:sig
..end
type
z =
| |
Top of |
(* |
Garbled mix of the addresses in the set
| *) |
| |
Map of |
(* |
Precice set of addresses+offsets
| *) |
include Lattice_type.AI_Lattice_with_cardinal_one
join
, narrow
, etc.include Lattice_type.With_Error_Top
val singleton_zero : t
0
val singleton_one : t
1
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
add b i loc
binds b
to i
in loc
when i
is not Ival.bottom
,
and returns bottom
otherwise.val diff : t -> t -> t
arg2
needs to be exact or an
under_approximation.val diff_if_one : t -> t -> t
arg2
can be an
over-approximation.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
inject_top_origin origin p
creates a top with origin origin
and additional information param
val top_with_origin : Origin.t -> t
val fold_bases : (Base.t -> 'a -> 'a) -> t -> 'a -> 'a
Top bases
.Error_Top
in the case Top Top
.val fold_i : (Base.t -> Ival.t -> 'a -> 'a) -> t -> 'a -> 'a
Error_Top
in the cases Top Top
, Top bases
.val fold_topset_ok : (Base.t -> Ival.t -> 'a -> 'a) -> t -> 'a -> 'a
Top bases
. In this case,
Ival.top
is supplied to the iterator.Error_Top
in the case Top Top
.val fold_enum : (t -> 'a -> 'a) -> t -> 'a -> 'a
fold_enum f loc acc
enumerates the locations in acc
, and passes
them to f
. Make sure to call Locations.Location_Bytes.cardinal_less_than
before calling
this function, as all possible combinations of bases/offsets are
presented to f
. Raises Error_Top
if loc
is Top _
or if
one offset cannot be enumerated.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
fold_i
, for advanced usersval cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
cardinal_less_than v card
returns the cardinal of v
if it is less
than card
, or raises Not_less_than
.val cardinal : t -> Integer.t option
val find_lonely_key : t -> Base.t * Ival.t
b
in the location, then returns the
pair b,o
where o
are the offsets associated to b
.Not_found
otherwise.val find_lonely_binding : t -> Base.t * Ival.t
b -> o
in the location (that is, only
one base b
with cardinal_zero_or_one o
), returns the pair b,o
.Not_found
otherwiseval find_or_bottom : Base.t -> M.t -> Ival.t
val split : Base.t -> t -> Ival.t * t
val get_bases : t -> Base.SetLattice.t
Base.SetLattice.Top
.val contains_addresses_of_locals : (M.key -> bool) -> t -> bool
contains_addresses_of_locals is_local loc
returns true
if loc
contains the adress of a variable for which
is_local
returns true
val remove_escaping_locals : (M.key -> bool) -> t -> Base.SetLattice.t * t
remove_escaping_locals is_local v
removes from v
information
associated with bases for which is_local
returns true
.val contains_addresses_of_any_locals : t -> bool
contains_addresses_of_any_locals loc
returns true
iff loc
contains
the adress of a local variable or of a formal variable.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
size
val is_relationable : t -> bool
val may_reach : Base.t -> t -> bool
may_reach base loc
is true if base
might be accessed from loc
.