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

re PR tree-optimization/70310 (wrong code with vector compare at -O0)

Browse Source 
2016-03-21  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/70310
	* tree-vect-generic.c (expand_vector_condition): Fold the built
	condition.

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

From-SVN: r234369
This commit is contained in:
Richard Biener 2016-03-21 13:50:50 +00:00 committed by Richard Biener
parent e9bde85499
commit 2fac8c142e
4 changed files with 32 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2016-03-21 Richard Biener <rguenther@suse.de>
PR tree-optimization/70310
* tree-vect-generic.c (expand_vector_condition): Fold the built
condition.
2016-03-21 Kirill Yukhin <kirill.yukhin@intel.com>
PR target/70293

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2016-03-21 Richard Biener <rguenther@suse.de>
PR tree-optimization/70310
* gcc.dg/torture/pr70310.c: New testcase.
2016-03-21 Kirill Yukhin <kirill.yukhin@intel.com>
PR target/70293

20
gcc/testsuite/gcc.dg/torture/pr70310.c Normal file
View File

@ -0,0 +1,20 @@
/* { dg-do run } */
typedef unsigned char v32u8 __attribute__ ((vector_size (32)));
unsigned __attribute__((noinline, noclone))
foo(unsigned u)
{
v32u8 v32u8_0 = (v32u8){} > (v32u8){-u};
return v32u8_0[31] + v32u8_0[0];
}
int
main ()
{
unsigned x = foo(0);
__builtin_printf ("%08x\n",x);
if (x != 0)
__builtin_abort();
return 0;
}

2
gcc/tree-vect-generic.c
View File

@ -897,7 +897,7 @@ expand_vector_condition (gimple_stmt_iterator *gsi)
{
tree aa1 = tree_vec_extract (gsi, comp_inner_type, a1, width, index);
tree aa2 = tree_vec_extract (gsi, comp_inner_type, a2, width, index);
aa = build2 (TREE_CODE (a), cond_type, aa1, aa2);
aa = fold_build2 (TREE_CODE (a), cond_type, aa1, aa2);
}
else
aa = tree_vec_extract (gsi, cond_type, a, width, index);