package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

dune-project

Dependency

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

Authors

Maintainers

Sources

goblint-1.1.1.tbz

sha256=999272bfbd3b9b96fcd58987b237ac6e9fa6d92ef935cc89f1ea2b4205185141

sha512=f3bf6ab71cf8c258d3290da4bf9f6fe42d7c671822e0efeb0fc50afdff078ab15e352237e5c1db31c5aa3a9d430691268ed2e5e00da10f2615835f672f91683d

doc/goblint.lib/Node/index.html

Module `Node`

include module type of struct include Printable.Std end

type group = Printable.Std.group = |

val show_group : group -> 'a

val to_group : 'a -> 'b option

val trace_enabled : bool

val invariant : 'a -> 'b -> Invariant.t

val tag : 'a -> 'b

val arbitrary : unit -> 'a

val relift : 'a -> 'a

type t =

| Statement of CilType.Stmt.t
(*
The statements as identified by CIL
*)
| FunctionEntry of CilType.Fundec.t
| Function of CilType.Fundec.t
(*
The variable information associated with the function declaration.
*)

A node in the Control Flow Graph is either a statement or function. Think of * the function node as last node that all the returning nodes point to. So * the result of the function call is contained in the function node.

val equal : t -> t -> Ppx_deriving_runtime.bool

val compare : t -> t -> Ppx_deriving_runtime.int

val _ : t -> Yojson.Safe.t

val name : unit -> string

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

Pretty node plainly with entire stmt.

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

Pretty node plainly with stmt location.

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

Pretty node for solver variable tracing with short stmt.

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

Output functions for Printable interface

val show : t -> string

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

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

val show_id : t -> string

Show node ID for CFG and results output.

val show_cfg : t -> string

Show node label for CFG.

val hash : t -> int

val location : t -> Cil.location

val find_fundec : t -> CilType.Fundec.t

Find fundec which the node is in. In an incremental run this might yield old fundecs for pseudo-return nodes from the old file.