mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-05 05:00:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

re PR tree-optimization/66165 (vect_transform_slp_perm_load: vec out of range ?)

Browse Source 
2015-05-19  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/66165
	* tree-vect-slp.c (vect_supported_load_permutation_p): Add guard
	for no load permutation.

	* gcc.dg/torture/pr66165.c: New testcase.

	PR tree-optimization/66185
	* tree-vect-slp.c (vect_build_slp_tree): Properly roll back
	when building the SLP node from scalars.

	* gcc.dg/torture/pr66185.c: New testcase.

From-SVN: r223349
This commit is contained in:
Richard Biener 2015-05-19 09:36:35 +00:00 committed by Richard Biener
parent d33606c306
commit 9626d143b9
5 changed files with 54 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
gcc/ChangeLog
View File

@ -1,3 +1,13 @@
2015-05-19 Richard Biener <rguenther@suse.de>
PR tree-optimization/66165
* tree-vect-slp.c (vect_supported_load_permutation_p): Add guard
for no load permutation.
PR tree-optimization/66185
* tree-vect-slp.c (vect_build_slp_tree): Properly roll back
when building the SLP node from scalars.
2015-05-19 Eric Botcazou <ebotcazou@adacore.com>
Tristan Gingold <gingold@adacore.com>

8
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,11 @@
2015-05-19 Richard Biener <rguenther@suse.de>
PR tree-optimization/66165
* gcc.dg/torture/pr66165.c: New testcase.
PR tree-optimization/66185
* gcc.dg/torture/pr66185.c: New testcase.
2015-05-19 Oleg Endo <olegendo@gcc.gnu.org>
PR target/54236

11
gcc/testsuite/gcc.dg/torture/pr66165.c Normal file
View File

@ -0,0 +1,11 @@
/* { dg-do compile } */
void foo(double *d, double *a)
{
d[0] += d[2];
d[1] += d[3];
d[2] += d[4];
d[3] += d[5];
a[0] = d[0];
a[1] = d[1];
}

13
gcc/testsuite/gcc.dg/torture/pr66185.c Normal file
View File

@ -0,0 +1,13 @@
/* { dg-do compile } */
unsigned int a;
int b[5], c;
int
main ()
{
for (c = 0; c < 4; c++)
b[c] = b[c+1] > ((b[0] > 0) > a);
return 0;
}

12
gcc/tree-vect-slp.c
View File

@ -1103,6 +1103,16 @@ vect_build_slp_tree (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo,
scalar version. */
&& !is_pattern_stmt_p (vinfo_for_stmt (stmt)))
{
unsigned int j;
slp_tree grandchild;
/* Roll back. */
*max_nunits = old_max_nunits;
loads->truncate (old_nloads);
FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild)
vect_free_slp_tree (grandchild);
SLP_TREE_CHILDREN (child).truncate (0);
dump_printf_loc (MSG_NOTE, vect_location,
"Building vector operands from scalars\n");
oprnd_info->def_stmts = vNULL;
@ -1400,6 +1410,8 @@ vect_supported_load_permutation_p (slp_instance slp_instn)
no permutation is necessary. */
FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node)
{
if (!SLP_TREE_LOAD_PERMUTATION (node).exists ())
continue;
bool subchain_p = true;
next_load = NULL;
FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), j, load)