https://gcc.gnu.org/bugzilla/show_bug.cgi?id=110935
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Target| |x86_64-*-*
Known to fail| |13.2.1, 14.0
CC| |rsandifo at gcc dot gnu.org
Keywords| |missed-optimization
--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> ---
I didn't find where we make sure to elide the "outgoing" permute of a
reduction, but I think we only have testcases for the loop vectorization case.
Can you suggest where we'd do this? Note we do not represent the plus
reduction
operation but the whole SLP instance has just a single node (with load
permutation)
