diff options
author | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
---|---|---|
committer | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
commit | 1bc5aee63eb72b341f506ad058502cd0361f0d10 (patch) | |
tree | c607e8252f3405424ff15bc2d00aa38dadbb2518 /gcc-4.9/gcc/graphds.h | |
parent | 283a0bf58fcf333c58a2a92c3ebbc41fb9eb1fdb (diff) | |
download | toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.gz toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.bz2 toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.zip |
Initial checkin of GCC 4.9.0 from trunk (r208799).
Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba
Diffstat (limited to 'gcc-4.9/gcc/graphds.h')
-rw-r--r-- | gcc-4.9/gcc/graphds.h | 61 |
1 files changed, 61 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/graphds.h b/gcc-4.9/gcc/graphds.h new file mode 100644 index 000000000..03f969afc --- /dev/null +++ b/gcc-4.9/gcc/graphds.h @@ -0,0 +1,61 @@ +/* Graph representation. + Copyright (C) 2007-2014 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/>. */ + +/* 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); +int graphds_dfs (struct graph *, int *, int, + vec<int> *, 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); |