Latest available version: IDA and decompilers v8.4.240320sp1 see all releases
Hex-Rays logo State-of-the-art binary code analysis tools
email icon
abstract_graph_t Member List

This is the complete list of members for abstract_graph_t, including all inherited members.

abstract_graph_t(void) (defined in abstract_graph_t)abstract_graph_tinline
add_node_edges(edgevec_t &dlist, int node) (defined in abstract_graph_t)abstract_graph_t
assign_edge_ports(const graph_row_info_t &gri, const node_set_t &selfrefs)abstract_graph_tprotected
begin(void) const (defined in gdl_graph_t)gdl_graph_tinline
calc_bounds(rect_t *r) (defined in abstract_graph_t)abstract_graph_t
calc_fitting_params(const rect_t &area, const rect_t &r, graph_location_info_t *gli, double max_zoom) (defined in abstract_graph_t)abstract_graph_t
calc_fitting_params(const rect_t &area, graph_location_info_t *gli, double max_zoom) (defined in abstract_graph_t)abstract_graph_t
calc_longest_pathes(const node_set_t &entries, intvec_t &tops, int row_height) constabstract_graph_tprotected
calc_row_heights(graph_row_info_t &gri) constabstract_graph_tprotected
callbackabstract_graph_t
callback_udabstract_graph_t
circle_centerabstract_graph_t
circle_radiusabstract_graph_t
clear(void) (defined in abstract_graph_t)abstract_graph_t
clear_layout_info(void)abstract_graph_tprotected
clone(void) const =0 (defined in abstract_graph_t)abstract_graph_tpure virtual
create_circle_layout(point_t p, int radius) (defined in abstract_graph_t)abstract_graph_tinline
create_graph_row_info(const intvec_t &tops, graph_row_info_t &gri, int graph_height) constabstract_graph_tprotected
create_orthogonal_layout(void) (defined in abstract_graph_t)abstract_graph_t
create_polar_tree_layout(point_t p, int radius) (defined in abstract_graph_t)abstract_graph_t
create_radial_tree_layout(point_t p, int radius) (defined in abstract_graph_t)abstract_graph_t
create_spanning_tree(edge_typer_t *et, node_set_t *entries, edgeset_t *back_edges, node_ordering_t *pre, node_ordering_t *post) const (defined in abstract_graph_t)abstract_graph_tprotected
create_tree_layout(void) (defined in abstract_graph_t)abstract_graph_tinline
current_layoutabstract_graph_t
depth_first(node_ordering_t *pre, node_ordering_t *post, edge_typer_t *et) const (defined in abstract_graph_t)abstract_graph_tprotected
dump_graph(const char *header) const (defined in abstract_graph_t)abstract_graph_t
edge(int node, int i, bool ispred) const (defined in gdl_graph_t)gdl_graph_tinline
empty(void) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
end(void) const (defined in gdl_graph_t)gdl_graph_tinline
entry(void) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
exists(int node) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
exit(void) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
for_all_nodes_edges(graph_visitor_t &nev, bool visit_nodes=true) (defined in abstract_graph_t)abstract_graph_t
front(void) (defined in gdl_graph_t)gdl_graph_tinline
gather_edge_segments(const graph_row_info_t &gri, edge_segs_vec_t &ges) constabstract_graph_tprotected
gen_dot(FILE *fp) const (defined in gdl_graph_t)gdl_graph_t
gen_dot(const char *file) const (defined in gdl_graph_t)gdl_graph_t
gen_gdl(FILE *fp) const (defined in gdl_graph_t)gdl_graph_t
gen_gdl(const char *file) const (defined in gdl_graph_t)gdl_graph_t
get_connected_components(intvec_t &entries) constabstract_graph_tprotected
get_edge(edge_t e) const (defined in abstract_graph_t)abstract_graph_tinline
get_edge(edge_t e)=0 (defined in abstract_graph_t)abstract_graph_tpure virtual
get_edge_color(int i, int j) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
get_edge_ports(edge_t e, point_t &s, point_t &d) const (defined in abstract_graph_t)abstract_graph_t
get_node_color(int n) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
get_node_label(char *iobuf, int iobufsize, int n) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
grcall(int code,...) (defined in abstract_graph_t)abstract_graph_tinline
make_rect_edges(graph_row_info_t &gri, const edge_segs_vec_t &ges, int first_reverser_node)abstract_graph_tprotected
minimize_crossings(graph_row_info_t &gri) constabstract_graph_tprotected
move_nodes_down(intvec_t &tops, const node_ordering_t &post, int first_reverser_node, int row_height) constabstract_graph_tprotected
nedge(int node, bool ispred) const (defined in gdl_graph_t)gdl_graph_tinline
node_qty(void) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
npred(int node) const =0 (defined in gdl_graph_t)gdl_graph_tpure virtual
nrect(int n) const (defined in abstract_graph_t)abstract_graph_tinline
nrect(int n)=0 (defined in abstract_graph_t)abstract_graph_tpure virtual
nsucc(int node) const =0 (defined in gdl_graph_t)gdl_graph_tpure virtual
path_back(const array_of_node_set_t &domin, int m, int n) constabstract_graph_tprotected
path_back(edge_typer_t &et, int m, int n) const (defined in abstract_graph_t)abstract_graph_tprotected
path_exists(int m, int n) const (defined in gdl_graph_t)gdl_graph_tinline
pred(int node, int i) const =0 (defined in gdl_graph_t)gdl_graph_tpure virtual
print_edge(FILE *fp, int i, int j) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
print_graph_attributes(FILE *fp) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
print_node(FILE *fp, int n) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
print_node_attributes(FILE *fp, int n) const (defined in gdl_graph_t)gdl_graph_tinlinevirtual
recalc_edge_widths(const edgeset_t &back_edges, const edge_infos_t &self_edges)abstract_graph_tprotected
rect_edges_madeabstract_graph_t
set_callback(hook_cb_t *_callback, void *_ud) (defined in abstract_graph_t)abstract_graph_tinline
set_x_coords(const graph_row_info_t &gri, const node_set_t &selfrefs, int first_added_node)abstract_graph_tprotected
size(void) const =0 (defined in gdl_graph_t)gdl_graph_tpure virtual
succ(int node, int i) const =0 (defined in gdl_graph_t)gdl_graph_tpure virtual
titleabstract_graph_t
tree_layout(edge_typer_t &et, const node_set_t &entries) (defined in abstract_graph_t)abstract_graph_tprotected
vgrcall(int code, va_list va) (defined in abstract_graph_t)abstract_graph_tinline
visit_nodes(int node, graph_node_visitor_t &gv) constabstract_graph_tprotected
visit_paths(int node, graph_path_visitor_t &gv) constabstract_graph_tprotected
~abstract_graph_t() (defined in abstract_graph_t)abstract_graph_tinlinevirtual
~gdl_graph_t() (defined in gdl_graph_t)gdl_graph_tinlinevirtual