From f780cc25eaffc78f268a94471da728ac7945751f Mon Sep 17 00:00:00 2001 From: tneumann Date: Tue, 5 Jun 2007 15:41:04 +0000 Subject: =?UTF-8?q?=09*=20cfg.c=20(init=5Fflow):=20Use=20type=20safe=20mem?= =?UTF-8?q?ory=20macros.=20=09(alloc=5Fblock):=20Likewise.=20=09(unchecked?= =?UTF-8?q?=5Fmake=5Fedge):=20Likewise.=20=09(dump=5Fflow=5Finfo):=20Avoid?= =?UTF-8?q?=20using=20C++=20keywords=20as=20variable=20names.=20=09(copy?= =?UTF-8?q?=5Foriginal=5Ftable=5Fclear):=20Cast=20according=20to=20the=20c?= =?UTF-8?q?oding=20conventions.=20=09(copy=5Foriginal=5Ftable=5Fset):=20Li?= =?UTF-8?q?kewise.=20=09*=20cfgexpand=20(label=5Frtx=5Ffor=5Fbb):=20Likewi?= =?UTF-8?q?se.=20=09(expand=5Fgim=C3=BCle=5Fbasic=5Fblock):=20Likewise.=20?= =?UTF-8?q?=09*=20cfghooks.c=20(dump=5Fbb):=20Likewise.=20=09(lv=5Fadjust?= =?UTF-8?q?=5Floop=5Fheader=5Fphi):=20Avoid=20using=20C++=20keywords=20as?= =?UTF-8?q?=20variable=20names.=20=09(lv=5Fadd=5Fcondition=5Fto=5Fbb):=20L?= =?UTF-8?q?ikewise.=20=09*=20cfglayout=20(relink=5Fblock=5Fchain):=20Cast?= =?UTF-8?q?=20according=20to=20the=20coding=20=09conventions.=20=09(fixup?= =?UTF-8?q?=5Freorder=5Fchain):=20Likewise.=20=09(fixup=5Ffallthru=5Fexit?= =?UTF-8?q?=5Fpredecessor):=20Likewise.=20=09*=20cfgloop.c=20(glb=5Fenum?= =?UTF-8?q?=5Fp):=20Likewise.=20=09(get=5Fexit=5Fdescription):=20Likewise.?= =?UTF-8?q?=20=09(dump=5Frecorded=5Fexit):=20Likewise.=20=09*=20cfgloop.h?= =?UTF-8?q?=20(enum=20loop=5Festimation):=20Move=20out=20of=20struct=20sco?= =?UTF-8?q?pe...=20=09(struct=20loop):=20...=20from=20here.=20=09*=20cfglo?= =?UTF-8?q?opmanip=20(rpe=5Fenum=5Fp):=20Cast=20according=20to=20the=20cod?= =?UTF-8?q?ing=20conventions.=20=09*=20cfgrtl.c=20(rtl=5Fcreate=5Fbasic=5F?= =?UTF-8?q?block):=20Likewise.=20=09(rtl=5Fsplit=5Fblock):=20Likewise.=20?= =?UTF-8?q?=09(rtl=5Fdump=5Fbb):=20Likewise.=20=09(cfg=5Flayout=5Fsplit=5F?= =?UTF-8?q?block):=20Likewise.=20=09(init=5Frtl=5Fbb=5Finfo):=20Use=20type?= =?UTF-8?q?safe=20memory=20macros.?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit * 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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@125336 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/graphds.h | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'gcc/graphds.h') 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); -- cgit v1.2.1