This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/37021] Fortran Complex reduction / multiplication not vectorized
- From: "irar at il dot ibm dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 25 Jan 2009 12:17:29 -0000
- Subject: [Bug tree-optimization/37021] Fortran Complex reduction / multiplication not vectorized
- References: <bug-37021-10053@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #8 from irar at il dot ibm dot com 2009-01-25 12:17 -------
(In reply to comment #7)
> > > Q1: does SLP work with reductions at all?
> >
> > No. SLP currently originates from groups of strided stores.
> Ah, I see. In this loop we have two reductions, so to apply SLP
> we would need to see that we can use a group of reductions for SLP?
Yes, I think this will work.
> > > Q2: does SLP do pattern recognition?
> >
> > Pattern recoginition is done before SLP, and SLP handles stmts that were marked
> > as a part of a pattern. There is no SLP specific pattern recoginition.
> Ok, but with a reduction it won't help me here.
> Can a loop be vectorized with just pattern recognition? Hm, if I
> remember correctly we detect scalar patterns and then vectorize them.
> We don't support detecting "vector patterns" from scalar code, correct?
Yes, if I understand you correctly, we detect scalar patterns, but adding
vector pattern detection does not seem to be complicated.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=37021