mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-21 15:50:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

re PR middle-end/60013 (Build of 176.gcc from CPU2000 loops in cc1 starting with r207231)

Browse Source 
PR middle-end/60013
	* ipa-inline-analysis.c (compute_bb_predicates): Ensure monotonicity
	of the dataflow.
	* gcc.dg/pr60013.c: New testcase.

Co-Authored-By: Jakub Jelinek <jakub@redhat.com>

From-SVN: r207529
This commit is contained in:
Jan Hubicka 2014-02-06 08:39:24 +01:00 committed by Jan Hubicka
parent d24d2cef4f
commit 78b1469d8b
4 changed files with 71 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
2014-02-05 Jan Hubicka <hubicka@ucw.cz>
Jakub Jelinek <jakub@redhat.com>
PR middle-end/60013
* ipa-inline-analysis.c (compute_bb_predicates): Ensure monotonicity
of the dataflow.
2014-02-05 Bill Schmidt <wschmidt@linux.vnet.ibm.com>
* config/rs6000/rs6000.c (altivec_expand_vec_perm_const): Change

15
gcc/ipa-inline-analysis.c
View File

@ -310,7 +310,7 @@ add_clause (conditions conditions, struct predicate *p, clause_t clause)
if (false_predicate_p (p))
return;
/* No one should be sily enough to add false into nontrivial clauses. */
/* No one should be silly enough to add false into nontrivial clauses. */
gcc_checking_assert (!(clause & (1 << predicate_false_condition)));
/* Look where to insert the clause. At the same time prune out
@ -1035,7 +1035,7 @@ inline_node_removal_hook (struct cgraph_node *node,
memset (info, 0, sizeof (inline_summary_t));
}
/* Remap predicate P of former function to be predicate of duplicated functoin.
/* Remap predicate P of former function to be predicate of duplicated function.
POSSIBLE_TRUTHS is clause of possible truths in the duplicated node,
INFO is inline summary of the duplicated node. */
@ -1887,8 +1887,15 @@ compute_bb_predicates (struct cgraph_node *node,
}
else if (!predicates_equal_p (&p, (struct predicate *) bb->aux))
{
done = false;
*((struct predicate *) bb->aux) = p;
/* This OR operation is needed to ensure monotonous data flow
in the case we hit the limit on number of clauses and the
and/or operations above give approximate answers. */
p = or_predicates (summary->conds, &p, (struct predicate *)bb->aux);
if (!predicates_equal_p (&p, (struct predicate *) bb->aux))
{
done = false;
*((struct predicate *) bb->aux) = p;
}
}
}
}

6
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,9 @@
2014-02-05 Jan Hubicka <hubicka@ucw.cz>
Jakub Jelinek <jakub@redhat.com>
PR middle-end/60013
* gcc.dg/pr60013.c: New testcase.
2014-02-05 Bill Schmidt <wschmidt@linux.vnet.ibm.com>
* gcc.dg/vmx/sum2s.c: New.

47
gcc/testsuite/gcc.dg/pr60013.c Normal file
View File

@ -0,0 +1,47 @@
/* PR ipa/60013 */
/* { dg-do compile } */
/* { dg-options "-O2" } */
typedef long int jmp_buf[64];
extern int _setjmp (jmp_buf) __attribute__ ((__nothrow__));
struct S { int a, b, c; };
extern struct S *baz (struct S *);
static jmp_buf j;
static inline int
bar (int b, int d)
{
return (b & d) < 0;
}
struct S *
foo (int a, struct S *b, struct S *c, struct S *d)
{
if (b->a == 0)
{
switch (a)
{
case 8:
return baz (b);
case 7:
bar (b->c, c->b);
return 0;
case 6:
case 5:
case 4:
return baz (c);
case 3:
case 2:
return baz (d);
}
return 0;
}
if (b->a == 1)
{
if (baz (c))
return c;
else if (_setjmp (j))
baz (b);
}
return 0;
}