https://gcc.gnu.org/bugzilla/show_bug.cgi?id=107247
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Resolution|--- |FIXED
Status|ASSIGNED |RESOLVED
--- Comment #3 from Richard Biener <rguenth at gcc dot gnu.org> ---
This is now fixed for the cases not requiring permutations. One could think of
a three-lane SLP reduction with three four component vectors being reduced
by first "expanding" to four "three component" vectors, summing them and then
extracting from the lower three lanes. Likewise for a six-lane SLP reduction
which would get a more complex extraction of two-vector, six-lane pairs.
Unless a compelling case comes along I don't consider these important.
