sig
type key = Cil_datatype.Stmt_Id.t
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 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
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val choose : t -> elt
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
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
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
module Key :
sig
type t = key
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
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t 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
end
end
module Hashtbl :
sig
type key = t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val iter_sorted :
?cmp:(key -> key -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_value :
cmp:('a -> 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_value :
cmp:('a -> 'a -> int) -> (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val structural_descr : Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.t
val memo : 'a t -> key -> (key -> 'a) -> 'a
module Key :
sig
type t = key
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
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t 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
end
end
val self : State.t
val empty : t
val hash : t -> int
val is_empty : t -> bool
val add : key -> Locations.Zone.t -> t -> t
val find : key -> t -> Locations.Zone.t
val find_key : key -> t -> key
val remove : key -> t -> t
val mem : key -> t -> bool
val iter :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> unit) -> t -> unit
val map : (Locations.Zone.t -> Locations.Zone.t) -> t -> t
val map' :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> Locations.Zone.t option) ->
t -> t
val fold :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> 'b -> 'b) -> t -> 'b -> 'b
val fold_rev :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> 'b -> 'b) -> t -> 'b -> 'b
val for_all :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> bool) -> t -> bool
val exists :
(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> bool) -> t -> bool
val generic_merge :
cache:string * bool ->
decide:(Cil_datatype.Stmt_Id.t ->
Locations.Zone.t option ->
Locations.Zone.t option -> Locations.Zone.t) ->
idempotent:bool -> t -> t -> t
val symmetric_merge :
cache:string * 'a ->
decide_none:(Cil_datatype.Stmt_Id.t ->
Locations.Zone.t -> Locations.Zone.t) ->
decide_some:(Locations.Zone.t -> Locations.Zone.t -> Locations.Zone.t) ->
t -> t -> t
val symmetric_inter :
cache:string * 'a ->
decide_some:(Cil_datatype.Stmt_Id.t ->
Locations.Zone.t ->
Locations.Zone.t -> Locations.Zone.t option) ->
t -> t -> t
val inter_with_shape : 'a Hptmap.Shape(Cil_datatype.Stmt_Id).t -> t -> t
type decide_fast = Done | Unknown
val generic_predicate :
exn ->
cache:string * 'a ->
decide_fast:(t -> t -> decide_fast) ->
decide_fst:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> unit) ->
decide_snd:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> unit) ->
decide_both:(Locations.Zone.t -> Locations.Zone.t -> unit) ->
t -> t -> unit
type predicate_type = ExistentialPredicate | UniversalPredicate
type predicate_result = PTrue | PFalse | PUnknown
type cache_type =
NoCache
| PersistentCache of string
| TemporaryCache of string
val binary_predicate :
cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_fst:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> bool) ->
decide_snd:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> bool) ->
decide_both:(Cil_datatype.Stmt_Id.t ->
Locations.Zone.t -> Locations.Zone.t -> bool) ->
t -> t -> bool
val generic_symmetric_predicate :
exn ->
decide_fast:(t -> t -> decide_fast) ->
decide_one:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> unit) ->
decide_both:(Locations.Zone.t -> Locations.Zone.t -> unit) ->
t -> t -> unit
val symmetric_binary_predicate :
cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_one:(Cil_datatype.Stmt_Id.t -> Locations.Zone.t -> bool) ->
decide_both:(Cil_datatype.Stmt_Id.t ->
Locations.Zone.t -> Locations.Zone.t -> bool) ->
t -> t -> bool
val decide_fast_inclusion : t -> t -> predicate_result
val decide_fast_intersection : t -> t -> predicate_result
val cached_fold :
cache_name:string ->
temporary:bool ->
f:(key -> Locations.Zone.t -> 'b) ->
joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val cached_map :
cache:string * int ->
temporary:bool ->
f:(key -> Locations.Zone.t -> Locations.Zone.t) -> t -> t
val singleton : key -> Locations.Zone.t -> t
val is_singleton : t -> (key * Locations.Zone.t) option
val cardinal : t -> int
val min_binding : t -> key * Locations.Zone.t
val max_binding : t -> key * Locations.Zone.t
val split : key -> t -> t * Locations.Zone.t option * t
val compositional_bool : t -> bool
val clear_caches : unit -> unit
val from_shape :
(Cil_datatype.Stmt_Id.t -> 'a -> Locations.Zone.t) ->
'a Hptmap.Shape(Cil_datatype.Stmt_Id).t -> t
val shape : t -> Locations.Zone.t Hptmap.Shape(Cil_datatype.Stmt_Id).t
val hash_debug : t -> int
val pretty_debug : Format.formatter -> t -> unit
val comp_prefixes : t -> t -> unit
val pretty_prefix : Hptmap.prefix -> Format.formatter -> t -> unit
type subtree
exception Found_prefix of Hptmap.prefix * subtree * subtree
val find_prefix : t -> Hptmap.prefix -> subtree option
val hash_subtree : subtree -> int
val equal_subtree : subtree -> subtree -> bool
val join : t -> t -> t
end