aboutsummaryrefslogtreecommitdiff
path: root/libgo
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2020-10-28 12:56:16 +0100
committerRichard Biener <rguenther@suse.de>2020-10-28 14:15:37 +0100
commit2acb33103c4cbc6766d8707ad58aa5cc9a804719 (patch)
tree2ae9a8c3f1965c9c023d7cda958797c0027e62e9 /libgo
parentac1724ccfdb9056d59fc21500c57c4edc963e653 (diff)
downloadgcc-2acb33103c4cbc6766d8707ad58aa5cc9a804719.zip
gcc-2acb33103c4cbc6766d8707ad58aa5cc9a804719.tar.gz
gcc-2acb33103c4cbc6766d8707ad58aa5cc9a804719.tar.bz2
Change the way we split stores in BB vectorization
The following fixes missed optimizations due to the strange way we split stores in BB vectorization. The solution is to split at the failure boundary and not re-align that to the initial piece chosen vector size. Also re-analyze any larger matching rest. 2020-10-28 Richard Biener <rguenther@suse.de> * tree-vect-slp.c (vect_build_slp_instance): Split the store group at the failure boundary and also re-analyze a large enough matching rest. * gcc.dg/vect/bb-slp-68.c: New testcase.
Diffstat (limited to 'libgo')
0 files changed, 0 insertions, 0 deletions