fflush (stderr);
}
- if (flag_dump_passes)
- dump_passes ();
-
/* Gimplify and lower all functions, compute reachability and
remove unreachable nodes. */
cgraph_analyze_functions ();
Common Report Var(flag_dump_noaddr)
Suppress output of addresses in debugging dumps
-fdump-passes
-Common Var(flag_dump_passes) Init(0)
-Dump optimization passes
-
fdump-unnumbered
Common Report Var(flag_dump_unnumbered)
Suppress output of instruction numbers, line number notes and addresses in debugging dumps
static bool
gate_rtl_cprop (void)
{
- return optimize > 0 && flag_gcse;
+ return optimize > 0 && flag_gcse
+ && !cfun->calls_setjmp
+ && dbg_cnt (cprop);
}
static unsigned int
execute_rtl_cprop (void)
{
int changed;
-
- if (cfun->calls_setjmp || !dbg_cnt (cprop))
- return 0;
-
delete_unreachable_blocks ();
df_set_flags (DF_LR_RUN_DCE);
df_analyze ();
TODO_verify_flow | TODO_ggc_collect /* todo_flags_finish */
}
};
+
-fdump-translation-unit@r{[}-@var{n}@r{]} @gol
-fdump-class-hierarchy@r{[}-@var{n}@r{]} @gol
-fdump-ipa-all -fdump-ipa-cgraph -fdump-ipa-inline @gol
--fdump-passes @gol
-fdump-statistics @gol
-fdump-tree-all @gol
-fdump-tree-original@r{[}-@var{n}@r{]} @gol
is trivial, the number pair can be simplified as a single number. If the
function's cgraph node's @var{uid} is falling within one of the specified ranges,
the @var{pass} is disabled for that function. The @var{uid} is shown in the
-function header of a dump file, and pass names can be dumped by using option
-@option{-fdump-passes}.
+function header of a dump file.
@item -fdisable-tree-@var{pass}
@item -fdisable-tree-@var{pass}=@var{range-list}
@end table
-@item -fdump-passes
-@opindex fdump-passes
-Dump the list of optimization passes that are turned on and off by
-the current command line options.
-
@item -fdump-statistics-@var{option}
@opindex fdump-statistics
Enable and control dumping of pass statistics in a separate file. The
static bool
gate_handle_eh (void)
{
- return true;
+ /* Nothing to do if no regions created. */
+ return cfun->eh->region_tree != NULL;
}
/* Complete generation of exception handling code. */
static unsigned int
rest_of_handle_eh (void)
{
- /* Nothing to do if no regions created. */
- if (cfun->eh->region_tree == NULL)
- return 0;
-
finish_eh_generation ();
cleanup_cfg (CLEANUP_NO_INSN_DEL);
return 0;
int min_labelno = 0, max_labelno = 0;
int saved_call_site_base = call_site_base;
- if (cfun->eh->region_tree == NULL)
- return 0;
-
crtl->eh.action_record_data = VEC_alloc (uchar, gc, 64);
ar_hash = htab_create (31, action_record_hash, action_record_eq, free);
gate_convert_to_eh_region_ranges (void)
{
/* Nothing to do for SJLJ exceptions or if no regions created. */
+ if (cfun->eh->region_tree == NULL)
+ return false;
if (targetm.except_unwind_info (&global_options) == UI_SJLJ)
return false;
return true;
gate_rtl_pre (void)
{
return optimize > 0 && flag_gcse
- && optimize_function_for_speed_p (cfun);
+ && !cfun->calls_setjmp
+ && optimize_function_for_speed_p (cfun)
+ && dbg_cnt (pre);
}
static unsigned int
execute_rtl_pre (void)
{
int changed;
-
- if (cfun->calls_setjmp || !dbg_cnt (pre))
- return 0;
-
delete_unreachable_blocks ();
df_analyze ();
changed = one_pre_gcse_pass ();
gate_rtl_hoist (void)
{
return optimize > 0 && flag_gcse
- /* It does not make sense to run code hoisting unless we are optimizing
- for code size -- it rarely makes programs faster, and can make then
- bigger if we did PRE (when optimizing for space, we don't run PRE). */
- && optimize_function_for_size_p (cfun);
+ && !cfun->calls_setjmp
+ /* It does not make sense to run code hoisting unless we are optimizing
+ for code size -- it rarely makes programs faster, and can make then
+ bigger if we did PRE (when optimizing for space, we don't run PRE). */
+ && optimize_function_for_size_p (cfun)
+ && dbg_cnt (hoist);
}
static unsigned int
execute_rtl_hoist (void)
{
int changed;
-
- if (cfun->calls_setjmp || !dbg_cnt (hoist))
- return 0;
-
delete_unreachable_blocks ();
df_analyze ();
changed = one_code_hoisting_pass ();
};
#include "gt-gcse.h"
+
return !strcmp (s1->unique_name, s2->unique_name);
}
-static htab_t name_to_pass_map = NULL;
+static htab_t pass_name_tab = NULL;
/* Register PASS with NAME. */
struct pass_registry **slot;
struct pass_registry pr;
- if (!name_to_pass_map)
- name_to_pass_map = htab_create (256, passr_hash, passr_eq, NULL);
+ if (!pass_name_tab)
+ pass_name_tab = htab_create (256, passr_hash, passr_eq, NULL);
pr.unique_name = name;
- slot = (struct pass_registry **) htab_find_slot (name_to_pass_map, &pr, INSERT);
+ slot = (struct pass_registry **) htab_find_slot (pass_name_tab, &pr, INSERT);
if (!*slot)
{
struct pass_registry *new_pr;
return; /* Ignore plugin passes. */
}
-/* Map from pass id to canonicalized pass name. */
-
-typedef const char *char_ptr;
-DEF_VEC_P(char_ptr);
-DEF_VEC_ALLOC_P(char_ptr, heap);
-static VEC(char_ptr, heap) *pass_tab = NULL;
-
-/* Callback function for traversing NAME_TO_PASS_MAP. */
-
-static int
-pass_traverse (void **slot, void *data ATTRIBUTE_UNUSED)
-{
- struct pass_registry **p = (struct pass_registry **)slot;
- struct opt_pass *pass = (*p)->pass;
-
- gcc_assert (pass->static_pass_number > 0);
- gcc_assert (pass_tab);
-
- VEC_replace (char_ptr, pass_tab, pass->static_pass_number,
- (*p)->unique_name);
-
- return 1;
-}
-
-/* The function traverses NAME_TO_PASS_MAP and creates a pass info
- table for dumping purpose. */
-
-static void
-create_pass_tab (void)
-{
- if (!flag_dump_passes)
- return;
-
- VEC_safe_grow_cleared (char_ptr, heap,
- pass_tab, passes_by_id_size + 1);
- htab_traverse (name_to_pass_map, pass_traverse, NULL);
-}
-
-static bool override_gate_status (struct opt_pass *, tree, bool);
-
-/* Dump the instantiated name for PASS. IS_ON indicates if PASS
- is turned on or not. */
-
-static void
-dump_one_pass (struct opt_pass *pass, int pass_indent)
-{
- int indent = 3 * pass_indent;
- const char *pn;
- bool is_on, is_really_on;
-
- is_on = (pass->gate == NULL) ? true : pass->gate();
- is_really_on = override_gate_status (pass, NULL, is_on);
-
- if (pass->static_pass_number <= 0)
- pn = pass->name;
- else
- pn = VEC_index (char_ptr, pass_tab, pass->static_pass_number);
-
- fprintf (stderr, "%*s%-40s%*s:%s%s\n", indent, " ", pn,
- (15 - indent < 0 ? 0 : 15 - indent), " ",
- is_on ? " ON" : " OFF",
- ((!is_on) == (!is_really_on) ? ""
- : (is_really_on ? " (FORCED_ON)" : " (FORCED_OFF)")));
-}
-
-/* Dump pass list PASS with indentation INDENT. */
-
-static void
-dump_pass_list (struct opt_pass *pass, int indent)
-{
- do
- {
- dump_one_pass (pass, indent);
- if (pass->sub)
- dump_pass_list (pass->sub, indent + 1);
- pass = pass->next;
- }
- while (pass);
-}
-
-/* Dump all optimization passes. */
-
-void
-dump_passes (void)
-{
- create_pass_tab();
-
- dump_pass_list (all_lowering_passes, 1);
- dump_pass_list (all_small_ipa_passes, 1);
- dump_pass_list (all_regular_ipa_passes, 1);
- dump_pass_list (all_lto_gen_passes, 1);
- dump_pass_list (all_passes, 1);
-}
-
-
/* Returns the pass with NAME. */
static struct opt_pass *
{
struct pass_registry **slot, pr;
+ gcc_assert (pass_name_tab);
pr.unique_name = name;
- slot = (struct pass_registry **) htab_find_slot (name_to_pass_map,
+ slot = (struct pass_registry **) htab_find_slot (pass_name_tab,
&pr, NO_INSERT);
if (!slot || !*slot)
-/* { dg-do compile } */
-/* { dg-options "-O2 -fdump-passes" } */
-
-unsigned res;
-
-void
-foo (unsigned code, int len)
-{
- int i;
- for (i = 0; i < len; i++)
- res |= code & 1;
-}
-
-/* { dg-prune-output ".*" } */
gimple_stmt_iterator gsi;
basic_block bb;
- /* With errors, normal optimization passes are not run. If we don't
- lower complex operations at all, rtl expansion will abort. */
- if (cfun->curr_properties & PROP_gimple_lcx)
- return 0;
-
if (!init_dont_simulate_again ())
return 0;
static bool
gate_no_optimization (void)
{
- return true;
+ /* With errors, normal optimization passes are not run. If we don't
+ lower complex operations at all, rtl expansion will abort. */
+ return !(cfun->curr_properties & PROP_gimple_lcx);
}
struct gimple_opt_pass pass_lower_complex_O0 =
bool any_rewritten = false;
bool redirected = false;
- if (cfun->eh->region_tree == NULL)
- return 0;
-
assign_filter_values ();
FOR_EACH_BB (bb)
static bool
gate_lower_eh_dispatch (void)
{
- return true;
+ return cfun->eh->region_tree != NULL;
}
struct gimple_opt_pass pass_lower_eh_dispatch =
static unsigned int
execute_cleanup_eh (void)
{
- int ret;
+ int ret = execute_cleanup_eh_1 ();
- if (cfun->eh == NULL || cfun->eh->region_tree == NULL)
- return 0;
-
- ret = execute_cleanup_eh_1 ();
/* If the function no longer needs an EH personality routine
clear it. This exposes cross-language inlining opportunities
and avoids references to a never defined personality routine. */
static bool
gate_cleanup_eh (void)
{
- return true;
+ return cfun->eh != NULL && cfun->eh->region_tree != NULL;
}
struct gimple_opt_pass pass_cleanup_eh = {
extern void disable_pass (const char *);
extern void enable_pass (const char *);
-extern void dump_passes (void);
#endif /* GCC_TREE_PASS_H */
static bool
gate_optimize_stdarg (void)
{
- return true;
+ /* This optimization is only for stdarg functions. */
+ return cfun->stdarg != 0;
}
const char *funcname = NULL;
tree cfun_va_list;
- /* This optimization is only for stdarg functions. */
- if (cfun->stdarg == 0)
- return 0;
-
cfun->va_list_gpr_size = 0;
cfun->va_list_fpr_size = 0;
memset (&si, 0, sizeof (si));