IDA C++ SDK 9.2
Loading...
Searching...
No Matches
gdl_graph_t Class Referenceabstract

gdl graph interface - includes only functions required to draw it More...

#include <gdl.hpp>

Inheritance diagram for gdl_graph_t:
cancellable_graph_t drawable_graph_t simple_graph_t qflow_chart_t interactive_graph_t mbl_graph_t

Public Member Functions

 DEFINE_MEMORY_ALLOCATION_FUNCS () virtual ~gdl_graph_t()
virtual char *idaapi get_node_label (char *iobuf, int iobufsize, int n) const
virtual void idaapi print_graph_attributes (FILE *fp) const
virtual bool idaapi print_node (FILE *fp, int n) const
virtual bool idaapi print_edge (FILE *fp, int i, int j) const
virtual void idaapi print_node_attributes (FILE *fp, int n) const
virtual int idaapi size (void) const =0
virtual int idaapi node_qty (void) const
virtual bool idaapi exists (int node) const
virtual int idaapi entry (void) const
virtual int idaapi exit (void) const
virtual int idaapi nsucc (int node) const =0
virtual int idaapi npred (int node) const =0
virtual int idaapi succ (int node, int i) const =0
virtual int idaapi pred (int node, int i) const =0
virtual bool idaapi empty (void) const
virtual bgcolor_t idaapi get_node_color (int n) const
virtual bgcolor_t idaapi get_edge_color (int i, int j) const
void idaapi gen_gdl (FILE *fp) const
void idaapi gen_gdl (const char *file) const
size_t idaapi nedge (int node, bool ispred) const
int idaapi edge (int node, int i, bool ispred) const
int idaapi front (void)
node_iterator idaapi begin (void) const
node_iterator idaapi end (void) const
bool idaapi path_exists (int m, int n) const
void idaapi gen_dot (FILE *fp) const
void idaapi gen_dot (const char *file) const

Detailed Description

gdl graph interface - includes only functions required to draw it

Member Function Documentation

◆ DEFINE_MEMORY_ALLOCATION_FUNCS()

gdl_graph_t::DEFINE_MEMORY_ALLOCATION_FUNCS ( )
inline

◆ get_node_label()

virtual char *idaapi gdl_graph_t::get_node_label ( char * iobuf,
int iobufsize,
int n ) const
inlinevirtual

Reimplemented in qflow_chart_t.

◆ print_graph_attributes()

virtual void idaapi gdl_graph_t::print_graph_attributes ( FILE * fp) const
inlinevirtual

◆ print_node()

virtual bool idaapi gdl_graph_t::print_node ( FILE * fp,
int n ) const
inlinevirtual

◆ print_edge()

virtual bool idaapi gdl_graph_t::print_edge ( FILE * fp,
int i,
int j ) const
inlinevirtual

◆ print_node_attributes()

virtual void idaapi gdl_graph_t::print_node_attributes ( FILE * fp,
int n ) const
inlinevirtual

Reimplemented in qflow_chart_t.

◆ size()

virtual int idaapi gdl_graph_t::size ( void ) const
pure virtual

Implemented in interactive_graph_t, and qflow_chart_t.

◆ node_qty()

virtual int idaapi gdl_graph_t::node_qty ( void ) const
inlinevirtual

Reimplemented in interactive_graph_t.

◆ exists()

virtual bool idaapi gdl_graph_t::exists ( int node) const
inlinevirtual

Reimplemented in interactive_graph_t.

◆ entry()

virtual int idaapi gdl_graph_t::entry ( void ) const
inlinevirtual

◆ exit()

virtual int idaapi gdl_graph_t::exit ( void ) const
inlinevirtual

◆ nsucc()

virtual int idaapi gdl_graph_t::nsucc ( int node) const
pure virtual

Implemented in interactive_graph_t, and qflow_chart_t.

◆ npred()

virtual int idaapi gdl_graph_t::npred ( int node) const
pure virtual

Implemented in interactive_graph_t, and qflow_chart_t.

◆ succ()

virtual int idaapi gdl_graph_t::succ ( int node,
int i ) const
pure virtual

Implemented in interactive_graph_t, and qflow_chart_t.

◆ pred()

virtual int idaapi gdl_graph_t::pred ( int node,
int i ) const
pure virtual

Implemented in interactive_graph_t, and qflow_chart_t.

◆ empty()

virtual bool idaapi gdl_graph_t::empty ( void ) const
inlinevirtual

Reimplemented in interactive_graph_t.

◆ get_node_color()

virtual bgcolor_t idaapi gdl_graph_t::get_node_color ( int n) const
inlinevirtual

◆ get_edge_color()

virtual bgcolor_t idaapi gdl_graph_t::get_edge_color ( int i,
int j ) const
inlinevirtual

◆ gen_gdl() [1/2]

void idaapi gdl_graph_t::gen_gdl ( FILE * fp) const

◆ gen_gdl() [2/2]

void idaapi gdl_graph_t::gen_gdl ( const char * file) const

◆ nedge()

size_t idaapi gdl_graph_t::nedge ( int node,
bool ispred ) const
inline

◆ edge()

int idaapi gdl_graph_t::edge ( int node,
int i,
bool ispred ) const
inline

◆ front()

int idaapi gdl_graph_t::front ( void )
inline

◆ begin()

node_iterator idaapi gdl_graph_t::begin ( void ) const
inline

◆ end()

node_iterator idaapi gdl_graph_t::end ( void ) const
inline

◆ path_exists()

bool idaapi gdl_graph_t::path_exists ( int m,
int n ) const
inline

◆ gen_dot() [1/2]

void idaapi gdl_graph_t::gen_dot ( FILE * fp) const

◆ gen_dot() [2/2]

void idaapi gdl_graph_t::gen_dot ( const char * file) const
The documentation for this class was generated from the following file: