http://gcc.gnu.org/bugzilla/show_bug.cgi?id=44563
--- Comment #10 from Jan Hubicka <hubicka at gcc dot gnu.org> 2010-12-13 01:46:39 UTC --- Created attachment 22730 --> http://gcc.gnu.org/bugzilla/attachment.cgi?id=22730 Fix for inline cost problem The attached patch fixes the inliner cost problem so we converge at -O1. It is bit brute force, but I guess it should work well in practice. With the fix -O1 converges in 90 secons. Profile is similar to one at -O0 14898 6.7090 libc-2.11.1.so libc-2.11.1.so _int_malloc 7981 3.5941 cc1 cc1 bitmap_set_bit 5993 2.6988 libc-2.11.1.so libc-2.11.1.so memset 5063 2.2800 cc1 cc1 htab_delete 4091 1.8423 libc-2.11.1.so libc-2.11.1.so _IO_vfscanf 3849 1.7333 no-vmlinux no-vmlinux /no-vmlinux 3807 1.7144 libc-2.11.1.so libc-2.11.1.so _int_free 3632 1.6356 cc1 cc1 df_note_compute 3469 1.5622 libc-2.11.1.so libc-2.11.1.so malloc_consolidate 3352 1.5095 libc-2.11.1.so libc-2.11.1.so msort_with_tmp 2978 1.3411 cc1 cc1 htab_traverse_noresize 2941 1.3244 libc-2.11.1.so libc-2.11.1.so free 2824 1.2717 cc1 cc1 bitmap_clear_bit 2653 1.1947 cc1 cc1 df_ref_create_structure 2429 1.0938 libc-2.11.1.so libc-2.11.1.so malloc 2239 1.0083 cc1 cc1 df_insn_refs_collect
