diff options
author | Richard Biener <rguenther@suse.de> | 2024-06-14 07:54:15 +0200 |
---|---|---|
committer | Richard Biener <rguenther@suse.de> | 2024-06-14 09:04:18 +0200 |
commit | e575b5c56137b12d402d9fb39291fe20985067b7 (patch) | |
tree | 45d3739620f56b1635da7e0b20cc2bfd8e933d1c /libgcc | |
parent | d3fae2bea034edb001cd45d1d86c5ceef146899b (diff) | |
download | gcc-e575b5c56137b12d402d9fb39291fe20985067b7.zip gcc-e575b5c56137b12d402d9fb39291fe20985067b7.tar.gz gcc-e575b5c56137b12d402d9fb39291fe20985067b7.tar.bz2 |
Fix fallout of peeling for gap improvements
The following hopefully addresses an observed bootstrap issue on aarch64
where maybe-uninit diagnostics occur. It also fixes bogus napkin math
from myself when I was confusing rounded up size of a single access
with rounded up size of the group accessed in a single scalar iteration.
So the following puts in a correctness check, leaving a set of peeling
for gaps as insufficient. This could be rectified by splitting the
last load into multiple ones but I'm leaving this for a followup, better
quickly fix the reported wrong-code.
* tree-vect-stmts.cc (get_group_load_store_type): Do not
re-use poly-int remain but re-compute with non-poly values.
Verify the shortened load is good enough to be covered with
a single scalar gap iteration before accepting it.
* gcc.dg/vect/pr115385.c: Enable AVX2 if available.
Diffstat (limited to 'libgcc')
0 files changed, 0 insertions, 0 deletions