This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Peeling loops at tree level?
- From: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>
- To: Richard Guenther <richard dot guenther at gmail dot com>
- Cc: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>,gcc at gcc dot gnu dot org
- Date: Mon, 13 Sep 2004 16:40:31 +0200
- Subject: Re: Peeling loops at tree level?
- References: <84fc9c0004091307124008a1f8@mail.gmail.com>
Hello,
> > Do we (I suspect not) peel small loops at tree level yet?
> Btw. lno from g++ (GCC) 3.5-tree-ssa-lno 20040630 (merged 20040612)
> seems to do the trick:
>
> ;; Function int bar(constVector<3>&) (_Z3barRK6VectorILi3EE)
>
> int bar(constVector<3>&) (x)
> {
> [...]
> <bb 0>:
> return *&x->val[2] + x->val[1] + x->val[0] + res;
>
> }
>
> So I guess we'll get this feature during further merge of lno?
indeed -- this will work once this lno branch merge patch
http://gcc.gnu.org/ml/gcc-patches/2004-08/msg00325.html
is in and the optimization is enabled.
Zdenek