sig
module LocationLattice :
sig
type l = Cil_types.location
type t = private Top | Bottom | Value of l
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
val join : t -> t -> t
val is_included : t -> t -> bool
val bottom : t
val top : t
type widen_hint
val widen : widen_hint -> t -> t -> t
val cardinal_zero_or_one : t -> bool
val narrow : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val intersects : t -> t -> bool
val project : t -> l
val inject : l -> t
val transform : (l -> l -> l) -> t -> t -> t
val current_loc : unit -> t
end
type origin =
Misalign_read of Origin.LocationLattice.t
| Leaf of Origin.LocationLattice.t
| Merge of Origin.LocationLattice.t
| Arith of Origin.LocationLattice.t
| Well
| Unknown
type t = origin
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code : Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
type kind = K_Misalign_read | K_Leaf | K_Merge | K_Arith
val current : Origin.kind -> Origin.origin
val pretty_as_reason : Format.formatter -> t -> unit
val top : t
val is_top : t -> bool
val bottom : t
val join : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val narrow : t -> t -> t
val is_included : t -> t -> bool
end