From 9de04252a07c04a9676de3c8606b0a29e66a23ce Mon Sep 17 00:00:00 2001 From: Martin Jambor Date: Wed, 15 May 2013 12:35:59 +0200 Subject: ipa-prop.c (ipa_print_node_jump_functions): Print symbol order in header... 2013-05-15 Martin Jambor * ipa-prop.c (ipa_print_node_jump_functions): Print symbol order in header, print symbol order instead of node uid, print more information about indirect edge targets. (ipa_make_edge_direct_to_target): Print symbol order instead of node uids. (ipa_make_edge_direct_to_target): Likewise. (remove_described_reference): Likewise. (propagate_controlled_uses): Likewise. (ipa_print_node_params): Also print symbol order. (ipcp_transform_function): Print symbol order instead of node uids. * cgraph.c (cgraph_redirect_edge_call_stmt_to_callee): Likewise. (cgraph_get_create_real_symbol_node): Likewise. * ipa-cp.c (print_lattice): Likewise. (print_all_lattices): Likewise. (determine_versionability): Likewise. (initialize_node_lattices): Likewise. (estimate_local_effects): Likewise. (update_profiling_info): Likewise. (create_specialized_node): Likewise. (perhaps_add_new_callers): Likewise. (decide_about_value): Likewise. (decide_whether_version_node): Likewise. (identify_dead_nodes): Likewise. * ipa-inline-analysis.c (dump_inline_edge_summary): Likewise. (dump_inline_summary): Likewise. (estimate_node_size_and_time): Likewise. (inline_analyze_function): Likewise. * ipa-inline.c (report_inline_failed_reason): Likewise. (want_early_inline_function_p): Likewise. (edge_badness): Likewise. (update_edge_key): Likewise. (inline_small_functions): Likewise. Add dumping of order to two other dumps. * ipa-pure-const.c (pure_const_read_summary): Print symbol order instead of node uids. (propagate_pure_const): Likewise. (propagate_pure_const): Likewise. * ipa-utils.c (dump_cgraph_node_set): Likewise. * lto-cgraph.c (input_node): Explicitly specify we dump uid. * lto-symtab.c (lto_cgraph_replace_node): Print symbol order instead of node uids. * tree-pretty-print.c (dump_function_header): Likewise. * tree-sra.c (convert_callers_for_node): Dump in traditional format. Print symbol order instead of node uids. lto/ * lto-partition.c (lto_balanced_map): Print symbol order instead of node uids. From-SVN: r198925 --- gcc/lto/ChangeLog | 5 +++++ gcc/lto/lto-partition.c | 6 ++++-- 2 files changed, 9 insertions(+), 2 deletions(-) (limited to 'gcc/lto') diff --git a/gcc/lto/ChangeLog b/gcc/lto/ChangeLog index 9a86b49..452b446 100644 --- a/gcc/lto/ChangeLog +++ b/gcc/lto/ChangeLog @@ -1,3 +1,8 @@ +2013-05-15 Martin Jambor + + * lto-partition.c (lto_balanced_map): Print symbol order instead + of node uids. + 2013-05-15 Jan Hubicka PR lto/57038 diff --git a/gcc/lto/lto-partition.c b/gcc/lto/lto-partition.c index acf8f29..b5d3247 100644 --- a/gcc/lto/lto-partition.c +++ b/gcc/lto/lto-partition.c @@ -691,8 +691,10 @@ lto_balanced_map (void) best_total_size = total_size; } if (cgraph_dump_file) - fprintf (cgraph_dump_file, "Step %i: added %s/%i, size %i, cost %i/%i best %i/%i, step %i\n", i, - cgraph_node_name (order[i]), order[i]->uid, partition->insns, cost, internal, + fprintf (cgraph_dump_file, "Step %i: added %s/%i, size %i, cost %i/%i " + "best %i/%i, step %i\n", i, + cgraph_node_name (order[i]), order[i]->symbol.order, + partition->insns, cost, internal, best_cost, best_internal, best_i); /* Partition is too large, unwind into step when best cost was reached and start new partition. */ -- cgit v1.1