/* Top-level control of tree optimizations.
- Copyright 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
+ Copyright 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009
+ Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 2, or (at your option)
+the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful,
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING. If not, write to
-the Free Software Foundation, 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA. */
+along with GCC; see the file COPYING3. If not see
+<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "tree-inline.h"
#include "tree-mudflap.h"
#include "tree-pass.h"
-#include "tree-alias-common.h"
#include "ggc.h"
#include "cgraph.h"
+#include "graph.h"
+#include "cfgloop.h"
+#include "except.h"
-/* Global variables used to communicate with passes. */
-int dump_flags;
-bitmap vars_to_rename;
-bool in_gimple_form;
+/* Gate: execute, or not, all of the non-trivial optimizations. */
-/* The root of the compilation pass tree, once constructed. */
-static struct tree_opt_pass *all_passes;
+static bool
+gate_all_optimizations (void)
+{
+ return (optimize >= 1
+ /* Don't bother doing anything if the program has errors.
+ We have to pass down the queue if we already went into SSA */
+ && (!(errorcount || sorrycount) || gimple_in_ssa_p (cfun)));
+}
-/* Pass: gimplify the function if it's not been done. */
+struct gimple_opt_pass pass_all_optimizations =
+{
+ {
+ GIMPLE_PASS,
+ NULL, /* name */
+ gate_all_optimizations, /* gate */
+ NULL, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ TV_NONE, /* tv_id */
+ 0, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ 0 /* todo_flags_finish */
+ }
+};
+
+/* Gate: execute, or not, all of the non-trivial optimizations. */
-static void
-execute_gimple (void)
+static bool
+gate_all_early_local_passes (void)
{
- /* We have this test here rather than as the gate because we always
- want to dump the original gimplified function. */
- if (!lang_hooks.gimple_before_inlining)
- gimplify_function_tree (current_function_decl);
+ /* Don't bother doing anything if the program has errors. */
+ return (!errorcount && !sorrycount);
}
-static struct tree_opt_pass pass_gimple =
+struct simple_ipa_opt_pass pass_early_local_passes =
{
- "gimple", /* name */
- NULL, /* gate */
- execute_gimple, /* execute */
+ {
+ SIMPLE_IPA_PASS,
+ "early_local_cleanups", /* name */
+ gate_all_early_local_passes, /* gate */
+ NULL, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
- 0, /* tv_id */
+ TV_NONE, /* tv_id */
0, /* properties_required */
- PROP_gimple_any, /* properties_provided */
+ 0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
- TODO_dump_func /* todo_flags_finish */
+ TODO_remove_functions /* todo_flags_finish */
+ }
};
+static unsigned int
+execute_early_local_optimizations (void)
+{
+ /* First time we start with early optimization we need to advance
+ cgraph state so newly inserted functions are also early optimized.
+ However we execute early local optimizations for lately inserted
+ functions, in that case don't reset cgraph state back to IPA_SSA. */
+ if (cgraph_state < CGRAPH_STATE_IPA_SSA)
+ cgraph_state = CGRAPH_STATE_IPA_SSA;
+ return 0;
+}
+
/* Gate: execute, or not, all of the non-trivial optimizations. */
static bool
-gate_all_optimizations (void)
+gate_all_early_optimizations (void)
{
return (optimize >= 1
/* Don't bother doing anything if the program has errors. */
&& !(errorcount || sorrycount));
}
-static struct tree_opt_pass pass_all_optimizations =
+struct gimple_opt_pass pass_all_early_optimizations =
{
- NULL, /* name */
- gate_all_optimizations, /* gate */
- NULL, /* execute */
+ {
+ GIMPLE_PASS,
+ "early_optimizations", /* name */
+ gate_all_early_optimizations, /* gate */
+ execute_early_local_optimizations, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
- 0, /* tv_id */
+ TV_NONE, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0 /* todo_flags_finish */
+ }
};
-/* Pass: do the actions required to finish with tree-ssa optimization
- passes. */
+/* Pass: cleanup the CFG just before expanding trees to RTL.
+ This is just a round of label cleanups and case node grouping
+ because after the tree optimizers have run such cleanups may
+ be necessary. */
-static void
-execute_free_datastructures (void)
+static unsigned int
+execute_cleanup_cfg_pre_ipa (void)
{
- tree *chain;
-
- /* ??? This isn't the right place for this. Worse, it got computed
- more or less at random in various passes. */
- free_dominance_info (CDI_DOMINATORS);
+ cleanup_tree_cfg ();
+ return 0;
+}
- /* Emit gotos for implicit jumps. */
- disband_implicit_edges ();
+struct gimple_opt_pass pass_cleanup_cfg =
+{
+ {
+ GIMPLE_PASS,
+ "cleanup_cfg", /* name */
+ NULL, /* gate */
+ execute_cleanup_cfg_pre_ipa, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ TV_NONE, /* tv_id */
+ PROP_cfg, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ TODO_dump_func /* todo_flags_finish */
+ }
+};
- /* Remove the ssa structures. Do it here since this includes statement
- annotations that need to be intact during disband_implicit_edges. */
- delete_tree_ssa ();
- /* Re-chain the statements from the blocks. */
- chain = &DECL_SAVED_TREE (current_function_decl);
- *chain = alloc_stmt_list ();
+/* Pass: cleanup the CFG just before expanding trees to RTL.
+ This is just a round of label cleanups and case node grouping
+ because after the tree optimizers have run such cleanups may
+ be necessary. */
- /* And get rid of annotations we no longer need. */
- delete_tree_cfg_annotations ();
+static unsigned int
+execute_cleanup_cfg_post_optimizing (void)
+{
+ fold_cond_expr_cond ();
+ cleanup_tree_cfg ();
+ cleanup_dead_labels ();
+ group_case_labels ();
+ return 0;
}
-static struct tree_opt_pass pass_free_datastructures =
+struct gimple_opt_pass pass_cleanup_cfg_post_optimizing =
{
- NULL, /* name */
+ {
+ GIMPLE_PASS,
+ "final_cleanup", /* name */
NULL, /* gate */
- execute_free_datastructures, /* execute */
+ execute_cleanup_cfg_post_optimizing, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
- 0, /* tv_id */
+ TV_NONE, /* tv_id */
PROP_cfg, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
- 0 /* todo_flags_finish */
+ TODO_dump_func /* todo_flags_finish */
+ }
};
+/* Pass: do the actions required to finish with tree-ssa optimization
+ passes. */
-/* Do the actions required to initialize internal data structures used
- in tree-ssa optimization passes. */
-
-static void
-execute_init_datastructures (void)
+static unsigned int
+execute_free_datastructures (void)
{
- /* Allocate hash tables, arrays and other structures. */
- init_tree_ssa ();
+ free_dominance_info (CDI_DOMINATORS);
+ free_dominance_info (CDI_POST_DOMINATORS);
+
+ /* Remove the ssa structures. */
+ if (cfun->gimple_df)
+ delete_tree_ssa ();
+ return 0;
}
-static struct tree_opt_pass pass_init_datastructures =
+struct gimple_opt_pass pass_free_datastructures =
{
+ {
+ GIMPLE_PASS,
NULL, /* name */
NULL, /* gate */
- execute_init_datastructures, /* execute */
+ execute_free_datastructures, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
- 0, /* tv_id */
+ TV_NONE, /* tv_id */
PROP_cfg, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0 /* todo_flags_finish */
+ }
};
+/* Pass: free cfg annotations. */
-/* Iterate over the pass tree allocating dump file numbers. We want
- to do this depth first, and independent of whether the pass is
- enabled or not. */
-
-static void
-register_one_dump_file (struct tree_opt_pass *pass)
+static unsigned int
+execute_free_cfg_annotations (void)
{
- char *dot_name, *flag_name;
- char num[10];
-
- if (!pass->name)
- return;
-
- /* See below in dup_pass_1. */
- num[0] = '\0';
- if (pass->static_pass_number)
- sprintf (num, "%d", ((int) pass->static_pass_number < 0
- ? 1 : pass->static_pass_number));
-
- dot_name = concat (".", pass->name, num, NULL);
- flag_name = concat ("tree-", pass->name, num, NULL);
+ /* And get rid of annotations we no longer need. */
+ delete_tree_cfg_annotations ();
- pass->static_pass_number = dump_register (dot_name, flag_name);
+ return 0;
}
-static int
-register_dump_files (struct tree_opt_pass *pass, int properties)
+struct gimple_opt_pass pass_free_cfg_annotations =
{
- do
- {
- /* Verify that all required properties are present. */
- if (pass->properties_required & ~properties)
- abort ();
-
- if (pass->properties_destroyed & pass->properties_provided)
- abort ();
-
- pass->properties_required = properties;
- pass->properties_provided = properties =
- (properties | pass->properties_provided) & ~pass->properties_destroyed;
-
- if (properties & PROP_trees)
- register_one_dump_file (pass);
- if (pass->sub)
- properties = register_dump_files (pass->sub, properties);
- pass = pass->next;
- }
- while (pass);
+ {
+ GIMPLE_PASS,
+ NULL, /* name */
+ NULL, /* gate */
+ execute_free_cfg_annotations, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ TV_NONE, /* tv_id */
+ PROP_cfg, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ 0 /* todo_flags_finish */
+ }
+};
- return properties;
-}
+/* Pass: fixup_cfg. IPA passes, compilation of earlier functions or inlining
+ might have changed some properties, such as marked functions nothrow.
+ Remove redundant edges and basic blocks, and create new ones if necessary.
-/* Duplicate a pass that's to be run more than once. */
+ This pass can't be executed as stand alone pass from pass manager, because
+ in between inlining and this fixup the verify_flow_info would fail. */
-static struct tree_opt_pass *
-dup_pass_1 (struct tree_opt_pass *pass)
+unsigned int
+execute_fixup_cfg (void)
{
- struct tree_opt_pass *new;
-
- new = xmalloc (sizeof (*new));
- memcpy (new, pass, sizeof (*new));
-
- /* Indicate to register_dump_files that this pass has duplicates,
- and so it should rename the dump file. The first instance will
- be < 0, and be number of duplicates = -static_pass_number + 1.
- Subsequent instances will be > 0 and just the duplicate number. */
- if (pass->name)
- {
- int n, p = pass->static_pass_number;
-
- if (p)
- n = -(--p) + 1;
- else
- n = 2, p = -1;
-
- pass->static_pass_number = p;
- new->static_pass_number = n;
- }
+ basic_block bb;
+ gimple_stmt_iterator gsi;
+ int todo = gimple_in_ssa_p (cfun) ? TODO_verify_ssa : 0;
+
+ if (cfun->eh)
+ FOR_EACH_BB (bb)
+ {
+ for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
+ {
+ gimple stmt = gsi_stmt (gsi);
+ tree decl = is_gimple_call (stmt)
+ ? gimple_call_fndecl (stmt)
+ : NULL;
+
+ if (decl
+ && gimple_call_flags (stmt) & (ECF_CONST
+ | ECF_PURE
+ | ECF_LOOPING_CONST_OR_PURE))
+ {
+ if (gimple_in_ssa_p (cfun))
+ {
+ todo |= TODO_update_ssa | TODO_cleanup_cfg;
+ mark_symbols_for_renaming (stmt);
+ update_stmt (stmt);
+ }
+ }
+
+ if (!stmt_could_throw_p (stmt) && lookup_stmt_eh_region (stmt))
+ remove_stmt_from_eh_region (stmt);
+ }
+
+ if (gimple_purge_dead_eh_edges (bb))
+ todo |= TODO_cleanup_cfg;
+ }
+
+ /* Dump a textual representation of the flowgraph. */
+ if (dump_file)
+ gimple_dump_cfg (dump_file, dump_flags);
- return new;
+ return todo;
}
-/* Construct the pass tree. */
-
-void
-init_tree_optimization_passes (void)
+struct gimple_opt_pass pass_fixup_cfg =
{
- struct tree_opt_pass **p;
-
-#define NEXT_PASS(PASS) (*p = &PASS, p = &(*p)->next)
-#define DUP_PASS(PASS) (*dup_pass_1 (&PASS))
-
- p = &all_passes;
- NEXT_PASS (pass_gimple);
- NEXT_PASS (pass_remove_useless_stmts);
- NEXT_PASS (pass_mudflap_1);
- NEXT_PASS (pass_lower_cf);
- NEXT_PASS (pass_lower_eh);
- NEXT_PASS (pass_build_cfg);
- NEXT_PASS (pass_tree_profile);
- NEXT_PASS (pass_init_datastructures);
- NEXT_PASS (pass_all_optimizations);
- NEXT_PASS (pass_mudflap_2);
- NEXT_PASS (pass_free_datastructures);
- NEXT_PASS (pass_expand);
- NEXT_PASS (pass_rest_of_compilation);
- *p = NULL;
-
- p = &pass_all_optimizations.sub;
- NEXT_PASS (pass_referenced_vars);
- NEXT_PASS (pass_build_pta);
- NEXT_PASS (pass_build_ssa);
- NEXT_PASS (pass_rename_ssa_copies);
- NEXT_PASS (pass_early_warn_uninitialized);
- NEXT_PASS (pass_dce);
- NEXT_PASS (pass_dominator);
- NEXT_PASS (pass_redundant_phi);
- NEXT_PASS (DUP_PASS (pass_dce));
- NEXT_PASS (pass_forwprop);
- NEXT_PASS (pass_phiopt);
- NEXT_PASS (pass_may_alias);
- NEXT_PASS (pass_tail_recursion);
- NEXT_PASS (pass_ch);
- NEXT_PASS (pass_del_pta);
- NEXT_PASS (pass_profile);
- NEXT_PASS (pass_lower_complex);
- NEXT_PASS (pass_sra);
- NEXT_PASS (DUP_PASS (pass_rename_ssa_copies));
- NEXT_PASS (DUP_PASS (pass_dominator));
- NEXT_PASS (DUP_PASS (pass_redundant_phi));
- NEXT_PASS (DUP_PASS (pass_dce));
- NEXT_PASS (pass_dse);
- NEXT_PASS (DUP_PASS (pass_forwprop));
- NEXT_PASS (DUP_PASS (pass_phiopt));
- NEXT_PASS (pass_ccp);
- NEXT_PASS (DUP_PASS (pass_redundant_phi));
- NEXT_PASS (pass_fold_builtins);
- NEXT_PASS (pass_split_crit_edges);
- NEXT_PASS (pass_pre);
- NEXT_PASS (DUP_PASS (pass_dominator));
- NEXT_PASS (DUP_PASS (pass_redundant_phi));
- NEXT_PASS (pass_cd_dce);
- NEXT_PASS (DUP_PASS (pass_dse));
- NEXT_PASS (DUP_PASS (pass_forwprop));
- NEXT_PASS (DUP_PASS (pass_phiopt));
- NEXT_PASS (pass_tail_calls);
- NEXT_PASS (pass_late_warn_uninitialized);
- NEXT_PASS (pass_warn_function_return);
- NEXT_PASS (pass_del_ssa);
- NEXT_PASS (pass_nrv);
- NEXT_PASS (pass_remove_useless_vars);
- *p = NULL;
-
-#undef NEXT_PASS
-#undef DUP_PASS
-
- /* Register the passes with the tree dump code. */
- register_dump_files (all_passes, 0);
-}
-
-static void execute_pass_list (struct tree_opt_pass *);
+ {
+ GIMPLE_PASS,
+ NULL, /* name */
+ NULL, /* gate */
+ execute_fixup_cfg, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ TV_NONE, /* tv_id */
+ PROP_cfg, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ 0 /* todo_flags_finish */
+ }
+};
-static unsigned int last_verified;
+/* Do the actions required to initialize internal data structures used
+ in tree-ssa optimization passes. */
-static void
-execute_todo (unsigned int flags)
+static unsigned int
+execute_init_datastructures (void)
{
- if (flags & TODO_rename_vars)
- {
- if (bitmap_first_set_bit (vars_to_rename) >= 0)
- rewrite_into_ssa ();
- BITMAP_XFREE (vars_to_rename);
- }
-
- if ((flags & TODO_dump_func) && dump_file)
- dump_function_to_file (current_function_decl,
- dump_file, dump_flags);
-
- if (flags & TODO_ggc_collect)
- ggc_collect ();
-
-#ifdef ENABLE_CHECKING
- if (flags & TODO_verify_ssa)
- verify_ssa ();
- if (flags & TODO_verify_flow)
- verify_flow_info ();
- if (flags & TODO_verify_stmts)
- verify_stmts ();
-#endif
+ /* Allocate hash tables, arrays and other structures. */
+ init_tree_ssa (cfun);
+ return 0;
}
-static bool
-execute_one_pass (struct tree_opt_pass *pass)
+struct gimple_opt_pass pass_init_datastructures =
{
- unsigned int todo;
-
- /* See if we're supposed to run this pass. */
- if (pass->gate && !pass->gate ())
- return false;
-
- /* Note that the folders should only create gimple expressions.
- This is a hack until the new folder is ready. */
- in_gimple_form = (pass->properties_provided & PROP_trees) != 0;
-
- /* Run pre-pass verification. */
- todo = pass->todo_flags_start & ~last_verified;
- if (todo)
- execute_todo (todo);
-
- /* If a dump file name is present, open it if enabled. */
- if (pass->static_pass_number)
- {
- dump_file = dump_begin (pass->static_pass_number, &dump_flags);
- if (dump_file)
- {
- const char *dname, *aname;
- dname = lang_hooks.decl_printable_name (current_function_decl, 2);
- aname = (IDENTIFIER_POINTER
- (DECL_ASSEMBLER_NAME (current_function_decl)));
- fprintf (dump_file, "\n;; Function %s (%s)\n\n", dname, aname);
- }
- }
-
- /* If a timevar is present, start it. */
- if (pass->tv_id)
- timevar_push (pass->tv_id);
-
- /* If the pass is requesting ssa variable renaming, allocate the bitmap. */
- if (pass->todo_flags_finish & TODO_rename_vars)
- vars_to_rename = BITMAP_XMALLOC ();
-
- /* Do it! */
- if (pass->execute)
- pass->execute ();
-
- /* Run post-pass cleanup and verification. */
- todo = pass->todo_flags_finish;
- last_verified = todo & TODO_verify_all;
- if (todo)
- execute_todo (todo);
-
- /* Close down timevar and dump file. */
- if (pass->tv_id)
- timevar_pop (pass->tv_id);
- if (dump_file)
- {
- dump_end (pass->static_pass_number, dump_file);
- dump_file = NULL;
- }
-
- return true;
-}
+ {
+ GIMPLE_PASS,
+ NULL, /* name */
+ NULL, /* gate */
+ execute_init_datastructures, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ TV_NONE, /* tv_id */
+ PROP_cfg, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ 0 /* todo_flags_finish */
+ }
+};
-static void
-execute_pass_list (struct tree_opt_pass *pass)
+void
+tree_lowering_passes (tree fn)
{
- do
- {
- if (execute_one_pass (pass) && pass->sub)
- execute_pass_list (pass->sub);
- pass = pass->next;
- }
- while (pass);
+ tree saved_current_function_decl = current_function_decl;
+
+ current_function_decl = fn;
+ push_cfun (DECL_STRUCT_FUNCTION (fn));
+ gimple_register_cfg_hooks ();
+ bitmap_obstack_initialize (NULL);
+ execute_pass_list (all_lowering_passes);
+ if (optimize && cgraph_global_info_ready)
+ execute_pass_list (pass_early_local_passes.pass.sub);
+ free_dominance_info (CDI_POST_DOMINATORS);
+ free_dominance_info (CDI_DOMINATORS);
+ compact_blocks ();
+ current_function_decl = saved_current_function_decl;
+ bitmap_obstack_release (NULL);
+ pop_cfun ();
}
-
\f
/* For functions-as-trees languages, this performs all optimization and
compilation for FNDECL. */
void
-tree_rest_of_compilation (tree fndecl, bool nested_p)
+tree_rest_of_compilation (tree fndecl)
{
location_t saved_loc;
- struct cgraph_node *saved_node = NULL, *node;
+ struct cgraph_node *node;
timevar_push (TV_EXPAND);
- if (flag_unit_at_a_time && !cgraph_global_info_ready)
- abort ();
+ gcc_assert (cgraph_global_info_ready);
+
+ node = cgraph_node (fndecl);
+
+ /* Initialize the default bitmap obstack. */
+ bitmap_obstack_initialize (NULL);
/* Initialize the RTL code for the function. */
current_function_decl = fndecl;
input_location = DECL_SOURCE_LOCATION (fndecl);
init_function_start (fndecl);
- /* This function is being processed in whole-function mode. */
- cfun->x_whole_function_mode_p = 1;
-
/* Even though we're inside a function body, we still don't want to
call expand_expr to calculate the size of a variable-sized array.
We haven't necessarily assigned RTL to all variables yet, so it's
not safe to try to expand expressions involving them. */
- 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 this is a nested function, protect the local variables in the stack
- above us from being collected while we're compiling this function. */
- if (nested_p)
- ggc_push_context ();
+ cfun->dont_save_pending_sizes_p = 1;
+
+ gimple_register_cfg_hooks ();
+ bitmap_obstack_initialize (®_obstack); /* FIXME, only at RTL generation*/
/* Perform all tree transforms and optimizations. */
execute_pass_list (all_passes);
+
+ bitmap_obstack_release (®_obstack);
- /* 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;
- cfun = 0;
+ /* Release the default bitmap obstack. */
+ bitmap_obstack_release (NULL);
+
+ set_cfun (NULL);
/* If requested, warn about function definitions where the function will
return a value (usually of some struct or union type) which itself will
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type));
if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0)
- warning ("%Jsize of return value of '%D' is %u bytes",
- fndecl, fndecl, size_as_int);
+ warning (OPT_Wlarger_than_eq, "size of return value of %q+D is %u bytes",
+ fndecl, size_as_int);
else
- warning ("%Jsize of return value of '%D' is larger than %wd bytes",
- fndecl, fndecl, larger_than_size);
+ warning (OPT_Wlarger_than_eq, "size of return value of %q+D is larger than %wd bytes",
+ fndecl, larger_than_size);
}
}
- if (!nested_p && !flag_inline_trees)
+ gimple_set_body (fndecl, NULL);
+ if (DECL_STRUCT_FUNCTION (fndecl) == 0
+ && !cgraph_node (fndecl)->origin)
{
- DECL_SAVED_TREE (fndecl) = NULL;
- if (DECL_STRUCT_FUNCTION (fndecl) == 0
- && !cgraph_node (fndecl)->origin)
- {
- /* Stop pointing to the local nodes about to be freed.
- But DECL_INITIAL must remain nonzero so we know this
- was an actual function definition.
- For a nested function, this is done in c_pop_function_context.
- If rest_of_compilation set this to 0, leave it 0. */
- if (DECL_INITIAL (fndecl) != 0)
- DECL_INITIAL (fndecl) = error_mark_node;
- }
+ /* Stop pointing to the local nodes about to be freed.
+ But DECL_INITIAL must remain nonzero so we know this
+ was an actual function definition.
+ For a nested function, this is done in c_pop_function_context.
+ If rest_of_compilation set this to 0, leave it 0. */
+ if (DECL_INITIAL (fndecl) != 0)
+ DECL_INITIAL (fndecl) = error_mark_node;
}
input_location = saved_loc;
ggc_collect ();
-
- /* Undo the GC context switch. */
- if (nested_p)
- ggc_pop_context ();
timevar_pop (TV_EXPAND);
}