functor
(M : Memory.Model) (C : sig
type loc = M.loc
val equal_obj :
Ctypes.c_object ->
loc Memory.value ->
loc Memory.value -> Lang.F.pred
end) (L : sig
type loc = M.loc
val vars :
loc Memory.sloc list -> Lang.F.Vars.t
val pp_logic :
Format.formatter ->
loc Memory.logic -> unit
val pp_sloc :
Format.formatter ->
loc Memory.sloc -> unit
val pp_region :
Format.formatter ->
loc Memory.sloc list -> unit
end) ->
sig
module Hmap :
sig
type key = M.Heap.t
type 'a t = 'a M.Heap.map
val empty : 'a t
val add : key -> 'a -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val findk : key -> 'a t -> key * 'a
val size : 'a t -> int
val is_empty : 'a t -> bool
val insert : (key -> 'a -> 'a -> 'a) -> key -> 'a -> 'a t -> 'a t
val change :
(key -> 'b -> 'a option -> 'a option) -> key -> 'b -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val mapf : (key -> 'a -> 'b option) -> 'a t -> 'b t
val mapq : (key -> 'a -> 'a option) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted : (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val union : (key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val inter : (key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val interf : (key -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
val interq : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val diffq : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val subset : (key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iterk : (key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val iter2 :
(key -> 'a option -> 'b option -> unit) -> 'a t -> 'b t -> unit
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
type domain = M.Heap.set
val domain : 'a t -> domain
end
module Dom :
sig
type elt = M.Heap.t
type t = M.Heap.set
val empty : t
val add : elt -> t -> t
val singleton : elt -> t
val elements : t -> elt list
val is_empty : t -> bool
val mem : elt -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val iter_sorted : (elt -> unit) -> t -> unit
val fold_sorted : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val union : t -> t -> t
val inter : t -> t -> t
val subset : t -> t -> bool
val intersect : t -> t -> bool
type 'a mapping = 'a M.Heap.map
val mapping : (elt -> 'a) -> t -> 'a mapping
end
type region = (Ctypes.c_object * M.loc Memory.sloc list) list
val vars : LogicAssigns.Make.region -> Lang.F.Vars.t
val dsloc : Ctypes.c_object -> M.loc Memory.sloc -> M.Heap.set
val domain : LogicAssigns.Make.region -> LogicAssigns.Make.Dom.t
val assigned_seq :
Lang.F.pred Bag.t ->
M.sigma Memory.sequence ->
(Ctypes.c_object * M.loc Memory.sloc) list -> Lang.F.pred Bag.t
val assigned :
M.sigma Memory.sequence -> LogicAssigns.Make.region -> Lang.F.pred list
end