Tree_state.Heapinclude sig ... endmodule SM : sig ... endtype syn = StateKey.syn * Freeable_block_with_meta.synval consume : syn -> t option -> (t option, syn list) DecayMapMonad.Consumer.tval empty : tval syntactic_bindings :
t ->
(StateKey.t * Freeable_block_with_meta.t) Stdlib.Seq.tval syntactic_mem : StateKey.t -> t -> boolval pp' :
?codom:(Stdlib.Format.formatter -> Freeable_block_with_meta.t -> unit) ->
?key:(Stdlib.Format.formatter -> StateKey.t -> unit) ->
?ignore:((StateKey.t * Freeable_block_with_meta.t) -> bool) ->
Stdlib.Format.formatter ->
t ->
unitval pp : Stdlib.Format.formatter -> t -> unitval show : t -> stringval pp_syn : Stdlib.Format.formatter -> syn -> unitval show_syn : syn -> stringval ins_outs :
syn ->
DecayMapMonad.Value.Expr.t list * DecayMapMonad.Value.Expr.t listval alloc :
new_codom:Freeable_block_with_meta.t ->
(StateKey.t, 'err, syn list) SM.Result.tval allocs :
fn:('a -> StateKey.t -> ('k * Freeable_block_with_meta.t) DecayMapMonad.t) ->
els:'a list ->
('k list, 'err, syn list) SM.Result.tval wrap :
StateKey.t ->
(Freeable_block_with_meta.t option ->
(('a, 'err, Freeable_block_with_meta.syn list) Soteria.Symex.Compo_res.t
* Freeable_block_with_meta.t option)
DecayMapMonad.t) ->
('a, 'err, syn list) SM.Result.tval fold :
('acc -> (StateKey.t * Freeable_block_with_meta.t) -> 'acc DecayMapMonad.t) ->
'acc ->
t option ->
'acc DecayMapMonad.tval produce : syn -> t option -> t option DecayMapMonad.Producer.tval with_ptr :
Sptr.t ->
([ `NonZero | `Zero ] Typed.t ->
('a,
[> `AccessedFnPointer
| `NullDereference
| `UBDanglingPointer
| `UseAfterFree ] as 'b,
Block.syn list)
Block.SM.Result.t) ->
('a, 'b, syn list) SM.Result.tval is_freed : StateKey.t -> (bool, 'a, syn list) SM.Result.tmodule Decoder : sig ... end