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-dfa.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-dfa.c')
-rw-r--r-- | gcc/tree-dfa.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/tree-dfa.c b/gcc/tree-dfa.c index a2b8a69..ca80043 100644 --- a/gcc/tree-dfa.c +++ b/gcc/tree-dfa.c @@ -181,7 +181,7 @@ compute_immediate_uses (int flags, bool (*calc_for)(tree)) { tree phi; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) compute_immediate_uses_for_phi (phi, calc_for); for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si)) @@ -227,7 +227,7 @@ free_df (void) { tree phi; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) free_df_for_stmt (phi); for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si)) @@ -636,7 +636,7 @@ dump_immediate_uses (FILE *file) { tree phi; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) dump_immediate_uses_for (file, phi); for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si)) @@ -818,7 +818,7 @@ collect_dfa_stats (struct dfa_stats_d *dfa_stats_p) FOR_EACH_BB (bb) { tree phi; - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { dfa_stats_p->num_phis++; dfa_stats_p->num_phi_args += PHI_NUM_ARGS (phi); |