This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: SRA bit-field optimization
- From: Eric Botcazou <ebotcazou at adacore dot com>
- To: Alexandre Oliva <aoliva at redhat dot com>
- Cc: gcc-patches at gcc dot gnu dot org, Roman Zippel <zippel at linux-m68k dot org>, Bernd Schmidt <bernds_cb1 at t-online dot de>, Diego Novillo <dnovillo at acm dot org>, Daniel Berlin <dberlin at dberlin dot org>, Andrew Pinski <pinskia at gmail dot com>
- Date: Mon, 8 Oct 2007 07:14:46 +0200
- Subject: Re: SRA bit-field optimization
- References: <orfy4czoyq.fsf@oliva.athome.lsd.ic.unicamp.br> <200710071103.33807.ebotcazou@adacore.com> <orsl4mtr5u.fsf@free.oliva.athome.lsd.ic.unicamp.br>
> It's not really introduced, it's just made explicit earlier, in the
> tree level, such that we can better optimize it. I'll give you that
> this isn't the simplest way to model operations on 32-bit words in
> 64-bit variables, but in the end we'd get the same code either way, at
> least for variables that are not pushed to memory.
OK, thanks for the clarification.
Could you install the aforementioned patchlet? FWIW it has successfully
passed a complete bootstrap + Ada regression testing on x86-64.
--
Eric Botcazou