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/Constraints/CompareHashtbl/Var/index.html

Module `CompareHashtbl.Var`

include module type of struct include Printable.Std end

val name : unit -> string

type group = Printable.Std.group = |

val show_group : group -> 'a

val to_group : 'a -> 'b option

val trace_enabled : bool

val tag : 'a -> 'b

val arbitrary : unit -> 'a

include module type of struct include Var end

include Goblint_lib.Prelude.Hashtbl.HashedType

type t = Var.t

The type of the hashtable keys.

val equal : t -> t -> bool

The equality predicate used to compare keys.

val hash : t -> int

A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include ((=), Hashtbl.hash) for comparing objects by structure, ((fun x y -> compare x y = 0), Hashtbl.hash) for comparing objects by structure and handling Pervasives.nan correctly, and ((==), Hashtbl.hash) for comparing objects by addresses (e.g. for cyclic keys).

include Analyses.SysVar with type t := t

val is_write_only : t -> bool

val pretty_trace : unit -> t -> GoblintCil.Pretty.doc

val compare : t -> t -> int

val var_id : t -> string

val node : t -> MyCFG.node

val relift : t -> t

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

include sig ... end

val show : t -> string

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

val to_yojson : t -> [> `String of string ]