diff options
| author | Richard Biener <rguenther@suse.de> | 2025-07-29 10:05:32 +0200 |
|---|---|---|
| committer | Richard Biener <rguenther@suse.de> | 2025-07-29 12:13:00 +0200 |
| commit | e8a51144c02e1cf210db5763e435802ac6fa6ad9 (patch) | |
| tree | 409ce9ba618ecaf899655559e63b8016dd85fc38 /gcc/testsuite/ada/acats-4/support/impdef.a | |
| parent | c1102be3b25bde9989561b2610f8ee721a33a8e7 (diff) | |
| download | gcc-master.zip gcc-master.tar.gz gcc-master.tar.bz2 | |
Reassoc carefully ranks operands to form reduction chains for
vectorization so we are careful to not apply any width related
changes in the early pass. Unfortunately we are not careful
enough. The following gates fma related re-ordering and also
the >= 3 ops tail "optimization" which is the culprit here.
This does not fix the reported inefficient vectorization when
using signed integer reductions yet.
PR tree-optimization/120687
* tree-ssa-reassoc.cc (reassociate_bb): Do not disturb
the sorted operand order in the early pass.
* tree-vect-slp.cc (vect_analyze_slp): Dump when a detected
reduction chain fails SLP discovery.
* gcc.dg/vect/pr120687-1.c: New testcase.
* gcc.dg/vect/pr120687-2.c: Likewise.
Diffstat (limited to 'gcc/testsuite/ada/acats-4/support/impdef.a')
0 files changed, 0 insertions, 0 deletions