[backport r171975 from gcc-4.7/trunk, PR43920 patch 1/n <mikpe@it.uu.se>]

gcc/

2011-04-05  Tom de Vries  <tom@codesourcery.com>

	* cfgcleanup.c (try_crossjump_bb): Remove 2 superfluous variables.

--- gcc-4.6.0/gcc/cfgcleanup.c.orig	2011-01-26 22:11:57.000000000 +0100
+++ gcc-4.6.0/gcc/cfgcleanup.c	2011-06-19 22:14:59.000000000 +0200
@@ -1812,7 +1812,6 @@ try_crossjump_bb (int mode, basic_block 
   edge e, e2, fallthru;
   bool changed;
   unsigned max, ix, ix2;
-  basic_block ev, ev2;
 
   /* Nothing to do if there is not at least two incoming edges.  */
   if (EDGE_COUNT (bb->preds) < 2)
@@ -1852,9 +1851,9 @@ try_crossjump_bb (int mode, basic_block 
   fallthru = find_fallthru_edge (bb->preds);
 
   changed = false;
-  for (ix = 0, ev = bb; ix < EDGE_COUNT (ev->preds); )
+  for (ix = 0; ix < EDGE_COUNT (bb->preds);)
     {
-      e = EDGE_PRED (ev, ix);
+      e = EDGE_PRED (bb, ix);
       ix++;
 
       /* As noted above, first try with the fallthru predecessor (or, a
@@ -1876,7 +1875,6 @@ try_crossjump_bb (int mode, basic_block 
 	    {
 	      changed = true;
 	      ix = 0;
-	      ev = bb;
 	      continue;
 	    }
 	}
@@ -1896,10 +1894,9 @@ try_crossjump_bb (int mode, basic_block 
       if (EDGE_SUCC (e->src, 0) != e)
 	continue;
 
-      for (ix2 = 0, ev2 = bb; ix2 < EDGE_COUNT (ev2->preds); )
+      for (ix2 = 0; ix2 < EDGE_COUNT (bb->preds); ix2++)
 	{
-	  e2 = EDGE_PRED (ev2, ix2);
-	  ix2++;
+	  e2 = EDGE_PRED (bb, ix2);
 
 	  if (e2 == e)
 	    continue;
@@ -1925,7 +1922,6 @@ try_crossjump_bb (int mode, basic_block 
 	  if (try_crossjump_to_edge (mode, e, e2))
 	    {
 	      changed = true;
-	      ev2 = bb;
 	      ix = 0;
 	      break;
 	    }