OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

tree-cfg.c, [...]: Replace TREE_CHAIN with PHI_CHAIN where appropriate.

Browse Source 
* tree-cfg.c, tree-if-conv.c, tree-ssa-loop-ivopts.c,
	tree-ssa-loop-manip.c, tree-vectorizer.c: Replace TREE_CHAIN
	with PHI_CHAIN where appropriate.

From-SVN: r90611
This commit is contained in:
Kazu Hirata 2004-11-14 04:08:11 +00:00
parent 88957e792d
commit eaf0dc0254
6 changed files with 20 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
gcc/ChangeLog
View File

@ -1,12 +1,18 @@
2004-11-14 Kazu Hirata <kazu@cs.umass.edu>
* tree-cfg.c, tree-if-conv.c, tree-ssa-loop-ivopts.c,
tree-ssa-loop-manip.c, tree-vectorizer.c: Replace TREE_CHAIN
with PHI_CHAIN where appropriate.
2004-11-13 Dale Johannesen <dalej@apple.com>
* tree-flow.h (bsi_commit_one_edge_insert): Remove name from prototype.
(tree_block_label): Ditto.
(flush_pending_stmts): Ditto.
(insert_edge_copies): Ditto.
(expr_invariant_in_loop_p): Ditto.
(TDF_USE_OPS): Parenthesize definition.
(TDF_USE_VOPS): Ditto.
* tree-flow.h (bsi_commit_one_edge_insert): Remove name from prototype.
(tree_block_label): Ditto.
(flush_pending_stmts): Ditto.
(insert_edge_copies): Ditto.
(expr_invariant_in_loop_p): Ditto.
(TDF_USE_OPS): Parenthesize definition.
(TDF_USE_VOPS): Ditto.
2004-11-13 David Edelsohn <edelsohn@gnu.org>

4
gcc/tree-cfg.c
View File

@ -4515,9 +4515,9 @@ add_phi_args_after_copy_bb (basic_block bb_copy)
for (phi = phi_nodes (e->dest), phi_copy = phi_nodes (e_copy->dest);
phi;
phi = phi_next, phi_copy = TREE_CHAIN (phi_copy))
phi = phi_next, phi_copy = PHI_CHAIN (phi_copy))
{
phi_next = TREE_CHAIN (phi);
phi_next = PHI_CHAIN (phi);
gcc_assert (PHI_RESULT (phi) == PHI_RESULT (phi_copy));
def = PHI_ARG_DEF_FROM_EDGE (phi, e);

2
gcc/tree-if-conv.c
View File

@ -824,7 +824,7 @@ process_phi_nodes (struct loop *loop)
while (phi)
{
tree next = TREE_CHAIN (phi);
tree next = PHI_CHAIN (phi);
replace_phi_with_cond_modify_expr (phi, cond, true_bb, &bsi);
release_phi_node (phi);
phi = next;

2
gcc/tree-ssa-loop-ivopts.c
View File

@ -4659,7 +4659,7 @@ compute_phi_arg_on_exit (edge exit, tree stmts, tree op)
for (phi = phi_nodes (exit->dest); phi; phi = next)
{
next = TREE_CHAIN (phi);
next = PHI_CHAIN (phi);
if (PHI_ARG_DEF_FROM_EDGE (phi, exit) == op)
{

2
gcc/tree-ssa-loop-manip.c
View File

@ -665,7 +665,7 @@ lv_adjust_loop_header_phi (basic_block first, basic_block second,
for (phi2 = phi_nodes (second), phi1 = phi_nodes (first);
phi2 && phi1;
phi2 = TREE_CHAIN (phi2), phi1 = TREE_CHAIN (phi1))
phi2 = PHI_CHAIN (phi2), phi1 = PHI_CHAIN (phi1))
{
int i;
for (i = 0; i < PHI_NUM_ARGS (phi2); i++)

4
gcc/tree-vectorizer.c
View File

@ -482,7 +482,7 @@ update_phis_for_duplicate_loop (struct loop *loop,
for (phi_new = phi_nodes (new_loop->header),
phi_old = phi_nodes (loop->header);
phi_new && phi_old;
phi_new = TREE_CHAIN (phi_new), phi_old = TREE_CHAIN (phi_old))
phi_new = PHI_CHAIN (phi_new), phi_old = PHI_CHAIN (phi_old))
{
def = PHI_ARG_DEF_FROM_EDGE (phi_old, old_latch);
@ -577,7 +577,7 @@ update_phi_nodes_for_guard (edge guard_true_edge, struct loop * loop)
/* Update all phi nodes at the loop exit successor. */
for (phi1 = phi_nodes (EDGE_SUCC (bb, 0)->dest);
phi1;
phi1 = TREE_CHAIN (phi1))
phi1 = PHI_CHAIN (phi1))
{
tree old_arg = PHI_ARG_DEF_FROM_EDGE (phi1, EDGE_SUCC (bb, 0));
if (old_arg == phi_arg)