This is the complete list of members for mbl_graph_t, including all inherited members.

begin() const	simple_graph_t	inline
calc_outgoing_edges(const intvec_t &sub, edgevec_t &el) const	simple_graph_t	protected
colored_gdl_edges	simple_graph_t
compute_dominator_info(struct dominator_info_t &di)	simple_graph_t	protected
compute_dominators(array_of_node_bitset_t &domin, bool post=false) const	simple_graph_t	inline
compute_immediate_dominators(const array_of_node_bitset_t &domin, intvec_t &idomin, bool post=false) const	simple_graph_t	inline
const_iterator typedef	simple_graph_t
DEFINE_MEMORY_ALLOCATION_FUNCS() virtual ~gdl_graph_t()	gdl_graph_t	inline
depth_first_postorder(node_ordering_t *post) const	simple_graph_t	inline
depth_first_postorder(node_ordering_t post, edge_mapper_t et) const	simple_graph_t
depth_first_postorder_for_all_entries(node_ordering_t *post) const	simple_graph_t
depth_first_preorder(node_ordering_t *pre) const	simple_graph_t	inline
edge(int node, int i, bool ispred) const	gdl_graph_t	inline
empty(void) const	gdl_graph_t	inlinevirtual
end() const	simple_graph_t	inline
entry(void) const	gdl_graph_t	inlinevirtual
exists(int node) const	gdl_graph_t	inlinevirtual
exit(void) const	gdl_graph_t	inlinevirtual
find_dead_nodes() const	simple_graph_t
find_reaching_nodes(int n, node_bitset_t &reaching) const	simple_graph_t
front() const	simple_graph_t	inline
gen_dot(FILE *fp) const	gdl_graph_t
gen_dot(const char *file) const	gdl_graph_t
gen_gdl(FILE *fp) const	gdl_graph_t
gen_gdl(const char *file) const	gdl_graph_t
get_chain_stamp() const	mbl_graph_t	inline
get_du(gctype_t gctype)	mbl_graph_t	inline
get_edge_color(int i, int j) const	gdl_graph_t	inlinevirtual
get_mblock(int n) const	mbl_graph_t	inline
get_node_color(int n) const	gdl_graph_t	inlinevirtual
get_node_label(char *iobuf, int iobufsize, int n) const	gdl_graph_t	inlinevirtual
get_ud(gctype_t gctype)	mbl_graph_t	inline
goup(int node) const newapi	simple_graph_t	inlinevirtual
HEXRAYS_MEMORY_ALLOCATION_FUNCS() virtual bool ignore_edge(int	simple_graph_t
inc(iterator &p, int n=1) const	simple_graph_t	inline
is_connected_without(const edge_t &forbidden_edge, const intvec_t &dead_nodes) const	simple_graph_t	protected
is_du_chain_dirty(gctype_t gctype)	mbl_graph_t	inline
is_redefined_globally(const mlist_t &list, int b1, int b2, const minsn_t m1, const minsn_t m2, maymust_t maymust=MAY_ACCESS) const	mbl_graph_t	inline
is_ud_chain_dirty(gctype_t gctype)	mbl_graph_t	inline
is_used_globally(const mlist_t &list, int b1, int b2, const minsn_t m1, const minsn_t m2, maymust_t maymust=MAY_ACCESS) const	mbl_graph_t	inline
nedge(int node, bool ispred) const	gdl_graph_t	inline
newapi	simple_graph_t
node_qty(void) const	gdl_graph_t	inlinevirtual
npred(int node) const =0	gdl_graph_t	pure virtual
nsucc(int node) const =0	gdl_graph_t	pure virtual
path_back(const array_of_node_bitset_t &domin, int m, int n) const	simple_graph_t
path_back(const edge_mapper_t &et, int m, int n) const	simple_graph_t
path_exists(int m, int n) const	simple_graph_t
pred(int node, int i) const =0	gdl_graph_t	pure virtual
print_edge(FILE *fp, int i, int j) const	gdl_graph_t	inlinevirtual
print_graph_attributes(FILE *fp) const	gdl_graph_t	inlinevirtual
print_node(FILE *fp, int n) const	gdl_graph_t	inlinevirtual
print_node_attributes(FILE *fp, int n) const	gdl_graph_t	inlinevirtual
size(void) const =0	gdl_graph_t	pure virtual
succ(int node, int i) const =0	gdl_graph_t	pure virtual
title	simple_graph_t