Commit bd8c998f by Eric Botcazou Committed by Eric Botcazou

re PR rtl-optimization/50615 (ICE: in distribute_notes, at combine.c:13282 with…

re PR rtl-optimization/50615 (ICE: in distribute_notes, at combine.c:13282 with -O --param max-cse-insns=1)

	PR rtl-optimization/50615
	* combine.c (distribute_notes) <REG_ARGS_SIZE>: Skip if I3 is a no-op.

From-SVN: r180058
parent 71c92d17
2011-10-16 Eric Botcazou <ebotcazou@adacore.com>
PR rtl-optimization/50615
* combine.c (distribute_notes) <REG_ARGS_SIZE>: Skip if I3 is a no-op.
2011-10-16 Jakub Jelinek <jakub@redhat.com> 2011-10-16 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/50596 PR tree-optimization/50596
...@@ -13274,13 +13274,14 @@ distribute_notes (rtx notes, rtx from_insn, rtx i3, rtx i2, rtx elim_i2, ...@@ -13274,13 +13274,14 @@ distribute_notes (rtx notes, rtx from_insn, rtx i3, rtx i2, rtx elim_i2,
break; break;
case REG_ARGS_SIZE: case REG_ARGS_SIZE:
{ /* ??? How to distribute between i3-i1. Assume i3 contains the
/* ??? How to distribute between i3-i1. Assume i3 contains the entire adjustment. Assert i3 contains at least some adjust. */
entire adjustment. Assert i3 contains at least some adjust. */ if (!noop_move_p (i3))
int old_size, args_size = INTVAL (XEXP (note, 0)); {
old_size = fixup_args_size_notes (PREV_INSN (i3), i3, args_size); int old_size, args_size = INTVAL (XEXP (note, 0));
gcc_assert (old_size != args_size); old_size = fixup_args_size_notes (PREV_INSN (i3), i3, args_size);
} gcc_assert (old_size != args_size);
}
break; break;
case REG_NORETURN: case REG_NORETURN:
......
2011-10-16 Eric Botcazou <ebotcazou@adacore.com>
* gcc.dg/vla-23.c: New test.
2011-10-16 Jakub Jelinek <jakub@redhat.com> 2011-10-16 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/50596 PR tree-optimization/50596
......
/* PR rtl-optimization/50615 */
/* Testcase by Zdenek Sojka <zsojka@seznam.cz> */
/* { dg-do compile } */
/* { dg-options "-O --param max-cse-insns=1" } */
int
foo (int a)
{
if (!a)
return 1;
{
int s[a];
return 0;
}
}
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