package bap-std

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

since in IR the order of edges defines semantics, we provide extra functions

include Graphlib.Std.Edge
  with type graph = t
   and type node = node
   and type t = edge

type t = edge

type node = node

type graph = t

type label

val create : node -> node -> label -> t

val label : t -> label

val src : t -> node

val dst : t -> node

val mem : t -> graph -> bool

val insert : t -> graph -> graph

val update : t -> label -> graph -> graph

val remove : t -> graph -> graph

val (>=) : t -> t -> bool

val (<=) : t -> t -> bool

val (=) : t -> t -> bool

val (>) : t -> t -> bool

val (<) : t -> t -> bool

val (<>) : t -> t -> bool

val equal : t -> t -> bool

val min : t -> t -> t

val max : t -> t -> t

val ascending : t -> t -> int

val descending : t -> t -> int

val between : t -> low:t -> high:t -> bool

val clamp_exn : t -> min:t -> max:t -> t

val clamp : t -> min:t -> max:t -> t Base__.Or_error.t

type comparator_witness

val comparator : (t, comparator_witness) Base__Comparator.comparator

val validate_lbound : min:t Base__.Maybe_bound.t -> t Base__.Validate.check

val validate_ubound : max:t Base__.Maybe_bound.t -> t Base__.Validate.check

val validate_bound : 
  min:t Base__.Maybe_bound.t ->
  max:t Base__.Maybe_bound.t ->
  t Base__.Validate.check

module Replace_polymorphic_compare : sig ... end

module Map : sig ... end

module Set : sig ... end

val compare : t -> t -> Core_kernel__.Import.int

val hash_fold_t : 
  Ppx_hash_lib.Std.Hash.state ->
  t ->
  Ppx_hash_lib.Std.Hash.state

val hash : t -> Ppx_hash_lib.Std.Hash.hash_value

val hashable : t Core_kernel__.Hashtbl.Hashable.t

module Table : sig ... end

module Hash_set : sig ... end

module Hash_queue : sig ... end

val jmps : [ `after | `before ] -> t -> graph -> jmp term seq

jmps dir e g enumerates all jumps (including calls, interrupts, indirects, etc), that occurs before if dir = `before or after if dir = `after an edge e

val edges : [ `after | `before ] -> t -> graph -> t seq

edges dir e g enumerates all edges occurring before of after an edge e in graph g

val jmp : t -> jmp term

jmp e returns a jmp term associated with edge e

val tid : t -> tid

tid e returns a tid of a jmp term that is associated with an edge e

val cond : t -> graph -> exp

cond e g computes a condition expression that is asserted to be true if this branch is taken.

Note: this is not the same as a condition associated with the jmp term itself, it takes into account all conditions preceding the edge.

include Regular.Std.Printable.S with type t := t

val to_string : t -> string

val str : unit -> t -> string

val pps : unit -> t -> string

val ppo : Core_kernel.Out_channel.t -> t -> unit

val pp_seq : Stdlib.Format.formatter -> t Core_kernel.Sequence.t -> unit

val pp : Base__.Formatter.t -> t -> unit