Rizin
unix-like reverse engineering framework and cli tools
rz_graph_visitor_t Struct Reference

#include <rz_graph.h>

Public Attributes

void(* discover_node )(RzGraphNode *n, struct rz_graph_visitor_t *vis)
 
void(* finish_node )(RzGraphNode *n, struct rz_graph_visitor_t *vis)
 
void(* tree_edge )(const RzGraphEdge *e, struct rz_graph_visitor_t *vis)
 
void(* back_edge )(const RzGraphEdge *e, struct rz_graph_visitor_t *vis)
 
void(* fcross_edge )(const RzGraphEdge *e, struct rz_graph_visitor_t *vis)
 
void * data
 

Detailed Description

Definition at line 32 of file rz_graph.h.

Member Data Documentation

◆ back_edge

void(* rz_graph_visitor_t::back_edge) (const RzGraphEdge *e, struct rz_graph_visitor_t *vis)

Definition at line 36 of file rz_graph.h.

Referenced by dfs_node(), and remove_cycles().

◆ data

void* rz_graph_visitor_t::data

◆ discover_node

void(* rz_graph_visitor_t::discover_node) (RzGraphNode *n, struct rz_graph_visitor_t *vis)

Definition at line 33 of file rz_graph.h.

Referenced by dfs_node().

◆ fcross_edge

void(* rz_graph_visitor_t::fcross_edge) (const RzGraphEdge *e, struct rz_graph_visitor_t *vis)

Definition at line 37 of file rz_graph.h.

Referenced by create_dummy_nodes(), and dfs_node().

◆ finish_node

void(* rz_graph_visitor_t::finish_node) (RzGraphNode *n, struct rz_graph_visitor_t *vis)

Definition at line 34 of file rz_graph.h.

Referenced by assign_layers(), and dfs_node().

◆ tree_edge

void(* rz_graph_visitor_t::tree_edge) (const RzGraphEdge *e, struct rz_graph_visitor_t *vis)

Definition at line 35 of file rz_graph.h.

Referenced by create_dummy_nodes(), and dfs_node().


The documentation for this struct was generated from the following file: