diff options
author | Ben Cheng <bccheng@google.com> | 2013-03-28 11:14:20 -0700 |
---|---|---|
committer | Ben Cheng <bccheng@google.com> | 2013-03-28 12:40:33 -0700 |
commit | af0c51ac87ab2a87caa03fa108f0d164987a2764 (patch) | |
tree | 4b8b470f7c5b69642fdab8d0aa1fbc148d02196b /gcc-4.8/gcc/graphds.h | |
parent | d87cae247d39ebf4f5a6bf25c932a14d2fdb9384 (diff) | |
download | toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.tar.gz toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.tar.bz2 toolchain_gcc-af0c51ac87ab2a87caa03fa108f0d164987a2764.zip |
[GCC 4.8] Initial check-in of GCC 4.8.0
Change-Id: I0719d8a6d0f69b367a6ab6f10eb75622dbf12771
Diffstat (limited to 'gcc-4.8/gcc/graphds.h')
-rw-r--r-- | gcc-4.8/gcc/graphds.h | 62 |
1 files changed, 62 insertions, 0 deletions
diff --git a/gcc-4.8/gcc/graphds.h b/gcc-4.8/gcc/graphds.h new file mode 100644 index 000000000..5e5ca7d84 --- /dev/null +++ b/gcc-4.8/gcc/graphds.h @@ -0,0 +1,62 @@ +/* Graph representation. + Copyright (C) 2007-2013 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. */ + htab_t indices; /* Fast lookup for indices. */ +}; + +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); |