diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2023-03-26 20:17:00 +0200 |
|---|---|---|
| committer | Jakub Jelinek <jakub@redhat.com> | 2023-03-26 20:17:00 +0200 |
| commit | 07fc3491260e6b5d261433c977a4e069f5ab40c1 (patch) | |
| tree | 2a9e40da01bf6082120cbae573aaf1b35bc023c3 /gcc/match.pd | |
| parent | 7eca91d4781bb3df941f25c30b971dac66ba1b3d (diff) | |
| download | gcc-07fc3491260e6b5d261433c977a4e069f5ab40c1.zip gcc-07fc3491260e6b5d261433c977a4e069f5ab40c1.tar.gz gcc-07fc3491260e6b5d261433c977a4e069f5ab40c1.tar.bz2 | |
match.pd: Fix up fneg/fadd simplification [PR109230]
The following testcase is miscompiled on aarch64-linux. match.pd
has a simplification for addsub, where it negates one of the vectors
in twice as large floating point element vector (effectively negating every
other element) and then doing addition.
But a requirement for that is that the permutation picks the right elements,
in particular 0, nelts+1, 2, nelts+3, 4, nelts+5, ...
The pattern tests this with sel.series_p (0, 2, 0, 2) check, which as
documented verifies that the even elements of the permutation mask are
identity, but doesn't say anything about the others.
The following patch fixes it by also checking that the odd elements
start at nelts + 1 with the same step of 2.
2023-03-26 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/109230
* match.pd (fneg/fadd simplify): Verify also odd permutation indexes.
* gcc.dg/pr109230.c: New test.
Diffstat (limited to 'gcc/match.pd')
| -rw-r--r-- | gcc/match.pd | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/gcc/match.pd b/gcc/match.pd index e352bd4..b8d3538 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -8096,6 +8096,7 @@ and, scalar_mode inner_mode = GET_MODE_INNER (vec_mode); } (if (sel.series_p (0, 2, 0, 2) + && sel.series_p (1, 2, nelts + 1, 2) && GET_MODE_2XWIDER_MODE (inner_mode).exists (&wide_elt_mode) && multiple_p (GET_MODE_NUNITS (vec_mode), 2, &wide_nunits) && related_vector_mode (vec_mode, wide_elt_mode, |