Commit ef0519fd by Richard Biener Committed by Richard Biener

re PR tree-optimization/87917 (ICE in initialize_matrix_A at gcc/tree-data-ref.c:3150)

2018-11-15  Richard Biener  <rguenther@suse.de>

	PR middle-end/87917
	* tree-data-ref.c (analyze_miv_subscript): Guard calls to
	analyze_subscript_affine_affine properly.

	* gcc.dg/tree-ssa/pr87917.c: New testcase.

From-SVN: r266173
parent 28209372
2018-11-15 Richard Biener <rguenther@suse.de>
PR middle-end/87917
* tree-data-ref.c (analyze_miv_subscript): Guard calls to
analyze_subscript_affine_affine properly.
2018-11-15 Xianmiao Qu <xianmiao_qu@c-sky.com> 2018-11-15 Xianmiao Qu <xianmiao_qu@c-sky.com>
* config/csky/csky-linux-elf.h (LINUX_DYNAMIC_LINKER): Remove. * config/csky/csky-linux-elf.h (LINUX_DYNAMIC_LINKER): Remove.
2018-11-15 Richard Biener <rguenther@suse.de>
PR middle-end/87917
* gcc.dg/tree-ssa/pr87917.c: New testcase.
2018-11-15 Bin Cheng <bin.cheng@linux.alibaba.com> 2018-11-15 Bin Cheng <bin.cheng@linux.alibaba.com>
PR tree-optimization/84648 PR tree-optimization/84648
......
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-loop-distribute-patterns -ftrapv -fno-tree-fre" } */
void foo(int x[])
{
int i, j;
for (i = 0; i < 2; i++)
for (j = 0; j < 2; j++)
{
x[i] = x[i*j];
x[i] = x[i*j];
}
}
...@@ -4038,9 +4038,9 @@ analyze_miv_subscript (tree chrec_a, ...@@ -4038,9 +4038,9 @@ analyze_miv_subscript (tree chrec_a,
dependence_stats.num_miv_independent++; dependence_stats.num_miv_independent++;
} }
else if (evolution_function_is_affine_multivariate_p (chrec_a, loop_nest->num) else if (evolution_function_is_affine_in_loop (chrec_a, loop_nest->num)
&& !chrec_contains_symbols (chrec_a) && !chrec_contains_symbols (chrec_a)
&& evolution_function_is_affine_multivariate_p (chrec_b, loop_nest->num) && evolution_function_is_affine_in_loop (chrec_b, loop_nest->num)
&& !chrec_contains_symbols (chrec_b)) && !chrec_contains_symbols (chrec_b))
{ {
/* testsuite/.../ssa-chrec-35.c /* testsuite/.../ssa-chrec-35.c
......
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