aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-optimize.c
diff options
context:
space:
mode:
authorJan Hubicka <jh@suse.cz>2004-04-02 01:28:15 +0200
committerJan Hubicka <hubicka@gcc.gnu.org>2004-04-01 23:28:15 +0000
commit18c6ada9b2ee27a40db256f4c32779fc25872050 (patch)
tree77aa1595ee2a84a8ea2004429140d1fb8bcc2796 /gcc/tree-optimize.c
parente86327772eaa1f4b2c352a411afa195b30ff0c8f (diff)
downloadgcc-18c6ada9b2ee27a40db256f4c32779fc25872050.zip
gcc-18c6ada9b2ee27a40db256f4c32779fc25872050.tar.gz
gcc-18c6ada9b2ee27a40db256f4c32779fc25872050.tar.bz2
cgraph.c: Add overall comment.
* cgraph.c: Add overall comment. (cgraph_inline_hash): New global variable. (cgraph_create_node): Break out from ... (cgraph_node): ... here. (cgraph_edge): New function. (cgraph_create_edge): New CALL_EXPR argument; some sanity checking. (cgraph_remove_edge): Accept edge, intead of source and destination. (cgraph_redirect_edge_callee): New. (cgraph_remove_node): Update all new datastructures. (cgraph_record_call, cgraph_remove_call): Kill. (dump_cgraph_node): Break out from ... ; dump new datastructures. (dump_cgraph): ... here. (cgraph_function_possibly_inlined_p): Use new hashtable. (cgraph_clone_edge, cgraph_clone_node): New. * cgraph.h: Include hashtab.h (struct cgraph_global_info): Kill cloned_times, inline_once, will_be_output fields, add inlined_to pointer. (cgraph_node): Add pointer to next_clone. (cgraph_remove_edge, cgraph_create_edge): Update prototype. (cgraph_remove_call, cgraph_record_call): Kill. (cgraph_inline_hash): Declare. (dump_cgraph_node, cgraph_edge, cg4raph_clone_edge, cgraph_clone_node, cgraph_redirect_edge_callee): Declare. (cgraph_create_edges, cgraph_inline_p): Update prorotype. (cgraph_preserve_function_body_p, verify_cgraph, verify_cgraph_node, cgraph_mark_inline_edge, cgraph_clone_inlined_nodes): Declare. * cgraphunit.c: Add overall comment. (cgraph_optimize_function): Kill. (cgraph_assemble_pending_functions): Do not assemble inline clones. (cgraph_finalize_function): Update call of cgraph_remove_node (record_call_1): Record call sites. (cgraph_create_edges): Accept node instead of decl argument. (error_found): New static variable. (verify_cgraph_node_1, verify_cgraph_node, verify_cgraph): New functions. (cgraph_analyze_function): Update for new datastructures. (cgraph_finalize_compilation_unit): Plug memory leak. (cgraph_optimize_function): Kill. (cgraph_expand_function): Do not use cgraph_optimize_function. (INLINED_TIMES, SET_INLINED_TIMES, cgraph_inlined_into, cgraph_inlined_callees): Kill. (cgraph_remove_unreachable_nodes): Verify cgraph; update handling of clones. (estimate_growth): Simplify. (cgraph_clone_inlined_nodes): New function. (cgraph_mark_inline_edge): Re-implement. (cgraph_mark_inline): Likewise. (cgraph_check_inline_limits): Simplify. (cgraph_recursive_inlining_p): New. (update_callee_keys): Break out from ... (cgraph_decide_inlining_of_small_functions): ... here; simplify. (cgraph_decide_inlining, cgraph_decide_inlining_incrementally): Likewise. (cgraph_expand_all_functions): Remove inline clones from the ordered list. (cgraph_preserve_function_body_p): New predicate. (cgraph_optimize): Verify cgraph. * function.h (struct function): Add fields saved_tree/saved_args. * timevar.def (TV_CGRAPH_VERIFY): Use verifier. * toplev.c (rest_of_compilation): Do not free cfun. * tree-inline.c: Include function.h (struct inline_data): Add saving_p field; replace decl/current_decl by node/current_node. (insert_decl_map): New function. (copy_body_r): Handle saving; update cgraph datastructure. (copy_body): Handle recursive inlining. (initialize_inlined_parameters): Likewise. (expand_call_inline): Propagate node attributes; update cgraph. (optimize_inline_calls): Verify that datastructure still match. (save_body): New function. * tree-inline.h (save_body): New. * tree-optimize.c (tree_rest_of_compilation): preserve function body; do inlining. * langhooks-def.c (LANG_HOOKS_UPDATE_DECL_AFTER_SAVING): New. * langhooks.c (lang_hooks): Add update_decl_after_saving. * cp-lang. (LANG_HOOKS_UPDATE_DECL_AFTER_SAVING): Define. * cp-tree.h (cp_update_decl_after_saving): Declare. * tree.c (cp_update_decl_after_saving): Define. * Make-lang.in (com.o): Add dependnecy on function.h * com.c: Include function.h (finish_function): Clear DECL_STRUCT_FUNCTION. * utils.c: Include function.h (end_subprog_body): Clear DECL_STRUCT_FUNCTION. From-SVN: r80334
Diffstat (limited to 'gcc/tree-optimize.c')
-rw-r--r--gcc/tree-optimize.c64
1 files changed, 61 insertions, 3 deletions
diff --git a/gcc/tree-optimize.c b/gcc/tree-optimize.c
index b1be8b0..f946593 100644
--- a/gcc/tree-optimize.c
+++ b/gcc/tree-optimize.c
@@ -96,6 +96,7 @@ void
tree_rest_of_compilation (tree fndecl, bool nested_p)
{
location_t saved_loc;
+ struct cgraph_node *node, *saved_node = NULL;
timevar_push (TV_EXPAND);
@@ -118,6 +119,39 @@ tree_rest_of_compilation (tree fndecl, bool nested_p)
immediate_size_expand = 0;
cfun->x_dont_save_pending_sizes_p = 1;
+ node = cgraph_node (fndecl);
+
+ /* We might need the body of this function so that we can expand
+ it inline somewhere else. This means not lowering some constructs
+ such as exception handling. */
+ if (cgraph_preserve_function_body_p (fndecl))
+ {
+ if (!flag_unit_at_a_time)
+ {
+ struct cgraph_edge *e;
+
+ saved_node = cgraph_clone_node (node);
+ for (e = saved_node->callees; e; e = e->next_callee)
+ if (!e->inline_failed)
+ cgraph_clone_inlined_nodes (e, true);
+ }
+ cfun->saved_tree = save_body (fndecl, &cfun->saved_args);
+ }
+
+ if (flag_inline_trees)
+ {
+ struct cgraph_edge *e;
+ for (e = node->callees; e; e = e->next_callee)
+ if (!e->inline_failed || warn_inline)
+ break;
+ if (e)
+ {
+ timevar_push (TV_INTEGRATION);
+ optimize_inline_calls (fndecl);
+ timevar_pop (TV_INTEGRATION);
+ }
+ }
+
/* If the function has a variably modified type, there may be
SAVE_EXPRs in the parameter types. Their context must be set to
refer to this function; they cannot be expanded in the containing
@@ -167,6 +201,7 @@ tree_rest_of_compilation (tree fndecl, bool nested_p)
/* Run the optimizers and output the assembler code for this function. */
rest_of_compilation (fndecl);
+
/* Undo the GC context switch. */
if (nested_p)
ggc_pop_context ();
@@ -205,11 +240,31 @@ tree_rest_of_compilation (tree fndecl, bool nested_p)
walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl),
clear_decl_rtl,
fndecl);
- if (!cgraph_function_possibly_inlined_p (fndecl))
+ /* Restore original body if still needed. */
+ if (cfun->saved_tree)
+ {
+ DECL_SAVED_TREE (fndecl) = cfun->saved_tree;
+ DECL_ARGUMENTS (fndecl) = cfun->saved_args;
+
+ /* When not in unit-at-a-time mode, we must preserve out of line copy
+ representing node before inlining. Restore original outgoing edges
+ using clone we created earlier. */
+ if (!flag_unit_at_a_time)
+ {
+ struct cgraph_edge *e;
+ while (node->callees)
+ cgraph_remove_edge (node->callees);
+ node->callees = saved_node->callees;
+ saved_node->callees = NULL;
+ for (e = saved_node->callees; e; e = e->next_callee)
+ e->caller = node;
+ cgraph_remove_node (saved_node);
+ }
+ }
+ else
{
DECL_SAVED_TREE (fndecl) = NULL;
- if (DECL_STRUCT_FUNCTION (fndecl) == 0
- && !cgraph_node (fndecl)->origin)
+ if (cgraph_node (fndecl)->origin)
{
/* Stop pointing to the local nodes about to be freed.
But DECL_INITIAL must remain nonzero so we know this
@@ -220,6 +275,9 @@ tree_rest_of_compilation (tree fndecl, bool nested_p)
DECL_INITIAL (fndecl) = error_mark_node;
}
}
+ free_after_compilation (cfun);
+ cfun = 0;
+ DECL_STRUCT_FUNCTION (fndecl) = 0;
input_location = saved_loc;