+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>
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);
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;
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)
{
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++)
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);
/* 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)