functor
(V : sig
exception Error_Top
exception Error_Bottom
type t
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 widen_hint
val join : t -> t -> t
val link : t -> t -> t
val meet : t -> t -> t
val narrow : t -> t -> t
val bottom : t
val top : t
val is_included : t -> t -> bool
val is_included_exn : t -> t -> unit
val intersects : t -> t -> bool
val widen : widen_hint -> t -> t -> t
val cardinal_zero_or_one : t -> bool
val cardinal_less_than : t -> int -> int
val tag : t -> int
end) ->
sig
type t
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 degenerate : V.t -> t
val pretty_with_type :
Cil_types.typ option -> Format.formatter -> t -> unit
val empty : t
val is_empty : t -> bool
val find :
(Abstract_interp.Int.t -> Abstract_interp.Int.t -> V.t) ->
Offsetmap_bitwise.itv -> t -> V.t
val find_intervs :
(Abstract_interp.Int.t -> Abstract_interp.Int.t -> V.t) ->
Abstract_value.Int_Intervals.t -> t -> V.t
val add : Offsetmap_bitwise.itv -> V.t -> t -> t
val add_approximate : Offsetmap_bitwise.itv -> V.t -> t -> t
val collapse : t -> V.t
val find_iset :
(Abstract_interp.Int.t -> Abstract_interp.Int.t -> V.t) ->
V.t -> Abstract_value.Int_Intervals.t -> t -> V.t
val add_iset :
exact:bool -> Abstract_value.Int_Intervals.t -> V.t -> t -> t
val join : t -> t -> t
val joindefault : t -> t
val is_included_exn : t -> t -> unit
val map_and_merge : (V.t -> V.t) -> t -> t -> t
val map : (bool * V.t -> bool * V.t) -> t -> t
val map2 :
((bool * V.t) option -> (bool * V.t) option -> bool * V.t) ->
t -> t -> t
val fold :
(Abstract_value.Int_Intervals.t -> bool * V.t -> 'a -> 'a) ->
t -> 'a -> 'a
val copy_paste :
f:((bool * V.t -> bool * V.t) *
(Abstract_interp.Int.t -> Abstract_interp.Int.t -> V.t))
option ->
t ->
Abstract_interp.Int.t ->
Abstract_interp.Int.t -> Abstract_interp.Int.t -> t -> t
val copy_merge :
t ->
Abstract_interp.Int.t ->
Abstract_interp.Int.t -> Abstract_interp.Int.t -> t -> t
val copy :
f:((bool * V.t -> bool * V.t) *
(Abstract_interp.Int.t -> Abstract_interp.Int.t -> V.t))
option ->
t -> Abstract_interp.Int.t -> Abstract_interp.Int.t -> t
val tag : t -> int
end