package goblint

  1. Overview
  2. Docs
package goblint
Legend:
Library
Module
Module type
Parameter
Class
Class type
include module type of struct include Analyses.DefaultSpec end

Relatively safe default implementations of some boring Spec functions.

type marshal = unit
val init : 'a -> unit
val finalize : unit -> unit
val vdecl : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'f
val asm : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e
val skip : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e
val query : 'b -> 'a Queries.t -> 'a0
val event : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'f -> 'g
val morphstate : 'a -> 'b -> 'c
val sync : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'f
val context : 'a -> 'b -> 'c
val access : 'a -> 'b -> unit
type trans_in = D.t
type trans_out = D.t
type transfer = trans_in -> trans_out
val name : unit -> string
val should_join : D.t -> D.t -> bool
val startstate : 'a -> D.t
val threadenter : 'a -> 'b -> 'c -> 'd -> D.t list
val threadspawn : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'f -> 'g -> 'h -> 'i
val exitstate : 'a -> D.t
val conv_offset : [< `Field of 'b * 'c | `Index of Prelude.Ana.exp * 'd | `NoOffset ] as 'a -> [> `Field of 'b * 'e | `Index of IntDomain.IntDomTuple.t * 'e | `NoOffset ] as 'e
val access_address : Queries.ask -> 'a -> Prelude.Ana.lval -> (CilType.Varinfo.t * [> `Field of CilType.Fieldinfo.t * 'b | `Index of IntDomain.IntDomTuple.t * 'b | `NoOffset ] as 'b * 'c) list
val access_one_byval : Queries.ask -> bool -> Prelude.Ana.exp -> (CilType.Varinfo.t * [> `Field of CilType.Fieldinfo.t * 'a | `Index of IntDomain.IntDomTuple.t * 'a | `NoOffset ] as 'a * bool) list
val access_lv_byval : Queries.ask -> Prelude.Ana.lval -> (CilType.Varinfo.t * [> `Field of CilType.Fieldinfo.t * 'a | `Index of IntDomain.IntDomTuple.t * 'a | `NoOffset ] as 'a * bool) list
val varoffs : Queries.ask -> Prelude.Ana.exp -> (CilType.Varinfo.t * [> `Field of CilType.Fieldinfo.t * 'b | `Index of IntDomain.IntDomTuple.t * 'b | `NoOffset ] as 'a) list
val vars : Queries.ask -> Prelude.Ana.exp -> Addr.t list
val is_expr_initd : Queries.ask -> Prelude.Ana.exp -> D.t -> bool
val remove_if_prefix : (Prelude.Ana.varinfo * (Addr.field, Addr.idx) Lval.offs) -> D.t -> D.t
type lval_offs = (Addr.field, Addr.idx) Lval.offs
type var_offs = Prelude.Ana.varinfo * lval_offs
val init_lval : Queries.ask -> Prelude.Ana.lval -> D.t -> D.t
val to_addrs : Prelude.Ana.varinfo -> Addr.t list
val remove_unreachable : Queries.ask -> Prelude.Ana.exp list -> D.t -> D.t
val assign : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.lval -> Prelude.Ana.exp -> trans_out
val branch : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.exp -> bool -> trans_out
val body : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.fundec -> trans_out
val return : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.exp option -> Prelude.Ana.fundec -> trans_out
val enter : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.lval option -> Prelude.Ana.fundec -> Prelude.Ana.exp list -> (D.t * D.t) list
val combine : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.lval option -> 'd -> Prelude.Ana.fundec -> Prelude.Ana.exp list -> 'e -> D.t -> trans_out
val special : (D.t, 'a, 'b, 'c) Analyses.ctx -> Prelude.Ana.lval option -> Prelude.Ana.varinfo -> Prelude.Ana.exp list -> D.t