sig
val opt2 : ('a -> 'b -> 'c) -> 'a option -> 'b option -> 'c option
val cache_name : string -> Hptmap_sig.cache_type
module Bounds :
sig
type t =
Datatype.Option(Datatype.Integer).t *
Datatype.Option(Datatype.Integer).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 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 varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
val pretty : Format.formatter -> t -> unit
val pretty_debug : Format.formatter -> t -> unit
val inject_range : int -> int -> t
val enlarge : Integer.t -> t -> t
val lift :
(Datatype.Integer.t -> Datatype.Integer.t -> Datatype.Integer.t) ->
(Datatype.Integer.t -> Datatype.Integer.t -> Datatype.Integer.t) ->
t -> t -> t
val equal : t -> t -> bool
val is_included : t -> t -> bool
val sub : t -> t -> t
val join : t -> t -> t
val add : t -> t -> t
val narrow : t -> t -> t Bottom.or_bottom
val succ : t -> t
val neg : t -> t
val mul_ct : Integer.t -> t -> t
val mul : t -> t -> t
val zero : Integer.t option * Integer.t option
val widen : ?threshold:Datatype.Integer.t -> t -> t -> t
val to_ival : t -> Ival.t
val from_ival : Ival.t -> t
type classify =
ContainsZero
| Positive of Integer.t * Integer.t option
| Negative of Integer.t option * Integer.t
val classify_sign : t -> Gauges_domain.G.Bounds.classify
val div_towards_minus_infty : Integer.t -> Integer.t -> Integer.t
val div_towards_plus_infty : Integer.t -> Integer.t -> Integer.t
val backward_nb :
b:t -> r:Ival.t -> [> `Value of Integer.t option * Integer.t option ]
end
module MV :
sig
type key = Base.t
type v = Cvalue.V.t
type 'a shape = 'a Hptmap.Shape(Base).t
type prefix = Hptmap.prefix
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
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 filter_map_inplace : (key -> 'a -> 'a option) -> '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 id : t -> int
val self : State.t
val empty : t
val is_empty : t -> bool
val add : key -> v -> t -> t
val find : key -> t -> v
val find_check_missing : key -> t -> v
val find_key : key -> t -> key
val remove : key -> t -> t
val mem : key -> t -> bool
val iter : (key -> v -> unit) -> t -> unit
val map : (v -> v) -> t -> t
val map' : (key -> v -> v option) -> t -> t
val fold : (key -> v -> 'b -> 'b) -> t -> 'b -> 'b
val fold_rev : (key -> v -> 'b -> 'b) -> t -> 'b -> 'b
val for_all : (key -> v -> bool) -> t -> bool
val exists : (key -> v -> bool) -> t -> bool
type empty_action =
Neutral
| Absorbing
| Traversing of (key -> v -> v option)
val merge :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide_both:(key -> v -> v -> v option) ->
decide_left:empty_action -> decide_right:empty_action -> t -> t -> t
val generic_join :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide:(key -> v option -> v option -> v) -> t -> t -> t
val join :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool -> decide:(key -> v -> v -> v) -> t -> t -> t
val inter :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool -> decide:(key -> v -> v -> v option) -> t -> t -> t
val inter_with_shape : 'a shape -> t -> t
type decide_fast = Done | Unknown
val generic_predicate :
exn ->
cache:string * 'a ->
decide_fast:(t -> t -> decide_fast) ->
decide_fst:(key -> v -> unit) ->
decide_snd:(key -> v -> unit) ->
decide_both:(v -> v -> unit) -> t -> t -> unit
type predicate_type = ExistentialPredicate | UniversalPredicate
type predicate_result = PTrue | PFalse | PUnknown
val binary_predicate :
Hptmap_sig.cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_fst:(key -> v -> bool) ->
decide_snd:(key -> v -> bool) ->
decide_both:(key -> v -> v -> bool) -> t -> t -> bool
val generic_symmetric_predicate :
exn ->
decide_fast:(t -> t -> decide_fast) ->
decide_one:(key -> v -> unit) ->
decide_both:(v -> v -> unit) -> t -> t -> unit
val symmetric_binary_predicate :
Hptmap_sig.cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_one:(key -> v -> bool) ->
decide_both:(key -> v -> v -> 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 -> v -> 'b) -> joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val cached_map :
cache:string * int -> temporary:bool -> f:(key -> v -> v) -> t -> t
val singleton : key -> v -> t
val is_singleton : t -> (key * v) option
val on_singleton : (key -> v -> bool) -> t -> bool
val cardinal : t -> int
val min_binding : t -> key * v
val max_binding : t -> key * v
val split : key -> t -> t * v option * t
val compositional_bool : t -> bool
val clear_caches : unit -> unit
val from_shape : (key -> 'a -> v) -> 'a shape -> t
val shape : t -> v shape
val fold2_join_heterogeneous :
cache:Hptmap_sig.cache_type ->
empty_left:('a shape -> 'b) ->
empty_right:(t -> 'b) ->
both:(key -> v -> 'a -> 'b) ->
join:('b -> 'b -> 'b) -> empty:'b -> t -> 'a shape -> 'b
val pretty_debug : Format.formatter -> t -> unit
val comp_prefixes : t -> t -> unit
val pretty_prefix : prefix -> Format.formatter -> t -> unit
type subtree
exception Found_prefix of prefix * subtree * subtree
val find_prefix : t -> prefix -> subtree option
val hash_subtree : subtree -> int
val equal_subtree : subtree -> subtree -> bool
val join_disjoint : t -> t -> t
val empty_wh : Integer.t * ('a -> Ival.Widen_Hints.t)
val widen : t -> t -> t
val is_included : t -> t -> bool
end
module MC :
sig
type key = Base.t
type v = Bounds.t
type 'a shape = 'a Hptmap.Shape(Base).t
type prefix = Hptmap.prefix
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
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 filter_map_inplace : (key -> 'a -> 'a option) -> '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 id : t -> int
val self : State.t
val empty : t
val is_empty : t -> bool
val add : key -> v -> t -> t
val find : key -> t -> v
val find_check_missing : key -> t -> v
val find_key : key -> t -> key
val remove : key -> t -> t
val mem : key -> t -> bool
val iter : (key -> v -> unit) -> t -> unit
val map : (v -> v) -> t -> t
val map' : (key -> v -> v option) -> t -> t
val fold : (key -> v -> 'b -> 'b) -> t -> 'b -> 'b
val fold_rev : (key -> v -> 'b -> 'b) -> t -> 'b -> 'b
val for_all : (key -> v -> bool) -> t -> bool
val exists : (key -> v -> bool) -> t -> bool
type empty_action =
Neutral
| Absorbing
| Traversing of (key -> v -> v option)
val merge :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide_both:(key -> v -> v -> v option) ->
decide_left:empty_action -> decide_right:empty_action -> t -> t -> t
val generic_join :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool ->
decide:(key -> v option -> v option -> v) -> t -> t -> t
val inter :
cache:Hptmap_sig.cache_type ->
symmetric:bool ->
idempotent:bool -> decide:(key -> v -> v -> v option) -> t -> t -> t
val inter_with_shape : 'a shape -> t -> t
type decide_fast = Done | Unknown
val generic_predicate :
exn ->
cache:string * 'a ->
decide_fast:(t -> t -> decide_fast) ->
decide_fst:(key -> v -> unit) ->
decide_snd:(key -> v -> unit) ->
decide_both:(v -> v -> unit) -> t -> t -> unit
type predicate_type = ExistentialPredicate | UniversalPredicate
type predicate_result = PTrue | PFalse | PUnknown
val binary_predicate :
Hptmap_sig.cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_fst:(key -> v -> bool) ->
decide_snd:(key -> v -> bool) ->
decide_both:(key -> v -> v -> bool) -> t -> t -> bool
val generic_symmetric_predicate :
exn ->
decide_fast:(t -> t -> decide_fast) ->
decide_one:(key -> v -> unit) ->
decide_both:(v -> v -> unit) -> t -> t -> unit
val symmetric_binary_predicate :
Hptmap_sig.cache_type ->
predicate_type ->
decide_fast:(t -> t -> predicate_result) ->
decide_one:(key -> v -> bool) ->
decide_both:(key -> v -> v -> 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 -> v -> 'b) -> joiner:('b -> 'b -> 'b) -> empty:'b -> t -> 'b
val cached_map :
cache:string * int -> temporary:bool -> f:(key -> v -> v) -> t -> t
val singleton : key -> v -> t
val is_singleton : t -> (key * v) option
val on_singleton : (key -> v -> bool) -> t -> bool
val cardinal : t -> int
val min_binding : t -> key * v
val max_binding : t -> key * v
val split : key -> t -> t * v option * t
val compositional_bool : t -> bool
val clear_caches : unit -> unit
val from_shape : (key -> 'a -> v) -> 'a shape -> t
val shape : t -> v shape
val fold2_join_heterogeneous :
cache:Hptmap_sig.cache_type ->
empty_left:('a shape -> 'b) ->
empty_right:(t -> 'b) ->
both:(key -> v -> 'a -> 'b) ->
join:('b -> 'b -> 'b) -> empty:'b -> t -> 'a shape -> 'b
val pretty_debug : Format.formatter -> t -> unit
val comp_prefixes : t -> t -> unit
val pretty_prefix : prefix -> Format.formatter -> t -> unit
type subtree
exception Found_prefix of prefix * subtree * subtree
val find_prefix : t -> prefix -> subtree option
val hash_subtree : subtree -> int
val equal_subtree : subtree -> subtree -> bool
val widen : t -> t -> t
val join : t -> t -> t
val is_included : t -> t -> bool
end
val sub_min_max_cvalue :
Cvalue.V.t -> Cvalue.V.t -> Gauges_domain.G.Bounds.t option
val sub_mv :
Gauges_domain.G.MV.t -> Gauges_domain.G.MV.t -> Gauges_domain.G.MC.t
val mv_minus_mc :
Gauges_domain.G.MV.t -> Gauges_domain.G.MC.t -> Gauges_domain.G.MV.t
val forget :
Gauges_domain.G.Bounds.t ->
Gauges_domain.G.MV.t -> Gauges_domain.G.MC.t -> Gauges_domain.G.MV.t
type multiple_iterations = {
nb : Gauges_domain.G.Bounds.t;
coeffs : Gauges_domain.G.MC.t;
}
module MultipleIterations :
sig
val compare :
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations -> int
val equal :
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations -> bool
val hash : Gauges_domain.G.multiple_iterations -> int
val structural_descr : Structural_descr.t
val succ :
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations
val join :
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations
val widen :
Cil_types.stmt ->
widen_nb:bool ->
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations ->
Gauges_domain.G.multiple_iterations
end
type iteration_info =
PreciseIteration of int
| MultipleIterations of Gauges_domain.G.multiple_iterations
module IterationInfo :
sig
type t = iteration_info
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 is_included :
Gauges_domain.G.iteration_info ->
Gauges_domain.G.iteration_info -> bool
end
type t =
MV.t * Datatype.List(Datatype.Pair(Cil_datatype.Stmt)(IterationInfo)).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 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 filter_map_inplace : (key -> 'a -> 'a option) -> '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 empty : Gauges_domain.G.MV.t * 'a list
val top : t -> t
val pretty_iteration_info :
Format.formatter -> Gauges_domain.G.iteration_info -> unit
val pretty_loop_step :
Format.formatter ->
Cil_types.stmt * Gauges_domain.G.iteration_info -> unit
val pretty_loop_info :
Datatype.List(Datatype.Pair(Cil_datatype.Stmt)(IterationInfo)).t
Pretty_utils.formatter
val pretty : Format.formatter -> t -> unit
val inc : t -> t
val remove_coeffs :
Gauges_domain.G.MC.t ->
int -> Gauges_domain.G.MV.t -> Gauges_domain.G.MV.t
val join_consecutive_lambda :
int ->
Gauges_domain.G.MV.t ->
Gauges_domain.G.MV.t ->
Gauges_domain.G.MC.t * Gauges_domain.G.MV.t * Gauges_domain.G.MV.t
val join_same_lambda :
Gauges_domain.G.MV.t -> Gauges_domain.G.MV.t -> Gauges_domain.G.MV.t
exception MessyJoin
val join_iterations :
t ->
t ->
Gauges_domain.G.MV.t * Gauges_domain.G.MV.t *
(Cil_datatype.Stmt.t * Gauges_domain.G.iteration_info) list * bool
val join : t -> t -> t
val is_included : t -> t -> bool
val join_and_is_included : t -> t -> t * bool
val widen : 'a -> Cil_datatype.Stmt.t -> t -> t -> t
val enter_loop : Cil_datatype.Stmt.t -> t -> t
val leave_loop : Cil_datatype.Stmt.t -> t -> t
val tracked_variable : Cil_types.varinfo -> bool
val kill_base : Gauges_domain.G.MC.key -> t -> t
exception Untranslatable
module Gauge :
sig
type t = Cvalue.V.t * Gauges_domain.G.Bounds.t list
val pretty : Format.formatter -> Gauges_domain.G.Gauge.t -> unit
val map2 : ('a -> 'a -> 'a) -> 'a list -> 'a list -> 'a list
val _join :
Gauges_domain.G.Gauge.t ->
Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val on_cvalue_ival : (Ival.t -> Ival.t) -> Cvalue.V.t -> Cvalue.V.t
val neg : Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val mul_ct :
Integer.t -> Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val mul :
Gauges_domain.G.Gauge.t ->
Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val sanitize_v : Cvalue.V.t -> unit
val add :
Gauges_domain.G.Gauge.t ->
Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val sub :
Gauges_domain.G.Gauge.t ->
Gauges_domain.G.Gauge.t -> Gauges_domain.G.Gauge.t
val ct : Cvalue.V.t -> Gauges_domain.G.Gauge.t
end
val extract_gauge :
t -> Gauges_domain.G.MV.key -> Gauges_domain.G.Gauge.t option
val eval_gauge : t -> Gauges_domain.G.Gauge.t -> Cvalue.V.t
val backward_loop : t -> Gauges_domain.G.MC.key -> Cvalue.V.t -> t option
val loc_to_base : Locations.location -> Cil_datatype.Typ.t -> Base.t
val gauge_from_state :
Gauges_domain.G.MV.key -> t -> Gauges_domain.G.Gauge.t
val translate_exp :
t ->
(Cil_types.lval -> Locations.location) ->
(Cil_types.exp -> Cvalue.V.t) -> Cil_types.exp -> Gauges_domain.G.Gauge.t
val store_gauge :
Gauges_domain.G.MC.key -> Gauges_domain.G.Gauge.t -> t -> t
val assign :
(Cil_types.lval -> Locations.location) ->
(Cil_types.exp -> Cvalue.V.t) ->
Cil_types.lval -> Cil_types.exp -> t -> t
end