tree-phinodes.c (remove_phi_node): Drop the last argument.
authorKazu Hirata <kazu@cs.umass.edu>
Sat, 5 Mar 2005 15:29:25 +0000 (15:29 +0000)
committerKazu Hirata <kazu@gcc.gnu.org>
Sat, 5 Mar 2005 15:29:25 +0000 (15:29 +0000)
* tree-phinodes.c (remove_phi_node): Drop the last argument.
* tree-flow.h: Adjust the prototype for remove_phi_node.
* lambda-code.c (perfect_nestify): Adjust a call to
remove_phi_node.
* tree-cfg.c
(remove_phi_nodes_and_edges_for_unreachable_block): Likewise.
* tree-outof-ssa.c (eliminate_virtual_phis, remove_ssa_form):
Likewise.
* tree-ssa-dce.c (remove_dead_phis): Likewise.
* tree-ssa-loop-ivopts.c (remove_statement): Likewise.
* tree-ssa-pre.c (remove_dead_inserted_code): Likewise.
* tree-ssa.c (kill_redundant_phi_nodes): Likewise.

From-SVN: r95932

gcc/ChangeLog
gcc/lambda-code.c
gcc/tree-cfg.c
gcc/tree-flow.h
gcc/tree-outof-ssa.c
gcc/tree-phinodes.c
gcc/tree-ssa-dce.c
gcc/tree-ssa-loop-ivopts.c
gcc/tree-ssa-pre.c
gcc/tree-ssa.c

index 7a8a848e7414862a8040df299d6bdfa6913c10e0..ab6f61722525a1d9fe2ee7af314980c301fe78f6 100644 (file)
@@ -8,6 +8,19 @@
        gensupport.c, jump.c, tree-phinodes.c, unwind-dw2-fde-glibc.c:
        Update copyright.
 
+       * tree-phinodes.c (remove_phi_node): Drop the last argument.
+       * tree-flow.h: Adjust the prototype for remove_phi_node.
+       * lambda-code.c (perfect_nestify): Adjust a call to
+       remove_phi_node.
+       * tree-cfg.c
+       (remove_phi_nodes_and_edges_for_unreachable_block): Likewise.
+       * tree-outof-ssa.c (eliminate_virtual_phis, remove_ssa_form):
+       Likewise.
+       * tree-ssa-dce.c (remove_dead_phis): Likewise.
+       * tree-ssa-loop-ivopts.c (remove_statement): Likewise.
+       * tree-ssa-pre.c (remove_dead_inserted_code): Likewise.
+       * tree-ssa.c (kill_redundant_phi_nodes): Likewise.
+
 2005-03-05  Richard Sandiford  <rsandifo@redhat.com>
 
        * doc/invoke.texi: Document new MIPS -msym32 and -mno-sym32 options.
index 909c28dd371c6e5389806edf954e79603410c1bd..a19ab92cd38f823959b2954e41b1b308c0446042 100644 (file)
@@ -2327,7 +2327,7 @@ perfect_nestify (struct loops *loops,
   while (phi_nodes (olddest) != NULL)
     {
       SET_PHI_RESULT (phi_nodes (olddest), NULL);
-      remove_phi_node (phi_nodes (olddest), NULL, olddest);
+      remove_phi_node (phi_nodes (olddest), NULL);
     }      
 
   /* and add them back to the new basic block.  */
index 6ba0a02b8d011536c501d533eb495e1ccd1ad690..b87ce54c29179eb2deaee3e9cdb08ad2070316f3 100644 (file)
@@ -1997,7 +1997,7 @@ remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
   while (phi)
     {
       tree next = PHI_CHAIN (phi);
-      remove_phi_node (phi, NULL_TREE, bb);
+      remove_phi_node (phi, NULL_TREE);
       phi = next;
     }
 
index 82402c27a0fef9e12c73f90ad81b17321e463331..b0c0f864413ef6087349e2d6237597a0278043d4 100644 (file)
@@ -522,7 +522,7 @@ extern void reserve_phi_args_for_new_edge (basic_block);
 extern tree create_phi_node (tree, basic_block);
 extern void add_phi_arg (tree, tree, edge);
 extern void remove_phi_args (edge);
-extern void remove_phi_node (tree, tree, basic_block);
+extern void remove_phi_node (tree, tree);
 extern void remove_all_phi_nodes_for (bitmap);
 extern tree phi_reverse (tree);
 extern void dump_dfa_stats (FILE *);
index 2eaa2713984f7094e881e2664e37267bad77be83..9e40698a84fd5548fb0defce8d9feed0e15f4eb8 100644 (file)
@@ -1030,7 +1030,7 @@ eliminate_virtual_phis (void)
                    }
                }
 #endif
-             remove_phi_node (phi, NULL_TREE, bb);
+             remove_phi_node (phi, NULL_TREE);
            }
        }
     }
@@ -2371,7 +2371,7 @@ remove_ssa_form (FILE *dump, var_map map, int flags)
       for (phi = phi_nodes (bb); phi; phi = next)
        {
          next = PHI_CHAIN (phi);
-         remove_phi_node (phi, NULL_TREE, bb);
+         remove_phi_node (phi, NULL_TREE);
        }
     }
 
index 8baf17a73a07109e0b35763bcc735737eb116eb7..dcf4ba078abf5bdde93a4c58729802c9590d184d 100644 (file)
@@ -402,7 +402,7 @@ remove_phi_args (edge e)
    used as the node immediately before PHI in the linked list.  */
 
 void
-remove_phi_node (tree phi, tree prev, basic_block bb)
+remove_phi_node (tree phi, tree prev)
 {
   tree *loc;
 
@@ -412,7 +412,7 @@ remove_phi_node (tree phi, tree prev, basic_block bb)
     }
   else
     {
-      for (loc = &(bb_ann (bb)->phi_nodes);
+      for (loc = &(bb_ann (bb_for_stmt (phi))->phi_nodes);
           *loc != phi;
           loc = &PHI_CHAIN (*loc))
        ;
index 69408e8cd7d6290651ece027f9f20f04cc6cac22..6920ee101aee9892957b17f0da9d7294cae0dc2a 100644 (file)
@@ -684,7 +684,7 @@ remove_dead_phis (basic_block bb)
              fprintf (dump_file, "\n");
            }
 
-         remove_phi_node (phi, prev, bb);
+         remove_phi_node (phi, prev);
          stats.removed_phis++;
          phi = next;
        }
index b1636a7ffe998486e53125da37c06b2aa90a050d..44314615646ca1e450d2c10f64940f868407a795 100644 (file)
@@ -4652,7 +4652,7 @@ remove_statement (tree stmt, bool including_defined_name)
          /* Prevent the ssa name defined by the statement from being removed.  */
          SET_PHI_RESULT (stmt, NULL);
        }
-      remove_phi_node (stmt, NULL_TREE, bb_for_stmt (stmt));
+      remove_phi_node (stmt, NULL_TREE);
     }
   else
     {
index 66e2b223ce3787817c53cbb1885ce895bb310345..f4488a72dc8282516e47b19545a4ef279f2074ca 100644 (file)
@@ -2106,7 +2106,7 @@ remove_dead_inserted_code (void)
            }
          if (TREE_CODE (t) == PHI_NODE)
            {
-             remove_phi_node (t, NULL, bb_for_stmt (t));
+             remove_phi_node (t, NULL);
            }
          else
            {
index 99b9627c2070fa463513e0510375c74360d9ce29..91e28d6a499e973611c39722e512371dabfb8d0a 100644 (file)
@@ -1288,7 +1288,7 @@ kill_redundant_phi_nodes (void)
       if (repl != ssa_name (i))
        {
          stmt = SSA_NAME_DEF_STMT (ssa_name (i));
-         remove_phi_node (stmt, NULL_TREE, bb_for_stmt (stmt));
+         remove_phi_node (stmt, NULL_TREE);
        }
     }