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 (10)

Authors

Maintainers

Sources

goblint-2.4.0.tbz

sha256=99b78e6def71534d195eef9084baa26d8334b36084e120aa6afb300c9bf8afa6

sha512=f3162bd95a03c00358a2991f6152fc6169205bfb4c55e2c483e98cc3935673df9656d025b6f1ea0fa5f1bd0aee037d4f483966b0d2907e3fa9bf11a93a3392af

doc/goblint.common/MyCFG/index.html

Module `MyCFG`

Control-flow graph.

Distinct from CIL's CFG.

type node = Node.t =

| Statement of CilType.Stmt.t
| FunctionEntry of CilType.Fundec.t
| Function of CilType.Fundec.t

Re-exported Node.t with constructors. See Node.t for documentation.

type edge = Edge.t =

| Assign of CilType.Lval.t * CilType.Exp.t
| Proc of CilType.Lval.t option * CilType.Exp.t * CilType.Exp.t list
| Entry of CilType.Fundec.t
| Ret of CilType.Exp.t option * CilType.Fundec.t
| Test of CilType.Exp.t * bool
| ASM of string list * Edge.asm_out * Edge.asm_in
| VDecl of CilType.Varinfo.t
| Skip

Re-exported Edge.t with constructors. See Edge.t for documentation.

type edges = (CilType.Location.t * Edge.t) list

val equal_edges : edges -> edges -> Ppx_deriving_runtime.bool

val hash_edges : edges -> int

type cfg = node -> (edges * node) list

module type CfgBackward = sig ... end

module type CfgForward = sig ... end

module type CfgBidir = sig ... end

module CfgEdge : sig ... end

Type of CFG "edges": keyed by 'from' and 'to' nodes, along with the list of connecting instructions.

module CfgEdgeH : sig ... end

module type CfgBidirSkip = sig ... end

module NodeH : sig ... end

val current_node : Node.t option ref

val current_cfg : (module CfgBidirSkip) ref

val unknown_exp : GoblintCil.exp

val dummy_func : GoblintCil.fundec

val dummy_node : node

module type FileCfg = sig ... end