Commit d597b944 by Martin Liska Committed by Martin Liska

Replace node->name/node->order with node->dump_name.

2020-01-08  Martin Liska  <mliska@suse.cz>

	* ipa-fnsummary.c (dump_ipa_call_summary): Use symtab_node::dump_name.
	(ipa_call_context::estimate_size_and_time): Likewise.
	(inline_analyze_function): Likewise.
2020-01-08  Martin Liska  <mliska@suse.cz>

	* lto-partition.c (lto_balanced_map): Use symtab_node::dump_name.

From-SVN: r279999
parent 4dfa3251
2020-01-08 Martin Liska <mliska@suse.cz> 2020-01-08 Martin Liska <mliska@suse.cz>
* ipa-fnsummary.c (dump_ipa_call_summary): Use symtab_node::dump_name.
(ipa_call_context::estimate_size_and_time): Likewise.
(inline_analyze_function): Likewise.
2020-01-08 Martin Liska <mliska@suse.cz>
* cgraph.c (cgraph_node::dump): Use systematically * cgraph.c (cgraph_node::dump): Use systematically
dump_asm_name. dump_asm_name.
......
...@@ -907,8 +907,8 @@ dump_ipa_call_summary (FILE *f, int indent, struct cgraph_node *node, ...@@ -907,8 +907,8 @@ dump_ipa_call_summary (FILE *f, int indent, struct cgraph_node *node,
int i; int i;
fprintf (f, fprintf (f,
"%*s%s/%i %s\n%*s freq:%4.2f", "%*s%s %s\n%*s freq:%4.2f",
indent, "", callee->name (), callee->order, indent, "", callee->dump_name (),
!edge->inline_failed !edge->inline_failed
? "inlined" : cgraph_inline_failed_string (edge-> inline_failed), ? "inlined" : cgraph_inline_failed_string (edge-> inline_failed),
indent, "", edge->sreal_frequency ().to_double ()); indent, "", edge->sreal_frequency ().to_double ());
...@@ -3505,9 +3505,8 @@ ipa_call_context::estimate_size_and_time (int *ret_size, ...@@ -3505,9 +3505,8 @@ ipa_call_context::estimate_size_and_time (int *ret_size,
if (dump_file && (dump_flags & TDF_DETAILS)) if (dump_file && (dump_flags & TDF_DETAILS))
{ {
bool found = false; bool found = false;
fprintf (dump_file, " Estimating body: %s/%i\n" fprintf (dump_file, " Estimating body: %s\n"
" Known to be false: ", m_node->name (), " Known to be false: ", m_node->dump_name ());
m_node->order);
for (i = predicate::not_inlined_condition; for (i = predicate::not_inlined_condition;
i < (predicate::first_dynamic_condition i < (predicate::first_dynamic_condition
...@@ -4034,8 +4033,7 @@ inline_analyze_function (struct cgraph_node *node) ...@@ -4034,8 +4033,7 @@ inline_analyze_function (struct cgraph_node *node)
push_cfun (DECL_STRUCT_FUNCTION (node->decl)); push_cfun (DECL_STRUCT_FUNCTION (node->decl));
if (dump_file) if (dump_file)
fprintf (dump_file, "\nAnalyzing function: %s/%u\n", fprintf (dump_file, "\nAnalyzing function: %s\n", node->dump_name ());
node->name (), node->order);
if (opt_for_fn (node->decl, optimize) && !node->thunk.thunk_p) if (opt_for_fn (node->decl, optimize) && !node->thunk.thunk_p)
inline_indirect_intraprocedural_analysis (node); inline_indirect_intraprocedural_analysis (node);
compute_fn_summary (node, false); compute_fn_summary (node, false);
......
2020-01-08 Martin Liska <mliska@suse.cz>
* lto-partition.c (lto_balanced_map): Use symtab_node::dump_name.
2020-01-01 Jakub Jelinek <jakub@redhat.com> 2020-01-01 Jakub Jelinek <jakub@redhat.com>
Update copyright years. Update copyright years.
......
...@@ -734,10 +734,10 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size) ...@@ -734,10 +734,10 @@ lto_balanced_map (int n_lto_partitions, int max_partition_size)
best_varpool_pos = varpool_pos; best_varpool_pos = varpool_pos;
} }
if (dump_file) if (dump_file)
fprintf (dump_file, "Step %i: added %s/%i, size %i, " fprintf (dump_file, "Step %i: added %s, size %i, "
"cost %" PRId64 "/%" PRId64 " " "cost %" PRId64 "/%" PRId64 " "
"best %" PRId64 "/%" PRId64", step %i\n", i, "best %" PRId64 "/%" PRId64", step %i\n", i,
order[i]->name (), order[i]->order, order[i]->dump_name (),
partition->insns, cost, internal, partition->insns, cost, internal,
best_cost, best_internal, best_i); best_cost, best_internal, best_i);
/* Partition is too large, unwind into step when best cost was reached and /* Partition is too large, unwind into step when best cost was reached and
......
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