diff options
author | Richard Biener <rguenther@suse.de> | 2020-10-28 14:16:05 +0100 |
---|---|---|
committer | Richard Biener <rguenther@suse.de> | 2020-10-28 15:04:06 +0100 |
commit | 616351b897c834500e685f4ab6ece4d82b506d29 (patch) | |
tree | 3ade60ae807bb46d11a4bd86dfbfd13629a05a88 | |
parent | c227d96feb0030d63efad352b8fa7175b4c30721 (diff) | |
download | gcc-616351b897c834500e685f4ab6ece4d82b506d29.zip gcc-616351b897c834500e685f4ab6ece4d82b506d29.tar.gz gcc-616351b897c834500e685f4ab6ece4d82b506d29.tar.bz2 |
Fix iteration over loads in SLP optimize
I've made a typo when refactoring the iteration over all loads in
the SLP graph. Fixed.
2020-10-28 Richard Biener <rguenther@suse.de>
* tree-vect-slp.c (vect_optimize_slp): Fix iteration over
all loads.
-rw-r--r-- | gcc/tree-vect-slp.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c index 50a2d37..5eafc03 100644 --- a/gcc/tree-vect-slp.c +++ b/gcc/tree-vect-slp.c @@ -3043,7 +3043,7 @@ vect_optimize_slp (vec_info *vinfo) /* Now elide load permutations that are not necessary. */ for (i = 0; i < leafs.length (); ++i) { - node = vertices[i]; + node = vertices[leafs[i]]; if (!SLP_TREE_LOAD_PERMUTATION (node).exists ()) continue; |