This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] folding fix 2
- From: law at redhat dot com
- To: Jan Hubicka <jh at suse dot cz>
- Cc: gcc-patches at gcc dot gnu dot org, dnovillo at redhat dot com, rth at redhat dot com
- Date: Tue, 06 Jan 2004 12:10:22 -0700
- Subject: Re: [tree-ssa] folding fix 2
- Reply-to: law at redhat dot com
In message <20040106155751.GE6383@kam.mff.cuni.cz>, Jan Hubicka writes:
>> In message <20031221101036.GE17542@kam.mff.cuni.cz>, Jan Hubicka writes:
>> >Hi,
>> >fold folds a==b into different copy of a==b that waste memory and can
>> >cause some optimizations thesting whether something simplified to loop.
>> >I also have sanity checking veirfying that statements don't fold that
>> >needs this.
>> >OK?
>> >Bootstrapped/regteste i686-pc-gnu-linux.
>> >
>> >Honza
>> >
>> >2003-12-21 Jan Hubicka <jh@suse.cz>
>> > * fold-const.c (fold): Do not rebuild comparison when nothing
>> > changed.
>> This is fine. Please install this patch.
>
>Thanks. The last fix
>(http://gcc.gnu.org/ml/gcc-patches/2003-12/msg01846.html)
That patch is fine as well. Please install it.
jeff