yann@1393: diff -durN gcc-4.4.0.orig/gcc/stmt.c gcc-4.4.0/gcc/stmt.c
yann@1393: --- gcc-4.4.0.orig/gcc/stmt.c	2009-02-27 20:49:42.000000000 +0100
yann@1393: +++ gcc-4.4.0/gcc/stmt.c	2009-05-27 21:38:21.000000000 +0200
yann@1393: @@ -2376,7 +2376,11 @@
yann@1393:  	  use_cost_table
yann@1393:  	    = (TREE_CODE (orig_type) != ENUMERAL_TYPE
yann@1393:  	       && estimate_case_costs (case_list));
yann@1393: -	  balance_case_nodes (&case_list, NULL);
yann@1393: +	  /* When optimizing for size, we want a straight list to avoid
yann@1393: +	     jumps as much as possible. This basically creates an if-else
yann@1393: +	     chain.  */
yann@1393: +	  if (!optimize_size)
yann@1393: +	    balance_case_nodes (&case_list, NULL);
yann@1393:  	  emit_case_nodes (index, case_list, default_label, index_type);
yann@1393:  	  if (default_label)
yann@1393:  	    emit_jump (default_label);
yann@1393: @@ -2942,6 +2946,7 @@
yann@1393:  	    {
yann@1393:  	      if (!node_has_low_bound (node, index_type))
yann@1393:  		{
yann@1393: +		  if (!optimize_size) /* don't jl to the .default_label. */
yann@1393:  		  emit_cmp_and_jump_insns (index,
yann@1393:  					   convert_modes
yann@1393:  					   (mode, imode,