GCC Middle and Back End API Reference
Data Fields
edge_equivalency Struct Reference

Data Fields

tree rhs
tree lhs

Detailed Description

@verbatim

Routines for discovering and unpropagating edge equivalences. Copyright (C) 2005-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/. 

   The basic structure describing an equivalency created by traversing
   an edge.  Traversing the edge effectively means that we can assume
   that we've seen an assignment LHS = RHS.

Field Documentation

tree edge_equivalency::lhs

Referenced by uncprop_dom_walker::after_dom_children(), associate_equivalences_with_edges(), and single_incoming_edge_ignoring_loop_edges().

tree edge_equivalency::rhs

Referenced by uncprop_dom_walker::after_dom_children(), associate_equivalences_with_edges(), and single_incoming_edge_ignoring_loop_edges().

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