|
| | __init__ (self, *args, **kwargs) |
| | init(self) -> gdl_graph_t
|
| |
| "bool" | is_ud_chain_dirty (self, *args) |
| | is_ud_chain_dirty(self, gctype) -> bool Is the use-def chain of the specified kind dirty?
|
| |
| "bool" | is_du_chain_dirty (self, *args) |
| | is_du_chain_dirty(self, gctype) -> bool Is the def-use chain of the specified kind dirty?
|
| |
| "int" | get_chain_stamp (self, *args) |
| | get_chain_stamp(self) -> int
|
| |
| "graph_chains_t *" | get_ud (self, *args) |
| | get_ud(self, gctype) -> graph_chains_t Get use-def chains.
|
| |
| "graph_chains_t *" | get_du (self, *args) |
| | get_du(self, gctype) -> graph_chains_t Get def-use chains.
|
| |
| "bool" | is_redefined_globally (self, *args) |
| | is_redefined_globally(self, list, b1, b2, m1, m2, maymust=MAY_ACCESS) -> bool Is LIST redefined in the graph?
|
| |
| "bool" | is_used_globally (self, *args) |
| | is_used_globally(self, list, b1, b2, m1, m2, maymust=MAY_ACCESS) -> bool Is LIST used in the graph?
|
| |
| "mblock_t *" | get_mblock (self, *args) |
| | get_mblock(self, n) -> mblock_t
|
| |
| "char *" | get_node_label (self, *args) |
| | get_node_label(self, n) -> char *
|
| |
| "void" | print_graph_attributes (self, *args) |
| | print_graph_attributes(self, fp)
|
| |
| "bool" | print_node (self, *args) |
| | print_node(self, fp, n) -> bool
|
| |
| "bool" | print_edge (self, *args) |
| | print_edge(self, fp, i, j) -> bool
|
| |
| "void" | print_node_attributes (self, *args) |
| | print_node_attributes(self, fp, n)
|
| |
| "int" | size (self, *args) |
| | size(self) -> int
|
| |
| "int" | node_qty (self, *args) |
| | node_qty(self) -> int
|
| |
| "bool" | exists (self, *args) |
| | exists(self, node) -> bool
|
| |
| "int" | entry (self, *args) |
| | entry(self) -> int
|
| |
| "int" | exit (self, *args) |
| | exit(self) -> int
|
| |
| "int" | nsucc (self, *args) |
| | nsucc(self, node) -> int
|
| |
| "int" | npred (self, *args) |
| | npred(self, node) -> int
|
| |
| "int" | succ (self, *args) |
| | succ(self, node, i) -> int
|
| |
| "int" | pred (self, *args) |
| | pred(self, node, i) -> int
|
| |
| "bool" | empty (self, *args) |
| | empty(self) -> bool
|
| |
| "bgcolor_t" | get_node_color (self, *args) |
| | get_node_color(self, n) -> bgcolor_t
|
| |
| "bgcolor_t" | get_edge_color (self, *args) |
| | get_edge_color(self, i, j) -> bgcolor_t
|
| |
| "size_t" | nedge (self, *args) |
| | nedge(self, node, ispred) -> size_t
|
| |
| "int" | edge (self, *args) |
| | edge(self, node, i, ispred) -> int
|
| |
| "int" | front (self, *args) |
| | front(self) -> int
|
| |
| "node_iterator" | begin (self, *args) |
| | begin(self) -> node_iterator
|
| |
| "node_iterator" | end (self, *args) |
| | end(self) -> node_iterator
|
| |
| | __disown__ (self) |
| |
|
| | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| |
| | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| |
| | title = property(_ida_hexrays.simple_graph_t_title_get, _ida_hexrays.simple_graph_t_title_set, doc=) |
| |
| | colored_gdl_edges = property(_ida_hexrays.simple_graph_t_colored_gdl_edges_get, _ida_hexrays.simple_graph_t_colored_gdl_edges_set, doc=) |
| |
| | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| |