https://gcc.gnu.org/bugzilla/show_bug.cgi?id=95866
--- Comment #2 from CVS Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Richard Biener <rgue...@gcc.gnu.org>: https://gcc.gnu.org/g:c78907d514d65483c7ddfb4cb1f5c57f23da73d9 commit r11-1633-gc78907d514d65483c7ddfb4cb1f5c57f23da73d9 Author: Richard Biener <rguent...@suse.de> Date: Wed Jun 24 15:49:00 2020 +0200 tree-optimization/95866 - avoid vectorizing uniform SLP subgraphs This avoids vectorizing SLP subgraphs that just compute uniform operations on all-same operands. That fixes the less interesting (but most embarrasing) part of the testcase in the PR. On the way it also fixed a missing matches[0] reset in the last refactoring touching that place. 2020-06-24 Richard Biener <rguent...@suse.de> PR tree-optimization/95866 * tree-vect-slp.c (vect_slp_tree_uniform_p): New. (vect_build_slp_tree_2): Properly reset matches[0], ignore uniform constants. * gcc.target/i386/pr95866-1.c: New testcase.
