procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

re PR tree-optimization/78777 (ICE in mark_reachable_handlers, at tree-eh.c:3823 (aarch64-linux-gnu))

Browse source 
PR tree-optimization/78777
	* gimple-ssa-strength-reduction.c (create_add_on_incoming_edge,
	insert_initializers): Use stmt_ends_bb_p instead of is_ctrl_stmt.

	* g++.dg/torture/pr78777.C: New test.

From-SVN: r243584
This commit is contained in:
Jakub Jelinek 2016-12-12 23:02:52 +01:00 • committed by Jakub Jelinek
parent 27ec22668f
commit 1697df8c99
4 changed files with 40 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
gcc/ChangeLog
View file

@ -1,5 +1,9 @@
2016-12-12 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/78777
* gimple-ssa-strength-reduction.c (create_add_on_incoming_edge,
insert_initializers): Use stmt_ends_bb_p instead of is_ctrl_stmt.
PR other/78766
* opt-functions.awk (opt_args): Use [{] instead of { in regexps.
Formatting fix.

4
gcc/gimple-ssa-strength-reduction.c
View file

@ -2253,7 +2253,7 @@ create_add_on_incoming_edge (slsr_cand_t c, tree basis_name,
insert_bb = single_succ_p (e->src) ? e->src : split_edge (e);
gsi = gsi_last_bb (insert_bb);
if (!gsi_end_p (gsi) && is_ctrl_stmt (gsi_stmt (gsi)))
if (!gsi_end_p (gsi) && stmt_ends_bb_p (gsi_stmt (gsi)))
{
gsi_insert_before (&gsi, new_stmt, GSI_SAME_STMT);
if (cast_stmt)
@ -3243,7 +3243,7 @@ insert_initializers (slsr_cand_t c)
gimple *basis_stmt = lookup_cand (c->basis)->cand_stmt;
location_t loc = gimple_location (basis_stmt);
if (!gsi_end_p (gsi) && is_ctrl_stmt (gsi_stmt (gsi)))
if (!gsi_end_p (gsi) && stmt_ends_bb_p (gsi_stmt (gsi)))
{
if (cast_stmt)
{

5
gcc/testsuite/ChangeLog
View file

@ -1,3 +1,8 @@
2016-12-12 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/78777
* g++.dg/torture/pr78777.C: New test.
2016-12-12 Martin Sebor <msebor@redhat.com>
PR middle-end/78622

29
gcc/testsuite/g++.dg/torture/pr78777.C Normal file
View file

@ -0,0 +1,29 @@
// PR tree-optimization/78777
void bar (char);
struct C { char b; };
struct H { char d[5]; int e; C *f[4]; int g[10]; };
void baz (C *, unsigned char *, int);
unsigned char j[10];
void
foo (H *o, int p, unsigned char *q, int r, char n, H *b)
{
for (int m = 0; m < o->e; m++)
{
if (o->f[m] || o->g[m])
continue;
try
{
baz (o->f[m], j, 5);
if (p)
baz (o->f[m], q, r);
}
catch (int)
{
C a = *o->f[m];
if (b)
bar (n & a.b);
}
}
}