module Zone: sig
.. end
Association between varids and ranges of bits.
Consult the Plugin Development Guide for additional details.
module Top_Param: Lattice_Set
with type O.elt = Base.t
type
map_t
type
tt =
| |
Top of Top_Param.t * Origin.t |
| |
Map of map_t |
include Datatype.S
val top : t
val bottom : t
val id : string
val tag : t -> int
val inject : Base.t -> Abstract_value.Int_Intervals.t -> t
val join : t -> t -> t
Over-approximation of union.
val link : t -> t -> t
Under_approximation of union.
val narrow : t -> t -> t
Over-approximation of intersection.
val meet : t -> t -> t
Under-approximation of intersection.
val diff : t -> t -> t
Over-approximation of difference.
arg2
needs to be exact or an under-approximation.
val diff_if_one : t -> t -> t
Over-approximation of difference. arg2
can be an
over-approximation.
exception Error_Bottom
exception Error_Top
val map_i : (Base.t -> Abstract_value.Int_Intervals.t -> t) -> t -> t
val find_exclusive : Base.t -> t -> Abstract_value.Int_Intervals.t
find_exclusive k m
returns v
if m
contains only the binding k
-> v
.
Raises Not_exclusive
otherwise.
val find_lonely_key : t -> Base.t * Abstract_value.Int_Intervals.t
val find_or_bottom : Base.t -> map_t -> Abstract_value.Int_Intervals.t
val mem_base : Base.t -> t -> bool
mem_base b m
returns true
if b
is associated to something
or topified in t
, and false
otherwise.
Since Carbon-20101201
exception Not_all_keys
val get_keys_exclusive : Abstract_value.Int_Intervals.t -> t -> Base.t list
val intersects : t -> t -> bool
val valid_intersects : t -> t -> bool
Assuming that z1
and z2
only contain valid bases,
valid_intersects z1 z2
returns true iff z1
and z2
have a valid
intersection.
type
widen_hint
val widen : widen_hint -> t -> t -> t
val is_included : t -> t -> bool
val is_included_exn : t -> t -> unit
val cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
val diff : t -> t -> t
Folding
val filter_base : (Base.t -> bool) -> t -> t
filter_base
can't raise Error_Top since it filters bases of Top
bases
. Note: the filter may give an over-approximation (in the case
Top Top
).
val fold_bases : (Base.t -> 'a -> 'a) -> t -> 'a -> 'a
fold_bases
folds also bases of Top bases
.
Raises Error_Top
in the case Top Top
.
val get_bases : t -> Top_Param.t
val fold_i : (Base.t -> Abstract_value.Int_Intervals.t -> 'a -> 'a) -> t -> 'a -> 'a
fold_i f l acc
folds l
by base.
Raises Error_Top
in the cases Top Top
, Top bases
.
val fold_topset_ok : (Base.t -> Abstract_value.Int_Intervals.t -> 'a -> 'a) -> t -> 'a -> 'a
fold_i f l acc
folds l
by base.
Raises Error_Top
in the case Top Top
.
val fold_enum_by_base : (t -> 'a -> 'a) -> t -> 'a -> 'a
fold_enum_by_base f l acc
folds l
by base. It applies f
to a
partition of l
by bases.
Raises Error_Top
in the case Top Top
, Top bases
.
val out_some_or_bottom : t option -> t
val cached_fold : cache:string * int ->
temporary:bool ->
f:(Base.t -> Abstract_value.Int_Intervals.t -> 'a) ->
projection:(Base.t -> Abstract_value.Int_Intervals.t) ->
joiner:('a -> 'a -> 'a) -> empty:'a -> t -> 'a
Lmap_bitwise utilities
The functions default and default_all are intended to be called by the
functor Lmap_bitwise.
val default : Base.t -> Abstract_interp.Int.t -> Abstract_interp.Int.t -> t
val defaultall : Base.t -> t