]> git.ipfire.org Git - thirdparty/gcc.git/commitdiff
tree-ssa-uncprop.c (uncprop_into_successor_phis): Fix PHI node existence check.
authorRichard Guenther <rguenther@suse.de>
Sun, 17 Jan 2010 16:22:17 +0000 (16:22 +0000)
committerRichard Biener <rguenth@gcc.gnu.org>
Sun, 17 Jan 2010 16:22:17 +0000 (16:22 +0000)
2010-01-17  Richard Guenther  <rguenther@suse.de>

* tree-ssa-uncprop.c (uncprop_into_successor_phis): Fix PHI
node existence check.
* tree-vect-loop.c (vect_analyze_loop_form): Likewise.
* tree-cfgcleanup.c (merge_phi_nodes): Likewise.
* tree-ssa-dce.c (forward_edge_to_pdom): Likewise.
* tree-cfg.c (gimple_execute_on_growing_pred): Likewise.
(gimple_execute_on_growing_pred): Likewise.

From-SVN: r155983

gcc/ChangeLog
gcc/tree-cfg.c
gcc/tree-cfgcleanup.c
gcc/tree-ssa-dce.c
gcc/tree-ssa-uncprop.c
gcc/tree-vect-loop.c

index 547c4bfd4b2ddbbb5f5e8be1a222d506d25404bf..212381f2139cf2b74f4af5432e42a061a8c16286 100644 (file)
@@ -1,3 +1,13 @@
+2010-01-17  Richard Guenther  <rguenther@suse.de>
+
+       * tree-ssa-uncprop.c (uncprop_into_successor_phis): Fix PHI
+       node existence check.
+       * tree-vect-loop.c (vect_analyze_loop_form): Likewise.
+       * tree-cfgcleanup.c (merge_phi_nodes): Likewise.
+       * tree-ssa-dce.c (forward_edge_to_pdom): Likewise.
+       * tree-cfg.c (gimple_execute_on_growing_pred): Likewise.
+       (gimple_execute_on_growing_pred): Likewise.
+
 2010-01-17  Richard Guenther  <rguenther@suse.de>
 
        PR tree-optimization/42773
index 0a3d544eece34b61c610d04c4dfb5e0641991801..d9276981eea8ad949d2e3b50d555c03b8069af0a 100644 (file)
@@ -6937,7 +6937,7 @@ gimple_execute_on_growing_pred (edge e)
 {
   basic_block bb = e->dest;
 
-  if (phi_nodes (bb))
+  if (!gimple_seq_empty_p (phi_nodes (bb)))
     reserve_phi_args_for_new_edge (bb);
 }
 
@@ -6947,7 +6947,7 @@ gimple_execute_on_growing_pred (edge e)
 static void
 gimple_execute_on_shrinking_pred (edge e)
 {
-  if (phi_nodes (e->dest))
+  if (!gimple_seq_empty_p (phi_nodes (e->dest)))
     remove_phi_args (e);
 }
 
index 5904407a35b59ed04a7dcc7a6f36727910613eb9..201298dc5357386235d73e0d985d3ac319bdd5b7 100644 (file)
@@ -875,7 +875,7 @@ merge_phi_nodes (void)
 
       /* We have to feed into another basic block with PHI
         nodes.  */
-      if (!phi_nodes (dest)
+      if (gimple_seq_empty_p (phi_nodes (dest))
          /* We don't want to deal with a basic block with
             abnormal edges.  */
          || has_abnormal_incoming_edge_p (bb))
index cdb64323b41df374d6a7e7ded2ca4cf87f74b412..bb24b6254d28b18ec6bc930a338591126ad7af39 100644 (file)
@@ -958,7 +958,7 @@ forward_edge_to_pdom (edge e, basic_block post_dom_bb)
   if (e2 != e)
     return e2;
 
-  if (phi_nodes (post_dom_bb))
+  if (!gimple_seq_empty_p (phi_nodes (post_dom_bb)))
     {
       /* We are sure that for every live PHI we are seeing control dependent BB.
          This means that we can look up the end of control dependent path leading
index 8e7715431f4ae053fa6fbfd9dec5f170639955a7..96c08d3c8f2115c57a75f2a822eb9d2257449e37 100644 (file)
@@ -456,7 +456,7 @@ uncprop_into_successor_phis (basic_block bb)
 
       /* If there are no PHI nodes in this destination, then there is
         no sense in recording any equivalences.  */
-      if (!phis)
+      if (gimple_seq_empty_p (phis))
        continue;
 
       /* Record any equivalency associated with E.  */
index f160cb458b4ae17c14bde963d667ed292fcdc21a..9e17eb36670039ede4e3a7e279e5d50a2b20223a 100644 (file)
@@ -981,7 +981,7 @@ vect_analyze_loop_form (struct loop *loop)
      before the loop if needed), where the loop header contains all the
      executable statements, and the latch is empty.  */
   if (!empty_block_p (loop->latch)
-        || phi_nodes (loop->latch))
+        || !gimple_seq_empty_p (phi_nodes (loop->latch)))
     {
       if (vect_print_dump_info (REPORT_BAD_FORM_LOOPS))
         fprintf (vect_dump, "not vectorized: unexpected loop form.");