https://gcc.gnu.org/bugzilla/show_bug.cgi?id=122722
--- Comment #1 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Richard Biener <[email protected]>: https://gcc.gnu.org/g:97a7d568f3d72076c3f9da062007e3298da9243f commit r16-5417-g97a7d568f3d72076c3f9da062007e3298da9243f Author: Richard Biener <[email protected]> Date: Tue Nov 18 15:20:44 2025 +0100 tree-optimization/122722 - better SLP reduction group discovery The following improves the all-or-nothing discovery of reduction groups to consider sub-groups by trying toplevel "matches" candidates for this. For simplicity and to limit compile-time failed sub-group matches are not decomposed further, only the originally failed part is tried again to discover more sub-groups. Any remaining fails get picked up by the current single-reduction handling. PR tree-optimization/122722 * tree-vect-slp.cc (vect_analyze_slp_reductions): New function, split out from vect_analyze_slp. Try SLP sub-groups. (vect_analyze_slp_reduction_group): New helper. * gcc.dg/vect/slp-reduc-14.c: New testcase.
