This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/68030] Redundant address calculations in vectorized loop
- From: "ienkovich at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 28 Jan 2016 14:36:48 +0000
- Subject: [Bug tree-optimization/68030] Redundant address calculations in vectorized loop
- Auto-submitted: auto-generated
- References: <bug-68030-4 at http dot gcc dot gnu dot org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68030
Ilya Enkovich <ienkovich at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |ienkovich at gcc dot gnu.org
--- Comment #2 from Ilya Enkovich <ienkovich at gcc dot gnu.org> ---
(In reply to Richard Biener from comment #1)
> Induction variable optimization is responsible here but it needs some help
> from a CSE. I proposed adding a late FRE for that some time ago. The issue
> is that
> the vectorizer creates some redundancies when creating address IVs for the
> vectorized accesses.
Would it be reasonable to cache in some way results of vect_create_data_ref_ptr
and don't create a new pointer each time it is called with the same set of
arguments (except STMT one)? This should help to make vector code to use IVs
set similar to what scalar code uses.