yann@2149: diff -durN gcc-4.4.5.orig/gcc/stmt.c gcc-4.4.5/gcc/stmt.c
yann@2149: --- gcc-4.4.5.orig/gcc/stmt.c	2010-03-08 12:46:28.000000000 +0100
yann@2149: +++ gcc-4.4.5/gcc/stmt.c	2010-10-09 23:01:01.000000000 +0200
yann@2149: @@ -2377,7 +2377,11 @@
yann@2149:  	  use_cost_table
yann@2149:  	    = (TREE_CODE (orig_type) != ENUMERAL_TYPE
yann@2149:  	       && estimate_case_costs (case_list));
yann@2149: -	  balance_case_nodes (&case_list, NULL);
yann@2149: +	  /* When optimizing for size, we want a straight list to avoid
yann@2149: +	     jumps as much as possible. This basically creates an if-else
yann@2149: +	     chain.  */
yann@2149: +	  if (!optimize_size)
yann@2149: +	    balance_case_nodes (&case_list, NULL);
yann@2149:  	  emit_case_nodes (index, case_list, default_label, index_type);
yann@2149:  	  if (default_label)
yann@2149:  	    emit_jump (default_label);
yann@2149: @@ -2943,6 +2947,7 @@
yann@2149:  	    {
yann@2149:  	      if (!node_has_low_bound (node, index_type))
yann@2149:  		{
yann@2149: +		  if (!optimize_size) /* don't jl to the .default_label. */
yann@2149:  		  emit_cmp_and_jump_insns (index,
yann@2149:  					   convert_modes
yann@2149:  					   (mode, imode,