yann@687: diff -durN gcc-4.2.1.orig/gcc/stmt.c gcc-4.2.1/gcc/stmt.c
yann@687: --- gcc-4.2.1.orig/gcc/stmt.c	2007-07-19 05:25:32.000000000 +0200
yann@687: +++ gcc-4.2.1/gcc/stmt.c	2007-08-03 20:37:19.000000000 +0200
yann@687: @@ -2512,7 +2512,11 @@
yann@687:  	  use_cost_table
yann@687:  	    = (TREE_CODE (orig_type) != ENUMERAL_TYPE
yann@687:  	       && estimate_case_costs (case_list));
yann@687: -	  balance_case_nodes (&case_list, NULL);
yann@687: +	  /* When optimizing for size, we want a straight list to avoid
yann@687: +	     jumps as much as possible. This basically creates an if-else
yann@687: +	     chain.  */
yann@687: +	  if (!optimize_size)
yann@687: +	    balance_case_nodes (&case_list, NULL);
yann@687:  	  emit_case_nodes (index, case_list, default_label, index_type);
yann@687:  	  emit_jump (default_label);
yann@687:  	}
yann@687: @@ -3070,6 +3074,7 @@
yann@687:  	    {
yann@687:  	      if (!node_has_low_bound (node, index_type))
yann@687:  		{
yann@687: +		  if (!optimize_size) /* don't jl to the .default_label. */
yann@687:  		  emit_cmp_and_jump_insns (index,
yann@687:  					   convert_modes
yann@687:  					   (mode, imode,