diff options
| author | Jan Hubicka <jh@suse.cz> | 2006-08-21 03:42:39 +0200 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2006-08-21 01:42:39 +0000 |
| commit | 70d539ce3a777b83d929c6de70b14a6eb7f3a100 (patch) | |
| tree | a12516abd37107b901b016eeb00d8d3bf4e3660f /gcc/tree-optimize.c | |
| parent | 76395e081fd157eea5646a1dc4add10415d8b330 (diff) | |
| download | gcc-70d539ce3a777b83d929c6de70b14a6eb7f3a100.zip gcc-70d539ce3a777b83d929c6de70b14a6eb7f3a100.tar.gz gcc-70d539ce3a777b83d929c6de70b14a6eb7f3a100.tar.bz2 | |
re PR middle-end/28071 (A file that can not be compiled in reasonable time/space)
PR rtl-optimization/28071
* tree-optimize.c (tree_rest_of_compilation): Do not remove edges
twice.
* tree-inline.c (copy_bb): Use cgraph_set_call_stmt.
* ipa-inline.c (cgraph_check_inline_limits): Add one_only argument.
(cgraph_decide_inlining, cgraph_decide_inlining_of_small_function,
cgraph_decide_inlining_incrementally): Update use of
cgraph_check_inline_limits.
* cgraph.c (edge_hash, edge_eq): New function.
(cgraph_edge, cgraph_set_call_stmt, cgraph_create_edge,
cgraph_edge_remove_caller, cgraph_node_remove_callees,
cgraph_remove_node): Maintain call site hash.
* cgraph.h (struct cgraph_node): Add call_site_hash.
(cgraph_set_call_stmt): New function.
From-SVN: r116284
Diffstat (limited to 'gcc/tree-optimize.c')
| -rw-r--r-- | gcc/tree-optimize.c | 15 |
1 files changed, 7 insertions, 8 deletions
diff --git a/gcc/tree-optimize.c b/gcc/tree-optimize.c index fdf8ca1..3f4471a 100644 --- a/gcc/tree-optimize.c +++ b/gcc/tree-optimize.c @@ -393,15 +393,14 @@ tree_rest_of_compilation (tree fndecl) timevar_pop (TV_INTEGRATION); } } - /* We are not going to maintain the cgraph edges up to date. - Kill it so it won't confuse us. */ - while (node->callees) + /* In non-unit-at-a-time we must mark all referenced functions as needed. + */ + if (!flag_unit_at_a_time) { - /* In non-unit-at-a-time we must mark all referenced functions as needed. - */ - if (node->callees->callee->analyzed && !flag_unit_at_a_time) - cgraph_mark_needed_node (node->callees->callee); - cgraph_remove_edge (node->callees); + struct cgraph_edge *e; + for (e = node->callees; e; e = e->next_callee) + if (e->callee->analyzed) + cgraph_mark_needed_node (e->callee); } /* We are not going to maintain the cgraph edges up to date. |