IDAPython 9.0
Loading...
Searching...
No Matches
mbl_graph_t Class Reference
Inheritance diagram for mbl_graph_t:
simple_graph_t gdl_graph_t

Public Member Functions

 __init__ (self, *args, **kwargs)
 
bool is_ud_chain_dirty (self, 'gctype_t' gctype)
 
bool is_du_chain_dirty (self, 'gctype_t' gctype)
 
int get_chain_stamp (self)
 
'graph_chains_t *' get_ud (self, 'gctype_t' gctype)
 
'graph_chains_t *' get_du (self, 'gctype_t' gctype)
 
bool is_redefined_globally (self, *args)
 
bool is_used_globally (self, *args)
 
'mblock_t *' get_mblock (self, int n)
 
- Public Member Functions inherited from simple_graph_t
None compute_dominators (self, 'array_of_node_bitset_t' domin, bool post=False)
 
None compute_immediate_dominators (self, 'array_of_node_bitset_t' domin, 'intvec_t' idomin, bool post=False)
 
int depth_first_preorder (self, 'node_ordering_t' pre)
 
int depth_first_postorder (self, 'node_ordering_t' post)
 
'simple_graph_t::iterator' begin (self)
 
'simple_graph_t::iterator' end (self)
 
int front (self)
 
None inc (self, 'simple_graph_t::iterator &' p, int n=1)
 
int goup (self, int node)
 
- Public Member Functions inherited from gdl_graph_t
'char *' get_node_label (self, int n)
 
None print_graph_attributes (self, 'FILE *' fp)
 
bool print_node (self, 'FILE *' fp, int n)
 
bool print_edge (self, 'FILE *' fp, int i, int j)
 
None print_node_attributes (self, 'FILE *' fp, int n)
 
int size (self)
 
int node_qty (self)
 
bool exists (self, int node)
 
int entry (self)
 
int exit (self)
 
int nsucc (self, int node)
 
int npred (self, int node)
 
int succ (self, int node, int i)
 
int pred (self, int node, int i)
 
bool empty (self)
 
'bgcolor_t' get_node_color (self, int n)
 
'bgcolor_t' get_edge_color (self, int i, int j)
 
'size_t' nedge (self, int node, bool ispred)
 
int edge (self, int node, int i, bool ispred)
 
 __disown__ (self)
 

Properties

 thisown
 
- Properties inherited from simple_graph_t
 thisown
 
- Properties inherited from gdl_graph_t
 thisown
 

Additional Inherited Members

- Static Public Attributes inherited from simple_graph_t
str title
 
str colored_gdl_edges
 

Constructor & Destructor Documentation

◆ __init__()

__init__ ( self,
* args,
** kwargs )

Reimplemented from simple_graph_t.

Member Function Documentation

◆ get_chain_stamp()

int get_chain_stamp ( self)

◆ get_du()

'graph_chains_t *' get_du ( self,
'gctype_t' gctype )
Get def-use chains.

◆ get_mblock()

'mblock_t *' get_mblock ( self,
int n )

◆ get_ud()

'graph_chains_t *' get_ud ( self,
'gctype_t' gctype )
Get use-def chains.

◆ is_du_chain_dirty()

bool is_du_chain_dirty ( self,
'gctype_t' gctype )
Is the def-use chain of the specified kind dirty?

◆ is_redefined_globally()

bool is_redefined_globally ( self,
* args )
Is LIST redefined in the graph?

◆ is_ud_chain_dirty()

bool is_ud_chain_dirty ( self,
'gctype_t' gctype )
Is the use-def chain of the specified kind dirty?

◆ is_used_globally()

bool is_used_globally ( self,
* args )
Is LIST used in the graph?

Property Documentation

◆ thisown

thisown
static
Initial value:
= property(lambda x: x.this.own(), lambda x, v: x.this.own(v),
doc='The membership flag')

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