Frama-C API - S
include Lattice_type.Full_Lattice
include Lattice_type.Bounded_Join_Semi_Lattice
include Lattice_type.Join_Semi_Lattice
datatype of element of the lattice
include Datatype.S
include Datatype.S_no_copy
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
include Lattice_type.With_Intersects with type t := t
val is_top : t -> bool
val inject_bounds : Abstract_interp.Int.t -> Abstract_interp.Int.t -> t
val from_ival_size : Ival.t -> Int_Base.t -> t
Conversion from an ival, which represents the beginning of each interval. The size if taken from the Int_Base.t
argument. If the result contains more than -plevel
arguments, it is automatically over-approximated.
val from_ival_size_under : Ival.t -> Int_Base.t -> t
Same as from_ival_size
, except that the result is an under-approximation if the ival points to too many locations
May raise Error_Top
. As intervals are not represented as lists, this function has an overhead. Use iterators whenever possible instead.
Iterators
val pretty_typ : Cil_types.typ option -> t Pretty_utils.formatter
Pretty-printer that supposes the intervals are subranges of a C type, and use the type to print nice offsets
val range_covers_whole_type : Cil_types.typ -> t -> bool
Does the interval cover the entire range of bits that are valid for the given type.