diff options
| author | Thomas Neumann <tneumann@gcc.gnu.org> | 2007-06-05 15:41:04 +0000 |
|---|---|---|
| committer | Thomas Neumann <tneumann@gcc.gnu.org> | 2007-06-05 15:41:04 +0000 |
| commit | ae50c0cbc82a40aa955d713c4e68a9fd32b6a98a (patch) | |
| tree | f12abaf00f4ac040bcdbeb67b7ce6b482e1ffff4 /gcc/graphds.h | |
| parent | 3fe5bcaf11efc74817ef5b4d0b612b6f5cb21388 (diff) | |
| download | gcc-ae50c0cbc82a40aa955d713c4e68a9fd32b6a98a.tar.gz | |
cfg.c (init_flow): Use type safe memory macros.
* cfg.c (init_flow): Use type safe memory macros.
(alloc_block): Likewise.
(unchecked_make_edge): Likewise.
(dump_flow_info): Avoid using C++ keywords as variable names.
(copy_original_table_clear): Cast according to the coding conventions.
(copy_original_table_set): Likewise.
* cfgexpand (label_rtx_for_bb): Likewise.
(expand_gimüle_basic_block): Likewise.
* cfghooks.c (dump_bb): Likewise.
(lv_adjust_loop_header_phi): Avoid using C++ keywords as variable names.
(lv_add_condition_to_bb): Likewise.
* cfglayout (relink_block_chain): Cast according to the coding
conventions.
(fixup_reorder_chain): Likewise.
(fixup_fallthru_exit_predecessor): Likewise.
* cfgloop.c (glb_enum_p): Likewise.
(get_exit_description): Likewise.
(dump_recorded_exit): Likewise.
* cfgloop.h (enum loop_estimation): Move out of struct scope...
(struct loop): ... from here.
* cfgloopmanip (rpe_enum_p): Cast according to the coding conventions.
* cfgrtl.c (rtl_create_basic_block): Likewise.
(rtl_split_block): Likewise.
(rtl_dump_bb): Likewise.
(cfg_layout_split_block): Likewise.
(init_rtl_bb_info): Use typesafe memory macros.
* graphds.h (struct graph_edge): Renamed edge to graph_edge.
* graphds.h: Updated all usages of edge to graph_edge.
* graphds.c: Likewise.
* cfgloopanal.c: Likewise.
From-SVN: r125336
Diffstat (limited to 'gcc/graphds.h')
| -rw-r--r-- | gcc/graphds.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/graphds.h b/gcc/graphds.h index 2aad4b00a73..23f7fb93784 100644 --- a/gcc/graphds.h +++ b/gcc/graphds.h @@ -21,10 +21,10 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA /* Structure representing edge of a graph. */ -struct edge +struct graph_edge { int src, dest; /* Source and destination. */ - struct edge *pred_next, *succ_next; + struct graph_edge *pred_next, *succ_next; /* Next edge in predecessor and successor lists. */ void *data; /* Data attached to the edge. */ }; @@ -33,7 +33,7 @@ struct edge struct vertex { - struct edge *pred, *succ; + struct graph_edge *pred, *succ; /* Lists of predecessors and successors. */ int component; /* Number of dfs restarts before reaching the vertex. */ @@ -52,12 +52,12 @@ struct graph struct graph *new_graph (int); void dump_graph (FILE *, struct graph *); -struct edge *add_edge (struct graph *, int, int); +struct graph_edge *add_edge (struct graph *, int, int); void identify_vertices (struct graph *, int, int); int graphds_dfs (struct graph *, int *, int, VEC (int, heap) **, bool, bitmap); int graphds_scc (struct graph *, bitmap); void graphds_domtree (struct graph *, int, int *, int *, int *); -typedef void (*graphds_edge_callback) (struct graph *, struct edge *); +typedef void (*graphds_edge_callback) (struct graph *, struct graph_edge *); void for_each_edge (struct graph *, graphds_edge_callback); void free_graph (struct graph *g); |