diff options
| author | steven <steven@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-06-16 23:03:34 +0000 |
|---|---|---|
| committer | steven <steven@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-06-16 23:03:34 +0000 |
| commit | 04f8eea36ac397c3903291fcbb7f41c12e83ea4d (patch) | |
| tree | dde82bd9f48e0a3f866df03c17efa0827619c51e /gcc/tree-ssa-live.c | |
| parent | 4a35e7d0fa5924c9bd57c656066954222134dff5 (diff) | |
| download | ppe42-gcc-04f8eea36ac397c3903291fcbb7f41c12e83ea4d.tar.gz ppe42-gcc-04f8eea36ac397c3903291fcbb7f41c12e83ea4d.zip | |
* tree.h (PHI_CHAIN): New.
* (tree-cfg.c, tree-dfa.c, tree-flow-inline.h, tree-into-ssa.c,
tree-outof-ssa.c, tree-phinodes.c, tree-pretty-print.c,
tree-ssa-alias.c, tree-ssa-ccp.c, tree-ssa-dom.c, tree-ssa-dse.c,
tree-ssa-live.c, tree-ssa-loop.c, tree-ssa-phiopt.c, tree-ssa-pre.c,
tree-ssa.c, tree-tailcall.c): Use PHI_CHAIN instead of TREE_CHAIN
when traversing a list of PHI_NODEs.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@83273 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-ssa-live.c')
| -rw-r--r-- | gcc/tree-ssa-live.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/tree-ssa-live.c b/gcc/tree-ssa-live.c index 549211d2979..2f9288b7114 100644 --- a/gcc/tree-ssa-live.c +++ b/gcc/tree-ssa-live.c @@ -329,7 +329,7 @@ create_ssa_var_map (int flags) FOR_EACH_BB (bb) { tree phi, arg; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { int i; register_ssa_partition (map, PHI_RESULT (phi), false); @@ -578,7 +578,7 @@ calculate_live_on_entry (var_map map) { bitmap_clear (saw_def); - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { for (i = 0; i < PHI_NUM_ARGS (phi); i++) { @@ -603,7 +603,7 @@ calculate_live_on_entry (var_map map) The a_3 referred to in b_3's PHI node is the one incoming on the edge, *not* the PHI node just seen. */ - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { var = PHI_RESULT (phi); set_if_valid (map, saw_def, var); @@ -701,7 +701,7 @@ calculate_live_on_entry (var_map map) int z, ok = 0; for (phi = phi_nodes (e->dest); phi && !ok; - phi = TREE_CHAIN (phi)) + phi = PHI_CHAIN (phi)) { for (z = 0; z < PHI_NUM_ARGS (phi); z++) if (var == PHI_ARG_DEF (phi, z)) @@ -751,7 +751,7 @@ calculate_live_on_exit (tree_live_info_p liveinfo) /* Set all the live-on-exit bits for uses in PHIs. */ FOR_EACH_BB (bb) { - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) for (i = 0; i < PHI_NUM_ARGS (phi); i++) { t = PHI_ARG_DEF (phi, i); @@ -1418,7 +1418,7 @@ build_tree_conflict_graph (tree_live_info_p liveinfo, tpa_p tpa, going to be translated out of SSA form we must record a conflict between the result of the PHI and any variables with are live. Otherwise the out-of-ssa translation may create incorrect code. */ - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { tree result = PHI_RESULT (phi); int p = var_to_partition (map, result); @@ -1837,7 +1837,7 @@ register_ssa_partitions_for_vars (bitmap vars, var_map map) { tree result = SSA_NAME_VAR (PHI_RESULT (phi)); - next = TREE_CHAIN (phi); + next = PHI_CHAIN (phi); if (bitmap_bit_p (vars, var_ann (result)->uid)) { if (! is_gimple_reg (result)) |
