Module Locations.Zone

module Zone: sig .. end
Association between varids and ranges of bits.
Consult the Plugin Development Guide for additional details.

type map_t 
type tt = 
| Top of Base.SetLattice.t * Origin.t
| Map of map_t
include Datatype.S
val top : t
val bottom : t
val is_bottom : t -> bool
val inject : Base.t -> Lattice_Interval_Set.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 -> Lattice_Interval_Set.Int_Intervals.t -> t) -> t -> t
val find_lonely_key : t -> Base.t * Lattice_Interval_Set.Int_Intervals.t
val find_or_bottom : Base.t -> map_t -> Lattice_Interval_Set.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
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

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 fold_i : (Base.t -> Lattice_Interval_Set.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 -> Lattice_Interval_Set.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 cached_fold : cache:string * int ->
temporary:bool ->
f:(Base.t -> Lattice_Interval_Set.Int_Intervals.t -> 'b) ->
projection:(Base.t -> Lattice_Interval_Set.Int_Intervals.t) ->
joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b

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