xref: /dflybsd-src/contrib/gcc-4.7/gcc/graphds.h (revision 04febcfb30580676d3e95f58a16c5137ee478b32)
1*e4b17023SJohn Marino /* Graph representation.
2*e4b17023SJohn Marino    Copyright (C) 2007, 2008
3*e4b17023SJohn Marino    Free Software Foundation, Inc.
4*e4b17023SJohn Marino 
5*e4b17023SJohn Marino This file is part of GCC.
6*e4b17023SJohn Marino 
7*e4b17023SJohn Marino GCC is free software; you can redistribute it and/or modify it under
8*e4b17023SJohn Marino the terms of the GNU General Public License as published by the Free
9*e4b17023SJohn Marino Software Foundation; either version 3, or (at your option) any later
10*e4b17023SJohn Marino version.
11*e4b17023SJohn Marino 
12*e4b17023SJohn Marino GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13*e4b17023SJohn Marino WARRANTY; without even the implied warranty of MERCHANTABILITY or
14*e4b17023SJohn Marino FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
15*e4b17023SJohn Marino for more details.
16*e4b17023SJohn Marino 
17*e4b17023SJohn Marino You should have received a copy of the GNU General Public License
18*e4b17023SJohn Marino along with GCC; see the file COPYING3.  If not see
19*e4b17023SJohn Marino <http://www.gnu.org/licenses/>.  */
20*e4b17023SJohn Marino 
21*e4b17023SJohn Marino /* Structure representing edge of a graph.  */
22*e4b17023SJohn Marino 
23*e4b17023SJohn Marino struct graph_edge
24*e4b17023SJohn Marino {
25*e4b17023SJohn Marino   int src, dest;	/* Source and destination.  */
26*e4b17023SJohn Marino   struct graph_edge *pred_next, *succ_next;
27*e4b17023SJohn Marino 			/* Next edge in predecessor and successor lists.  */
28*e4b17023SJohn Marino   void *data;		/* Data attached to the edge.  */
29*e4b17023SJohn Marino };
30*e4b17023SJohn Marino 
31*e4b17023SJohn Marino /* Structure representing vertex of a graph.  */
32*e4b17023SJohn Marino 
33*e4b17023SJohn Marino struct vertex
34*e4b17023SJohn Marino {
35*e4b17023SJohn Marino   struct graph_edge *pred, *succ;
36*e4b17023SJohn Marino 			/* Lists of predecessors and successors.  */
37*e4b17023SJohn Marino   int component;	/* Number of dfs restarts before reaching the
38*e4b17023SJohn Marino 			   vertex.  */
39*e4b17023SJohn Marino   int post;		/* Postorder number.  */
40*e4b17023SJohn Marino   void *data;		/* Data attached to the vertex.  */
41*e4b17023SJohn Marino };
42*e4b17023SJohn Marino 
43*e4b17023SJohn Marino /* Structure representing a graph.  */
44*e4b17023SJohn Marino 
45*e4b17023SJohn Marino struct graph
46*e4b17023SJohn Marino {
47*e4b17023SJohn Marino   int n_vertices;	/* Number of vertices.  */
48*e4b17023SJohn Marino   struct vertex *vertices;
49*e4b17023SJohn Marino 			/* The vertices.  */
50*e4b17023SJohn Marino   htab_t indices;	/* Fast lookup for indices.  */
51*e4b17023SJohn Marino };
52*e4b17023SJohn Marino 
53*e4b17023SJohn Marino struct graph *new_graph (int);
54*e4b17023SJohn Marino void dump_graph (FILE *, struct graph *);
55*e4b17023SJohn Marino struct graph_edge *add_edge (struct graph *, int, int);
56*e4b17023SJohn Marino void identify_vertices (struct graph *, int, int);
57*e4b17023SJohn Marino int graphds_dfs (struct graph *, int *, int,
58*e4b17023SJohn Marino 		 VEC (int, heap) **, bool, bitmap);
59*e4b17023SJohn Marino int graphds_scc (struct graph *, bitmap);
60*e4b17023SJohn Marino void graphds_domtree (struct graph *, int, int *, int *, int *);
61*e4b17023SJohn Marino typedef void (*graphds_edge_callback) (struct graph *, struct graph_edge *);
62*e4b17023SJohn Marino void for_each_edge (struct graph *, graphds_edge_callback);
63*e4b17023SJohn Marino void free_graph (struct graph *g);
64