graphds.h

Go to the documentation of this file.

/* Graph representation.
   Copyright (C) 2007-2024 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 3, 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 COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */
 
#ifndef GCC_GRAPHDS_H
#define GCC_GRAPHDS_H
 
/* 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 obstack ob;       /* Obstack for vertex and edge allocation.  */
};
 
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);
typedef bool (*skip_edge_callback) (struct graph_edge *);
int graphds_dfs (struct graph *, int *, int,
                 vec<int> *, bool, bitmap, skip_edge_callback = NULL);
int graphds_scc (struct graph *, bitmap, skip_edge_callback = NULL,
                 vec<int> * = NULL);
void graphds_domtree (struct graph *, int, int *, int *, int *);
typedef void (*graphds_edge_callback) (struct graph *,
                                       struct graph_edge *, void *);
void for_each_edge (struct graph *, graphds_edge_callback, void *);
void free_graph (struct graph *g);
 
#endif /* GCC_GRAPHDS_H */