ae50c0cbc8
* 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
64 lines
2.0 KiB
C
64 lines
2.0 KiB
C
/* Graph representation.
|
|
Copyright (C) 2007
|
|
Free Software Foundation, Inc.
|
|
|
|
This file is part of GCC.
|
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU General Public License as published by the Free
|
|
Software Foundation; either version 2, or (at your option) any later
|
|
version.
|
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with GCC; see the file COPYING. If not, write to the Free
|
|
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301, USA. */
|
|
|
|
/* Structure representing edge of a graph. */
|
|
|
|
struct graph_edge
|
|
{
|
|
int src, dest; /* Source and destination. */
|
|
struct graph_edge *pred_next, *succ_next;
|
|
/* Next edge in predecessor and successor lists. */
|
|
void *data; /* Data attached to the edge. */
|
|
};
|
|
|
|
/* Structure representing vertex of a graph. */
|
|
|
|
struct vertex
|
|
{
|
|
struct graph_edge *pred, *succ;
|
|
/* Lists of predecessors and successors. */
|
|
int component; /* Number of dfs restarts before reaching the
|
|
vertex. */
|
|
int post; /* Postorder number. */
|
|
void *data; /* Data attached to the vertex. */
|
|
};
|
|
|
|
/* Structure representing a graph. */
|
|
|
|
struct graph
|
|
{
|
|
int n_vertices; /* Number of vertices. */
|
|
struct vertex *vertices;
|
|
/* The vertices. */
|
|
};
|
|
|
|
struct graph *new_graph (int);
|
|
void dump_graph (FILE *, struct graph *);
|
|
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 graph_edge *);
|
|
void for_each_edge (struct graph *, graphds_edge_callback);
|
|
void free_graph (struct graph *g);
|