GCC Middle and Back End API Reference
|
Data Fields | |
tree | rhs |
tree | lhs |
@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.
tree edge_equivalency::lhs |
Referenced by associate_equivalences_with_edges(), uncprop_enter_block(), and uncprop_into_successor_phis().
tree edge_equivalency::rhs |
Referenced by associate_equivalences_with_edges(), uncprop_enter_block(), and uncprop_into_successor_phis().