/* Top-level control of tree optimizations.
|
/* Top-level control of tree optimizations.
|
Copyright 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009
|
Copyright 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
Contributed by Diego Novillo <dnovillo@redhat.com>
|
Contributed by Diego Novillo <dnovillo@redhat.com>
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify
|
GCC is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3, or (at your option)
|
the Free Software Foundation; either version 3, or (at your option)
|
any later version.
|
any later version.
|
|
|
GCC is distributed in the hope that it will be useful,
|
GCC is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "tree.h"
|
#include "tree.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "tm_p.h"
|
#include "tm_p.h"
|
#include "hard-reg-set.h"
|
#include "hard-reg-set.h"
|
#include "basic-block.h"
|
#include "basic-block.h"
|
#include "output.h"
|
#include "output.h"
|
#include "expr.h"
|
#include "expr.h"
|
#include "diagnostic.h"
|
#include "diagnostic.h"
|
#include "basic-block.h"
|
#include "basic-block.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "tree-flow.h"
|
#include "tree-flow.h"
|
#include "tree-dump.h"
|
#include "tree-dump.h"
|
#include "timevar.h"
|
#include "timevar.h"
|
#include "function.h"
|
#include "function.h"
|
#include "langhooks.h"
|
#include "langhooks.h"
|
#include "toplev.h"
|
#include "toplev.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "cgraph.h"
|
#include "cgraph.h"
|
#include "tree-inline.h"
|
#include "tree-inline.h"
|
#include "tree-mudflap.h"
|
#include "tree-mudflap.h"
|
#include "tree-pass.h"
|
#include "tree-pass.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
#include "cgraph.h"
|
#include "cgraph.h"
|
#include "graph.h"
|
#include "graph.h"
|
#include "cfgloop.h"
|
#include "cfgloop.h"
|
#include "except.h"
|
#include "except.h"
|
#include "plugin.h"
|
#include "plugin.h"
|
|
|
|
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
|
|
static bool
|
static bool
|
gate_all_optimizations (void)
|
gate_all_optimizations (void)
|
{
|
{
|
return (optimize >= 1
|
return (optimize >= 1
|
/* Don't bother doing anything if the program has errors.
|
/* Don't bother doing anything if the program has errors.
|
We have to pass down the queue if we already went into SSA */
|
We have to pass down the queue if we already went into SSA */
|
&& (!(errorcount || sorrycount) || gimple_in_ssa_p (cfun)));
|
&& (!(errorcount || sorrycount) || gimple_in_ssa_p (cfun)));
|
}
|
}
|
|
|
struct gimple_opt_pass pass_all_optimizations =
|
struct gimple_opt_pass pass_all_optimizations =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"*all_optimizations", /* name */
|
"*all_optimizations", /* name */
|
gate_all_optimizations, /* gate */
|
gate_all_optimizations, /* gate */
|
NULL, /* execute */
|
NULL, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0 /* todo_flags_finish */
|
0 /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
|
|
static bool
|
static bool
|
gate_all_early_local_passes (void)
|
gate_all_early_local_passes (void)
|
{
|
{
|
/* Don't bother doing anything if the program has errors. */
|
/* Don't bother doing anything if the program has errors. */
|
return (!errorcount && !sorrycount && !in_lto_p);
|
return (!errorcount && !sorrycount && !in_lto_p);
|
}
|
}
|
|
|
struct simple_ipa_opt_pass pass_early_local_passes =
|
struct simple_ipa_opt_pass pass_early_local_passes =
|
{
|
{
|
{
|
{
|
SIMPLE_IPA_PASS,
|
SIMPLE_IPA_PASS,
|
"early_local_cleanups", /* name */
|
"early_local_cleanups", /* name */
|
gate_all_early_local_passes, /* gate */
|
gate_all_early_local_passes, /* gate */
|
NULL, /* execute */
|
NULL, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
TODO_remove_functions /* todo_flags_finish */
|
TODO_remove_functions /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
static unsigned int
|
static unsigned int
|
execute_early_local_optimizations (void)
|
execute_early_local_optimizations (void)
|
{
|
{
|
/* First time we start with early optimization we need to advance
|
/* First time we start with early optimization we need to advance
|
cgraph state so newly inserted functions are also early optimized.
|
cgraph state so newly inserted functions are also early optimized.
|
However we execute early local optimizations for lately inserted
|
However we execute early local optimizations for lately inserted
|
functions, in that case don't reset cgraph state back to IPA_SSA. */
|
functions, in that case don't reset cgraph state back to IPA_SSA. */
|
if (cgraph_state < CGRAPH_STATE_IPA_SSA)
|
if (cgraph_state < CGRAPH_STATE_IPA_SSA)
|
cgraph_state = CGRAPH_STATE_IPA_SSA;
|
cgraph_state = CGRAPH_STATE_IPA_SSA;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
/* Gate: execute, or not, all of the non-trivial optimizations. */
|
|
|
static bool
|
static bool
|
gate_all_early_optimizations (void)
|
gate_all_early_optimizations (void)
|
{
|
{
|
return (optimize >= 1
|
return (optimize >= 1
|
/* Don't bother doing anything if the program has errors. */
|
/* Don't bother doing anything if the program has errors. */
|
&& !(errorcount || sorrycount));
|
&& !(errorcount || sorrycount));
|
}
|
}
|
|
|
struct gimple_opt_pass pass_all_early_optimizations =
|
struct gimple_opt_pass pass_all_early_optimizations =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"early_optimizations", /* name */
|
"early_optimizations", /* name */
|
gate_all_early_optimizations, /* gate */
|
gate_all_early_optimizations, /* gate */
|
execute_early_local_optimizations, /* execute */
|
execute_early_local_optimizations, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
0, /* properties_required */
|
0, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0 /* todo_flags_finish */
|
0 /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
/* Pass: cleanup the CFG just before expanding trees to RTL.
|
/* Pass: cleanup the CFG just before expanding trees to RTL.
|
This is just a round of label cleanups and case node grouping
|
This is just a round of label cleanups and case node grouping
|
because after the tree optimizers have run such cleanups may
|
because after the tree optimizers have run such cleanups may
|
be necessary. */
|
be necessary. */
|
|
|
static unsigned int
|
static unsigned int
|
execute_cleanup_cfg_pre_ipa (void)
|
execute_cleanup_cfg_pre_ipa (void)
|
{
|
{
|
cleanup_tree_cfg ();
|
cleanup_tree_cfg ();
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct gimple_opt_pass pass_cleanup_cfg =
|
struct gimple_opt_pass pass_cleanup_cfg =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"cleanup_cfg", /* name */
|
"cleanup_cfg", /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
execute_cleanup_cfg_pre_ipa, /* execute */
|
execute_cleanup_cfg_pre_ipa, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
PROP_cfg, /* properties_required */
|
PROP_cfg, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
TODO_dump_func /* todo_flags_finish */
|
TODO_dump_func /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
|
|
/* Pass: cleanup the CFG just before expanding trees to RTL.
|
/* Pass: cleanup the CFG just before expanding trees to RTL.
|
This is just a round of label cleanups and case node grouping
|
This is just a round of label cleanups and case node grouping
|
because after the tree optimizers have run such cleanups may
|
because after the tree optimizers have run such cleanups may
|
be necessary. */
|
be necessary. */
|
|
|
static unsigned int
|
static unsigned int
|
execute_cleanup_cfg_post_optimizing (void)
|
execute_cleanup_cfg_post_optimizing (void)
|
{
|
{
|
fold_cond_expr_cond ();
|
fold_cond_expr_cond ();
|
cleanup_tree_cfg ();
|
cleanup_tree_cfg ();
|
cleanup_dead_labels ();
|
cleanup_dead_labels ();
|
group_case_labels ();
|
group_case_labels ();
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct gimple_opt_pass pass_cleanup_cfg_post_optimizing =
|
struct gimple_opt_pass pass_cleanup_cfg_post_optimizing =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"optimized", /* name */
|
"optimized", /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
execute_cleanup_cfg_post_optimizing, /* execute */
|
execute_cleanup_cfg_post_optimizing, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
PROP_cfg, /* properties_required */
|
PROP_cfg, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
TODO_dump_func /* todo_flags_finish */
|
TODO_dump_func /* todo_flags_finish */
|
| TODO_remove_unused_locals
|
| TODO_remove_unused_locals
|
}
|
}
|
};
|
};
|
|
|
/* Pass: do the actions required to finish with tree-ssa optimization
|
/* Pass: do the actions required to finish with tree-ssa optimization
|
passes. */
|
passes. */
|
|
|
unsigned int
|
unsigned int
|
execute_free_datastructures (void)
|
execute_free_datastructures (void)
|
{
|
{
|
free_dominance_info (CDI_DOMINATORS);
|
free_dominance_info (CDI_DOMINATORS);
|
free_dominance_info (CDI_POST_DOMINATORS);
|
free_dominance_info (CDI_POST_DOMINATORS);
|
|
|
/* And get rid of annotations we no longer need. */
|
/* And get rid of annotations we no longer need. */
|
delete_tree_cfg_annotations ();
|
delete_tree_cfg_annotations ();
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Pass: fixup_cfg. IPA passes, compilation of earlier functions or inlining
|
/* Pass: fixup_cfg. IPA passes, compilation of earlier functions or inlining
|
might have changed some properties, such as marked functions nothrow.
|
might have changed some properties, such as marked functions nothrow.
|
Remove redundant edges and basic blocks, and create new ones if necessary.
|
Remove redundant edges and basic blocks, and create new ones if necessary.
|
|
|
This pass can't be executed as stand alone pass from pass manager, because
|
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. */
|
in between inlining and this fixup the verify_flow_info would fail. */
|
|
|
unsigned int
|
unsigned int
|
execute_fixup_cfg (void)
|
execute_fixup_cfg (void)
|
{
|
{
|
basic_block bb;
|
basic_block bb;
|
gimple_stmt_iterator gsi;
|
gimple_stmt_iterator gsi;
|
int todo = gimple_in_ssa_p (cfun) ? TODO_verify_ssa : 0;
|
int todo = gimple_in_ssa_p (cfun) ? TODO_verify_ssa : 0;
|
gcov_type count_scale;
|
gcov_type count_scale;
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
if (ENTRY_BLOCK_PTR->count)
|
if (ENTRY_BLOCK_PTR->count)
|
count_scale = (cgraph_node (current_function_decl)->count * REG_BR_PROB_BASE
|
count_scale = (cgraph_node (current_function_decl)->count * REG_BR_PROB_BASE
|
+ ENTRY_BLOCK_PTR->count / 2) / ENTRY_BLOCK_PTR->count;
|
+ ENTRY_BLOCK_PTR->count / 2) / ENTRY_BLOCK_PTR->count;
|
else
|
else
|
count_scale = REG_BR_PROB_BASE;
|
count_scale = REG_BR_PROB_BASE;
|
|
|
ENTRY_BLOCK_PTR->count = cgraph_node (current_function_decl)->count;
|
ENTRY_BLOCK_PTR->count = cgraph_node (current_function_decl)->count;
|
EXIT_BLOCK_PTR->count = (EXIT_BLOCK_PTR->count * count_scale
|
EXIT_BLOCK_PTR->count = (EXIT_BLOCK_PTR->count * count_scale
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
|
|
FOR_EACH_BB (bb)
|
FOR_EACH_BB (bb)
|
{
|
{
|
bb->count = (bb->count * count_scale
|
bb->count = (bb->count * count_scale
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
|
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
|
{
|
{
|
gimple stmt = gsi_stmt (gsi);
|
gimple stmt = gsi_stmt (gsi);
|
tree decl = is_gimple_call (stmt)
|
tree decl = is_gimple_call (stmt)
|
? gimple_call_fndecl (stmt)
|
? gimple_call_fndecl (stmt)
|
: NULL;
|
: NULL;
|
|
|
if (decl
|
if (decl
|
&& gimple_call_flags (stmt) & (ECF_CONST
|
&& gimple_call_flags (stmt) & (ECF_CONST
|
| ECF_PURE
|
| ECF_PURE
|
| ECF_LOOPING_CONST_OR_PURE))
|
| ECF_LOOPING_CONST_OR_PURE))
|
{
|
{
|
if (gimple_in_ssa_p (cfun))
|
if (gimple_in_ssa_p (cfun))
|
{
|
{
|
todo |= TODO_update_ssa | TODO_cleanup_cfg;
|
todo |= TODO_update_ssa | TODO_cleanup_cfg;
|
mark_symbols_for_renaming (stmt);
|
mark_symbols_for_renaming (stmt);
|
update_stmt (stmt);
|
update_stmt (stmt);
|
}
|
}
|
}
|
}
|
|
|
maybe_clean_eh_stmt (stmt);
|
maybe_clean_eh_stmt (stmt);
|
}
|
}
|
|
|
if (gimple_purge_dead_eh_edges (bb))
|
if (gimple_purge_dead_eh_edges (bb))
|
todo |= TODO_cleanup_cfg;
|
todo |= TODO_cleanup_cfg;
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
e->count = (e->count * count_scale
|
e->count = (e->count * count_scale
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
+ REG_BR_PROB_BASE / 2) / REG_BR_PROB_BASE;
|
}
|
}
|
if (count_scale != REG_BR_PROB_BASE)
|
if (count_scale != REG_BR_PROB_BASE)
|
compute_function_frequency ();
|
compute_function_frequency ();
|
|
|
/* Dump a textual representation of the flowgraph. */
|
/* Dump a textual representation of the flowgraph. */
|
if (dump_file)
|
if (dump_file)
|
gimple_dump_cfg (dump_file, dump_flags);
|
gimple_dump_cfg (dump_file, dump_flags);
|
|
|
return todo;
|
return todo;
|
}
|
}
|
|
|
struct gimple_opt_pass pass_fixup_cfg =
|
struct gimple_opt_pass pass_fixup_cfg =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"*free_cfg_annotations", /* name */
|
"*free_cfg_annotations", /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
execute_fixup_cfg, /* execute */
|
execute_fixup_cfg, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
PROP_cfg, /* properties_required */
|
PROP_cfg, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0 /* todo_flags_finish */
|
0 /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
/* Do the actions required to initialize internal data structures used
|
/* Do the actions required to initialize internal data structures used
|
in tree-ssa optimization passes. */
|
in tree-ssa optimization passes. */
|
|
|
static unsigned int
|
static unsigned int
|
execute_init_datastructures (void)
|
execute_init_datastructures (void)
|
{
|
{
|
/* Allocate hash tables, arrays and other structures. */
|
/* Allocate hash tables, arrays and other structures. */
|
init_tree_ssa (cfun);
|
init_tree_ssa (cfun);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct gimple_opt_pass pass_init_datastructures =
|
struct gimple_opt_pass pass_init_datastructures =
|
{
|
{
|
{
|
{
|
GIMPLE_PASS,
|
GIMPLE_PASS,
|
"*init_datastructures", /* name */
|
"*init_datastructures", /* name */
|
NULL, /* gate */
|
NULL, /* gate */
|
execute_init_datastructures, /* execute */
|
execute_init_datastructures, /* execute */
|
NULL, /* sub */
|
NULL, /* sub */
|
NULL, /* next */
|
NULL, /* next */
|
0, /* static_pass_number */
|
0, /* static_pass_number */
|
TV_NONE, /* tv_id */
|
TV_NONE, /* tv_id */
|
PROP_cfg, /* properties_required */
|
PROP_cfg, /* properties_required */
|
0, /* properties_provided */
|
0, /* properties_provided */
|
0, /* properties_destroyed */
|
0, /* properties_destroyed */
|
0, /* todo_flags_start */
|
0, /* todo_flags_start */
|
0 /* todo_flags_finish */
|
0 /* todo_flags_finish */
|
}
|
}
|
};
|
};
|
|
|
void
|
void
|
tree_lowering_passes (tree fn)
|
tree_lowering_passes (tree fn)
|
{
|
{
|
tree saved_current_function_decl = current_function_decl;
|
tree saved_current_function_decl = current_function_decl;
|
|
|
current_function_decl = fn;
|
current_function_decl = fn;
|
push_cfun (DECL_STRUCT_FUNCTION (fn));
|
push_cfun (DECL_STRUCT_FUNCTION (fn));
|
gimple_register_cfg_hooks ();
|
gimple_register_cfg_hooks ();
|
bitmap_obstack_initialize (NULL);
|
bitmap_obstack_initialize (NULL);
|
execute_pass_list (all_lowering_passes);
|
execute_pass_list (all_lowering_passes);
|
if (optimize && cgraph_global_info_ready)
|
if (optimize && cgraph_global_info_ready)
|
execute_pass_list (pass_early_local_passes.pass.sub);
|
execute_pass_list (pass_early_local_passes.pass.sub);
|
free_dominance_info (CDI_POST_DOMINATORS);
|
free_dominance_info (CDI_POST_DOMINATORS);
|
free_dominance_info (CDI_DOMINATORS);
|
free_dominance_info (CDI_DOMINATORS);
|
compact_blocks ();
|
compact_blocks ();
|
current_function_decl = saved_current_function_decl;
|
current_function_decl = saved_current_function_decl;
|
bitmap_obstack_release (NULL);
|
bitmap_obstack_release (NULL);
|
pop_cfun ();
|
pop_cfun ();
|
}
|
}
|
|
|
/* For functions-as-trees languages, this performs all optimization and
|
/* For functions-as-trees languages, this performs all optimization and
|
compilation for FNDECL. */
|
compilation for FNDECL. */
|
|
|
void
|
void
|
tree_rest_of_compilation (tree fndecl)
|
tree_rest_of_compilation (tree fndecl)
|
{
|
{
|
location_t saved_loc;
|
location_t saved_loc;
|
|
|
timevar_push (TV_EXPAND);
|
timevar_push (TV_EXPAND);
|
|
|
gcc_assert (cgraph_global_info_ready);
|
gcc_assert (cgraph_global_info_ready);
|
|
|
/* Initialize the default bitmap obstack. */
|
/* Initialize the default bitmap obstack. */
|
bitmap_obstack_initialize (NULL);
|
bitmap_obstack_initialize (NULL);
|
|
|
/* Initialize the RTL code for the function. */
|
/* Initialize the RTL code for the function. */
|
current_function_decl = fndecl;
|
current_function_decl = fndecl;
|
saved_loc = input_location;
|
saved_loc = input_location;
|
input_location = DECL_SOURCE_LOCATION (fndecl);
|
input_location = DECL_SOURCE_LOCATION (fndecl);
|
init_function_start (fndecl);
|
init_function_start (fndecl);
|
|
|
/* Even though we're inside a function body, we still don't want to
|
/* 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.
|
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
|
We haven't necessarily assigned RTL to all variables yet, so it's
|
not safe to try to expand expressions involving them. */
|
not safe to try to expand expressions involving them. */
|
cfun->dont_save_pending_sizes_p = 1;
|
cfun->dont_save_pending_sizes_p = 1;
|
|
|
gimple_register_cfg_hooks ();
|
gimple_register_cfg_hooks ();
|
|
|
bitmap_obstack_initialize (®_obstack); /* FIXME, only at RTL generation*/
|
bitmap_obstack_initialize (®_obstack); /* FIXME, only at RTL generation*/
|
|
|
execute_all_ipa_transforms ();
|
execute_all_ipa_transforms ();
|
|
|
/* Perform all tree transforms and optimizations. */
|
/* Perform all tree transforms and optimizations. */
|
|
|
/* Signal the start of passes. */
|
/* Signal the start of passes. */
|
invoke_plugin_callbacks (PLUGIN_ALL_PASSES_START, NULL);
|
invoke_plugin_callbacks (PLUGIN_ALL_PASSES_START, NULL);
|
|
|
execute_pass_list (all_passes);
|
execute_pass_list (all_passes);
|
|
|
/* Signal the end of passes. */
|
/* Signal the end of passes. */
|
invoke_plugin_callbacks (PLUGIN_ALL_PASSES_END, NULL);
|
invoke_plugin_callbacks (PLUGIN_ALL_PASSES_END, NULL);
|
|
|
bitmap_obstack_release (®_obstack);
|
bitmap_obstack_release (®_obstack);
|
|
|
/* Release the default bitmap obstack. */
|
/* Release the default bitmap obstack. */
|
bitmap_obstack_release (NULL);
|
bitmap_obstack_release (NULL);
|
|
|
set_cfun (NULL);
|
set_cfun (NULL);
|
|
|
/* If requested, warn about function definitions where the function will
|
/* If requested, warn about function definitions where the function will
|
return a value (usually of some struct or union type) which itself will
|
return a value (usually of some struct or union type) which itself will
|
take up a lot of stack space. */
|
take up a lot of stack space. */
|
if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl))
|
if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl))
|
{
|
{
|
tree ret_type = TREE_TYPE (TREE_TYPE (fndecl));
|
tree ret_type = TREE_TYPE (TREE_TYPE (fndecl));
|
|
|
if (ret_type && TYPE_SIZE_UNIT (ret_type)
|
if (ret_type && TYPE_SIZE_UNIT (ret_type)
|
&& TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST
|
&& TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST
|
&& 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type),
|
&& 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type),
|
larger_than_size))
|
larger_than_size))
|
{
|
{
|
unsigned int size_as_int
|
unsigned int size_as_int
|
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type));
|
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type));
|
|
|
if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0)
|
if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0)
|
warning (OPT_Wlarger_than_eq, "size of return value of %q+D is %u bytes",
|
warning (OPT_Wlarger_than_eq, "size of return value of %q+D is %u bytes",
|
fndecl, size_as_int);
|
fndecl, size_as_int);
|
else
|
else
|
warning (OPT_Wlarger_than_eq, "size of return value of %q+D is larger than %wd bytes",
|
warning (OPT_Wlarger_than_eq, "size of return value of %q+D is larger than %wd bytes",
|
fndecl, larger_than_size);
|
fndecl, larger_than_size);
|
}
|
}
|
}
|
}
|
|
|
gimple_set_body (fndecl, NULL);
|
gimple_set_body (fndecl, NULL);
|
if (DECL_STRUCT_FUNCTION (fndecl) == 0
|
if (DECL_STRUCT_FUNCTION (fndecl) == 0
|
&& !cgraph_node (fndecl)->origin)
|
&& !cgraph_node (fndecl)->origin)
|
{
|
{
|
/* Stop pointing to the local nodes about to be freed.
|
/* Stop pointing to the local nodes about to be freed.
|
But DECL_INITIAL must remain nonzero so we know this
|
But DECL_INITIAL must remain nonzero so we know this
|
was an actual function definition.
|
was an actual function definition.
|
For a nested function, this is done in c_pop_function_context.
|
For a nested function, this is done in c_pop_function_context.
|
If rest_of_compilation set this to 0, leave it 0. */
|
If rest_of_compilation set this to 0, leave it 0. */
|
if (DECL_INITIAL (fndecl) != 0)
|
if (DECL_INITIAL (fndecl) != 0)
|
DECL_INITIAL (fndecl) = error_mark_node;
|
DECL_INITIAL (fndecl) = error_mark_node;
|
}
|
}
|
|
|
input_location = saved_loc;
|
input_location = saved_loc;
|
|
|
ggc_collect ();
|
ggc_collect ();
|
timevar_pop (TV_EXPAND);
|
timevar_pop (TV_EXPAND);
|
}
|
}
|
|
|
