diff options
| author | Richard Biener <rguenther@suse.de> | 2020-06-19 10:03:46 +0200 |
|---|---|---|
| committer | Giuliano Belinassi <giuliano.belinassi@usp.br> | 2020-08-17 13:14:13 -0300 |
| commit | 4438515c3769a82aa555789e8a5f536563c0893d (patch) | |
| tree | 69f83d605163cc7d3d2dec0fa6758e3e8e432896 /gcc/fortran/iresolve.c | |
| parent | e21ad1d77174f63b5835d2f71c04ab9d5aea58a6 (diff) | |
| download | gcc-4438515c3769a82aa555789e8a5f536563c0893d.zip gcc-4438515c3769a82aa555789e8a5f536563c0893d.tar.gz gcc-4438515c3769a82aa555789e8a5f536563c0893d.tar.bz2 | |
tree-optimization/95761 - fix vector insertion place compute
I missed that indeed SLP permutation code generation can end up
refering to a non-last vectorized stmt in the last SLP_TREE_VEC_STMTS
element as optimization. So walk them all.
2020-06-19 Richard Biener <rguenther@suse.de>
PR tree-optimization/95761
* tree-vect-slp.c (vect_schedule_slp_instance): Walk all
vectorized stmts for finding the last one.
* gcc.dg/torture/pr95761.c: New testcase.
Diffstat (limited to 'gcc/fortran/iresolve.c')
0 files changed, 0 insertions, 0 deletions