diff options
| author | Steven Bosscher <steven@gcc.gnu.org> | 2004-06-16 23:03:34 +0000 |
|---|---|---|
| committer | Steven Bosscher <steven@gcc.gnu.org> | 2004-06-16 23:03:34 +0000 |
| commit | 17192884645f6c9e6135af2e691418734bdb6aac (patch) | |
| tree | dde82bd9f48e0a3f866df03c17efa0827619c51e /gcc/tree-ssa-dom.c | |
| parent | bf83cc10ca01f0da835a13d9bda9ca52cd251bea (diff) | |
| download | gcc-17192884645f6c9e6135af2e691418734bdb6aac.zip gcc-17192884645f6c9e6135af2e691418734bdb6aac.tar.gz gcc-17192884645f6c9e6135af2e691418734bdb6aac.tar.bz2 | |
tree.h (PHI_CHAIN): New.
* 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.
From-SVN: r83273
Diffstat (limited to 'gcc/tree-ssa-dom.c')
| -rw-r--r-- | gcc/tree-ssa-dom.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/tree-ssa-dom.c b/gcc/tree-ssa-dom.c index 3a0c1aa..636af8e 100644 --- a/gcc/tree-ssa-dom.c +++ b/gcc/tree-ssa-dom.c @@ -331,7 +331,7 @@ redirect_edges_and_update_ssa_graph (varray_type redirection_edges) /* All variables referenced in PHI nodes we bypass must be renamed. */ - for (phi = phi_nodes (e->dest); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) { tree result = SSA_NAME_VAR (PHI_RESULT (phi)); @@ -381,7 +381,7 @@ redirect_edges_and_update_ssa_graph (varray_type redirection_edges) /* Finally, any variables in PHI nodes at our final destination must also be taken our of SSA form. */ - for (phi = phi_nodes (tgt); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (tgt); phi; phi = PHI_CHAIN (phi)) { tree result = SSA_NAME_VAR (PHI_RESULT (phi)); @@ -515,7 +515,7 @@ redirect_edges_and_update_ssa_graph (varray_type redirection_edges) { tree result = PHI_RESULT (phi); - next = TREE_CHAIN (phi); + next = PHI_CHAIN (phi); if (bitmap_bit_p (virtuals_to_rename, var_ann (SSA_NAME_VAR (result))->uid)) @@ -698,7 +698,7 @@ thread_across_edge (struct dom_walk_data *walk_data, edge e) tree phi; /* Each PHI creates a temporary equivalence, record them. */ - for (phi = phi_nodes (e->dest); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) { tree src = PHI_ARG_DEF (phi, phi_arg_from_edge (phi, e)); tree dst = PHI_RESULT (phi); @@ -1334,7 +1334,7 @@ record_equivalences_from_phis (struct dom_walk_data *walk_data, basic_block bb) = VARRAY_TOP_GENERIC_PTR (walk_data->block_data_stack); tree phi; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { tree lhs = PHI_RESULT (phi); tree rhs = NULL; |