Module Goblint_lib.MyARG

Abstract reachability graph.

module type Node = sig ... end
module type Edge = sig ... end
module CFGEdge : Edge with type t = MyCFG.edge
type inline_edge =
  1. | CFGEdge of Edge.t
  2. | InlineEntry of CilType.Lval.t option * CilType.Fundec.t * CilType.Exp.t list
  3. | InlineReturn of CilType.Lval.t option * CilType.Fundec.t * CilType.Exp.t list
  4. | InlinedEdge of Edge.t
  5. | ThreadEntry of CilType.Lval.t option * CilType.Varinfo.t * CilType.Exp.t list
val equal_inline_edge : inline_edge -> inline_edge -> Ppx_deriving_runtime.bool
val compare_inline_edge : inline_edge -> inline_edge -> Ppx_deriving_runtime.int
val hash_inline_edge : inline_edge -> int
val pretty_inline_edge : unit -> inline_edge -> GoblintCil.Pretty.doc
val inline_edge_to_yojson : inline_edge -> [> `Assoc of (string * [> `Assoc of (string * Yojson.Safe.t) list ]) list ]
module InlineEdge : Edge with type t = inline_edge
module type S = sig ... end
module StackNode (Node : Node) : Node with type t = Node.t list
module Stack (Arg : S with module Edge = InlineEdge) : S with module Node = StackNode(Arg.Node) and module Edge = Arg.Edge
module type IsInteresting = sig ... end
module InterestingArg (Arg : S) (IsInteresting : IsInteresting with type node := Arg.Node.t and type edge := Arg.Edge.t) : S with module Node = Arg.Node and module Edge = Arg.Edge
module type SIntra = sig ... end
module type SIntraOpt = sig ... end
val partition_if_next : (MyCFG.edge * 'a) list -> CilType.Exp.t * 'b * 'c
module Intra (ArgIntra : SIntraOpt) (Arg : S) : S with module Node = Arg.Node and module Edge = Arg.Edge