diff options
author | hubicka <hubicka@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-04-14 13:26:44 +0000 |
---|---|---|
committer | hubicka <hubicka@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-04-14 13:26:44 +0000 |
commit | c7b2cc59a01b620dacfe495f7092b9c95f4773ff (patch) | |
tree | eb6e4c913e14b3874133c0765b5a7b51b8c55868 /gcc/cgraph.c | |
parent | 481fc47427d3ea2d912d3db0b21d31aacd829328 (diff) | |
download | gcc-c7b2cc59a01b620dacfe495f7092b9c95f4773ff.tar.gz |
* cgraph.c (dump_cgraph_node): Do not dump inline summaries.
* cgraph.h (struct inline_summary): Move to ipa-inline.h
(cgraph_local_info): Remove inline_summary.
* ipa-cp.c: Include ipa-inline.h.
(ipcp_cloning_candidate_p, ipcp_estimate_growth,
ipcp_estimate_cloning_cost, ipcp_insert_stage): Use inline_summary
accesor.
* lto-cgraph.c (lto_output_node): Do not stream inline summary.
(input_overwrite_node): Do not set inline summary.
(input_node): Do not stream inline summary.
* ipa-inline.c (cgraph_decide_inlining): Dump inline summaries.
(cgraph_decide_inlining_incrementally): Do not try to estimate overall
growth; we do not have inline parameters computed for that anyway.
(cgraph_early_inlining): After inlining compute call_stmt_sizes.
* ipa-inline.h (struct inline_summary): Move here from ipa-inline.h
(inline_summary_t): New type and VECtor.
(debug_inline_summary, dump_inline_summaries): Declare.
(inline_summary): Use VOCtor.
(estimate_edge_growth): Kill hack computing call stmt size directly.
* lto-section-in.c (lto_section_name): Add inline section.
* ipa-inline-analysis.c: Include lto-streamer.h
(node_removal_hook_holder, node_duplication_hook_holder): New holders
(inline_node_removal_hook, inline_node_duplication_hook): New functions.
(inline_summary_vec): Define.
(inline_summary_alloc, dump_inline_summary, debug_inline_summary,
dump_inline_summaries): New functions.
(estimate_function_body_sizes): Properly compute size/time of outgoing calls.
(compute_inline_parameters): Alloc inline_summary; do not compute size/time
of incomming calls.
(estimate_edge_time): Avoid missing time summary hack.
(inline_read_summary): Read inline summary info.
(inline_write_summary): Write inline summary info.
(inline_free_summary): Free all hooks and inline summary vector.
* lto-streamer.h: Add LTO_section_inline_summary section.
* Makefile.in (ipa-cp.o, ipa-inline-analysis.o): Update dependencies.
* ipa.c (cgraph_remove_unreachable_nodes): Fix dump file formating.
* lto.c: Include ipa-inline.h
(add_cgraph_node_to_partition, undo_partition): Use inline_summary accessor.
(ipa_node_duplication_hook): Fix declaration.
* Make-lang.in (lto.o): Update dependencies.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@172430 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cgraph.c')
-rw-r--r-- | gcc/cgraph.c | 16 |
1 files changed, 0 insertions, 16 deletions
diff --git a/gcc/cgraph.c b/gcc/cgraph.c index 22098e54955..09436c7cfb5 100644 --- a/gcc/cgraph.c +++ b/gcc/cgraph.c @@ -1876,22 +1876,6 @@ dump_cgraph_node (FILE *f, struct cgraph_node *node) if (node->count) fprintf (f, " executed "HOST_WIDEST_INT_PRINT_DEC"x", (HOST_WIDEST_INT)node->count); - if (node->local.inline_summary.self_time) - fprintf (f, " %i time, %i benefit", node->local.inline_summary.self_time, - node->local.inline_summary.time_inlining_benefit); - if (node->global.time && node->global.time - != node->local.inline_summary.self_time) - fprintf (f, " (%i after inlining)", node->global.time); - if (node->local.inline_summary.self_size) - fprintf (f, " %i size, %i benefit", node->local.inline_summary.self_size, - node->local.inline_summary.size_inlining_benefit); - if (node->global.size && node->global.size - != node->local.inline_summary.self_size) - fprintf (f, " (%i after inlining)", node->global.size); - if (node->local.inline_summary.estimated_self_stack_size) - fprintf (f, " %i bytes stack usage", (int)node->local.inline_summary.estimated_self_stack_size); - if (node->global.estimated_stack_size != node->local.inline_summary.estimated_self_stack_size) - fprintf (f, " %i bytes after inlining", (int)node->global.estimated_stack_size); if (node->origin) fprintf (f, " nested in: %s", cgraph_node_name (node->origin)); if (node->needed) |