diff options
author | Richard Sandiford <richard.sandiford@arm.com> | 2020-01-25 17:18:51 +0000 |
---|---|---|
committer | Richard Sandiford <richard.sandiford@arm.com> | 2020-01-28 10:56:50 +0000 |
commit | 1ee3b380dfb479b335f3b50039ce26abcbffe59a (patch) | |
tree | dfaa126fdbc1ce9d2c920920e45dfe3409f57ebe /gcc/fortran/trans-openmp.c | |
parent | 6cedf5d8e23c862db147e71d5767ca57e6b4f433 (diff) | |
download | gcc-1ee3b380dfb479b335f3b50039ce26abcbffe59a.zip gcc-1ee3b380dfb479b335f3b50039ce26abcbffe59a.tar.gz gcc-1ee3b380dfb479b335f3b50039ce26abcbffe59a.tar.bz2 |
forwprop: Tweak choice of VEC_PERM_EXPR filler [PR92822]
For the 2s failures in the PR, we have a V4SF VEC_PERM_EXPR in
which the first two elements are duplicates of one element and
the other two are don't-care:
v4sf_b = VEC_PERM_EXPR <v4sf_a, v4sf_a, { 1, 1, ?, ? }>;
The heuristic was to extend this with a blend:
v4sf_b = VEC_PERM_EXPR <v4sf_a, v4sf_a, { 1, 1, 2, 3 }>;
but it seems better to extend a partial duplicate to a full duplicate:
v4sf_b = VEC_PERM_EXPR <v4sf_a, v4sf_a, { 1, 1, 1, 1 }>;
Obviously this is still just a heuristic though.
I wondered whether to restrict this to two elements or more
but couldn't find any examples in which it made a difference.
Either way should be fine for the purposes of fixing this PR.
2020-01-28 Richard Sandiford <richard.sandiford@arm.com>
gcc/
PR tree-optimization/92822
* tree-ssa-forwprop.c (simplify_vector_constructor): When filling
out the don't-care elements of a vector whose significant elements
are duplicates, make the don't-care elements duplicates too.
Diffstat (limited to 'gcc/fortran/trans-openmp.c')
0 files changed, 0 insertions, 0 deletions