package binsec

  1. Overview
  2. Docs

Module Ir.GraphSource

include GRAPH with type t = private View.t
include Graph.Sig.G with type V.t = int and type E.t = int * bool * int with type t = private View.t
Sourcetype t = private View.t
Sourcemodule V : sig ... end
Sourcetype vertex = V.t
Sourcemodule E : sig ... end
Sourcetype edge = E.t
Sourceval is_directed : bool
Sourceval is_empty : t -> bool
Sourceval nb_vertex : t -> int
Sourceval nb_edges : t -> int
Sourceval out_degree : t -> vertex -> int
Sourceval in_degree : t -> vertex -> int
Sourceval mem_vertex : t -> vertex -> bool
Sourceval mem_edge : t -> vertex -> vertex -> bool
Sourceval mem_edge_e : t -> edge -> bool
Sourceval find_edge : t -> vertex -> vertex -> edge
Sourceval find_all_edges : t -> vertex -> vertex -> edge list
Sourceval succ : t -> vertex -> vertex list
Sourceval pred : t -> vertex -> vertex list
Sourceval succ_e : t -> vertex -> edge list
Sourceval pred_e : t -> vertex -> edge list
Sourceval iter_vertex : (vertex -> unit) -> t -> unit
Sourceval fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges : (vertex -> vertex -> unit) -> t -> unit
Sourceval fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges_e : (edge -> unit) -> t -> unit
Sourceval fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval map_vertex : (vertex -> vertex) -> t -> t
Sourceval iter_succ : (vertex -> unit) -> t -> vertex -> unit
Sourceval iter_pred : (vertex -> unit) -> t -> vertex -> unit
Sourceval fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_succ_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_pred_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval node : t -> vertex -> node
Sourceval fold_entries : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval fold_exits : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_entries : (vertex -> unit) -> t -> unit
Sourceval iter_exits : (vertex -> unit) -> t -> unit
include INSTRUMENT with type t := t and type vertex := vertex
Sourceval insert_before : t -> vertex -> ?label:label -> fallthrough -> unit
Sourceval insert_before_v : t -> vertex -> ?label:label -> fallthrough -> vertex
Sourceval insert_list_before : t -> vertex -> ?label:label -> fallthrough list -> unit
Sourceval insert_list_before_v : t -> vertex -> ?label:label -> fallthrough list -> vertex
Sourceval length : t -> int
Sourceval empty : unit -> t
Sourceval copy : t -> t
Sourceval of_instruction : Binsec_kernel.Instruction.t -> t
Sourceval of_script : Binsec_kernel.Virtual_address.t -> string -> ?eoh:terminator -> stmt list -> t
Sourceval replace_node : t -> vertex -> node -> unit
Sourceval append_node : t -> node -> vertex
Sourceval append : t -> from:t -> vertex