Frama-C API - Zone
Association between bases and ranges of bits.
include Datatype.S_with_collections with type t := t
include Datatype.S with type t := t
include Datatype.S_no_copy with type t := t
include Datatype.Ty with type t := t
module Set : Datatype.Set with type elt = t
module Map : Datatype.Map with type key = t
module Hashtbl : Datatype.Hashtbl with type key = t
val pretty_debug : t Pretty_utils.formatter
include Lattice_type.Bounded_Join_Semi_Lattice with type t := t
include Lattice_type.Join_Semi_Lattice with type t := t
datatype of element of the lattice
include Datatype.S with type t := t
include Datatype.S_no_copy with type t := t
include Datatype.Ty with type t := t
val packed_descr : Structural_descr.pack
Packed version of the descriptor.
val reprs : t list
List of representants of the descriptor.
val hash : t -> int
Hash function: same spec than Hashtbl.hash
.
val pretty : Stdlib.Format.formatter -> t -> unit
Pretty print each value in an user-friendly way.
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
mem_project f x
must return true
iff there is a value p
of type Project.t
in x
such that f p
returns true
.
val bottom : t
smallest element
include Lattice_type.With_Top with type t := t
val top : t
largest element
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
mem_base b m
returns true
if b
is associated to something or topified in t
, and false
otherwise.
val get_bases : t -> Base.SetLattice.t
Returns the bases contained by the given zone. Never fails, but may return Base.SetLattice.Top
.
Assuming that z1
and z2
only contain valid bases, valid_intersects z1 z2
returns true iff z1
and z2
have a valid intersection.
Folding
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_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