graph_edge Struct Reference

#include <graphds.h>

Collaboration diagram for graph_edge:

Data Fields
int	src
int	dest
struct graph_edge *	pred_next
struct graph_edge *	succ_next
void *	data

Detailed Description

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/>.   

Structure representing edge of a graph.   

Field Documentation

data

void* graph_edge::data

Referenced by add_edge(), add_partition_graph_edge(), vect_optimize_slp_pass::build_graph(), create_edge_for_control_dependence(), create_rdg_edges_for_scalar(), dump_graph(), free_partition_graph_edata_cb(), free_rdg(), mark_irreducible_loops(), pg_collect_alias_ddrs(), pg_skip_alias_edge(), pg_unmark_merged_alias_ddrs(), and skip_cfg_latch_edges().

dest

int graph_edge::dest

Referenced by add_edge(), vect_optimize_slp_pass::backward_cost(), dfs_edge_dest(), dfs_edge_src(), dot_rdg_1(), dump_graph(), dump_rdg_vertex(), vect_optimize_slp_pass::edge_layout_cost(), identify_vertices(), vect_optimize_slp_pass::is_cfg_latch_edge(), mark_irreducible_loops(), pg_collect_alias_ddrs(), and pg_unmark_merged_alias_ddrs().

pred_next

struct graph_edge* graph_edge::pred_next

Referenced by add_edge(), dfs_next_edge(), dump_graph(), dump_rdg_vertex(), foll_in_subgraph(), vect_optimize_slp_pass::for_each_partition_edge(), graphds_domtree(), and identify_vertices().

src

int graph_edge::src

Referenced by add_edge(), vect_optimize_slp_pass::backward_cost(), dfs_edge_dest(), dfs_edge_src(), dump_graph(), dump_rdg_vertex(), vect_optimize_slp_pass::edge_layout_cost(), graphds_domtree(), identify_vertices(), vect_optimize_slp_pass::is_cfg_latch_edge(), mark_irreducible_loops(), pg_collect_alias_ddrs(), pg_unmark_merged_alias_ddrs(), and vect_optimize_slp_pass::start_choosing_layouts().

succ_next

struct graph_edge * graph_edge::succ_next

Referenced by add_edge(), dfs_next_edge(), dot_rdg_1(), dump_graph(), dump_rdg_vertex(), foll_in_subgraph(), for_each_edge(), vect_optimize_slp_pass::for_each_partition_edge(), free_rdg(), identify_vertices(), and mark_irreducible_loops().

---

The documentation for this struct was generated from the following file:

• graphds.h