ipa-prop.c (ipa_print_node_jump_functions, [...]): Print info about missing summaries.

* ipa-prop.c (ipa_print_node_jump_functions,
	ipa_print_node_params): Print info about missing summaries.

From-SVN: r278127
This commit is contained in:
Jan Hubicka 2019-11-13 11:11:59 +01:00 committed by Jan Hubicka
parent 4a96e1c4dd
commit 0302955aeb
2 changed files with 18 additions and 6 deletions

View file

@ -1,3 +1,8 @@
2019-11-13 Jan Hubicka <hubicka@ucw.cz>
* ipa-prop.c (ipa_print_node_jump_functions,
ipa_print_node_params): Print info about missing summaries.
2019-11-13 Richard Sandiford <richard.sandiford@arm.com>
* tree-vect-loop.c (vect_estimate_min_profitable_iters): Include

View file

@ -422,20 +422,19 @@ ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node)
fprintf (f, " Jump functions of caller %s:\n", node->dump_name ());
for (cs = node->callees; cs; cs = cs->next_callee)
{
if (!ipa_edge_args_info_available_for_edge_p (cs))
continue;
fprintf (f, " callsite %s -> %s : \n",
node->dump_name (),
cs->callee->dump_name ());
ipa_print_node_jump_functions_for_edge (f, cs);
if (!ipa_edge_args_info_available_for_edge_p (cs))
fprintf (f, " no arg info\n");
else
ipa_print_node_jump_functions_for_edge (f, cs);
}
for (cs = node->indirect_calls; cs; cs = cs->next_callee)
{
class cgraph_indirect_call_info *ii;
if (!ipa_edge_args_info_available_for_edge_p (cs))
continue;
ii = cs->indirect_info;
if (ii->agg_contents)
@ -459,7 +458,10 @@ ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node)
fprintf (f, "\n");
if (ii->polymorphic)
ii->context.dump (f);
ipa_print_node_jump_functions_for_edge (f, cs);
if (!ipa_edge_args_info_available_for_edge_p (cs))
fprintf (f, " no arg info\n");
else
ipa_print_node_jump_functions_for_edge (f, cs);
}
}
@ -4081,6 +4083,11 @@ ipa_print_node_params (FILE *f, struct cgraph_node *node)
return;
info = IPA_NODE_REF (node);
fprintf (f, " function %s parameter descriptors:\n", node->dump_name ());
if (!info)
{
fprintf (f, " no params return\n");
return;
}
count = ipa_get_param_count (info);
for (i = 0; i < count; i++)
{