This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Loop optimizer issues
- From: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>
- To: Toon Moene <toon at moene dot indiv dot nluug dot nl>
- Cc: Diego Novillo <dnovillo at redhat dot com>,"gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>,Richard Henderson <rth at redhat dot com>, Jason Merrill <jason at redhat dot com>,pop at gauvain dot u-strasbg dot fr, Jan Hubicka <jh at suse dot cz>,Daniel Berlin <dberlin at dberlin dot org>
- Date: Tue, 3 Jun 2003 09:51:06 +0200
- Subject: Re: Loop optimizer issues
- References: <20030530183552.GA27110@atrey.karlin.mff.cuni.cz> <1054585449.9789.146.camel@frodo.toronto.redhat.com> <3EDBCE52.6030200@moene.indiv.nluug.nl>
Hello,
> Diego Novillo wrote:
>
> >On Fri, 2003-05-30 at 14:35, Zdenek Dvorak wrote:
>
> >>The process of merging of the loop optimizer work I am currently doing
> >>on rtlopt branch. I am quite sure that I won't be able to get it to
> >>reasonable state for 3.4. I would however like to reuse some parts of
> >>this work on tree-ssa. Would it be feasible to merge this work from
> >>rtlopt branch to tree-ssa branch once it is in sufficiently stabilized
> >>state (in about a month or so)?
>
> Note that induction variable re-combination can only be done at the RTL
> level, because only at that level it's clear what addressing modes are
> available to estimate correct costs.
that is not entirely true -- as discussed on gcc summit, it should be
relatively easy to let ast level access some parts of machine-specific
data, like cost function for different addressing modes.
Zdenek