|
| __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) |
|
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) |
|
'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) |
|