Commit a265c9a9 by Richard Biener Committed by Richard Biener

re PR tree-optimization/90006 (gcc loops indefinitely around…

re PR tree-optimization/90006 (gcc loops indefinitely around vect_get_constant_vectors on -O2 -ftree-slp-vectorize -fno-math-errno)

2019-04-08  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/90006
	* tree-vect-data-refs.c (vect_get_smallest_scalar_type): Handle
	calls like lrint.

	* gcc.dg/vect/bb-slp-pr90006.c: New testcase.

From-SVN: r270210
parent b8e214c6
2019-04-08 Richard Biener <rguenther@suse.de>
PR tree-optimization/90006
* tree-vect-data-refs.c (vect_get_smallest_scalar_type): Handle
calls like lrint.
2019-04-08 Andrea Corallo <andrea.corallo@arm.com>
PR target/83033
......
2019-04-08 Richard Biener <rguenther@suse.de>
PR tree-optimization/90006
* gcc.dg/vect/bb-slp-pr90006.c: New testcase.
2019-04-08 Jakub Jelinek <jakub@redhat.com>
PR rtl-optimization/89865
......
/* { dg-do compile } */
/* { dg-additional-options "-fno-math-errno" } */
/* { dg-additional-options "-march=x86-64" { target x86_64-*-* i?86-*-* } } */
long int lrint(double x);
int a, b;
union c {
int d;
};
int e()
{
int f, g, h;
long i, j, k;
double l, m = b = lrint(0.3127);
a = b >> 16 >> 8 & 255;
((union c *)e)->d = a;
k = m;
h = k >> 16 >> 8 & 255;
((union c *)(e + 4))->d = h;
j = lrint(l);
g = j >> 16 >> 8 & 255;
((union c *)(e + 8))->d = g;
i = lrint(0.292);
f = i >> 16 >> 8 & 255;
((union c *)(e + 12))->d = f;
return 0;
}
/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target { { x86_64-*-* i?86-*-* } && ilp32 } } } } */
......@@ -145,6 +145,15 @@ vect_get_smallest_scalar_type (stmt_vec_info stmt_info,
if (rhs < lhs)
scalar_type = rhs_type;
}
else if (is_gimple_call (stmt_info->stmt)
&& gimple_call_num_args (stmt_info->stmt) > 0)
{
tree rhs_type = TREE_TYPE (gimple_call_arg (stmt_info->stmt, 0));
rhs = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (rhs_type));
if (rhs < lhs)
scalar_type = rhs_type;
}
*lhs_size_unit = lhs;
*rhs_size_unit = rhs;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment