OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR tree-optimization/77979 (ICE on valid code at -Os and above on x86_64-linux-gnu: Segmentation fault)

Browse Source 
2016-10-14  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/77979
	* tree-vrp.c (compare_name_with_value): Handle released SSA names
	in the equivalency sets.
	(compare_names): Likewise.

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

From-SVN: r241162
This commit is contained in:
Richard Biener 2016-10-14 12:58:18 +00:00 committed by Richard Biener
parent 43f66d6e1e
commit 6d59425df7
4 changed files with 36 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
2016-10-14 Richard Biener <rguenther@suse.de>
PR tree-optimization/77979
* tree-vrp.c (compare_name_with_value): Handle released SSA names
in the equivalency sets.
(compare_names): Likewise.
2016-10-14 Martin Liska <mliska@suse.cz>
* builtins.h(target_char_cst_p): Declare the function.

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2016-10-14 Richard Biener <rguenther@suse.de>
PR tree-optimization/77979
* gcc.dg/torture/pr77979.c: New testcase.
2016-10-14 Martin Liska <mliska@suse.cz>
* gcc.dg/tree-ssa/builtins-folding-generic.c: New test.

12
gcc/testsuite/gcc.dg/torture/pr77979.c Normal file
View File

@ -0,0 +1,12 @@
/* { dg-do compile } */
int a, b, c, d, e, f;
void fn1 ()
{
int g = b;
a = -~(d || a) << 4 || e;
b = c || g ^ a;
if (f < g)
d = e;
}

14
gcc/tree-vrp.c
View File

@ -7188,9 +7188,13 @@ compare_name_with_value (enum tree_code comp, tree var, tree val,
EXECUTE_IF_SET_IN_BITMAP (e, 0, i, bi)
{
tree name = ssa_name (i);
if (! name)
continue;
if (! use_equiv_p
&& ! SSA_NAME_IS_DEFAULT_DEF (ssa_name (i))
&& prop_simulate_again_p (SSA_NAME_DEF_STMT (ssa_name (i))))
&& ! SSA_NAME_IS_DEFAULT_DEF (name)
&& prop_simulate_again_p (SSA_NAME_DEF_STMT (name)))
continue;
equiv_vr = get_vr_for_comparison (i);
@ -7289,11 +7293,17 @@ compare_names (enum tree_code comp, tree n1, tree n2,
of the loop just to check N1 and N2 ranges. */
EXECUTE_IF_SET_IN_BITMAP (e1, 0, i1, bi1)
{
if (! ssa_name (i1))
continue;
value_range vr1 = get_vr_for_comparison (i1);
t = retval = NULL_TREE;
EXECUTE_IF_SET_IN_BITMAP (e2, 0, i2, bi2)
{
if (! ssa_name (i2))
continue;
bool sop = false;
value_range vr2 = get_vr_for_comparison (i2);