constraint_graph Struct Reference

Collaboration diagram for constraint_graph:

Data Fields
unsigned int	size
bitmap *	succs
bitmap *	implicit_preds
bitmap *	preds
int *	indirect_cycles
unsigned int *	rep
int *	eq_rep
unsigned int *	pe
int *	pe_rep
unsigned int *	pointer_label
unsigned int *	loc_label
bitmap *	pointed_by
bitmap *	points_to
sbitmap	direct_nodes
bitmap	address_taken
vec< constraint_t > *	complex

---

Detailed Description

The constraint graph is represented as an array of bitmaps
   containing successor nodes.   

---

Field Documentation

bitmap constraint_graph::address_taken

Referenced by build_pred_graph(), and find_equivalent_node().

vec<constraint_t>* constraint_graph::complex

Referenced by delete_points_to_sets(), dump_constraint_graph(), init_graph(), insert_into_complex(), merge_node_constraints(), and solve_graph().

sbitmap constraint_graph::direct_nodes

Referenced by build_pred_graph(), build_succ_graph(), condense_visit(), free_var_substitution_info(), label_visit(), and perform_var_substitution().

int* constraint_graph::eq_rep

Referenced by build_pred_graph(), find_equivalent_node(), and free_var_substitution_info().

bitmap* constraint_graph::implicit_preds

Referenced by add_implicit_graph_edge(), build_pred_graph(), condense_visit(), and remove_preds_and_fake_succs().

int* constraint_graph::indirect_cycles

Referenced by build_pred_graph(), delete_points_to_sets(), eliminate_indirect_cycles(), init_graph(), merge_graph_nodes(), and scc_visit().

unsigned int* constraint_graph::loc_label

Referenced by build_pred_graph(), free_var_substitution_info(), and perform_var_substitution().

unsigned int* constraint_graph::pe

Referenced by delete_points_to_sets(), find_equivalent_node(), init_graph(), and unite_pointer_equivalences().

int* constraint_graph::pe_rep

Referenced by delete_points_to_sets(), find_equivalent_node(), init_graph(), and unite_pointer_equivalences().

bitmap* constraint_graph::pointed_by

Referenced by build_pred_graph(), free_var_substitution_info(), and perform_var_substitution().

unsigned int* constraint_graph::pointer_label

Referenced by build_pred_graph(), free_var_substitution_info(), label_visit(), perform_var_substitution(), and rewrite_constraints().

bitmap* constraint_graph::points_to

Referenced by build_pred_graph(), condense_visit(), dump_pred_graph(), free_var_substitution_info(), and label_visit().

bitmap* constraint_graph::preds

Referenced by add_pred_graph_edge(), build_pred_graph(), condense_visit(), dump_pred_graph(), label_visit(), and remove_preds_and_fake_succs().

unsigned int* constraint_graph::rep

Referenced by delete_points_to_sets(), find(), init_graph(), and unite().

unsigned int constraint_graph::size

Referenced by build_pred_graph(), compute_topo_order(), delete_points_to_sets(), dump_constraint_graph(), dump_pred_graph(), find_indirect_cycles(), init_graph(), init_topo_info(), perform_var_substitution(), remove_preds_and_fake_succs(), rewrite_constraints(), and solve_graph().

bitmap* constraint_graph::succs

Referenced by add_graph_edge(), clear_edges_for_node(), delete_points_to_sets(), dump_constraint_graph(), init_graph(), merge_graph_nodes(), remove_preds_and_fake_succs(), scc_visit(), solve_graph(), topo_visit(), and unify_nodes().

---

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

• tree-ssa-structalias.c