package goblint
Module AddressDomain.AddressLattice
Address lattice.
Actually a disjoint union of lattices without top or bottom. Addresses are grouped as follows:
- Each
Addr, modulo precise index expressions in the offset, is a sublattice with ordering induced byMval. NullPtris a singleton sublattice.UnknownPtris a singleton sublattice.- If
ana.base.limit-string-addressesis enabled, then allStrPtrare together in one sublattice with flat ordering. Ifana.base.limit-string-addressesis disabled, then eachStrPtris a singleton sublattice.
Parameters
module Mval : Mval.LatticeSignature
include sig ... end
type t = AddressBase(Mval).t = | Addr of Mval.t(*Pointer to mvalue.
*)| NullPtr(*NULL pointer.
*)| UnknownPtr(*Unknown pointer. Could point to globals, heap and escaped variables.
*)| StrPtr of string option(*String literal pointer.
*)StrPtr Noneabstracts any string pointer
val to_n_c_string : int -> t -> string optionConvert StrPtr to C string of given maximum length if possible.
val to_string_length : t -> int optionFind length of C string if possible.
val is_definite : t -> boolWhether address is a NULL pointer or an mvalue that has only definite integer indexing (and fields).
val of_var : GoblintCil.varinfo -> tConvert from variable (without offset).
val to_var : t -> GoblintCil.varinfo optionConvert to variable if possible.
val to_var_may : t -> GoblintCil.varinfo optionConvert to variable with any offset if possible.
val to_var_must : t -> GoblintCil.varinfo optionConvert to variable without offset if possible.
val to_exp : t -> GoblintCil.expConvert to CIL expression.
val type_of : t -> GoblintCil.typType of address.
include Lattice.S with type t := t
include Lattice.PO with type t := t
include Printable.S with type t := t
val hash : t -> intval show : t -> stringval pretty : unit -> t -> Printable.Pretty.docval printXml : 'a BatInnerIO.output -> t -> unitval to_yojson : t -> Yojson.Safe.tval tag : t -> intUnique ID, given by HConsed, for context identification in witness
val arbitrary : unit -> t QCheck.arbitrarywiden x y assumes leq x y. Solvers guarantee this by calling widen old (join old new).
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.docIf leq x y = false, then pretty_diff () (x, y) should explain why.
val bot : unit -> tval is_bot : t -> boolval top : unit -> tval is_top : t -> bool