This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [ast-optimizer-branch] Goto/Break/Continue/Switch elimination
- From: Zack Weinberg <zack at codesourcery dot com>
- To: Sebastian Pop <m1sp at csc dot liv dot ac dot uk>
- Cc: dnovillo at redhat dot com, gcc-patches at gcc dot gnu dot org
- Date: Thu, 2 May 2002 08:51:54 -0700
- Subject: Re: [ast-optimizer-branch] Goto/Break/Continue/Switch elimination
- References: <20020502134838.A18764@linux18.lxfarm.csc.liv.ac.uk>
On Thu, May 02, 2002 at 01:48:38PM +0100, Sebastian Pop wrote:
> Hi,
>
> The following patch and newfiles.tar.gz implements a goto, break and continue
> elimination pass on SIMPLE trees. It uses the double linked statement chain
> (it is really much more simpler to implement transformations on trees when we
> can access the previous statement, and the code becomes much more readable).
Maybe I'm missing the point, but why is this a desirable optimization?
It looks like it massively increases code size, and I don't see why
the result would be any faster.
zw