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-tailcall.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-tailcall.c')
| -rw-r--r-- | gcc/tree-tailcall.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/tree-tailcall.c b/gcc/tree-tailcall.c index 92626860f23..379594e9321 100644 --- a/gcc/tree-tailcall.c +++ b/gcc/tree-tailcall.c @@ -339,7 +339,7 @@ propagate_through_phis (tree var, edge e) basic_block dest = e->dest; tree phi; - for (phi = phi_nodes (dest); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) if (phi_element_for_edge (phi, e)->def == var) return PHI_RESULT (phi); @@ -558,7 +558,7 @@ adjust_accumulator_values (block_stmt_iterator bsi, tree m, tree a, edge back) if (a_acc) { - for (phi = phi_nodes (back->dest); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) if (PHI_RESULT (phi) == a_acc) break; @@ -567,7 +567,7 @@ adjust_accumulator_values (block_stmt_iterator bsi, tree m, tree a, edge back) if (m_acc) { - for (phi = phi_nodes (back->dest); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) if (PHI_RESULT (phi) == m_acc) break; @@ -684,7 +684,7 @@ eliminate_tail_call (struct tailcall *t) args = TREE_CHAIN (args)) { - for (phi = phi_nodes (first); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (first); phi; phi = PHI_CHAIN (phi)) if (param == SSA_NAME_VAR (PHI_RESULT (phi))) break; @@ -701,7 +701,7 @@ eliminate_tail_call (struct tailcall *t) for (i = 0; i < NUM_V_MAY_DEFS (v_may_defs); i++) { param = SSA_NAME_VAR (V_MAY_DEF_RESULT (v_may_defs, i)); - for (phi = phi_nodes (first); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (first); phi; phi = PHI_CHAIN (phi)) if (param == SSA_NAME_VAR (PHI_RESULT (phi))) break; |
