re PR tree-optimization/48195 (ICE: vector VEC(ipa_node_params_t,base) index domain error, in ipa_analyze_node at ipa-prop.c:1525 with -flto --param partial-inlining-entry-probability=101)
2011-04-11 Martin Jambor <mjambor@suse.cz> PR tree-optimization/48195 * ipa-cp.c (ipcp_driver): Call ipa_check_create_node_params and ipa_check_create_edge_args. (ipcp_generate_summary): Do not call ipa_check_create_node_params and ipa_check_create_edge_args. * ipa-inline.c (inline_generate_summary): Do not call ipa_check_create_node_params and ipa_check_create_edge_args. * ipa-prop.c (ipa_analyze_node): Call ipa_check_create_node_params and ipa_check_create_edge_args. * testsuite/gcc.dg/ipa/pr48195.c: New test. From-SVN: r172256
This commit is contained in:
parent
d0bfa8b5ab
commit
57dbdc5a66
@ -1,3 +1,15 @@
|
||||
2011-04-11 Martin Jambor <mjambor@suse.cz>
|
||||
|
||||
PR tree-optimization/48195
|
||||
* ipa-cp.c (ipcp_driver): Call ipa_check_create_node_params and
|
||||
ipa_check_create_edge_args.
|
||||
(ipcp_generate_summary): Do not call ipa_check_create_node_params and
|
||||
ipa_check_create_edge_args.
|
||||
* ipa-inline.c (inline_generate_summary): Do not call
|
||||
ipa_check_create_node_params and ipa_check_create_edge_args.
|
||||
* ipa-prop.c (ipa_analyze_node): Call ipa_check_create_node_params and
|
||||
ipa_check_create_edge_args.
|
||||
|
||||
2011-04-09 Anatoly Sokolov <aesok@post.ru>
|
||||
|
||||
* expr.c (expand_expr_real_1): Use add_to_hard_reg_set function
|
||||
|
@ -1539,6 +1539,8 @@ ipcp_driver (void)
|
||||
ipa_print_all_params (dump_file);
|
||||
ipa_print_all_jump_functions (dump_file);
|
||||
}
|
||||
ipa_check_create_node_params ();
|
||||
ipa_check_create_edge_args ();
|
||||
/* 2. Do the interprocedural propagation. */
|
||||
ipcp_iterate_stage ();
|
||||
/* 3. Insert the constants found to the functions. */
|
||||
@ -1566,8 +1568,6 @@ ipcp_generate_summary (void)
|
||||
|
||||
if (dump_file)
|
||||
fprintf (dump_file, "\nIPA constant propagation start:\n");
|
||||
ipa_check_create_node_params ();
|
||||
ipa_check_create_edge_args ();
|
||||
ipa_register_cgraph_hooks ();
|
||||
|
||||
for (node = cgraph_nodes; node; node = node->next)
|
||||
|
@ -2066,11 +2066,7 @@ inline_generate_summary (void)
|
||||
cgraph_add_function_insertion_hook (&add_new_function, NULL);
|
||||
|
||||
if (flag_indirect_inlining)
|
||||
{
|
||||
ipa_register_cgraph_hooks ();
|
||||
ipa_check_create_node_params ();
|
||||
ipa_check_create_edge_args ();
|
||||
}
|
||||
ipa_register_cgraph_hooks ();
|
||||
|
||||
for (node = cgraph_nodes; node; node = node->next)
|
||||
if (node->analyzed)
|
||||
|
@ -1522,10 +1522,13 @@ ipa_analyze_params_uses (struct cgraph_node *node,
|
||||
void
|
||||
ipa_analyze_node (struct cgraph_node *node)
|
||||
{
|
||||
struct ipa_node_params *info = IPA_NODE_REF (node);
|
||||
struct ipa_node_params *info;
|
||||
struct param_analysis_info *parms_info;
|
||||
int i, param_count;
|
||||
|
||||
ipa_check_create_node_params ();
|
||||
ipa_check_create_edge_args ();
|
||||
info = IPA_NODE_REF (node);
|
||||
push_cfun (DECL_STRUCT_FUNCTION (node->decl));
|
||||
current_function_decl = node->decl;
|
||||
ipa_initialize_node_params (node);
|
||||
|
@ -1,3 +1,8 @@
|
||||
2011-04-11 Martin Jambor <mjambor@suse.cz>
|
||||
|
||||
PR tree-optimization/48195
|
||||
* gcc.dg/ipa/pr48195.c: New test.
|
||||
|
||||
2011-04-10 Eric Botcazou <ebotcazou@adacore.com>
|
||||
|
||||
* gnat.dg/return3.adb: Remove unused switch.
|
||||
|
24
gcc/testsuite/gcc.dg/ipa/pr48195.c
Normal file
24
gcc/testsuite/gcc.dg/ipa/pr48195.c
Normal file
@ -0,0 +1,24 @@
|
||||
/* { dg-do link } */
|
||||
/* { dg-options "-O2 -flto --param partial-inlining-entry-probability=101" } */
|
||||
|
||||
extern void abort(void);
|
||||
|
||||
int i;
|
||||
|
||||
void __attribute__ ((constructor))
|
||||
c2 ()
|
||||
{
|
||||
if (i)
|
||||
abort ();
|
||||
}
|
||||
|
||||
void __attribute__ ((destructor))
|
||||
d1 ()
|
||||
{
|
||||
if (i)
|
||||
abort ();
|
||||
}
|
||||
|
||||
void main ()
|
||||
{
|
||||
}
|
Loading…
Reference in New Issue
Block a user