From 17192884645f6c9e6135af2e691418734bdb6aac Mon Sep 17 00:00:00 2001 From: Steven Bosscher Date: Wed, 16 Jun 2004 23:03:34 +0000 Subject: 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 --- gcc/tree-ssa-dce.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'gcc/tree-ssa-dce.c') diff --git a/gcc/tree-ssa-dce.c b/gcc/tree-ssa-dce.c index 36007a43c84..344f2249ada 100644 --- a/gcc/tree-ssa-dce.c +++ b/gcc/tree-ssa-dce.c @@ -432,7 +432,7 @@ find_obviously_necessary_stmts (struct edge_list *el) tree phi; /* Check any PHI nodes in the block. */ - for (phi = phi_nodes (bb); phi; phi = TREE_CHAIN (phi)) + for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) { NECESSARY (phi) = 0; @@ -664,7 +664,7 @@ remove_dead_phis (basic_block bb) if (! NECESSARY (phi)) { - tree next = TREE_CHAIN (phi); + tree next = PHI_CHAIN (phi); if (dump_file && (dump_flags & TDF_DETAILS)) { @@ -680,7 +680,7 @@ remove_dead_phis (basic_block bb) else { prev = phi; - phi = TREE_CHAIN (phi); + phi = PHI_CHAIN (phi); } } } -- cgit v1.2.1