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-2.0.1.tbz

sha256=dba2b664c7c125687e708e871d83fbfb6ba6d9ee98d235b4850d9a238caa84de

sha512=529987cde39691ad9e955000a3603e89c1c8cf14ed5e8b4cd3a7fc26e47d016aff571b472e2329725133c46f8d0cb45a05b88994eeffaa221a4d31b4c543adcd

doc/goblint.lib/Goblint_lib/LockDomain/Lockset/index.html

Module `LockDomain.Lockset`

module RW = IntDomain.Booleans

module Lock : sig ... end

module ReverseAddrSet : sig ... end

module AddrSet : sig ... end

include module type of struct include AddrSet end

type t = ReverseAddrSet.t

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

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

val to_yojson : t -> Yojson.Safe.t

val tag : t -> int

val relift : t -> t

val widen : ReverseAddrSet.t -> ReverseAddrSet.t -> ReverseAddrSet.t

val narrow : ReverseAddrSet.t -> ReverseAddrSet.t -> ReverseAddrSet.t

val bot : unit -> ReverseAddrSet.t

val is_bot : ReverseAddrSet.t -> bool

val top : unit -> ReverseAddrSet.t

val is_top : ReverseAddrSet.t -> bool

val leq : ReverseAddrSet.t -> ReverseAddrSet.t -> bool

val join : ReverseAddrSet.t -> ReverseAddrSet.t -> ReverseAddrSet.t

val meet : ReverseAddrSet.t -> ReverseAddrSet.t -> ReverseAddrSet.t

val name : unit -> string

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

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

val arbitrary : unit -> ReverseAddrSet.t QCheck.arbitrary

val may_be_same_offset : 
  [> `Field of GoblintCil.fieldinfo * 'a
  | `Index of IdxDom.t * 'a
  | `NoOffset ] as 'a ->
  [> `Field of GoblintCil.fieldinfo * 'b
  | `Index of IdxDom.t * 'b
  | `NoOffset ] as 'b ->
  bool

val add : (Addr.t * RW.t) -> ReverseAddrSet.t -> ReverseAddrSet.t

val remove : (Addr.t * RW.t) -> ReverseAddrSet.t -> ReverseAddrSet.t

val empty : unit -> ReverseAddrSet.t

val is_empty : ReverseAddrSet.t -> bool

val filter : 
  (ReverseAddrSet.elt -> bool) ->
  ReverseAddrSet.t ->
  ReverseAddrSet.t

val fold : (ReverseAddrSet.elt -> 'a -> 'a) -> ReverseAddrSet.t -> 'a -> 'a

val singleton : ReverseAddrSet.elt -> ReverseAddrSet.t

val mem : ReverseAddrSet.elt -> ReverseAddrSet.t -> bool

val exists : (ReverseAddrSet.elt -> bool) -> ReverseAddrSet.t -> bool

val export_locks : ReverseAddrSet.t -> Mutexes.t