package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

Dune Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (8)

Authors

Maintainers

Sources

goblint-1.1.1.tbz

sha256=999272bfbd3b9b96fcd58987b237ac6e9fa6d92ef935cc89f1ea2b4205185141

sha512=f3bf6ab71cf8c258d3290da4bf9f6fe42d7c671822e0efeb0fc50afdff078ab15e352237e5c1db31c5aa3a9d430691268ed2e5e00da10f2615835f672f91683d

doc/goblint.lib/CondVars/Domain/index.html

Module `CondVars.Domain`

module V = Queries.ES

include sig ... end

type t = MapDomain.MapBot(Lval.CilLval)(V).t

type key = Lval.CilLval.t

type value = V.t

val add : key -> value -> t -> t

val remove : key -> t -> t

val find : key -> t -> value

val find_opt : key -> t -> value option

val mem : key -> t -> bool

val iter : (key -> value -> unit) -> t -> unit

val map : (value -> value) -> t -> t

val filter : (key -> value -> bool) -> t -> t

val mapi : (key -> value -> value) -> t -> t

val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a

val add_list : (key * value) list -> t -> t

val add_list_set : key list -> value -> t -> t

val add_list_fun : key list -> (key -> value) -> t -> t

val for_all : (key -> value -> bool) -> t -> bool

val map2 : (value -> value -> value) -> t -> t -> t

val long_map2 : (value -> value -> value) -> t -> t -> t

val merge : 
  (key -> value option -> value option -> value option) ->
  t ->
  t ->
  t

val cardinal : t -> int

val choose : t -> key * value

val singleton : key -> value -> t

val empty : unit -> t

val is_empty : t -> bool

val exists : (key -> value -> bool) -> t -> bool

val bindings : t -> (key * value) list

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

val pretty : unit -> t -> Pretty.doc

val printXml : 'a BatInnerIO.output -> t -> unit

val name : unit -> string

val to_yojson : t -> Printable.json

val invariant : Invariant.context -> t -> Invariant.t

val tag : t -> int

val arbitrary : unit -> t QCheck.arbitrary

val relift : t -> t

val leq : t -> t -> bool

val join : t -> t -> t

val meet : t -> t -> t

val widen : t -> t -> t

val narrow : t -> t -> t

val pretty_diff : unit -> (t * t) -> Pretty.doc

val bot : unit -> t

val is_bot : t -> bool

val top : unit -> t

val is_top : t -> bool

val widen_with_fct : (value -> value -> value) -> t -> t -> t

val join_with_fct : (value -> value -> value) -> t -> t -> t

val leq_with_fct : (value -> value -> bool) -> t -> t -> bool

val var_in_lval : (Prelude.Ana.varinfo -> bool) -> Prelude.Ana.lval -> bool

val var_in_offs : (Prelude.Ana.varinfo -> bool) -> Prelude.Ana.offset -> bool

val var_in_expr : (Prelude.Ana.varinfo -> bool) -> Prelude.Ana.exp -> bool

val filter_exprs_with_var : (Prelude.Ana.varinfo -> bool) -> t -> t

val filter_vars : (Prelude.Ana.varinfo -> bool) -> t -> t

val remove_var : Prelude.Ana.varinfo -> t -> t

val remove_fun_locals : Prelude.Ana.fundec -> t -> t

val only_globals : t -> t

val only_locals : t -> t

val only_global_exprs : [ `Lifted of SetDomain.Make(Exp.Exp).t | `Top ] -> bool

val get : key -> t -> value option

val get_elt : key -> t -> V.elt option

val has : key -> t -> bool