Module Locations.Zone

module Zone: sig .. end

Association between bases and ranges of bits.


type map_t 
type t = private 
| Top of Base.SetLattice.t * Origin.t
| Map of map_t
include Datatype.S_with_collections
val pretty_debug : t Pretty_utils.formatter
include Lattice_type.Bounded_Join_Semi_Lattice
include Lattice_type.With_Top
include Lattice_type.With_Narrow
include Lattice_type.With_Under_Approximation
include Lattice_type.With_Diff
val is_bottom : t -> bool
val inject : Base.t -> Int_Intervals.t -> t
val find_lonely_key : t -> Base.t * Int_Intervals.t
val find_or_bottom : Base.t -> map_t -> Int_Intervals.t
val find : Base.t -> t -> 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.

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.

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.

val fold_i : (Base.t -> Int_Intervals.t -> 'a -> 'a) -> t -> 'a -> 'a

fold_i f l acc folds l by base.

val fold_topset_ok : (Base.t -> Int_Intervals.t -> 'a -> 'a) -> t -> 'a -> 'a

fold_i f l acc folds l by base.

val cached_fold : cache_name:string ->
temporary:bool ->
f:(Base.t -> Int_Intervals.t -> 'b) ->
projection:(Base.t -> Int_Intervals.t) ->
joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val fold2_join_heterogeneous : cache:Hptmap_sig.cache_type ->
empty_left:('a Hptmap.Shape(Base.Base).t -> 'b) ->
empty_right:(t -> 'b) ->
both:(Base.t -> Int_Intervals.t -> 'a -> 'b) ->
join:('b -> 'b -> 'b) ->
empty:'b -> t -> 'a Hptmap.Shape(Base.Base).t -> 'b
val shape : map_t -> Int_Intervals.t Hptmap.Shape(Base.Base).t

Misc