#include <graphds.h>
Data Fields | |
| int | src |
| int | dest |
| struct graph_edge * | pred_next |
| struct graph_edge * | succ_next |
| void * | data |
Detailed Description
@verbatim
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.
Field Documentation
| void* graph_edge::data |
Next edge in predecessor and successor lists.
Referenced by create_rdg_edges_for_scalar(), and stmts_from_loop().
| int graph_edge::dest |
Referenced by dfs_edge_src(), and dump_graph().
| struct graph_edge* graph_edge::pred_next |
Referenced by dfs_fst_edge(), dump_graph(), foll_in_subgraph(), and write_alias_graph_to_ascii_ecc().
| int graph_edge::src |
Referenced by dfs_edge_src(), dump_graph(), identify_vertices(), and write_alias_graph_to_ascii_ecc().
| struct graph_edge * graph_edge::succ_next |
Referenced by dfs_fst_edge(), dump_graph(), foll_in_subgraph(), identify_vertices(), and stmts_from_loop().
The documentation for this struct was generated from the following file:
