Public Types | |
| typedef tree_int_map | value_type |
| typedef tree_int_map | compare_type |
Static Public Member Functions | |
| static hashval_t | hash (const value_type *) |
| static bool | equal (const value_type *, const compare_type *) |
| static void | remove (tree_int_map *p) |
Detailed Description
Liveness for SSA trees. Copyright (C) 2003-2013 Free Software Foundation, Inc. Contributed by Andrew MacLeod amacleod@redhat.com
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/. VARMAP maintains a mapping from SSA version number to real variables.
All SSA_NAMES are divided into partitions. Initially each ssa_name is the only member of it's own partition. Coalescing will attempt to group any ssa_names which occur in a copy or in a PHI node into the same partition.
At the end of out-of-ssa, each partition becomes a "real" variable and is rewritten as a compiler variable.
The var_map data structure is used to manage these partitions. It allows partitions to be combined, and determines which partition belongs to what ssa_name or variable, and vice versa. Hashtable helpers.
Member Typedef Documentation
| typedef tree_int_map tree_int_map_hasher::compare_type |
| typedef tree_int_map tree_int_map_hasher::value_type |
Member Function Documentation
|
inlinestatic |
|
inlinestatic |
|
inlinestaticinherited |
Remove doing nothing.
The documentation for this struct was generated from the following file:
