mbl_graph_t Class Reference

Proxy of C++ mbl_graph_t class.

Inheritance diagram for mbl_graph_t:

Public Member Functions
	__init__ (self, *args, **kwargs)
	init(self) -> gdl_graph_t
"bool"	is_ud_chain_dirty (self, "gctype_t" gctype)
	is_ud_chain_dirty(self, gctype) -> bool Is the use-def chain of the specified kind dirty?
"bool"	is_du_chain_dirty (self, "gctype_t" gctype)
	is_du_chain_dirty(self, gctype) -> bool Is the def-use chain of the specified kind dirty?
"int"	get_chain_stamp (self)
	get_chain_stamp(self) -> int
"graph_chains_t *"	get_ud (self, "gctype_t" gctype)
	get_ud(self, gctype) -> graph_chains_t Get use-def chains.
"graph_chains_t *"	get_du (self, "gctype_t" gctype)
	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, "int" n)
	get_mblock(self, n) -> mblock_t
Public Member Functions inherited from simple_graph_t
"void"	compute_dominators (self, "array_of_node_bitset_t &" domin, "bool" post=False)
	compute_dominators(self, domin, post=False)
"void"	compute_immediate_dominators (self, "array_of_node_bitset_t const &" domin, "intvec_t" idomin, "bool" post=False)
	compute_immediate_dominators(self, domin, idomin, post=False)
"int"	depth_first_preorder (self, "node_ordering_t" pre)
	depth_first_preorder(self, pre) -> int
"int"	depth_first_postorder (self, "node_ordering_t" post)
	depth_first_postorder(self, post) -> int
"simple_graph_t::iterator"	begin (self)
	begin(self) -> simple_graph_t::iterator
"simple_graph_t::iterator"	end (self)
	end(self) -> simple_graph_t::iterator
"int"	front (self)
	front(self) -> int
"void"	inc (self, "simple_graph_t::iterator &" p, "int" n=1)
	inc(self, p, n=1)
"int"	goup (self, "int" node)
	goup(self, node) -> int
Public Member Functions inherited from gdl_graph_t
"char *"	get_node_label (self, "int" n)
	get_node_label(self, n) -> char *
"void"	print_graph_attributes (self, "FILE *" fp)
	print_graph_attributes(self, fp)
"bool"	print_node (self, "FILE *" fp, "int" n)
	print_node(self, fp, n) -> bool
"bool"	print_edge (self, "FILE *" fp, "int" i, "int" j)
	print_edge(self, fp, i, j) -> bool
"void"	print_node_attributes (self, "FILE *" fp, "int" n)
	print_node_attributes(self, fp, n)
"int"	size (self)
	size(self) -> int
"int"	node_qty (self)
	node_qty(self) -> int
"bool"	exists (self, "int" node)
	exists(self, node) -> bool
"int"	entry (self)
	entry(self) -> int
"int"	exit (self)
	exit(self) -> int
"int"	nsucc (self, "int" node)
	nsucc(self, node) -> int
"int"	npred (self, "int" node)
	npred(self, node) -> int
"int"	succ (self, "int" node, "int" i)
	succ(self, node, i) -> int
"int"	pred (self, "int" node, "int" i)
	pred(self, node, i) -> int
"bool"	empty (self)
	empty(self) -> bool
"bgcolor_t"	get_node_color (self, "int" n)
	get_node_color(self, n) -> bgcolor_t
"bgcolor_t"	get_edge_color (self, "int" i, "int" j)
	get_edge_color(self, i, j) -> bgcolor_t
"size_t"	nedge (self, "int" node, "bool" ispred)
	nedge(self, node, ispred) -> size_t
"int"	edge (self, "int" node, "int" i, "bool" ispred)
	edge(self, node, i, ispred) -> int
	__disown__ (self)

Properties
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
Properties inherited from simple_graph_t
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
Properties inherited from gdl_graph_t
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

Additional Inherited Members
Static Public Attributes inherited from simple_graph_t
str	title = property(_ida_hexrays.simple_graph_t_title_get, _ida_hexrays.simple_graph_t_title_set, doc=)
str	colored_gdl_edges = property(_ida_hexrays.simple_graph_t_colored_gdl_edges_get, _ida_hexrays.simple_graph_t_colored_gdl_edges_set, doc=)

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args,
		**	kwargs )

Parameters

self	PyObject *

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 )

Parameters

gctype

(C++: gctype_t) enum gctype_t

get_mblock()

"mblock_t *" get_mblock	(		self,
		"int"	n )

Parameters

n

int

get_ud()

"graph_chains_t *" get_ud	(		self,
		"gctype_t"	gctype )

Parameters

gctype

(C++: gctype_t) enum gctype_t

is_du_chain_dirty()

"bool" is_du_chain_dirty	(		self,
		"gctype_t"	gctype )

Parameters

gctype

(C++: gctype_t) enum gctype_t

is_redefined_globally()

"bool" is_redefined_globally	(		self,
		*	args )

Parameters

list	(C++: const mlist_t &) mlist_t const &
b1	(C++: int)
b2	(C++: int)
m1	(C++: const minsn_t *) minsn_t const *
m2	(C++: const minsn_t *) minsn_t const *
maymust	(C++: maymust_t)

is_ud_chain_dirty()

"bool" is_ud_chain_dirty	(		self,
		"gctype_t"	gctype )

Parameters

gctype

(C++: gctype_t) enum gctype_t

is_used_globally()

"bool" is_used_globally	(		self,
		*	args )

Parameters

list	(C++: const mlist_t &) mlist_t const &
b1	(C++: int)
b2	(C++: int)
m1	(C++: const minsn_t *) minsn_t const *
m2	(C++: const minsn_t *) minsn_t const *
maymust	(C++: maymust_t)

Property Documentation

thisown

thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

static

---

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

• ida_hexrays.py