diff options
| author | Richard Biener <rguenther@suse.de> | 2022-05-04 10:43:07 +0200 |
|---|---|---|
| committer | Richard Biener <rguenther@suse.de> | 2022-05-04 15:12:28 +0200 |
| commit | 52b7b86f8c72eb19e637f1e72ffd10f39b8cb829 (patch) | |
| tree | e3be8ae54b34bd4c70e8ec90c02eebb5c53734ad /gcc/cp/constexpr.cc | |
| parent | 0aa9aa76bbf53213fb60ad36bd999726dc75aa98 (diff) | |
| download | gcc-52b7b86f8c72eb19e637f1e72ffd10f39b8cb829.zip gcc-52b7b86f8c72eb19e637f1e72ffd10f39b8cb829.tar.gz gcc-52b7b86f8c72eb19e637f1e72ffd10f39b8cb829.tar.bz2 | |
tree-optimization/103116 - SLP permutes and peeling for gaps
The testcase shows that we can end up with a contiguous access across
loop iterations but by means of permutations the elements accessed
might only cover parts of a vector. In this case we end up with
GROUP_GAP == 0 but still need to avoid accessing excess elements
in the last loop iterations. Peeling for gaps is designed to cover
this but a single scalar iteration might not cover all of the excess
elements. The following ensures peeling for gaps is done in this
situation and when that isn't sufficient because we need to peel
more than one iteration (gcc.dg/vect/pr103116-2.c), fail the SLP
vectorization.
2022-05-04 Richard Biener <rguenther@suse.de>
PR tree-optimization/103116
* tree-vect-stmts.cc (get_group_load_store_type): Handle the
case we need peeling for gaps even though GROUP_GAP is zero.
* gcc.dg/vect/pr103116-1.c: New testcase.
* gcc.dg/vect/pr103116-2.c: Likewise.
Diffstat (limited to 'gcc/cp/constexpr.cc')
0 files changed, 0 insertions, 0 deletions