Remove redundant variable from tree-call-cdce.c
authorRichard Sandiford <richard.sandiford@arm.com>
Thu, 29 Oct 2015 15:23:51 +0000 (15:23 +0000)
committerRichard Sandiford <rsandifo@gcc.gnu.org>
Thu, 29 Oct 2015 15:23:51 +0000 (15:23 +0000)
shrink_wrap_one_built_in_call had both guard_bb and guard_bb0.
It looks like an earlier version of the pass may have updated
one of the variables in the while loop, but now they're just
two names for the same thing.

Tested on x86_64-linux-gnu, aarch64-linux-gnu and arm-linux-gnueabi.

gcc/
* tree-call-cdce.c (shrink_wrap_one_built_in_call): Remove
guard_bb0 and use guard_bb throughout.

From-SVN: r229532

gcc/ChangeLog
gcc/tree-call-cdce.c

index 8f4cc17b9df097710309d1477057d5c724b837f1..ab1622c2da9d4eeb80ad983b544f8af1afe9dae8 100644 (file)
@@ -1,3 +1,8 @@
+2015-10-29  Richard Sandiford  <richard.sandiford@arm.com>
+
+       * tree-call-cdce.c (shrink_wrap_one_built_in_call): Remove
+       guard_bb0 and use guard_bb throughout.
+
 2015-10-29  Richard Sandiford  <richard.sandiford@arm.com>
 
        * tree-call-cdce.c (shrink_wrap_one_built_in_call): Remove
index 400ca161084d74f73867e7c35739dac0c4d5945f..57be8a436e01c354c8fca30ba748197e7b716e25 100644 (file)
@@ -717,7 +717,7 @@ static bool
 shrink_wrap_one_built_in_call (gcall *bi_call)
 {
   gimple_stmt_iterator bi_call_bsi;
-  basic_block bi_call_bb, join_tgt_bb, guard_bb, guard_bb0;
+  basic_block bi_call_bb, join_tgt_bb, guard_bb;
   edge join_tgt_in_edge_from_call, join_tgt_in_edge_fall_thru;
   edge bi_call_in_edge0, guard_bb_in_edge;
   unsigned tn_cond_stmts, nconds;
@@ -775,22 +775,21 @@ shrink_wrap_one_built_in_call (gcall *bi_call)
   bi_call_in_edge0 = split_block (bi_call_bb, cond_expr);
   bi_call_in_edge0->flags &= ~EDGE_FALLTHRU;
   bi_call_in_edge0->flags |= EDGE_TRUE_VALUE;
-  guard_bb0 = bi_call_bb;
+  guard_bb = bi_call_bb;
   bi_call_bb = bi_call_in_edge0->dest;
-  join_tgt_in_edge_fall_thru = make_edge (guard_bb0, join_tgt_bb,
+  join_tgt_in_edge_fall_thru = make_edge (guard_bb, join_tgt_bb,
                                           EDGE_FALSE_VALUE);
 
   bi_call_in_edge0->probability = REG_BR_PROB_BASE * ERR_PROB;
   bi_call_in_edge0->count =
-      apply_probability (guard_bb0->count,
+      apply_probability (guard_bb->count,
                         bi_call_in_edge0->probability);
   join_tgt_in_edge_fall_thru->probability =
       inverse_probability (bi_call_in_edge0->probability);
   join_tgt_in_edge_fall_thru->count =
-      guard_bb0->count - bi_call_in_edge0->count;
+      guard_bb->count - bi_call_in_edge0->count;
 
   /* Code generation for the rest of the conditions  */
-  guard_bb = guard_bb0;
   while (nconds > 0)
     {
       unsigned ci0;