This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH] Fix PR60505
- From: Jakub Jelinek <jakub at redhat dot com>
- To: Richard Biener <rguenther at suse dot de>
- Cc: Cong Hou <congh at google dot com>, GCC Patches <gcc-patches at gcc dot gnu dot org>
- Date: Mon, 17 Mar 2014 14:49:01 +0100
- Subject: Re: [PATCH] Fix PR60505
- Authentication-results: sourceware.org; auth=none
- References: <CAK=A3=1eySj3DAFV+3=GSD6y9KxnMQ6SKUW9s43cybRN7PeBiw at mail dot gmail dot com> <20140312082459 dot GI22862 at tucnak dot redhat dot com> <CAK=A3=1-0dXNYxesV7KhOsR84vpR-DkTfNkeKcD2xf7LpOL0xw at mail dot gmail dot com> <alpine dot LSU dot 2 dot 11 dot 1403131026520 dot 6041 at zhemvz dot fhfr dot qr> <CAK=A3=38Kh0pb9EKsCoJkR0FyuX=p7rHW0_MrvCDFzapPo97HA at mail dot gmail dot com> <alpine dot LSU dot 2 dot 11 dot 1403140850170 dot 6041 at zhemvz dot fhfr dot qr> <20140314075734 dot GC22862 at tucnak dot redhat dot com> <alpine dot LSU dot 2 dot 11 dot 1403140857110 dot 6041 at zhemvz dot fhfr dot qr> <CAK=A3=18SWi9K4FVhE4ivqXCm2Qc=vxMWfrsrEUgjSjhVYJACg at mail dot gmail dot com> <alpine dot LSU dot 2 dot 11 dot 1403171442500 dot 6041 at zhemvz dot fhfr dot qr>
- Reply-to: Jakub Jelinek <jakub at redhat dot com>
On Mon, Mar 17, 2014 at 02:44:29PM +0100, Richard Biener wrote:
> You mean exactly in the case where the profitability check ensures
> that n % vf == 0? Thus effectively if n == maximum trip count?
> That's quite a special case, no?
Indeed it is. But I guess that is pretty much the only case where
the following optimizers can fold the array accesses in the (unneeded)
epilogue loop from some non-constant indexes to constant ones (because, it
knows that the vector loop will iterate in that case exactly once).
Jakub