11debfc3dSmrg /* Graph representation. 2*8feb0f0bSmrg Copyright (C) 2007-2020 Free Software Foundation, Inc. 31debfc3dSmrg 41debfc3dSmrg This file is part of GCC. 51debfc3dSmrg 61debfc3dSmrg GCC is free software; you can redistribute it and/or modify it under 71debfc3dSmrg the terms of the GNU General Public License as published by the Free 81debfc3dSmrg Software Foundation; either version 3, or (at your option) any later 91debfc3dSmrg version. 101debfc3dSmrg 111debfc3dSmrg GCC is distributed in the hope that it will be useful, but WITHOUT ANY 121debfc3dSmrg WARRANTY; without even the implied warranty of MERCHANTABILITY or 131debfc3dSmrg FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 141debfc3dSmrg for more details. 151debfc3dSmrg 161debfc3dSmrg You should have received a copy of the GNU General Public License 171debfc3dSmrg along with GCC; see the file COPYING3. If not see 181debfc3dSmrg <http://www.gnu.org/licenses/>. */ 191debfc3dSmrg 201debfc3dSmrg #ifndef GCC_GRAPHDS_H 211debfc3dSmrg #define GCC_GRAPHDS_H 221debfc3dSmrg 231debfc3dSmrg /* Structure representing edge of a graph. */ 241debfc3dSmrg 251debfc3dSmrg struct graph_edge 261debfc3dSmrg { 271debfc3dSmrg int src, dest; /* Source and destination. */ 281debfc3dSmrg struct graph_edge *pred_next, *succ_next; 291debfc3dSmrg /* Next edge in predecessor and successor lists. */ 301debfc3dSmrg void *data; /* Data attached to the edge. */ 311debfc3dSmrg }; 321debfc3dSmrg 331debfc3dSmrg /* Structure representing vertex of a graph. */ 341debfc3dSmrg 351debfc3dSmrg struct vertex 361debfc3dSmrg { 371debfc3dSmrg struct graph_edge *pred, *succ; 381debfc3dSmrg /* Lists of predecessors and successors. */ 391debfc3dSmrg int component; /* Number of dfs restarts before reaching the 401debfc3dSmrg vertex. */ 411debfc3dSmrg int post; /* Postorder number. */ 421debfc3dSmrg void *data; /* Data attached to the vertex. */ 431debfc3dSmrg }; 441debfc3dSmrg 451debfc3dSmrg /* Structure representing a graph. */ 461debfc3dSmrg 471debfc3dSmrg struct graph 481debfc3dSmrg { 491debfc3dSmrg int n_vertices; /* Number of vertices. */ 501debfc3dSmrg struct vertex *vertices; /* The vertices. */ 511debfc3dSmrg struct obstack ob; /* Obstack for vertex and edge allocation. */ 521debfc3dSmrg }; 531debfc3dSmrg 541debfc3dSmrg struct graph *new_graph (int); 551debfc3dSmrg void dump_graph (FILE *, struct graph *); 561debfc3dSmrg struct graph_edge *add_edge (struct graph *, int, int); 571debfc3dSmrg void identify_vertices (struct graph *, int, int); 58a2dc1f3fSmrg typedef bool (*skip_edge_callback) (struct graph_edge *); 591debfc3dSmrg int graphds_dfs (struct graph *, int *, int, 60a2dc1f3fSmrg vec<int> *, bool, bitmap, skip_edge_callback = NULL); 61a2dc1f3fSmrg int graphds_scc (struct graph *, bitmap, skip_edge_callback = NULL); 621debfc3dSmrg void graphds_domtree (struct graph *, int, int *, int *, int *); 63a2dc1f3fSmrg typedef void (*graphds_edge_callback) (struct graph *, 64a2dc1f3fSmrg struct graph_edge *, void *); 65a2dc1f3fSmrg void for_each_edge (struct graph *, graphds_edge_callback, void *); 661debfc3dSmrg void free_graph (struct graph *g); 671debfc3dSmrg 681debfc3dSmrg #endif /* GCC_GRAPHDS_H */ 69